{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T12:12:03Z","timestamp":1773576723332,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T00:00:00Z","timestamp":1487635200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11075-017-0285-1","type":"journal-article","created":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T00:33:40Z","timestamp":1487637220000},"page":"381-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A contribution to perturbation analysis for total least squares problems"],"prefix":"10.1007","volume":"75","author":[{"given":"Pengpeng","family":"Xie","sequence":"first","affiliation":[]},{"given":"Hua","family":"Xiang","sequence":"additional","affiliation":[]},{"given":"Yimin","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"issue":"3","key":"285_CR1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1137\/090777608","volume":"32","author":"M Baboulin","year":"2011","unstructured":"Baboulin, M, Gratton, S: A contribution to the conditioning of the total least-squares problem. SIAM J Matrix Anal. Appl. 32(3), 685\u2013699 (2011)","journal-title":"SIAM J Matrix Anal. Appl."},{"issue":"2","key":"285_CR2","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/S0895479899355414","volume":"22","author":"\u00c5 Bj\u00f6rck","year":"2000","unstructured":"Bj\u00f6rck, \u00c5., Heggernes, P., Matstoms, P.: Methods for large scale total least squares problems. SIAM J Matrix Anal. Appl. 22(2), 413\u2013429 (2000)","journal-title":"SIAM J Matrix Anal. Appl."},{"issue":"8","key":"285_CR3","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1002\/nla.640","volume":"16","author":"X-W Chang","year":"2009","unstructured":"Chang, X.-W., Titley-Peloquin, D.: Backward perturbation analysis for scaled total least-squares problems. Numer Linear Algebra Appl. 16(8), 627\u2013648 (2009)","journal-title":"Numer Linear Algebra Appl."},{"key":"285_CR4","doi-asserted-by":"publisher","unstructured":"Diao, H.-A., Wei, Y., Xie, P.: Small sample statistical condition estimation for the total least squares problem. Numer. Algorithms, doi: 10.1007\/s11075-016-0185-9","DOI":"10.1007\/s11075-016-0185-9"},{"key":"285_CR5","doi-asserted-by":"crossref","unstructured":"Golub, G.H., Van Loan, C.F.: An analysis of the total least squares problem. SIAM J. Numer Anal. 17(6), 883\u2013893 (1980)","DOI":"10.1137\/0717073"},{"key":"285_CR6","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix computations. Johns Hopkins Studies in the Mathematical Sciences, 4th edn. Johns Hopkins University Press, Baltimore (2013)"},{"issue":"3","key":"285_CR7","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1137\/120895019","volume":"34","author":"S Gratton","year":"2013","unstructured":"Gratton, S., Titley-Peloquin, D., Ilunga, J.T.: Sensitivity and conditioning of the truncated total least squares solution. SIAM J. Matrix Anal. Appl. 34(3), 1257\u20131276 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"285_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00211-013-0533-9","volume":"125","author":"Z Jia","year":"2013","unstructured":"Jia, Z., Li, B.: On the condition number of the total least squares problem. Numer. Math. 125(1), 61\u201387 (2013)","journal-title":"Numer. Math."},{"issue":"1","key":"285_CR9","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0915003","volume":"15","author":"CS Kenney","year":"1994","unstructured":"Kenney, C.S., Laub, A.J.: Small-sample statistical condition estimates for general matrix functions. SIAM J. Sci Comput. 15(1), 36\u201361 (1994)","journal-title":"SIAM J. Sci Comput."},{"issue":"3","key":"285_CR10","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.laa.2010.07.022","volume":"435","author":"B Li","year":"2011","unstructured":"Li, B., Jia, Z.: Some results on condition numbers of the scaled total least squares problem. Linear Algebra Appl. 435(3), 674\u2013686 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"285_CR11","first-page":"254","volume":"19","author":"X-G Liu","year":"1996","unstructured":"Liu, X.-G.: On the solvability and perturbation analysis for the total least squares problem. Acta Math. Appl. Sinica 19(2), 254\u2013262 (1996). (in Chinese)","journal-title":"Acta Math. Appl. Sinica"},{"issue":"4","key":"285_CR12","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1137\/S0895479801389564","volume":"24","author":"AN Malyshev","year":"2003","unstructured":"Malyshev, A.N.: A unified theory of conditioning for linear least squares and Tikhonov regularization solutions. SIAM J. Matrix Anal. Appl. 24(4), 1186\u20131196 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"285_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0024-3795(84)90128-9","volume":"56","author":"GW Stewart","year":"1984","unstructured":"Stewart, G.W.: A second order perturbation expansion for small singular values. Linear Algebra Appl. 56, 231\u2013235 (1984)","journal-title":"Linear Algebra Appl."},{"key":"285_CR14","doi-asserted-by":"crossref","unstructured":"Van Huffel, S., Vandewalle, J.: The total least squares problem: computational aspects and analysis. SIAM, Philadelphia (1991)","DOI":"10.1137\/1.9781611971002"},{"issue":"3","key":"285_CR15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s11075-009-9269-0","volume":"51","author":"L Zhou","year":"2009","unstructured":"Zhou, L., Lin, L., Wei, Y., Qiao, S.: Perturbation analysis and condition numbers of scaled total least squares problems. Numer. Algorithms 51(3), 381\u2013399 (2009)","journal-title":"Numer. Algorithms"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0285-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0285-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0285-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T18:24:53Z","timestamp":1568831093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0285-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,21]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["285"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0285-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,21]]}}}