{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T18:13:32Z","timestamp":1786212812968,"version":"3.56.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"LABoratoires d\u2019EXcellence CEMPI","award":["ANR-11-LABX-0007-01"],"award-info":[{"award-number":["ANR-11-LABX-0007-01"]}]},{"DOI":"10.13039\/100014810","name":"Fondazione di Sardegna","doi-asserted-by":"publisher","award":["Progetto biennale bando 2021 COMANCHE"],"award-info":[{"award-number":["Progetto biennale bando 2021 COMANCHE"]}],"id":[{"id":"10.13039\/100014810","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014810","name":"Fondazione di Sardegna","doi-asserted-by":"publisher","award":["Progetto biennale bando 2021 COMANCHE"],"award-info":[{"award-number":["Progetto biennale bando 2021 COMANCHE"]}],"id":[{"id":"10.13039\/100014810","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e1 e della Ricerca","doi-asserted-by":"publisher","award":["2022ANC8HL"],"award-info":[{"award-number":["2022ANC8HL"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e1 e della Ricerca","doi-asserted-by":"publisher","award":["P20229RMLB"],"award-info":[{"award-number":["P20229RMLB"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["P2022PMEN2"],"award-info":[{"award-number":["P2022PMEN2"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["P2022PMEN2"],"award-info":[{"award-number":["P2022PMEN2"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009112","name":"Istituto Nazionale di Alta Matematica \u201cFrancesco Severi\u201d","doi-asserted-by":"publisher","award":["Algebra lineare numerica per problemi di grandi dimensioni: aspetti teorici e applicazioni"],"award-info":[{"award-number":["Algebra lineare numerica per problemi di grandi dimensioni: aspetti teorici e applicazioni"]}],"id":[{"id":"10.13039\/100009112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009112","name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","doi-asserted-by":"publisher","award":["Algebra lineare numerica per problemi di grandi dimensioni: aspetti teorici e applicazioni"],"award-info":[{"award-number":["Algebra lineare numerica per problemi di grandi dimensioni: aspetti teorici e applicazioni"]}],"id":[{"id":"10.13039\/100009112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009112","name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","doi-asserted-by":"publisher","award":["Algebra lineare numerica per problemi di grandi dimensioni: aspetti teorici e applicazioni"],"award-info":[{"award-number":["Algebra lineare numerica per problemi di grandi dimensioni: aspetti teorici e applicazioni"]}],"id":[{"id":"10.13039\/100009112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100013003","name":"Universit\u00e0 degli Studi di Cagliari","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100013003","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Linear discrete inverse problems are common in many applicative fields. Regularization consists of substituting to the original ill-conditioned problem an approximated formulation depending on a parameter, which has to be chosen so that the new problem is well-conditioned and its solution is close enough to the ideal solution. When the parameter is discrete, like in the truncated singular value decomposition (TSVD) and in the generalized TSVD (TGSVD), one has to choose a vector out of a sequence. In this paper we explore the possibility to employ a sequence of extrapolated solutions to estimate the best parameter, as well as substituting to the regularized solution an extrapolated one. We investigate the use of three classical vector extrapolation methods, MPE (minimal polynomial extrapolation), RRE (reduced rank extrapolation), and VEA (vector epsilon algorithm). For the VEA method we also develop a new computational scheme which reduces memory storage and computing time. Numerical experiments compare the performance of the newly introduced approaches with other well-known methods.<\/jats:p>","DOI":"10.1007\/s10915-025-02822-3","type":"journal-article","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T13:14:34Z","timestamp":1739452474000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameter Choice Rules for Discrete Ill-Posed Problems Based on Extrapolation Methods"],"prefix":"10.1007","volume":"103","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0002-2053-8222","authenticated-orcid":false,"given":"Andrea","family":"Azzarelli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-2209-4306","authenticated-orcid":false,"given":"Claude","family":"Brezinski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-2831-0591","authenticated-orcid":false,"given":"Caterina","family":"Fenu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-9789-1078","authenticated-orcid":false,"given":"Michela","family":"Redivo-Zaglia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-9054-8712","authenticated-orcid":false,"given":"Giuseppe","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"key":"2822_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01385494","volume":"61","author":"G Auchmuty","year":"1992","unstructured":"Auchmuty, G.: A posteriori error estimates for linear equations. Numer. Math. 61, 1\u20136 (1992)","journal-title":"Numer. Math."},{"key":"2822_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0041-5553(84)90253-2","volume":"24","author":"AB Bakushinskii","year":"1984","unstructured":"Bakushinskii, A.B.: Remarks on choosing a regularization parameter using quasi-optimality and ratio criterion. USSR Comp. Math. Math. Phys. 24, 181\u2013182 (1984)","journal-title":"USSR Comp. Math. Math. Phys."},{"key":"2822_CR3","first-page":"5","volume":"17","author":"F Bauer","year":"2009","unstructured":"Bauer, F., Kindermann, S.: Recent results on the quasi-optimality principle. J. Inv. Ill-Posed Probl. 17, 5\u201318 (2009)","journal-title":"J. Inv. Ill-Posed Probl."},{"key":"2822_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical methods for least squares problems","author":"A Bj\u00f6rck","year":"1996","unstructured":"Bj\u00f6rck, A.: Numerical methods for least squares problems. SIAM, Philadelphia (1996)"},{"key":"2822_CR5","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1016\/j.laa.2010.06.001","volume":"434","author":"A Bouhamidi","year":"2011","unstructured":"Bouhamidi, A., Jbilou, K., Reichel, L., Sadok, H.: An extrapolated TSVD method for linear discrete ill-posed problems with kronecker structure. Linear Algebra Appl. 434, 1677\u20131688 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2822_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10665-013-9677-y","volume":"93","author":"A Bouhamidi","year":"2015","unstructured":"Bouhamidi, A., Jbilou, K., Reichel, L., Sadok, H., Wang, Z.: Vector extrapolation applied to truncated singular value decomposition and truncated iteration. J. Eng. Math. 93(1), 99\u2013112 (2015)","journal-title":"J. Eng. Math."},{"key":"2822_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF02575753","volume":"12","author":"C Brezinski","year":"1975","unstructured":"Brezinski, C.: G\u00e9n\u00e9ralisations de la transformation de Shanks, de la table de Pad\u00e9 et de l\u2019$$\\varepsilon $$-algorithme. Calcolo 12, 317\u2013360 (1975)","journal-title":"Calcolo"},{"key":"2822_CR8","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1137\/S1064827597328510","volume":"21","author":"C Brezinski","year":"1999","unstructured":"Brezinski, C.: Error estimates for the solution of linear systems. SIAM J. Sci. Comput. 21, 764\u2013781 (1999)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"2822_CR9","doi-asserted-by":"publisher","first-page":"3058","DOI":"10.1093\/imanum\/drab061","volume":"42","author":"C Brezinski","year":"2022","unstructured":"Brezinski, C., Cipolla, S., Redivo-Zaglia, M., Saad, Y.: Shanks and Anderson-type acceleration techniques for systems of nonlinear equations. IMA J. Numer. Anal. 42(4), 3058\u20133093 (2022)","journal-title":"IMA J. Numer. Anal."},{"key":"2822_CR10","volume-title":"Extrapolation methods: theory and practice","author":"C Brezinski","year":"2013","unstructured":"Brezinski, C., Redivo-Zaglia, M.: Extrapolation methods: theory and practice. Elsevier, Amsterdam (2013)"},{"issue":"5","key":"2822_CR11","doi-asserted-by":"publisher","first-page":"A2227","DOI":"10.1137\/140957044","volume":"36","author":"C Brezinski","year":"2014","unstructured":"Brezinski, C., Redivo-Zaglia, M.: The simplified topological $$\\varepsilon $$-algorithms for accelerating sequences in a vector space. SIAM J. Sci. Comput. 36(5), A2227\u2013A2247 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"2822_CR12","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1007\/s11075-016-0238-0","volume":"74","author":"C Brezinski","year":"2017","unstructured":"Brezinski, C., Redivo-Zaglia, M.: The simplified topological $$\\varepsilon $$-algorithms: software and applications. Numer. Algorithms 74, 1237\u20131260 (2017)","journal-title":"Numer. Algorithms"},{"key":"2822_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s11075-018-0567-2","volume":"80","author":"C Brezinski","year":"2019","unstructured":"Brezinski, C., Redivo-Zaglia, M.: The genesis and early developments of Aitken\u2019s process, Shanks\u2019 transformation, the $$\\varepsilon $$-algorithm, and related fixed point methods. Numer. Algorithms 80, 11\u2013133 (2019)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"2822_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002110050382","volume":"81","author":"C Brezinski","year":"1998","unstructured":"Brezinski, C., Redivo-Zaglia, M., Rodriguez, G., Seatzu, S.: Extrapolation techniques for ill-conditioned linear systems. Numer. Math. 81(1), 1\u201329 (1998)","journal-title":"Numer. Math."},{"issue":"3","key":"2822_CR15","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1137\/17M1120725","volume":"60","author":"C Brezinski","year":"2018","unstructured":"Brezinski, C., Redivo-Zaglia, M., Saad, Y.: Shanks sequence transformations and Anderson acceleration. SIAM Rev. 60(3), 646\u2013669 (2018)","journal-title":"SIAM Rev."},{"issue":"1","key":"2822_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11075-022-01358-z","volume":"92","author":"C Brezinski","year":"2023","unstructured":"Brezinski, C., Redivo-Zaglia, M., Salam, A.: On the kernel of vector $$\\varvec {\\varepsilon }$$-algorithm and related topics. Numer. Algorithms 92(1), 207\u2013221 (2023)","journal-title":"Numer. Algorithms"},{"key":"2822_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s11075-008-9163-1","volume":"49","author":"C Brezinski","year":"2008","unstructured":"Brezinski, C., Rodriguez, G., Seatzu, S.: Error estimates for linear systems with applications to regularization. Numer. Algorithms 49, 85\u2013104 (2008)","journal-title":"Numer. Algorithms"},{"key":"2822_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s11075-008-9243-2","volume":"51","author":"C Brezinski","year":"2009","unstructured":"Brezinski, C., Rodriguez, G., Seatzu, S.: Error estimates for the regularization of least squares problems. Numer. Algorithms 51, 61\u201376 (2009)","journal-title":"Numer. Algorithms"},{"key":"2822_CR19","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1553\/etna_vol61s66","volume":"61","author":"A Buccini","year":"2024","unstructured":"Buccini, A., Reichel, L.: Software for limited memory restarted $$\\ell ^p$$-$$\\ell ^q$$ minimization methods using generalized Krylov subspaces. Electron. Trans. Numer. Anal. 61, 66\u201391 (2024)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"5","key":"2822_CR20","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1137\/0713060","volume":"13","author":"S Cabay","year":"1976","unstructured":"Cabay, S., Jackson, L.W.: A polynomial extrapolation method for finding limits and antilimits of vector sequences. SIAM J. Numer. Anal. 13(5), 734\u2013752 (1976)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"2822_CR21","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/21M1441420","volume":"66","author":"J Chung","year":"2024","unstructured":"Chung, J., Gazzola, S.: Computational methods for large-scale inverse problems: A survey on hybrid projection methods. SIAM Rev. 66(2), 205\u2013284 (2024)","journal-title":"SIAM Rev."},{"key":"2822_CR22","doi-asserted-by":"crossref","unstructured":"Deidda, G.P., D\u00edaz\u00a0de Alba, P., Rodriguez, G.: Identifying the magnetic permeability in multi-frequency EM data inversion. Electron. Trans. Numer. Anal. 47, 1\u201317 (2017)","DOI":"10.1553\/etna_vol47s1"},{"key":"2822_CR23","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/30\/12\/125014","volume":"30","author":"GP Deidda","year":"2014","unstructured":"Deidda, G.P., Fenu, C., Rodriguez, G.: Regularized solution of a nonlinear problem in electromagnetic sounding. Inverse Probl. 30, 125014 (2014)","journal-title":"Inverse Probl."},{"key":"2822_CR24","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/B978-0-12-734250-4.50028-X","volume-title":"Information linkage between applied mathematics and industry","author":"RP Eddy","year":"1979","unstructured":"Eddy, R.P.: Extrapolating to the limit of a vector sequence. In: Wang, P.C.C. (ed.) Information linkage between applied mathematics and industry, pp. 387\u2013396. Academic Press, New York (1979)"},{"key":"2822_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-1740-8","volume-title":"Regularization of inverse problems","author":"HW Engl","year":"1996","unstructured":"Engl, H.W., Hanke, M., Neubauer, A.: Regularization of inverse problems. Kluwer, Dordrecht (1996)"},{"key":"2822_CR26","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/nla.2020","volume":"23","author":"S Gazzola","year":"2016","unstructured":"Gazzola, S., Onunwor, E., Reichel, L., Rodriguez, G.: On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems. Numer. Linear Algebra Appl. 23, 187\u2013204 (2016)","journal-title":"Numer. Linear Algebra Appl."},{"key":"2822_CR27","volume-title":"Matrices. Moments and quadrature with applications","author":"GH Golub","year":"2010","unstructured":"Golub, G.H., Meurant, G.: Matrices. Moments and quadrature with applications. Princeton University Press, Princeton (2010)"},{"key":"2822_CR28","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1137\/1034115","volume":"34","author":"P Hansen","year":"1992","unstructured":"Hansen, P.: Analysis of discrete ill-posed problems by means of the L-curve. SIAM Review 34, 561\u2013580 (1992)","journal-title":"SIAM Review"},{"key":"2822_CR29","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1137\/0914086","volume":"14","author":"P Hansen","year":"1993","unstructured":"Hansen, P., O\u2019Leary, D.: The use of the L-curve in the regularization of discrete ill-posed problems. SIAM J. Sci. Comput. 14, 1487\u20131503 (1993)","journal-title":"SIAM J. Sci. Comput."},{"key":"2822_CR30","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/BF01937276","volume":"27","author":"PC Hansen","year":"1987","unstructured":"Hansen, P.C.: The truncated SVD as a method for regularization. BIT 27, 543\u2013553 (1987)","journal-title":"BIT"},{"key":"2822_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02149761","volume":"6","author":"PC Hansen","year":"1994","unstructured":"Hansen, P.C.: REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problems. Numer. Algorithms 6, 1\u201335 (1994)","journal-title":"Numer. Algorithms"},{"issue":"2","key":"2822_CR32","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.cam.2005.09.026","volume":"198","author":"PC Hansen","year":"2007","unstructured":"Hansen, P.C., Jensen, T.K., Rodriguez, G.: An adaptive pruning algorithm for the discrete L-curve criterion. J. Comput. Appl. Math. 198(2), 483\u2013492 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"2822_CR33","unstructured":"Jbilou, K.: M\u00e9thodes d\u2019extrapolation et de projection. applications aux suites de vecteurs (1988). Th\u00e8se de 3\u00e8me cycle, Universit\u00e9 des Sciences et Techniques de Lille"},{"issue":"2","key":"2822_CR34","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11075-008-9229-0","volume":"51","author":"K Jbilou","year":"2009","unstructured":"Jbilou, K., Reichel, L., Sadok, H.: Vector extrapolation enhanced TSVD for linear discrete ill-posed problems. Numer. Algorithms 51(2), 195\u2013208 (2009)","journal-title":"Numer. Algorithms"},{"key":"2822_CR35","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0377-0427(91)90018-F","volume":"36","author":"K Jbilou","year":"1991","unstructured":"Jbilou, K., Sadok, H.: Some results about vector extrapolation methods and related fixed point iteration. J. Comp. Appl. Math. 36, 385\u2013398 (1991)","journal-title":"J. Comp. Appl. Math."},{"key":"2822_CR36","first-page":"233","volume":"38","author":"S Kindermann","year":"2012","unstructured":"Kindermann, S.: Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems. Electron. Trans. Numer. Anal. 38, 233\u2013257 (2012)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"1\u20132","key":"2822_CR37","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02279938","volume":"7","author":"J McLeod","year":"1971","unstructured":"McLeod, J.: A note on the $$\\varepsilon $$-algorithm. Computing 7(1\u20132), 17\u201324 (1971)","journal-title":"Computing"},{"issue":"2","key":"2822_CR38","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0045-7825(77)90004-4","volume":"10","author":"M Me\u0161ina","year":"1977","unstructured":"Me\u0161ina, M.: Convergence acceleration for the iterative solution of the equations $$X=AX+f$$. Comput. Meth. Appl. Mech. Eng. 10(2), 165\u2013173 (1977)","journal-title":"Comput. Meth. Appl. Mech. Eng."},{"key":"2822_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5280-1","volume-title":"Methods for solving incorrectly posed problems","author":"VA Morozov","year":"1984","unstructured":"Morozov, V.A.: Methods for solving incorrectly posed problems. Springer Verlag, New York (1984)"},{"issue":"3","key":"2822_CR40","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0718026","volume":"18","author":"CC Paige","year":"1981","unstructured":"Paige, C.C., Saunders, M.A.: Towards a generalized singular value decomposition. SIAM J. Numer. Anal. 18(3), 398\u2013405 (1981)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"2822_CR41","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/355993.356000","volume":"8","author":"CC Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: Algorithm 583: LSQR: Sparse linear equations and least squares problems. ACM Trans. Math. Softw. 8(2), 195\u2013209 (1982)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"2822_CR42","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. Softw. 8(1), 43\u201371 (1982)","journal-title":"ACM Trans. Math. Softw."},{"key":"2822_CR43","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s11075-012-9612-8","volume":"63","author":"L Reichel","year":"2013","unstructured":"Reichel, L., Rodriguez, G.: Old and new parameter choice rules for discrete ill-posed problems. Numer. Algorithms 63, 65\u201387 (2013)","journal-title":"Numer. Algorithms"},{"key":"2822_CR44","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s11075-008-9244-1","volume":"51","author":"L Reichel","year":"2009","unstructured":"Reichel, L., Rodriguez, G., Seatzu, S.: Error estimates for large-scale ill-posed problems. Numer. Algorithms 51, 341\u2013361 (2009)","journal-title":"Numer. Algorithms"},{"key":"2822_CR45","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF02140685","volume":"7","author":"A Salam","year":"1994","unstructured":"Salam, A.: Non-commutative extrapolation algorithms. Numer. Algorithms 7, 225\u2013251 (1994)","journal-title":"Numer. Algorithms"},{"issue":"1\u20134","key":"2822_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/sapm19553411","volume":"34","author":"D Shanks","year":"1955","unstructured":"Shanks, D.: Non-linear transformations of divergent and slowly convergent sequences. J. Math. Phys. 34(1\u20134), 1\u201342 (1955)","journal-title":"J. Math. Phys."},{"issue":"3","key":"2822_CR47","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0377-0427(91)90013-A","volume":"36","author":"A Sidi","year":"1991","unstructured":"Sidi, A.: Efficient implementation of minimal polynomial and reduced rank extrapolation methods. J. Comp. Appl. Math. 36(3), 305\u2013337 (1991)","journal-title":"J. Comp. Appl. Math."},{"issue":"1","key":"2822_CR48","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0723013","volume":"23","author":"A Sidi","year":"1986","unstructured":"Sidi, A., Ford, W.F., Smith, D.A.: Acceleration of convergence of vector sequences. SIAM J. Numer. Anal. 23(1), 178\u2013196 (1986)","journal-title":"SIAM J. Numer. Anal."},{"issue":"54","key":"2822_CR49","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1090\/S0025-5718-1956-0084056-6","volume":"10","author":"P Wynn","year":"1956","unstructured":"Wynn, P.: On a device for computing the $$e_m(s_n)$$ tranformation. Math. Comput. 10(54), 91\u201396 (1956)","journal-title":"Math. Comput."},{"key":"2822_CR50","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1090\/S0025-5718-1962-0145647-X","volume":"16","author":"P Wynn","year":"1962","unstructured":"Wynn, P.: Acceleration techniqes for iterated vector and matrix problems. Math. Comp. 16, 301\u2013322 (1962)","journal-title":"Math. Comp."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02822-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10915-025-02822-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02822-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T02:50:49Z","timestamp":1743475849000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s10915-025-02822-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,13]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2822"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10915-025-02822-3","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,13]]},"assertion":[{"value":"16 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"9"}}