Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
From MaRDI portal
Recommendations
Cites work
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- A fast algorithm for Fourier continuation
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- A modified Chebyshev pseudospectral method with an \(O(N^{-1})\) time step restriction
- A spectral embedding method applied to the advection-diffusion equation
- A stability barrier for reconstructions from Fourier samples
- Accuracy Enhancement for Higher Derivatives using Chebyshev Collocation and a Mapping Technique
- Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
- An introduction to frames and Riesz bases
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Approximation theory and approximation practice
- Dictionary of inequalities
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. I: Single-interval schemes
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- Frames and numerical approximation
- Frames and numerical approximation. II: Generalized sampling
- Function approximation on arbitrary domains using Fourier extension frames
- Generalized sampling and the stable and accurate reconstruction of piecewise analytic functions from their Fourier coefficients
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 43996 (Why is no real title available?)
- scientific article; zbMATH DE number 3640828 (Why is no real title available?)
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- Multivariate approximation
- New Quadrature Formulas from Conformal Maps
- On approximate recovery of functions with bounded mixed derivative
- On some inequalities of S. Bernstein and W. Markoff for derivatives of polynomials
- On the Fourier Extension of Nonperiodic Functions
- On the numerical stability of Fourier extensions
- On the resolution power of Fourier extensions for oscillatory functions
- Optimal sampling rates for approximating analytic functions from pointwise samples
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
- Pointwise and uniform convergence of Fourier extensions
- Sparse Polynomial Approximation of High-Dimensional Functions
- Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon
- The AZ algorithm for least squares systems with a known incomplete generalized inverse
- The Fourier extension method and discrete orthogonal polynomials on an arc of the circle
- The Growth of Polynomials Bounded at Equally Spaced Points
Cited in
(7)- AAA interpolation of equispaced data
- Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
- Oversampled collocation approximation method of functions via Jacobi frames
- Stable and accurate least squares radial basis function approximations on bounded domains
- Optimal sampling for least-squares approximation
- Stability of least squares approximation under random sampling
- Convergence and near-optimal sampling for multivariate function approximations in irregular domains via Vandermonde with Arnoldi
This page was built for publication: Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2700866)
