July 11, 2001
Convergence problems occur abundantly in all branches of mathematics or in the mathematical treatment of the sciences. Sequence transformations are principal tools to overcome convergence problems of the kind. They accomplish this by converting a slowly converging or diverging input sequence $\{s_n \}_{n=0}^{\infty}$ into another sequence $\{s^{\prime}_n \}_{n=0}^{\infty}$ with hopefully better numerical properties. Pad\'{e} approximants, which convert the partial sums of a power series to a doubly indexed sequence of rational functions, are the best known sequence transformations, but the emphasis of the review will be on alternative sequence transformations which for some problems provide better results than Pad\'{e} approximants.
Similar papers 1
June 20, 2003
Slowly convergent series and sequences as well as divergent series occur quite frequently in the mathematical treatment of scientific problems. In this report, a large number of mainly nonlinear sequence transformations for the acceleration of convergence and the summation of divergent series are discussed. Some of the sequence transformations of this report as for instance Wynn's $\epsilon$ algorithm or Levin's sequence transformation are well established in the literature o...
March 19, 2017
In this paper, we discuss the application of the author's $\tilde{d}^{(m)}$ transformation to accelerate the convergence of infinite series $\sum^\infty_{n=1}a_n$ when the terms $a_n$ have asymptotic expansions that can be expressed in the form $$ a_n\sim(n!)^{s/m}\exp\left[\sum^{m}_{i=0}q_in^{i/m}\right]\sum^\infty_{i=0}w_i n^{\gamma-i/m}\quad\text{as $n\to\infty$},\quad s\ \text{integer.}$$ We discuss the implementation of the $\tilde{d}^{(m)}$ transformation via the recurs...
February 1, 2002
This work describes numerical methods that are useful in many areas: examples include statistical modelling (bioinformatics, computational biology), theoretical physics, and even pure mathematics. The methods are primarily useful for the acceleration of slowly convergent and the summation of divergent series that are ubiquitous in relevant applications. The computing time is reduced in many cases by orders of magnitude.
May 22, 2000
Sequence transformations are important tools for the convergence acceleration of slowly convergent scalar sequences or series and for the summation of divergent series. Transformations that depend not only on the sequence elements or partial sums $s_n$ but also on an auxiliary sequence of so-called remainder estimates $\omega_n$ are of Levin-type if they are linear in the $s_n$, and nonlinear in the $\omega_n$. Known Levin-type sequence transformations are reviewed and put in...
June 22, 2015
We describe a simple analytical method for effective summation of series, including divergent series. The method is based on self-similar approximation theory resulting in self-similar root approximants. The method is shown to be general and applicable to different problems, as is illustrated by a number of examples. The accuracy of the method is not worse, and in many cases better, than that of Pade approximants, when the latter can be defined.
March 15, 2017
The aim of this review, based on a series of four lectures held at the 22nd "Saalburg" Summer School (2016), is to cover selected topics in the theory of perturbation series and their summation. The first part is devoted to strategies for accelerating the rate of convergence of convergent series, namely Richardson extrapolation, and the Shanks transformations, and also covers a few techniques for accelerating the convergence of Fourier series. The second part focuses on diver...
March 25, 2019
We construct new sequence transformations based on Wynn's epsilon and rho algorithms. The recursions of the new algorithms include the recursions of Wynn's epsilon and rho algorithm and of Osada's generalized rho algorithm as special cases. We demonstrate the performance of our algorithms numerically by applying them to some linearly and logarithmically convergent sequences as well as some divergent series.
September 21, 1998
A method of numerically evaluating slowly convergent monotone series is described. First, we apply a condensation transformation due to Van Wijngaarden to the original series. This transforms the original monotone series into an alternating series. In the second step, the convergence of the transformed series is accelerated with the help of suitable nonlinear sequence transformations that are known to be particularly powerful for alternating series. Some theoretical aspects o...
June 25, 2003
\v{C}\'{\i}\v{z}ek, Zamastil, and Sk\'{a}la [J. Math. Phys. \textbf{44}, 962 - 968 (2003)] introduced in connection with the summation of the divergent perturbation expansion of the hydrogen atom in an external magnetic field a new sequence transformation which uses as input data not only the elements of a sequence $\{s_n \}_{n=0}^{\infty}$ of partial sums, but also explicit estimates $\{\omega_n \}_{n=0}^{\infty}$ for the truncation errors. The explicit incorporation of the ...
February 23, 2017
We propose a new simple convergence acceleration method for wide range class of convergent alternating series. It has some common features with Smith's and Ford's modification of Levin's and Weniger's sequence transformations, but its computational and memory cost is lower. We compare all three methods and give some common theoretical results. Numerical examples confirm a similar performance of all of them.