{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T04:43:37Z","timestamp":1770439417648,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,12,6]],"date-time":"2012-12-06T00:00:00Z","timestamp":1354752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11075-012-9665-8","type":"journal-article","created":{"date-parts":[[2012,12,5]],"date-time":"2012-12-05T20:43:03Z","timestamp":1354740183000},"page":"263-293","source":"Crossref","is-referenced-by-count":14,"title":["An augmented LSQR method"],"prefix":"10.1007","volume":"64","author":[{"given":"J.","family":"Baglama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Reichel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Richmond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,6]]},"reference":[{"key":"9665_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/04060593X","volume":"27","author":"J Baglama","year":"2005","unstructured":"Baglama, J., Reichel, L.: Augmented implicitly restarted Lanczos bidiagonalization methods. SIAM J. Sci. Comput. 27, 19\u201342 (2005)","journal-title":"SIAM J. Sci. Comput."},{"key":"9665_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s11075-006-9057-z","volume":"43","author":"J Baglama","year":"2006","unstructured":"Baglama, J., Reichel, L.: Restarted block Lanczos bidiagonalization methods. Numer. Algorithms 43, 251\u2013272 (2006)","journal-title":"Numer. Algorithms"},{"key":"9665_CR3","unstructured":"Baglama, J., Reichel, L.: An implicitly restarted block Lanczos bidiagonalization method using Leja shifts. BIT Numer. Math. (in press)"},{"key":"9665_CR4","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S106482750240649X","volume":"25","author":"M Benzi","year":"2003","unstructured":"Benzi, M., Tuma, M.: A robust preconditioner with low memory requirements for large sparse least squares problems. SIAM J. Sci. Comput. 25, 499\u2013512 (2003)","journal-title":"SIAM J. Sci. Comput."},{"key":"9665_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"\u00c5 Bj\u00f6rck","year":"1996","unstructured":"Bj\u00f6rck, \u00c5.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)"},{"key":"9665_CR6","first-page":"26","volume":"8","author":"\u00c5 Bj\u00f6rck","year":"1997","unstructured":"Bj\u00f6rck, \u00c5., Yuan, J.Y.: Preconditioners for least squares problems by LU factorization. Electron. Trans. Numer. Anal. 8, 26\u201335 (1997)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"9665_CR7","unstructured":"Boisvert, R., Pozo, R., Remington, K., Miller, B., Lipman, R.: MatrixMarket. The matrices are available at https:\/\/2.zoppoz.workers.dev:443\/http\/math.nist.gov\/MatrixMarket\/ (1996)"},{"key":"9665_CR8","unstructured":"Choi, S.-C.: Iterative methods for singular linear equations and least squares. Ph.D. thesis, Institute for Computational and Mathematical Engineering, Stanford University (2006)"},{"key":"9665_CR9","unstructured":"Duff, I.S., Grimes, R.G., Lewis, J.G.: User\u2019s guide for the Harwell\u2013Boeing sparse matrix collection (release I), France (1992). Matrices available at https:\/\/2.zoppoz.workers.dev:443\/http\/math.nist.bov\/MatrixMarket\/"},{"key":"9665_CR10","doi-asserted-by":"crossref","first-page":"2950","DOI":"10.1137\/10079687X","volume":"33","author":"DC-L Fong","year":"2011","unstructured":"Fong, D.C.-L., Saunders, M.A.: LSMR: an iterative algorithm for sparse least-squares problems. SIAM J. Sci. Comput. 33, 2950\u20132971 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"9665_CR11","doi-asserted-by":"crossref","first-page":"2400","DOI":"10.1137\/070696313","volume":"31","author":"K Hayami","year":"2010","unstructured":"Hayami, K., Yin, J.-F., Ito, T.: GMRES methods for least squares problems. SIAM J. Matrix Anal. Appl. 31, 2400\u20132430 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9665_CR12","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s10543-004-5244-2","volume":"44","author":"ME Hochstenbach","year":"2004","unstructured":"Hochstenbach, M.E.: Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems. BIT Numer. Math. 44, 721\u2013754 (2004)","journal-title":"BIT Numer. Math."},{"key":"9665_CR13","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s11424-010-7190-1","volume":"23","author":"Z Jia","year":"2010","unstructured":"Jia, Z.: Some properties of LSQR for large sparse linear least squares problems. J. Syst. Sci. Complex. 23, 815\u2013821 (2010)","journal-title":"J. Syst. Sci. Complex."},{"key":"9665_CR14","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/S0895479802404192","volume":"25","author":"Z Jia","year":"2003","unstructured":"Jia, Z., Niu, D.: An implicitly restarted refined bidiagonalization Lanczos method for computing a partial singular value decomposition. SIAM J. Matrix Anal. Appl. 25, 246\u2013265 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9665_CR15","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1137\/080733383","volume":"32","author":"Z Jia","year":"2010","unstructured":"Jia, Z., Niu, D.: A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices. SIAM J. Sci. Comput. 32, 714\u2013744 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1\u20132","key":"9665_CR16","first-page":"213","volume":"26","author":"S Karimi","year":"2008","unstructured":"Karimi, S., Salkuyeh, D.K., Toutounian, F.: A preconditioner for the LSQR algorithm. J. Appl. Math. Informatics 26(1\u20132), 213\u2013222 (2008)","journal-title":"J. Appl. Math. Informatics"},{"key":"9665_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.apnum.2003.11.011","volume":"49","author":"E Kokiopoulou","year":"2004","unstructured":"Kokiopoulou, E., Bekas, C., Gallopoulos, E.: Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization. Appl. Numer. Math. 49, 39\u201361 (2004)","journal-title":"Appl. Numer. Math."},{"key":"9665_CR18","doi-asserted-by":"crossref","unstructured":"Larsen, R.M.: Lanczos bidiagonalization with partial reorthogonalization. Ph.D. thesis, Dept. Computer Science, University of Aarhus, Aarhus, Denmark (1998)","DOI":"10.7146\/dpb.v27i537.7070"},{"key":"9665_CR19","unstructured":"Larsen, R.M.: Combining implicit restarts and partial reorthogonalization in Lanczos bidiagonalization (2001). https:\/\/2.zoppoz.workers.dev:443\/http\/soi.stanford.edu\/~rmunk\/PROPACK\/"},{"key":"9665_CR20","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0024-3795(91)90381-6","volume":"154\u2013156","author":"RB Morgan","year":"1991","unstructured":"Morgan, R.B.: Computing interior eigenvalues of large matrices. Linear Algebra Appl. 154\u2013156, 289\u2013309 (1991)","journal-title":"Linear Algebra Appl."},{"key":"9665_CR21","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1137\/S0895479893253975","volume":"16","author":"RB Morgan","year":"1995","unstructured":"Morgan, R.B.: A restarted GMRES method augmented with eigenvectors. SIAM J. Matrix Anal. Appl. 16, 1154\u20131171 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9665_CR22","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1137\/S0895479897321362","volume":"21","author":"RB Morgan","year":"2000","unstructured":"Morgan, R.B.: Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations. SIAM J. Matrix Anal. Appl. 21, 1112\u20131135 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9665_CR23","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1137\/S1064827599364659","volume":"24","author":"RB Morgan","year":"2002","unstructured":"Morgan, R.B.: GMRES with deflated restarting. SIAM J. Sci. Comput. 24, 20\u201337 (2002)","journal-title":"SIAM J. Sci. Comput."},{"key":"9665_CR24","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0711019","volume":"11","author":"CC Paige","year":"1974","unstructured":"Paige, C.C.: Bidiagonalization of matrices and solution of linear equations. SIAM J. Numer. Anal. 11, 197\u2013209 (1974)","journal-title":"SIAM J. Numer. Anal."},{"key":"9665_CR25","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/nla.1680020205","volume":"2","author":"CC Paige","year":"1995","unstructured":"Paige, C.C., Parlett, B.N., van der Vorst, H.A.: Approximate solutions and eigenvalue bounds from Krylov subspaces. Numer. Linear Algebra Appl. 2, 115\u2013134 (1995)","journal-title":"Numer. Linear Algebra Appl."},{"key":"9665_CR26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"CC Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8, 43\u201371 (1982)","journal-title":"ACM Trans. Math. Softw."},{"key":"9665_CR27","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1002\/nla.611","volume":"15","author":"L Reichel","year":"2008","unstructured":"Reichel, L., Ye, Q.: A generalized LSQR algorithm. Numer. Linear Algebra Appl. 15, 643\u2013660 (2008)","journal-title":"Numer. Linear Algebra Appl."},{"key":"9665_CR28","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)","edition":"2"},{"key":"9665_CR29","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1137\/S1064827597327309","volume":"21","author":"HD Simon","year":"2000","unstructured":"Simon, H.D., Zha, H.: Low rank matrix approximation using the Lanczos bidiagonalization process with applications. SIAM J. Sci. Comput. 21, 2257\u20132274 (2000)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9665-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s11075-012-9665-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9665-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T17:12:34Z","timestamp":1562433154000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/s11075-012-9665-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,6]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9665"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s11075-012-9665-8","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,6]]}}}