Oversampled collocation approximation method of functions via Jacobi frames
From MaRDI portal
Publication:6497449
DOI10.4208/AAMM.OA-2022-0071MaRDI QIDQ6497449FDOQ6497449
Authors: Xianru Chen, Li Lin
Publication date: 6 May 2024
Published in: Advances in Applied Mathematics and Mechanics (Search for Journal in Brave)
Approximation by polynomials (41A10) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Rate of convergence, degree of approximation (41A25)
Cites Work
- Spectral methods. Algorithms, analysis and applications.
- Spectral Methods for Time-Dependent Problems
- Spectral Methods
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. I: Single-interval schemes
- An introduction to frames and Riesz bases
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- The Growth of Polynomials Bounded at Equally Spaced Points
- A fast algorithm for Fourier continuation
- On the numerical stability of Fourier extensions
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- Function approximation on arbitrary domains using Fourier extension frames
- Frames and numerical approximation
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Frames and numerical approximation. II: Generalized sampling
- Optimal sampling rates for approximating analytic functions from pointwise samples
This page was built for publication: Oversampled collocation approximation method of functions via Jacobi frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6497449)