A comparison of two methods for accelerating the convergence of Fourier series
From MaRDI portal
accelerating slowly convergent Fourier seriescomparison of methodsepsilon algorithmnumerical inversion of Laplace transformssummation by parts
Convergence and absolute convergence of Fourier and trigonometric series (42A20) Laplace transform (44A10) Extrapolation to the limit, deferred corrections (65B05) Numerical summation of series (65B10) Numerical methods for integral transforms (65R10) Numerical methods for trigonometric approximation and interpolation (65T40)
Cites work
- Development of non-linear transformations for improving convergence of sequences
- scientific article; zbMATH DE number 3418028 (Why is no real title available?)
- scientific article; zbMATH DE number 3081880 (Why is no real title available?)
- Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
- Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation
- Numerical inversion of Mellin and two-sided Laplace transforms
- On a Device for Computing the e m (S n ) Transformation
- What is the Laplace Transform?
Cited in
(6)- 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
- A Levin-type algorithm for accelerating the convergence of Fourier series
- Computing the action of the matrix generating function of Bernoulli polynomials on a vector with an application to non-local boundary value problems
This page was built for publication: A comparison of two methods for accelerating the convergence of Fourier series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1155321)
