From Useful Algorithms for Slowly Convergent Series to Physical Predictions Based on Divergent Perturbative Expansions
E. Caliceti, M. Meyer-Hermann, P. Ribeca, A. Surzhykov, U. D., Jentschura

TL;DR
This review explores numerical methods for accelerating series convergence and discusses Borel resummation techniques, highlighting their applications in physics for handling divergent series and extracting physical predictions.
Contribution
It provides a comprehensive overview of convergence acceleration methods and advanced Borel resummation algorithms, connecting mathematical techniques with physical interpretations.
Findings
Convergence acceleration methods can significantly improve series summation efficiency.
Borel resummation effectively handles factorially divergent series in physics.
Singularities in the Borel transform relate to physical phenomena like resonances and nonperturbative effects.
Abstract
This review is focused on the borderline region of theoretical physics and mathematics. First, we describe numerical methods for the acceleration of the convergence of series. These provide a useful toolbox for theoretical physics which has hitherto not received the attention it actually deserves. The unifying concept for convergence acceleration methods is that in many cases, one can reach much faster convergence than by adding a particular series term by term. In some cases, it is even possible to use a divergent input series, together with a suitable sequence transformation, for the construction of numerical methods that can be applied to the calculation of special functions. This review both aims to provide some practical guidance as well as a groundwork for the study of specialized literature. As a second topic, we review some recent developments in the field of Borel resummation,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
