{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T22:29:40Z","timestamp":1773872980968,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["23-06159S"],"award-info":[{"award-number":["23-06159S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004240","name":"Akademie V\u011bd \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["67985840"],"award-info":[{"award-number":["67985840"]}],"id":[{"id":"10.13039\/501100004240","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11075-023-01691-x","type":"journal-article","created":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T11:02:07Z","timestamp":1699354927000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Estimating error norms in CG-like algorithms for least-squares and least-norm problems"],"prefix":"10.1007","volume":"97","author":[{"given":"Jan","family":"Pape\u017e","sequence":"first","affiliation":[]},{"given":"Petr","family":"Tich\u00fd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"key":"1691_CR1","volume-title":"Krylov Subspace Methods","author":"J Liesen","year":"2013","unstructured":"Liesen, J., Strako\u0161, Z.: Krylov Subspace Methods. Numerical Mathematics and Scientific Computation. Oxford University Press, Oxford (2013)"},{"issue":"3","key":"1691_CR2","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s11075-021-01078-w","volume":"88","author":"G Meurant","year":"2021","unstructured":"Meurant, G., Pape\u017e, J., Tich\u00fd, P.: Accurate error estimation in CG. Numer. Algorithms 88(3), 1337\u20131359 (2021). https:\/\/doi.org\/10.1007\/s11075-021-01078-w","journal-title":"Numer. Algorithms"},{"key":"1691_CR3","first-page":"56","volume":"13","author":"Z Strako\u0161","year":"2002","unstructured":"Strako\u0161, Z., Tich\u00fd, P.: On error estimation in the conjugate gradient method and why it works in finite precision computations. Electron. Trans. Numer. Anal. 13, 56\u201380 (2002)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"1691_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718140","volume-title":"The Lanczos and Conjugate Gradient Algorithms, from Theory to Finite Precision Computations","author":"G Meurant","year":"2006","unstructured":"Meurant, G.: The Lanczos and Conjugate Gradient Algorithms, from Theory to Finite Precision Computations. SIAM, Philadelphia (2006)"},{"key":"1691_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0024-3795(89)90285-1","volume":"113","author":"A Greenbaum","year":"1989","unstructured":"Greenbaum, A.: Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences. Linear Algebra Appl. 113, 7\u201363 (1989)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1691_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02141261","volume":"7","author":"GLG Sleijpen","year":"1994","unstructured":"Sleijpen, G.L.G., van der Vorst, H.A., Fokkema, D.R.: BiCGstab(l) and other hybrid Bi-CG methods. Numer. Algorithms 7(1), 75\u2013109 (1994)","journal-title":"Numer. Algorithms"},{"key":"1691_CR7","doi-asserted-by":"publisher","unstructured":"Jir\u00e1nek, P., Titley-Peloquin, D.: Estimating the backward error in LSQR. SIAM J. Matrix Anal. Appl. 31(4), 2055\u20132074 (2009\/10). https:\/\/doi.org\/10.1137\/090770655","DOI":"10.1137\/090770655"},{"issue":"11","key":"1691_CR8","doi-asserted-by":"publisher","first-page":"2322","DOI":"10.1016\/j.cpc.2012.05.023","volume":"183","author":"M Arioli","year":"2012","unstructured":"Arioli, M., Gratton, S.: Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method. Comput. Phys. Commun. 183(11), 2322\u20132336 (2012). https:\/\/doi.org\/10.1016\/j.cpc.2012.05.023","journal-title":"Comput. Phys. Commun."},{"issue":"2","key":"1691_CR9","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/120866543","volume":"34","author":"M Arioli","year":"2013","unstructured":"Arioli, M.: Generalized Golub-Kahan bidiagonalization and stopping criteria. SIAM J. Matrix Anal. Appl. 34(2), 571\u2013592 (2013). https:\/\/doi.org\/10.1137\/120866543","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"1691_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/16M1094816","volume":"40","author":"R Estrin","year":"2019","unstructured":"Estrin, R., Orban, D., Saunders, M.A.: Euclidean-norm error bounds for SYMMLQ and CG. SIAM J. Matrix Anal. Appl. 40(1), 235\u2013253 (2019). https:\/\/doi.org\/10.1137\/16M1094816","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1691_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Research Nat. Bur. Standards 49, 409\u2013436 (1952)","journal-title":"J. Research Nat. Bur. Standards"},{"issue":"1","key":"1691_CR12","doi-asserted-by":"publisher","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. Software 8(1), 43\u201371 (1982)","journal-title":"ACM Trans. Math. Software"},{"key":"1691_CR13","unstructured":"Craig, E.J.: Iteration procedures for simultaneous equations. PhD thesis, Massachusetts Institute of Technology (1954)"},{"key":"1691_CR14","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1002\/sapm195534164","volume":"34","author":"EJ Craig","year":"1955","unstructured":"Craig, E.J.: The $$N$$-step iteration procedures. J. Math. and Phys. 34, 64\u201373 (1955). https:\/\/doi.org\/10.1002\/sapm195534164","journal-title":"J. Math. and Phys."},{"key":"1691_CR15","first-page":"621","volume-title":"Computational Methods of Linear Algebra","author":"DK Faddeev","year":"1963","unstructured":"Faddeev, D.K., Faddeeva, V.N.: Computational Methods of Linear Algebra, p. 621. W. H. Freeman and Co., San Francisco (1963)"},{"issue":"4","key":"1691_CR16","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/BF01739829","volume":"35","author":"MA Saunders","year":"1995","unstructured":"Saunders, M.A.: Solution of sparse rectangular systems using LSQR and CRAIG. BIT 35(4), 588\u2013604 (1995). https:\/\/doi.org\/10.1007\/BF01739829","journal-title":"BIT"},{"key":"1691_CR17","unstructured":"Pape\u017e, J., Tich\u00fd, P.: CG-like methods with error estimate, GitHub repository. https:\/\/github.com\/JanPapez\/CGlike-methods-with-error-estimate (2023)"},{"issue":"4","key":"1691_CR18","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/s10543-005-0032-1","volume":"45","author":"Z Strako\u0161","year":"2005","unstructured":"Strako\u0161, Z., Tich\u00fd, P.: Error estimation in preconditioned conjugate gradients. BIT 45(4), 789\u2013817 (2005). https:\/\/doi.org\/10.1007\/s10543-005-0032-1","journal-title":"BIT"},{"issue":"1","key":"1691_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0377-0427(88)90358-5","volume":"24","author":"EF Kaasschieter","year":"1988","unstructured":"Kaasschieter, E.F.: Preconditioned conjugate gradients for solving singular systems. J. Comput. Appl. Math. 24(1), 265\u2013275 (1988). https:\/\/doi.org\/10.1016\/0377-0427(88)90358-5","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"1691_CR20","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S089547989631202X","volume":"19","author":"\u00c5 Bj\u00f6rck","year":"1998","unstructured":"Bj\u00f6rck, \u00c5., Elfving, T., Strako\u0161, Z.: Stability of conjugate gradient and Lanczos methods for linear least squares problems. SIAM J. Matrix Anal. Appl. 19(3), 720\u2013736 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1691_CR21","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1137\/18M1194948","volume":"40","author":"R Estrin","year":"2019","unstructured":"Estrin, R., Orban, D., Saunders, M.A.: LNLQ: an iterative method for least-norm problems with an error minimization property. SIAM J. Matrix Anal. Appl. 40(3), 1102\u20131124 (2019). https:\/\/doi.org\/10.1137\/18M1194948","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"1691_CR22","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1137\/17M1113552","volume":"40","author":"R Estrin","year":"2019","unstructured":"Estrin, R., Orban, D., Saunders, M.A.: LSLQ: an iterative method for linear least-squares with an error minimization property. SIAM J. Matrix Anal. Appl. 40(1), 254\u2013275 (2019). https:\/\/doi.org\/10.1137\/17M1113552","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1691_CR23","unstructured":"Fong, D.C.-l.: Minimum-residual methods for sparse least-squares using Golub- Kahan bidiagonalization. PhD thesis, Stanford University (2011)"},{"issue":"2","key":"1691_CR24","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/080724071","volume":"31","author":"X-W Chang","year":"2009","unstructured":"Chang, X.-W., Paige, C.C., Titley-Peloquin, D.: Stopping criteria for the iterative solution of linear least squares problems. SIAM J. Matrix Anal. Appl. 31(2), 831\u2013852 (2009). https:\/\/doi.org\/10.1137\/080724071","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"1691_CR25","doi-asserted-by":"publisher","first-page":"2950","DOI":"10.1137\/10079687X","volume":"33","author":"DC-L Fong","year":"2011","unstructured":"Fong, D.C.-L., Saunders, M.: LSMR: an iterative algorithm for sparse leastsquares problems. SIAM J. Sci. Comput. 33(5), 2950\u20132971 (2011). https:\/\/doi.org\/10.1137\/10079687X","journal-title":"SIAM J. Sci. Comput."},{"issue":"2\u20134","key":"1691_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02142693","volume":"8","author":"GH Golub","year":"1994","unstructured":"Golub, G.H., Strako\u0161, Z.: Estimates in quadratic formulas. Numer. Algorithms 8(2\u20134), 241\u2013268 (1994)","journal-title":"Numer. Algorithms"},{"issue":"2","key":"1691_CR27","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s11075-005-1528-0","volume":"40","author":"G Meurant","year":"2005","unstructured":"Meurant, G.: Estimates of the $$l_2$$ norm of the error in the conjugate gradient algorithm. Numer. Algorithms 40(2), 157\u2013169 (2005)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"1691_CR28","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1137\/19M1272822","volume":"41","author":"E Hallman","year":"2020","unstructured":"Hallman, E.: Sharp 2-norm error bounds for LSQR and the conjugate gradient method. SIAM J. Matrix Anal. Appl. 41(3), 1183\u20131207 (2020). https:\/\/doi.org\/10.1137\/19M1272822","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1691_CR29","doi-asserted-by":"publisher","unstructured":"Meurant, G., Tich\u00fd, P.: On computing quadrature-based bounds for the A-norm of the error in conjugate gradients. Numer. Algorithms 62(2), 163\u2013191 (2013). https:\/\/doi.org\/10.1007\/s11075-012-9591-9","DOI":"10.1007\/s11075-012-9591-9"},{"key":"1691_CR30","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/0711019","volume":"11","author":"CC Paige","year":"1974","unstructured":"Paige, C.C.: Bidiagonalization of matrices and solutions of the linear equations. SIAM J. Numer. Anal. 11, 197\u2013209 (1974)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"1691_CR31","doi-asserted-by":"publisher","first-page":"2002","DOI":"10.1137\/130931588","volume":"36","author":"R Bru","year":"2014","unstructured":"Bru, R., Mar\u00edn, J., Mas, J., T\u016fma, M.: Preconditioned iterative methods for solving linear least squares problems. SIAM J. Sci. Comput. 36(4), 2002\u20132022 (2014). https:\/\/doi.org\/10.1137\/130931588","journal-title":"SIAM J. Sci. Comput."},{"key":"1691_CR32","unstructured":"HSL. A collection of Fortran codes for large-scale scientific computation. http:\/\/www.hsl.rl.ac.uk\/ (1963-2023)"},{"key":"1691_CR33","unstructured":"Regev, S., Saunders, M.A.: SSAI: A symmetric sparse approximate inverse preconditioner for the conjugate gradient methods PCG and PCGLS. (2020). Unpublished report, available at https:\/\/web.stanford.edu\/group\/SOL\/reports\/20SSAI.pdf"},{"issue":"7","key":"1691_CR34","doi-asserted-by":"publisher","first-page":"075009","DOI":"10.1088\/0266-5611\/30\/7\/075009","volume":"30","author":"SR Arridge","year":"2014","unstructured":"Arridge, S.R., Betcke, M.M., Harhanen, L.: Iterated preconditioned LSQR method for inverse problems on unstructured grids. Inverse Problems 30(7), 075009\u201327 (2014). https:\/\/doi.org\/10.1088\/0266-5611\/30\/7\/075009","journal-title":"Inverse Problems"},{"key":"1691_CR35","doi-asserted-by":"publisher","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1) (2011). https:\/\/doi.org\/10.1145\/2049662.2049663. https:\/\/sparse.tamu.edu","DOI":"10.1145\/2049662.2049663"},{"key":"1691_CR36","doi-asserted-by":"crossref","unstructured":"Pape\u017e, J., Tich\u00fd, P.: Estimating the error in CG-like algorithms for least-squares and least-norm problems (2023). arXiv:2305.02044","DOI":"10.1007\/s11075-023-01691-x"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01691-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01691-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01691-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:23:10Z","timestamp":1722936190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01691-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["1691"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01691-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"5 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}