A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids
From MaRDI portal
Publication:5741066
DOI10.1137/15M1023853zbMath1342.65088OpenAlexW2480289783MaRDI QIDQ5741066
Publication date: 21 July 2016
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1023853
Numerical interpolation (65D05) Numerical methods for discrete and fast Fourier transforms (65T50) Algorithms for approximation of functions (65D15)
Related Items (15)
Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data ⋮ Polynomial mapped bases: theory and applications ⋮ The Gibbs-Wilbraham phenomenon in the approximation of \(| x |\) by using Lagrange interpolation on the Chebyshev-Lobatto nodal systems ⋮ Padua points and fake nodes for polynomial approximation: old, new and open problems ⋮ Multivariate approximation at fake nodes ⋮ On Kosloff Tal-Ezer least-squares quadrature formulas ⋮ More properties of \((\beta,\gamma)\)-Chebyshev functions and points ⋮ Linear Barycentric Rational Interpolation with Guaranteed Degree of Exactness ⋮ Fast and stable approximation of analytic functions from equispaced samples via polynomial frames ⋮ Subperiodic Trigonometric Hyperinterpolation ⋮ Stable extrapolation of analytic functions ⋮ On \((\beta,\gamma)\)-Chebyshev functions and points of the interval ⋮ Polynomial interpolation via mapped bases without resampling ⋮ Stable discontinuous mapped bases: the Gibbs-Runge-avoiding stable polynomial approximation (GRASPA) method ⋮ Mapped polynomials and discontinuous kernels for Runge and Gibbs phenomena
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the numerical stability of Fourier extensions
- Nonperiodic trigonometric polynomial approximation
- Bounds for polynomials with a unit discrete norm
- Multivariate modified Fourier series and application to boundary value problems
- Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
- On the Gibbs phenomenon. I: Recovering exponential accuracy from the Fourier partial sum of a nonperiodic analytic function
- A modified Chebyshev pseudospectral method with an \(O(N^{-1})\) time step restriction
- A note on fast Fourier transforms for nonequispaced grids
- Fast Fourier transforms for nonequispaced data. II
- Evaluation of Chebyshev pseudospectral methods for third order differential equations
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- Optimal Gegenbauer quadrature over arbitrary integration nodes
- Approximation properties of a mapped Chebyshev method
- Univariate modified Fourier methods for second order boundary value problems
- Barycentric rational interpolation with no poles and high rates of approximation
- Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
- On the resolution power of Fourier extensions for oscillatory functions
- A Windowed Fourier Method for Approximation of Non-periodic Functions on Equispaced Nodes
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- New Quadrature Formulas from Conformal Maps
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- The Growth of Polynomials Bounded at Equally Spaced Points
- Fast Fourier Transforms for Nonequispaced Data
- On the Gibbs Phenomenon and Its Resolution
- Accuracy Enhancement for Higher Derivatives using Chebyshev Collocation and a Mapping Technique
- Nonuniform fast fourier transforms using min-max interpolation
- Spectral Methods
This page was built for publication: A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids
