A comparison of two methods for accelerating the convergence of Fourier series

DOI10.1016/0898-1221(81)90036-5zbMath0466.65002MaRDI QIDQ1155321

George H. Weiss, James E. Kiefer

Publication date: 1981

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(81)90036-5

zbMATH Keywords

comparison of methods; epsilon algorithm; summation by parts; numerical inversion of Laplace transforms; accelerating slowly convergent Fourier series

Mathematics Subject Classification ID

65B05: Extrapolation to the limit, deferred corrections

44A10: Laplace transform

65R10: Numerical methods for integral transforms

65T40: Numerical methods for trigonometric approximation and interpolation

42A20: Convergence and absolute convergence of Fourier and trigonometric series

65B10: Numerical summation of series

Related Items

A Levin-type algorithm for accelerating the convergence of Fourier series, The Fourier-series method for inverting transforms of probability distributions, An asymptotically hierarchy-consistent, iterative sequence transformation for convergence acceleration of Fourier series, A convergence acceleration method of Fourier series, The accelerated convergence of heat transfer series in high frequency oscillating boundary layer flows of compressible fluids

Cites Work

• Numerical inversion of Mellin and two-sided Laplace transforms
• Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation
• Development of non-linear transformations for improving convergence of sequences
• Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
• What is the Laplace Transform?
• On a Device for Computing the e m (S n ) Transformation
• Unnamed Item
• Unnamed Item