{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T14:20:16Z","timestamp":1783952416119,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100031060","name":"Performance Computing Joint Undertaking","doi-asserted-by":"publisher","award":["101144014"],"award-info":[{"award-number":["101144014"]}],"id":[{"id":"10.13039\/100031060","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017142","name":"Gruppo Nazionale per il Calcolo Scientifico","doi-asserted-by":"publisher","award":["E53C22001930001"],"award-info":[{"award-number":["E53C22001930001"]}],"id":[{"id":"10.13039\/100017142","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021856","name":"Ministero dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["I53C22000690001"],"award-info":[{"award-number":["I53C22000690001"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11075-025-02117-6","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T02:58:13Z","timestamp":1749437893000},"page":"1783-1812","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal polynomial smoothers for parallel AMG"],"prefix":"10.1007","volume":"100","author":[{"given":"Pasqua","family":"D\u2019Ambra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabio","family":"Durastante","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salvatore","family":"Filippone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefano","family":"Massei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,9]]},"reference":[{"issue":"6","key":"2117_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2518","volume":"30","author":"J Lottes","year":"2023","unstructured":"Lottes, J.: Optimal polynomial smoothers for multigrid V-cycles. Numer. Lin. Alg. with Appl. 30(6), e2518 (2023). https:\/\/doi.org\/10.1002\/nla.2518","journal-title":"Numer. Lin. Alg. with Appl."},{"key":"2117_CR2","unstructured":"Vassilevski, P.S.: Multilevel Block Factorization Preconditioners, p. 529. Springer, New York (2008). Matrix-based analysis and algorithms for solving finite element equations"},{"key":"2117_CR3","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1017\/S0962492917000083","volume":"26","author":"J Xu","year":"2017","unstructured":"Xu, J., Zikatanov, L.: Algebraic multigrid methods. Acta Numer. 26, 591\u2013721 (2017). https:\/\/doi.org\/10.1017\/S0962492917000083","journal-title":"Acta Numer."},{"issue":"2166","key":"2117_CR4","doi-asserted-by":"publisher","first-page":"20190053","DOI":"10.1098\/rsta.2019.0053","volume":"378","author":"H Anzt","year":"2020","unstructured":"Anzt, H., Boman, E., Falgout, R., et al.: Preparing sparse solvers for exascale computing. Philos. Trans. Roy. Soc. A. 378(2166), 20190053\u201317 (2020). https:\/\/doi.org\/10.1098\/rsta.2019.0053","journal-title":"Philos. Trans. Roy. Soc. A."},{"issue":"5","key":"2117_CR5","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1137\/100798806","volume":"33","author":"AH Baker","year":"2011","unstructured":"Baker, A.H., Falgout, R.D., Kolev, T.V., Yang, U.M.: Multigrid smoothers for ultraparallel computing. SIAM J. Sci. Comput. 33(5), 2864\u20132887 (2011). https:\/\/doi.org\/10.1137\/100798806","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"2117_CR6","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0021-9991(03)00194-3","volume":"188","author":"M Adams","year":"2003","unstructured":"Adams, M., Brezina, M., Hu, J., Tuminaro, R.: Parallel multigrid smoothing: polynomial versus Gauss-Seidel. J. Comput. Phys. 188(2), 593\u2013610 (2003). https:\/\/doi.org\/10.1016\/S0021-9991(03)00194-3","journal-title":"J. Comput. Phys."},{"issue":"4","key":"2117_CR7","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.1137\/S1064827500380623","volume":"23","author":"O Br\u00f6ker","year":"2001","unstructured":"Br\u00f6ker, O., Grote, M.J., Mayer, C., Reusken, A.: Robust parallel smoothing for multigrid via sparse approximate inverses. SIAM J. Sci. Comput. 23(4), 1396\u20131417 (2001). https:\/\/doi.org\/10.1137\/S1064827500380623","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2117_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/21M1430030","volume":"45","author":"R Huang","year":"2023","unstructured":"Huang, R., Li, R., Xi, Y.: Learning optimal multigrid smoothers via neural networks. SIAM J. Sci. Comput. 45(3), 199\u2013225 (2023). https:\/\/doi.org\/10.1137\/21M1430030","journal-title":"SIAM J. Sci. Comput."},{"key":"2117_CR9","doi-asserted-by":"publisher","unstructured":"Flaig, C., Arbenz, P.: A scalable memory efficient multigrid solver for micro-finite element analyses based on CT images. Parallel Comput. 37(12), 846\u2013854 (2011). https:\/\/doi.org\/10.1016\/j.parco.2011.08.001. International Workshop on Parallel Matrix Algorithms and Applications (PMAA\u201910)","DOI":"10.1016\/j.parco.2011.08.001"},{"key":"2117_CR10","first-page":"215","volume-title":"Competence in High Performance Computing 2010","author":"AH Baker","year":"2012","unstructured":"Baker, A.H., Falgout, R.D., Gamblin, T., Kolev, T.V., Schulz, M., Yang, U.M.: Scaling Algebraic Multigrid Solvers: On the Road to Exascale. In: Bischof, C., Hegering, H.-G., Nagel, W.E., Wittum, G. (eds.) Competence in High Performance Computing 2010, pp. 215\u2013226. Springer, Berlin, Heidelberg (2012)"},{"issue":"8","key":"2117_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1002\/nla.486","volume":"13","author":"S MacLachlan","year":"2006","unstructured":"MacLachlan, S., Manteuffel, T., McCormick, S.: Adaptive reduction-based AMG. Numer. Linear Algebra Appl. 13(8), 599\u2013620 (2006). https:\/\/doi.org\/10.1002\/nla.486","journal-title":"Numer. Linear Algebra Appl."},{"key":"2117_CR12","first-page":"146","volume":"45","author":"F Gossler","year":"2016","unstructured":"Gossler, F., Nabben, R.: On AMG methods with F-smoothing based on Chebyshev polynomials and their relation to AMGr. Electron. Trans. Numer. Anal. 45, 146\u2013159 (2016)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"2117_CR13","doi-asserted-by":"publisher","unstructured":"Siefert, C., Olivier, S.L., Voskuilen, G., Young, J.: MultiGrid on FPGA Using Data Parallel C++. In: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 907\u2013910 (2022). https:\/\/doi.org\/10.1109\/IPDPSW55747.2022.00147","DOI":"10.1109\/IPDPSW55747.2022.00147"},{"issue":"11","key":"2117_CR14","doi-asserted-by":"publisher","first-page":"4153","DOI":"10.1016\/j.jcp.2010.04.030","volume":"230","author":"F Bassi","year":"2011","unstructured":"Bassi, F., Ghidoni, A., Rebay, S.: Optimal Runge-Kutta smoothers for the $$p$$-multigrid discontinuous Galerkin solution of the 1D Euler equations. J. Comput. Phys. 230(11), 4153\u20134175 (2011). https:\/\/doi.org\/10.1016\/j.jcp.2010.04.030","journal-title":"J. Comput. Phys."},{"key":"2117_CR15","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.laa.2017.07.036","volume":"533","author":"D Bertaccini","year":"2017","unstructured":"Bertaccini, D., Donatelli, M., Durastante, F., Serra-Capizzano, S.: Optimizing a multigrid Runge-Kutta smoother for variable-coefficient convection-diffusion equations. Linear Algebra Appl. 533, 507\u2013535 (2017). https:\/\/doi.org\/10.1016\/j.laa.2017.07.036","journal-title":"Linear Algebra Appl."},{"key":"2117_CR16","first-page":"298","volume":"39","author":"P Birken","year":"2012","unstructured":"Birken, P.: Optimizing Runge-Kutta smoothers for unsteady flow problems. Electron. Trans. Numer. Anal. 39, 298\u2013312 (2012)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"2117_CR17","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jcp.2014.07.050","volume":"277","author":"S Langer","year":"2014","unstructured":"Langer, S.: Agglomeration multigrid methods with implicit Runge-Kutta smoothers applied to aerodynamic simulations on unstructured grids. J. Comput. Phys. 277, 72\u2013100 (2014). https:\/\/doi.org\/10.1016\/j.jcp.2014.07.050","journal-title":"J. Comput. Phys."},{"issue":"4","key":"2117_CR18","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1002\/nla.1979","volume":"22","author":"H Sundar","year":"2015","unstructured":"Sundar, H., Stadler, G., Biros, G.: Comparison of multigrid algorithms for high-order continuous finite element discretizations. Numer. Linear Algebra Appl. 22(4), 664\u2013680 (2015). https:\/\/doi.org\/10.1002\/nla.1979","journal-title":"Numer. Linear Algebra Appl."},{"issue":"3","key":"2117_CR19","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1177\/10943420231217221","volume":"38","author":"P Munch","year":"2024","unstructured":"Munch, P., Kronbichler, M.: Cache-optimized and low-overhead implementations of additive Schwarz methods for high-order FEM multigrid computations. Int. J. High Perform. Comput. Appl. 38(3), 192\u2013209 (2024). https:\/\/doi.org\/10.1177\/10943420231217221","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"2","key":"2117_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/nla.1808","volume":"19","author":"P Ghysels","year":"2012","unstructured":"Ghysels, P., K\u0142osiewicz, P., Vanroose, W.: Improving the arithmetic intensity of multigrid with the help of polynomial smoothers. Numer. Linear Algebra Appl. 19(2), 253\u2013267 (2012). https:\/\/doi.org\/10.1002\/nla.1808","journal-title":"Numer. Linear Algebra Appl."},{"issue":"4","key":"2117_CR21","doi-asserted-by":"publisher","first-page":"448","DOI":"10.2478\/cmam-2012-0026","volume":"12","author":"J Kraus","year":"2012","unstructured":"Kraus, J., Vassilevski, P., Zikatanov, L.: Polynomial of best uniform approximation to and smoothing in two-level methods. Comput. Meth. Appl. Math. 12(4), 448\u2013468 (2012). https:\/\/doi.org\/10.2478\/cmam-2012-0026","journal-title":"Comput. Meth. Appl. Math."},{"issue":"4","key":"2117_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10492-013-0018-2","volume":"58","author":"P Van\u011bk","year":"2013","unstructured":"Van\u011bk, P., Brezina, M.: Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing. Appl. Math. 58(4), 369\u2013388 (2013). https:\/\/doi.org\/10.1007\/s10492-013-0018-2","journal-title":"Appl. Math."},{"issue":"1","key":"2117_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4208\/nmtma.2015.w01si","volume":"8","author":"J Brannick","year":"2015","unstructured":"Brannick, J., Hu, X., Rodrigo, C., Zikatanov, L.: Local Fourier analysis of multigrid methods with polynomial smoothers and aggressive coarsening. Numer. Math. Theory Methods Appl. 8(1), 1\u201321 (2015). https:\/\/doi.org\/10.4208\/nmtma.2015.w01si","journal-title":"Numer. Math. Theory Methods Appl."},{"key":"2117_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.simpa.2022.100463","volume":"15","author":"P D\u2019Ambra","year":"2023","unstructured":"D\u2019Ambra, P., Durastante, F., Filippone, S.: Parallel sparse computation toolkit. Softw Impacts 15, 1 (2023). https:\/\/doi.org\/10.1016\/j.simpa.2022.100463","journal-title":"Parallel sparse computation toolkit. Softw Impacts"},{"issue":"5","key":"2117_CR25","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1137\/20M134914X","volume":"43","author":"P D\u2019Ambra","year":"2021","unstructured":"D\u2019Ambra, P., Durastante, F., Filippone, S.: AMG preconditioners for linear solvers towards extreme scale. SIAM J. Sci. Comput. 43(5), 679\u2013703 (2021). https:\/\/doi.org\/10.1137\/20M134914X","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"2117_CR26","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1137\/0722039","volume":"22","author":"SF McCormick","year":"1985","unstructured":"McCormick, S.F.: Multigrid methods for variational problems: General theory for the $$V$$-cycle. SIAM J. Numer. Anal. 22(4), 634\u2013643 (1985). https:\/\/doi.org\/10.1137\/0722039","journal-title":"SIAM J. Numer. Anal."},{"key":"2117_CR27","doi-asserted-by":"crossref","unstructured":"Hackbusch, W.: Multigrid convergence theory. In: Multigrid Methods (Cologne, 1981). Lecture Notes in Math., vol. 960, pp. 177\u2013219. Springer, Berlin-New York (1982)","DOI":"10.1007\/BFb0069929"},{"key":"2117_CR28","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01386014","volume":"3","author":"GH Golub","year":"1961","unstructured":"Golub, G.H., Varga, R.S.: Chebyshev semi-iterative methods, successive over-relaxation iterative methods, and second order Richardson iterative methods. II. Numer. Math. 3, 157\u2013168 (1961). https:\/\/doi.org\/10.1007\/BF01386014","journal-title":"II. Numer. Math."},{"key":"2117_CR29","first-page":"341","volume-title":"Chebyshev Polynomials","author":"JC Mason","year":"2003","unstructured":"Mason, J.C., Handscomb, D.C.: Chebyshev Polynomials, p. 341. Chapman & Hall\/CRC, Boca Raton, FL (2003)"},{"key":"2117_CR30","unstructured":"Forsythe, G.E., Malcolm, M.A., Moler, C.B.: Computer Methods for Mathematical Computations. Prentice-Hall Series in Automatic Computation, p. 259. Prentice-Hall, Inc., Englewood Cliffs, NJ (1977)"},{"key":"2117_CR31","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF02238511.","volume":"56","author":"P Van\u011bk","year":"1996","unstructured":"Van\u011bk, P., Mandel, J., Brezina, M.: Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems. 56, 179\u2013196 (1996). https:\/\/doi.org\/10.1007\/BF02238511. International GAMM-Workshop on Multi-level Methods (Meisdorf, 1994)","journal-title":"Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems."},{"issue":"4","key":"2117_CR32","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/3190647","volume":"44","author":"P D\u2019Ambra","year":"2018","unstructured":"D\u2019Ambra, P., Filippone, S., Vassilevski, P.S.: BootCMatch: a software package for bootstrap AMG based on graph weighted matching. ACM Trans. Math. Software 44(4), 39\u201325 (2018). https:\/\/doi.org\/10.1145\/3190647","journal-title":"ACM Trans. Math. Software"},{"key":"2117_CR33","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.jcp.2014.10.043","volume":"281","author":"Y Notay","year":"2015","unstructured":"Notay, Y., Napov, A.: A massively parallel solver for discrete Poisson-like problems. J. Comput. Phys. 281, 237\u2013250 (2015). https:\/\/doi.org\/10.1016\/j.jcp.2014.10.043","journal-title":"J. Comput. Phys."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02117-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02117-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02117-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T04:59:52Z","timestamp":1763960392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02117-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,9]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2117"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02117-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,9]]},"assertion":[{"value":"27 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":3,"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":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interest"}}]}}