A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid

DOI10.1016/0021-9991(92)90399-JzbMath0768.65001OpenAlexW1997321472WikidataQ56608064 ScholiaQ56608064MaRDI QIDQ1206566

John P. Boyd

Publication date: 1 April 1993

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(92)90399-j

zbMATH Keywords

fast Fourier transformLagrangian interpolationsummation of seriesChebyshev seriesChebyshev interpolationFourier interpolationsinc interpolationEuler sum accelerationinterpolatory sum

Mathematics Subject Classification ID

Numerical interpolation (65D05) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical summation of series (65B10)

Related Items (21)

Accurate function sinc interpolation and derivative estimations over finite intervals ⋮ A general and fast convolution-based method for peridynamics: applications to elasticity and brittle fracture ⋮ Sum-accelerated pseudospectral methods: Finite differences and sech-weighted differences ⋮ Computational methods for the dynamics of the nonlinear Schrödinger/Gross-Pitaevskii equations ⋮ The uselessness of the fast Gauss transform for summing Gaussian radial basis function series ⋮ Fast and accurate polar Fourier transform ⋮ The use of tricubic interpolation with spectral derivatives to integrate particle trajectories in complicated electromagnetic fields ⋮ A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing ⋮ An efficient spectral method for computing dynamics of rotating two-component Bose-Einstein condensates via coordinate transformation ⋮ Construction of Lighthill's unitary functions: The imbricate series of unity ⋮ An \(\mathcal O(1)\) integration scheme for three-dimensional surface scattering problems ⋮ MaxEnt power spectrum estimation using the Fourier transform for irregularly sampled data applied to a record of stellar luminosity ⋮ A Nonuniform Fast Fourier Transform Based on Low Rank Approximation ⋮ An extra-component method for evaluating fast matrix-vector multiplication with special functions ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ Direct operatorial tau method for pantograph-type equations ⋮ Multipole expansions and pseudospectral cardinal functions: A new generalization of the fast Fourier transform ⋮ An application of the interpolating scaling functions to wave packet propagation ⋮ An asymptotically hierarchy-consistent, iterative sequence transformation for convergence acceleration of Fourier series ⋮ Continuum and discrete initial-boundary value problems and Einstein's field equations ⋮ A new compact spectral scheme for turbulence simulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sum-accelerated pseudospectral methods: The Euler-accelerated sinc algorithm
• On the use of spectral methods for the numerical solution of stiff problems
• An adaptive pseudo-spectral method for reaction diffusion problems
• Multipole expansions and pseudospectral cardinal functions: A new generalization of the fast Fourier transform
• Fronts, relaxation oscillations, and period doubling in solid fuel combustion
• An adaptive pseudospectral method for discontinuous problems
• An operator-integration-factor splitting method for time-dependent problems: Application to incompressible fluid flow
• On Shape-Preserving Interpolation and Semi-Lagrangian Transport
• A Spectral Method of Characteristics for Hyperbolic Problems

This page was built for publication: A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid