{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:29:49Z","timestamp":1787336989197,"version":"build-2736575974"},"reference-count":44,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2000,1]]},"abstract":"<jats:p>We give an overview of fast algorithms for solving least squares problems with Toeplitz structure, based on generalization of the classical Schur algorithm, and discuss their stability properties. In order to obtain more accurate triangular factors of a Toeplitz matrix as well as accurate solutions for the least squares problems, methods based on corrected seminormal equations (CSNE) can be used. We show that the applicability of the generalized Schur algorithm is considerably enhanced when the algorithm is used in conjunction with CSNE.<\/jats:p>\n                  <jats:p>Several numerical tests are reported, where different variants of the generalized Schur algorithm and CSNE are compared for their accuracy and speed.<\/jats:p>","DOI":"10.1137\/s1064827598347423","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"406-430","source":"Crossref","is-referenced-by-count":7,"title":["Schur-Type Methods for Solving Least Squares Problems with Toeplitz Structure"],"prefix":"10.1137","volume":"22","author":[{"given":"Haesun","family":"Park","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lars","family":"Eld\u00e9n","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,25]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(88)90158-9"},{"key":"R2","unstructured":"E. Anderson, Z. Bai, C. H. Bischof, J. W. Demmel, J. J. Dongarra, J. J. Du Croz, A. Greenbaum, S. J. Hammarling, A. McKenney, S. Ostrouchov, and D. C. Sorensen,\n                      LAPACK Users\u2019 Guide, Release 2.0\n                      , 2nd ed., SIAM, Philadelphia, PA, 1995."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971484"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/S089547989222895X"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(87)90101-7"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02140770"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479891221563"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0908031"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01389431"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895287419"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/16.4.457"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0908073"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1983-0679449-6"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/0908063"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/S089547989223691X"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050072"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01731982"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1080\/00949657308810051"},{"key":"R19","unstructured":"G. H. Golub and C. F. Van Loan,\n                      Matrix Computations\n                      , 2nd ed., Johns Hopkins Press, Baltimore, MD, 1989."},{"key":"R20","unstructured":"G. H. Golub and C. F. Van Loan,\n                      Matrix Computations\n                      , 3rd ed., Johns Hopkins Press, Baltimore, MD, 1996."},{"key":"R21","unstructured":"J. G\u00f6tze and H. Park,\n                      Schur\u2010type Methods in Linear Algebra\n                      , Technical report, Department of Electrical and Computer Engineering, Rice University, Houston, TX, 1995."},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/S089547989529646X"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02142744"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"T. Kailath,\n                      A Theorem of I. Schur\n                      and its Impact on Modern Signal Processing, in Operator Theory: Advances and Applications, I. Gohberg, ed., Birkh\u00e4user\u2010Verlag, Basel, 1986, pp. 9\u201330.","DOI":"10.1007\/978-3-0348-5483-2_2"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479889169042"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(79)90124-0"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1137\/1037082"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2364(92)90066-G"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1137\/0914070"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02140689"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(89)90363-4"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050268"},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01404468"},{"key":"R34","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1986.1164998"},{"key":"R35","unstructured":"M. A. Saunders,\n                      Large\u2010Scale Linear Programming Using the Cholesky Factorization\n                      , Technical Report CS252, Computer Science Department, Stanford University, 1972."},{"key":"R36","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1515\/crll.1917.147.205","volume":"147","author":"Schur I.","year":"1917","journal-title":"J. Reine Angew. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0075-4102","issn-type":"print"},{"key":"R37","doi-asserted-by":"crossref","unstructured":"I. Schur,\n                      On power series which are bounded in the interior of the unit circle\n                      . I., in Operator Theory: Advances and Applications, I. Gohberg, ed., Birkh\u00e4user\u2010Verlag, Basel, 1986, pp. 31\u201359.","DOI":"10.1007\/978-3-0348-5483-2_3"},{"key":"R38","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/23.2.203"},{"key":"R39","doi-asserted-by":"publisher","DOI":"10.1109\/78.482114"},{"key":"R40","doi-asserted-by":"publisher","DOI":"10.1137\/S089547989528692X"},{"key":"R41","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897319581"},{"key":"R42","doi-asserted-by":"publisher","DOI":"10.1007\/BF01389635"},{"key":"R43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970999"},{"key":"R44","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1680020308"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1064827598347423","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:39:43Z","timestamp":1787333983000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1064827598347423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1137\/S1064827598347423"],"URL":"https:\/\/doi.org\/10.1137\/s1064827598347423","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}