The Fourier approximation of smooth but non-periodic functions from unevenly spaced data

DOI10.1007/S10444-014-9342-7zbMath1308.65225OpenAlexW2060502476MaRDI QIDQ489772

Yong-Cai Geng, Sumit K. Garg

Publication date: 21 January 2015

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-014-9342-7

zbMATH Keywords

algorithmnumerical examplescattered datanonequispaced fast Fourier transformFourier extensionunevenly spaced dataFourier continuationnonperiodic multivariate data

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (3)

A Hermite extension method for numerical differentiation ⋮ Numerical differentiation for two-dimensional functions by a Fourier extension method ⋮ Numerical differentiation by a Fourier extension method with super-order regularization

Uses Software

• Unnamed Item
• Unnamed Item
• NFFT
• NFFT3
• CRAIG

Cites Work

• Unnamed Item
• On the numerical stability of Fourier extensions
• Multi-domain Fourier-continuation/WENO hybrid solver for conservation laws
• A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
• Scattered and track data interpolation using an efficient strip searching procedure
• Sobolev smoothing of SVD-based Fourier continuations
• Local hybrid approximation for scattered data fitting with bivariate splines
• A fast randomized algorithm for the approximation of matrices
• Numerical stability of nonequispaced fast Fourier transforms
• High-order unconditionally stable FC-AD solvers for general smooth domains. II: Elliptic, parabolic and hyperbolic PDEs; theoretical considerations
• A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
• A note on fast Fourier transforms for nonequispaced grids
• Fast Fourier transforms for nonequispaced data. II
• A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
• Radial basis functions for the multivariate interpolation of large scattered data sets
• Approximation error in regularized SVD-based Fourier continuations
• Multistep scattered data interpolation using compactly supported radial basis functions
• On the fast Fourier transform of functions with singularities
• High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
• Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
• On the resolution power of Fourier extensions for oscillatory functions
• Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
• Randomized algorithms for the low-rank approximation of matrices
• On the Fourier Extension of Nonperiodic Functions
• A Fast Algorithm for Fourier Continuation
• Multivariate interpolation of large sets of scattered data
• Smooth interpolation of large sets of scattered data
• Scattered Data Interpolation: Tests of Some Method
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• The Discrete Cosine Transform
• Fast Fourier Transforms for Nonequispaced Data
• Accelerating the Nonuniform Fast Fourier Transform
• The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
• Rapid Computation of the Discrete Fourier Transform
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Nonuniform fast fourier transforms using min-max interpolation
• Fast monte-carlo algorithms for finding low-rank approximations
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition

This page was built for publication: The Fourier approximation of smooth but non-periodic functions from unevenly spaced data