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

DOI10.1016/0898-1221(81)90036-5zbMath0466.65002OpenAlexW2088374058MaRDI 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 methodsepsilon algorithmsummation by partsnumerical inversion of Laplace transformsaccelerating slowly convergent Fourier series

Mathematics Subject Classification ID

Extrapolation to the limit, deferred corrections (65B05) Laplace transform (44A10) Numerical methods for integral transforms (65R10) Numerical methods for trigonometric approximation and interpolation (65T40) Convergence and absolute convergence of Fourier and trigonometric series (42A20) Numerical summation of series (65B10)

Related Items (5)

The Fourier-series method for inverting transforms of probability distributions ⋮ A Levin-type algorithm for accelerating the convergence of Fourier series ⋮ 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

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A comparison of two methods for accelerating the convergence of Fourier series