{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:18Z","timestamp":1740123678023,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:00:00Z","timestamp":1578441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:00:00Z","timestamp":1578441600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/MAT\/00297\/2019 (CMA)"],"award-info":[{"award-number":["UID\/MAT\/00297\/2019 (CMA)"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CNRS Poste Rouge, France","award":["LAMFA Laboratory (UMR 7352)"],"award-info":[{"award-number":["LAMFA Laboratory (UMR 7352)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s11075-019-00862-z","type":"journal-article","created":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:02:26Z","timestamp":1578506546000},"page":"1213-1231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Geometrical inverse matrix approximation for least-squares problems and acceleration strategies"],"prefix":"10.1007","volume":"85","author":[{"given":"Jean-Paul","family":"Chehab","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0417-7981","authenticated-orcid":false,"given":"Marcos","family":"Raydan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,8]]},"reference":[{"key":"862_CR1","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/321296.321305","volume":"12","author":"DG Anderson","year":"1965","unstructured":"Anderson, D.G.: Iterative procedures for nonlinear integral equations. J. ACM 12, 547\u2013560 (1965)","journal-title":"J. ACM"},{"key":"862_CR2","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1016\/j.laa.2012.07.048","volume":"438","author":"R Andreani","year":"2013","unstructured":"Andreani, R., Raydan, M., Tarazaga, P.: On the geometrical structure of symmetric matrices. Linear Algebra Appl. 438, 1201\u20131214 (2013)","journal-title":"Linear Algebra Appl."},{"key":"862_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-0427(00)00360-5","volume":"122","author":"C Brezinski","year":"2000","unstructured":"Brezinski, C.: Convergence acceleration during the 20th century. J. Comput. Appl. Math. 122, 1\u201321 (2000). Numerical Analysis in the 20th Century Vol. II: Interpolation and Extrapolation","journal-title":"J. Comput. Appl. Math."},{"key":"862_CR4","volume-title":"Extrapolation methods theory and practice","author":"C Brezinski","year":"1991","unstructured":"Brezinski, C., Redivo-Zaglia, M.: Extrapolation methods theory and practice. North-Holland, Amsterdam (1991)"},{"key":"862_CR5","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1137\/140957044","volume":"36","author":"C Brezinski","year":"2014","unstructured":"Brezinski, C., Redivo-Zaglia, M.: The simplified topological \u03b5-algorithms for accelerating sequences in a vector space. SIAM J. Sci. Comput. 36, 2227\u20132247 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"862_CR6","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 \u03b5-algorithms: software and applications. Numer. Algor. 74, 1237\u20131260 (2017)","journal-title":"Numer. Algor."},{"key":"862_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s11075-018-0567-2","volume":"84","author":"C Brezinski","year":"2019","unstructured":"Brezinski, C., Redivo-Zaglia, M.: The genesis and early developments of Aitkens process, Shanks transformation, the \u03b5-algorithm, and related fixed point methods. Numer. Algor. 84, 11\u2013133 (2019)","journal-title":"Numer. Algor."},{"key":"862_CR8","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, 646\u2013669 (2018)","journal-title":"SIAM Rev."},{"key":"862_CR9","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1137\/11083229X","volume":"34","author":"LE Carr","year":"2012","unstructured":"Carr, L.E., Borges, C.F., Giraldo, F.X.: An element based spectrally optimized approximate inverse preconditioner for the Euler equations. SIAM J. Sci. Comput. 34, 392\u2013420 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"862_CR10","first-page":"95","volume":"26","author":"J-P Chehab","year":"2007","unstructured":"Chehab, J.-P.: Matrix differential equations and inverse preconditioners. Comput. Appl. Math. 26, 95\u2013128 (2007)","journal-title":"Comput. Appl. Math."},{"key":"862_CR11","first-page":"95","volume":"4","author":"J-P Chehab","year":"2016","unstructured":"Chehab, J.-P.: Sparse approximations of matrix functions via numerical integration of ODEs. Bull. Comput. Appl. Math. 4, 95\u2013132 (2016)","journal-title":"Bull. Comput. Appl. Math."},{"key":"862_CR12","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1016\/j.laa.2008.06.006","volume":"429","author":"JP Chehab","year":"2008","unstructured":"Chehab, J.P., Raydan, M.: Geometrical properties of the Frobenius condition number for positive definite matrices. Linear Algebra Appl. 429, 2089\u20132097 (2008)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"862_CR13","doi-asserted-by":"publisher","first-page":"46","DOI":"10.3390\/math4030046","volume":"4","author":"JP Chehab","year":"2016","unstructured":"Chehab, J.P., Raydan, M.: Geometrical inverse preconditioning for symmetric positive definite matrices. Mathematics 4(3), 46 (2016). https:\/\/doi.org\/10.3390\/math4030046","journal-title":"Mathematics"},{"key":"862_CR14","first-page":"1058\u20141078","volume":"22","author":"K Chen","year":"2001","unstructured":"Chen, K.: An analysis of sparse approximate inverse preconditioners for boundary integral equations. SIAM J. Matrix Anal. Appl. 22, 1058\u20141078 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"862_CR15","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1137\/S1064827595281575","volume":"18","author":"E Chow","year":"1997","unstructured":"Chow, E., Saad, Y.: Approximate inverse techniques for block-partitioned matrices. SIAM J. Sci. Comput. 18, 1657\u20131675 (1997)","journal-title":"SIAM J. Sci. Comput."},{"key":"862_CR16","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.laa.2014.07.024","volume":"468","author":"J Chung","year":"2015","unstructured":"Chung, J., Chung, M., O\u2019Leary, D.P.: Optimal regularized low rank inverse approximation. Linear Algebra Appl. 468, 260\u2013269 (2015)","journal-title":"Linear Algebra Appl."},{"key":"862_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03167543","volume":"26","author":"X Cui","year":"2009","unstructured":"Cui, X., Hayami, K.: Generalized approximate inverse preconditioners for least squares problems. J.pan J. Indust. Appl. Math. 26, 1\u201314 (2009)","journal-title":"J.pan J. Indust. Appl. Math."},{"key":"862_CR18","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1093\/imanum\/drs056","volume":"33","author":"R De Asmundis","year":"2013","unstructured":"De Asmundis, R., di Serafino, D., Riccio, F., Toraldo, G.: On spectral properties of steepest descent methods. IMA J. Numer. Anal. 33, 1416\u20131435 (2013)","journal-title":"IMA J. Numer. Anal."},{"key":"862_CR19","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF01399010","volume":"35","author":"JP Delahaye","year":"1980","unstructured":"Delahaye, J.P., Germain-Bonne, B.: R\u00e9sultats n\u00e9gatifs en acc\u00e9l\u00e9ration de la convergence. Numer. Math. 35, 443\u2013457 (1980)","journal-title":"Numer. Math."},{"key":"862_CR20","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.cam.2007.07.017","volume":"219","author":"MA Diniz-Ehrhardt","year":"2008","unstructured":"Diniz-Ehrhardt, M.A., Mart\u00ednez, J.M., Raydan, M.: A derivative-free nonmonotone line search technique for unconstrained optimization. J. Comput. Appl. Math. 219, 383\u2013397 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"862_CR21","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/74.482076","volume":"37","author":"K Forsman","year":"1995","unstructured":"Forsman, K., Gropp, W., Kettunen, L., Levine, D., Salonen, J.: Solution of dense systems of linear equations arising from integral equation formulations. Antennas and Propagation Magazine 37, 96\u2013100 (1995)","journal-title":"Antennas and Propagation Magazine"},{"key":"862_CR22","doi-asserted-by":"crossref","first-page":"299","DOI":"10.3934\/jimo.2008.4.299","volume":"4","author":"G Frassoldati","year":"2008","unstructured":"Frassoldati, G., Zanni, L., Zanghirati, G.: New adaptive stepsize selections in gradient methods. J. Ind. Manag. Optim. 4, 299\u2013312 (2008)","journal-title":"J. Ind. Manag. Optim."},{"key":"862_CR23","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/jcc.540140115","volume":"14","author":"W Glunt","year":"1993","unstructured":"Glunt, W., Hayden, T.L.: M. Raydan molecular conformations from distance matrices. J. Comput. Chem. 14, 114\u2013120 (1993)","journal-title":"J. Comput. Chem."},{"key":"862_CR24","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S1064827595288425","volume":"19","author":"NIM Gould","year":"1998","unstructured":"Gould, N.I.M., Scott, J.A.: Sparse approximate-inverse preconditioners using norm-minimization techniques. SIAM J. Sci. Comput. 19, 605\u2013625 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"862_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0377-0427(00)00355-1","volume":"122","author":"PR Graves-Morris","year":"2000","unstructured":"Graves-Morris, P.R., Roberts, P.R., Salam, A.: The epsilon algorithm and related topics. J. Comput. Appl. Math. 122, 51\u201380 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"862_CR26","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10543-006-0057-0","volume":"46","author":"J Helsing","year":"2006","unstructured":"Helsing, J.: Approximate inverse preconditioners for some large dense random electrostatic interaction matrices. BIT Numer. Math. 46, 307\u2013323 (2006)","journal-title":"BIT Numer. Math."},{"key":"862_CR27","doi-asserted-by":"publisher","unstructured":"Henderson, N.C., Varadhan, R.: Damped Anderson acceleration with restarts and monotonicity control for accelerating EM and EM like algorithms, Journal of Computational and Graphical Statistics. https:\/\/doi.org\/10.1080\/10618600.2019.1594835 (2019)","DOI":"10.1080\/10618600.2019.1594835"},{"key":"862_CR28","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1007\/s11075-015-0078-3","volume":"72","author":"N Higham","year":"2016","unstructured":"Higham, N., Strabi\u0107, N.: Anderson acceleration of the alternating projections method for computing the nearest correlation matrix. Numer. Algor. 72, 1021\u20131042 (2016)","journal-title":"Numer. Algor."},{"key":"862_CR29","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1093\/imanum\/drx015","volume":"38","author":"B Iannazzo","year":"2018","unstructured":"Iannazzo, B., Porcelli, M.: The Riemannian Barzilai-Borwein method with nonmonotone line-search and the matrix geometric mean computation. IMA J. Numer. Anal. 38, 495\u2013517 (2018)","journal-title":"IMA J. Numer. Anal."},{"key":"862_CR30","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.apnum.2016.04.001","volume":"106","author":"K Jbilou","year":"2016","unstructured":"Jbilou, K., Messaoudi, A.: Block extrapolation methods with applications. Appl. Numer. Math. 106, 154\u2013164 (2016)","journal-title":"Appl. Numer. Math."},{"key":"862_CR31","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0377-0427(00)00357-5","volume":"122","author":"K Jbilou","year":"2000","unstructured":"Jbilou, K., Sadok, H.: Vector extrapolation methods: applications and numerical comparison. J. Comput. Appl. Math. 122, 149\u2013165 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"862_CR32","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11075-014-9879-z","volume":"68","author":"K Jbilou","year":"2015","unstructured":"Jbilou, K., Sadok, H.: Matrix polynomial and epsilon-type extrapolation methods with applications. Numer. Algor. 68, 107\u2013119 (2015)","journal-title":"Numer. Algor."},{"key":"862_CR33","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02141939","volume":"3","author":"AC Matos","year":"1992","unstructured":"Matos, A.C.: Convergence and acceleration properties for the vector \ud835\udf16-algorithm. Numer. Algor. 3, 313\u2013320 (1992)","journal-title":"Numer. Algor."},{"key":"862_CR34","unstructured":"Matrix Market, http:\/\/math.nist.gov\/MatrixMarket\/"},{"key":"862_CR35","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/nla.269","volume":"9","author":"G Montero","year":"2002","unstructured":"Montero, G., Gonz\u00e1lez, L., Fl\u00f3rez, E., Garc\u00eda, M.D., Su\u00e1rez, A.: Approximate inverse computation using Frobenius inner product. Numerical Linear Algebra with Applications 9, 239\u2013247 (2002)","journal-title":"Numerical Linear Algebra with Applications"},{"key":"862_CR36","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1013708715892","volume":"21","author":"M Raydan","year":"2002","unstructured":"Raydan, M., Svaiter, B.: Relaxed steepest descent and Cauchy-Barzilai-Borwein method. Comput. Optim. Appl. 21, 155\u2013167 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"862_CR37","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.cam.2014.02.030","volume":"268","author":"AM Sajo-Castelli","year":"2014","unstructured":"Sajo-Castelli, A.M., Fortes, M.A., Raydan, M.: Preconditioned conjugate gradient method for finding minimal energy surfaces on Powell-Sabin triangulations. J. Comput. Appl. Math. 268, 34\u201355 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"862_CR38","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.amc.2017.07.037","volume":"318","author":"D di Serafino","year":"2018","unstructured":"di Serafino, D., Ruggiero, V., Toraldo, G., Zanni, L.: On the steplength selection in gradient methods for unconstrained optimization. Appl. Math. Comput. 318, 176\u2013195 (2018)","journal-title":"Appl. Math. Comput."},{"key":"862_CR39","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s11075-010-9397-6","volume":"56","author":"RB Sidje","year":"2011","unstructured":"Sidje, R.B., Saad, Y.: Rational approximation to the Fermi\u2013Dirac function with applications in density functional theory. Numer. Algor. 56, 455\u2013479 (2011)","journal-title":"Numer. Algor."},{"key":"862_CR40","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1137\/10078356X","volume":"49","author":"HF Walker","year":"2011","unstructured":"Walker, H.F., Ni, P.: Anderson acceleration for fixed-point iterations. SIAM J. Numer. Anal. 49, 1715\u20131735 (2011)","journal-title":"SIAM J. Numer. Anal."},{"key":"862_CR41","unstructured":"Wang, J.-K., Lin, S.D.: Robust inverse covariance estimation under noisy measurements. In: Proceedings of the 31st International Conference on Machine Learning (ICML-14), 928\u2013936 (2014)"},{"key":"862_CR42","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou, B., Gao, L., Dai, Y.H.: Gradient methods with adaptive step-sizes. Comput. Optim. Appl. 35, 69\u201386 (2006)","journal-title":"Comput. Optim. Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00862-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-019-00862-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00862-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T11:24:24Z","timestamp":1665401064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-019-00862-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,8]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["862"],"URL":"https:\/\/doi.org\/10.1007\/s11075-019-00862-z","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2020,1,8]]},"assertion":[{"value":"21 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}