Sum-accelerated pseudospectral methods: The Euler-accelerated sinc algorithm

DOI10.1016/0168-9274(91)90065-8MaRDI QIDQ804219zbMATH OpenOpenAlexFDO

Authors John P. Boyd

Publication date 1991

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027.42/29397

zbMATH Keywords

Euler summationsinc algorithmsinc basissum-accelerated pseudospectral methods

Mathematics Subject Classification ID

Euler-Maclaurin formula in numerical analysis (65B15) Numerical differentiation (65D25) Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35)

Review text

Pseudospectral discretizations yield a much more accurate method than the standard finite difference or finite element discretizations. The price is that the pseudospectral matrix is dense. The author shows that the Euler summation can be applied to a standard pseudospectral scheme to produce an algorithm which is both exponentially accurate and yet generates sparse matrices. For illustration, a sinc basis with an evenly spaced grid on \([-\infty,\infty]\) is used. However, this technique can also be applied to Chebyshev and Fourier polynomials.

Recommendations

• Sum-accelerated pseudospectral methods: Finite differences and sech-weighted differences
• An improved pseudospectral method for initial-boundary value problems
• scientific article; zbMATH DE number 671792
• Generation of Pseudospectral Differentiation Matrices I
• A Practical Guide to Pseudospectral Methods

Cites work

• A Sine-Collocation Method for the Computation of the Eigenvalues of the Radial Schrödinger Equation
• Acceleration of Linear and Logarithmic Convergence
• scientific article; zbMATH DE number 43996 (Why is no real title available?)
• scientific article; zbMATH DE number 1544184 (Why is no real title available?)
• scientific article; zbMATH DE number 3082267 (Why is no real title available?)
• Numerical Methods Based on Whittaker Cardinal, or Sinc Functions
• Sequence transformations and their applications
• Spectral methods for problems in complex geometries

Cited in

(13)

• Acceleration of algebraically-converging Fourier series when the coefficients have series in powers of \(1/n\)
• A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
• An asymptotically hierarchy-consistent, iterative sequence transformation for convergence acceleration of Fourier series
• A new compact spectral scheme for turbulence simulations
• Sum-accelerated pseudospectral methods: Finite differences and sech-weighted differences
• A lag-average generalization of Euler's method for accelerating series
• A proof that the discrete singular convolution (DSC)/Lagrange-distributed approximating function (LDAF) method is inferior to high order finite differences
• A Fourier error analysis for radial basis functions on an infinite uniform grid. II: Spectral-plus is special
• Augmented Lagrangian formulation of orbital-free density functional theory
• scientific article; zbMATH DE number 745262 (Why is no real title available?)
• Euler summability method of sequences of fuzzy numbers and a Tauberian theorem
• On the Convergence of the Quasi-Periodic Approximations on a Finite Interval
• Efficient spectral-element methods in polar coordinates for complex geometries with piecewise-smooth boundaries

This page was built for publication: Sum-accelerated pseudospectral methods: The Euler-accelerated sinc algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804219)