The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
From MaRDI portal
(Redirected from Publication:489772)
Recommendations
- scientific article; zbMATH DE number 3886516
- Fourier analysis of irregularly spaced data on \(R^d\)
- Fourier reconstruction of univariate piecewise-smooth functions from non-uniform spectral data with exponential convergence rates
- Approximating Functions From Sampled Fourier Data Using Spline Pseudofilters
- High-smoothness continuations for Fourier approximations of nonperiodic functions
- Approximation of high-dimensional periodic functions with Fourier-based methods
- The approximation of periodical functions of many variables with high smoothness by rectangular Fourier sums
- scientific article; zbMATH DE number 3962408
- Recovering Piecewise Smooth Functions from Nonuniform Fourier Measurements
- The high smooth continuations for Fourier approximations of non-periodic functions
Cites work
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
- A fast algorithm for Fourier continuation
- A fast randomized algorithm for the approximation of matrices
- A note on fast Fourier transforms for nonequispaced grids
- A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
- Accelerating the Nonuniform Fast Fourier Transform
- Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Approximation error in regularized SVD-based Fourier continuations
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. I: Single-interval schemes
- Fast Approximate Fourier Transforms for Irregularly Spaced Data
- Fast Fourier Transforms for Nonequispaced Data
- Fast Fourier transforms for nonequispaced data. II
- 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
- Fast monte-carlo algorithms for finding low-rank approximations
- High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
- High-order unconditionally stable FC-AD solvers for general smooth domains. II: Elliptic, parabolic and hyperbolic PDEs; theoretical considerations
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Local hybrid approximation for scattered data fitting with bivariate splines
- Multi-domain Fourier-continuation/WENO hybrid solver for conservation laws
- Multistep scattered data interpolation using compactly supported radial basis functions
- Multivariate interpolation of large sets of scattered data
- Nonuniform fast fourier transforms using min-max interpolation
- Numerical stability of nonequispaced fast Fourier transforms
- On the Fourier Extension of Nonperiodic Functions
- On the fast Fourier transform of functions with singularities
- On the numerical stability of Fourier extensions
- On the resolution power of Fourier extensions for oscillatory functions
- Radial basis functions for the multivariate interpolation of large scattered data sets
- Randomized algorithms for the low-rank approximation of matrices
- Rapid Computation of the Discrete Fourier Transform
- Scattered Data Interpolation: Tests of Some Method
- Scattered and track data interpolation using an efficient strip searching procedure
- Smooth interpolation of large sets of scattered data
- Sobolev smoothing of SVD-based Fourier continuations
- The Discrete Cosine Transform
- The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
- Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
Cited in
(6)- An exact solution to the Fourier transform of band-limited periodic functions with nonequispaced data and application to non-periodic functions
- A Hermite extension method for numerical differentiation
- Numerical differentiation by a Fourier extension method with super-order regularization
- A fast algorithm for Fourier continuation
- Numerical differentiation for two-dimensional functions by a Fourier extension method
- On the stability of unevenly spaced samples for interpolation and quadrature
This page was built for publication: The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489772)
