Acceleration methods based on convergence tests
The following simple theorem offers both a convergence test for a real valued sequence and a derived sequence which converges faster to the same limit. Let \(\{\) S(n)\(\}\) and \(\{\) x(n)\(\}\) be monotone, the latter converging to x. Set \(A(k,n)=\{x(n+1)-x(n)\}/\{S(n+k+1)-S(n+k)\}.\) If, with k fixed, lim A(k,n)\(\neq 0\), then \(\{\) S(n)\(\}\) converges and, setting \(T(n)=S(n)+\{x-x(n-k)\}/A(k,n-k),\lim \{S-T(n)\}/\{S-S(n)\}=0,\) where \(S=\lim S(n).\) The convergence tests of d'Alembert, Cauchy, Kummer, Raabe, Gauss and others are considered in the light of the above result.
- scientific article; zbMATH DE number 709412
- Convergence acceleration of some logarithmic sequences
- A Convergence Acceleration Method based on a good Estimation of the Absolute value of the Error
- scientific article; zbMATH DE number 95653
- Remarks to a definition of convergence acceleration illustrated by means of continued fractions \(K(a_ n/1)\) where \(a_ n\to 0\)
- Optimal linear contractive sequence transformations
- On the acceleration of two classes of sequences by the \(\widehat{\Theta}\)-algorithm
- Comparison of four nonlinear transforms on some classes of logarithmic fixed point sequences
- Extrapolation algorithms and Padé approximations: A historical survey
- A derivation of extrapolation algorithms based on error estimates
- Multistart method with estimation scheme for global satisfycing problems
- scientific article; zbMATH DE number 3926057 (Why is no real title available?)
- The early history of convergence acceleration methods
- scientific article; zbMATH DE number 709412 (Why is no real title available?)
- Accelerating the CM method
- Convergence acceleration during the 20th century
- Some results of convergence acceleration for a general \(\Theta\)-type algorithm
This page was built for publication: Acceleration methods based on convergence tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751161)