The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
type: Item
instance of: scholarly article
title: The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
zbMATH Open document ID: 1308.65225
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Advances in Computational Mathematics
publication date: 2015-01-21T00:00:00Z
Mathematics Subject Classification ID: 65T50
zbMATH DE Number: 6388522
zbMATH Keywords: unevenly spaced data
zbMATH Keywords: Fourier continuation
zbMATH Keywords: Fourier extension
zbMATH Keywords: scattered data
zbMATH Keywords: algorithm
zbMATH Keywords: nonequispaced fast Fourier transform
zbMATH Keywords: nonperiodic multivariate data
zbMATH Keywords: numerical example
describes a project that uses: NFFT3
describes a project that uses: LSQR
describes a project that uses: QSHEP3D
describes a project that uses: NFFT
describes a project that uses: CRAIG
MaRDI profile type: Publication
full work available at URL: s10444-014-9342-7
OpenAlex ID: W2060502476
cites work: On the resolution power of Fourier extensions for oscillatory functions
cites work: On the numerical stability of Fourier extensions
cites work: A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
cites work: Scattered and track data interpolation using an efficient strip searching procedure
cites work: Rapid Computation of the Discrete Fourier Transform
cites work: On the fast Fourier transform of functions with singularities
cites work: A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
cites work: A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
cites work: Q5268582
cites work: Approximation error in regularized SVD-based Fourier continuations
cites work: Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
cites work: High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: Local hybrid approximation for scattered data fitting with bivariate splines
cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
cites work: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
cites work: Fast Fourier Transforms for Nonequispaced Data
cites work: Fast Fourier transforms for nonequispaced data. II
cites work: Nonuniform fast fourier transforms using min-max interpolation
cites work: Multistep scattered data interpolation using compactly supported radial basis functions
cites work: Smooth interpolation of large sets of scattered data
cites work: Scattered Data Interpolation: Tests of Some Method
cites work: Fast monte-carlo algorithms for finding low-rank approximations
cites work: Accelerating the Nonuniform Fast Fourier Transform
cites work: On the Fourier Extension of Nonperiodic Functions
cites work: Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
cites work: Radial basis functions for the multivariate interpolation of large scattered data sets
cites work: Randomized algorithms for the low-rank approximation of matrices
cites work: A Fast Algorithm for Fourier Continuation
cites work: Sobolev smoothing of SVD-based Fourier continuations
cites work: High-order unconditionally stable FC-AD solvers for general smooth domains. II: Elliptic, parabolic and hyperbolic PDEs; theoretical considerations
cites work: The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
cites work: Numerical stability of nonequispaced fast Fourier transforms
cites work: Multivariate interpolation of large sets of scattered data
cites work: Multi-domain Fourier-continuation/WENO hybrid solver for conservation laws
cites work: A note on fast Fourier transforms for nonequispaced grids
cites work: The Discrete Cosine Transform
cites work: Fast Approximate Fourier Transforms for Irregularly Spaced Data
cites work: A fast randomized algorithm for the approximation of matrices
DOI: 10.1007/S10444-014-9342-7
Recommended article: Q3219270
Recommended article: Fourier Analysis of Irregularly Spaced Data onRd
Recommended article: Fourier reconstruction of univariate piecewise-smooth functions from non-uniform spectral data with exponential convergence rates
Recommended article: Approximating Functions From Sampled Fourier Data Using Spline Pseudofilters
Recommended article: High-smoothness continuations for Fourier approximations of nonperiodic functions
Recommended article: Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods
Recommended article: The approximation of periodical functions of many variables with high smoothness by rectangular Fourier sums
Recommended article: Q3729533
Recommended article: Recovering Piecewise Smooth Functions from Nonuniform Fourier Measurements
Recommended article: Q2934307
description: scientific article; zbMATH DE number 6388522