A convergence acceleration method for some logarithmically convergent sequences
SIAM Journal on Numerical Analysis
Acceleration of convergence of a family of logarithmically convergent sequences
Mathematics of Computation
HURRY: An Acceleration Algorithm for Scalar Sequences and Series
ACM Transactions on Mathematical Software (TOMS)
Scalar Levin-type sequence transformations
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 vol. II: interpolation and extrapolation
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 vol. II: interpolation and extrapolation
Algorithm 368: Numerical inversion of Laplace transforms [D5]
Communications of the ACM
Numerical Inversion Methods for Computing Approximate p-Values
Computational Economics
Application of high-precision computing for pricing arithmetic asian options
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A Unified Framework for Numerically Inverting Laplace Transforms
INFORMS Journal on Computing
Computational Statistics & Data Analysis
Automation and Remote Control
Application of Post's formula to optical pulse propagation in dispersive media
Computers & Mathematics with Applications
Mathematics and Computers in Simulation
Hi-index | 0.09 |
The sequence of Gaver functionals is useful in the numerical inversion of Laplace transforms. The convergence behavior of the sequence is logarithmic, therefore, an acceleration scheme is required. The accepted procedure utilizes Salzer summation, because in many cases the Gaver functionals have the asymptotic behavior @?"n(t) - @?"n(t) ~ An^-^2 as n - ~ for fixed t. It seems that no other acceleration schemes have been investigated in this area. Surely, the popular nonlinear methods should be more effective. However, to our surprise, only one nonlinear method was superior to Salzer summation, namely the Wynn rho algorithm.