Oversampled collocation approximation method of functions via Jacobi frames
From MaRDI portal
Publication:6497449
DOI10.4208/AAMM.OA-2022-0071MaRDI QIDQ6497449
Publication date: 6 May 2024
Published in: Advances in Applied Mathematics and Mechanics (Search for Journal in Brave)
Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)
Cites Work
- Unnamed Item
- On the numerical stability of Fourier extensions
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- Frames and numerical approximation. II: Generalized sampling
- Fast Algorithms for the Computation of Fourier Extensions of Arbitrary Length
- Spectral Methods
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- A Fast Algorithm for Fourier Continuation
- Spectral Methods for Time-Dependent Problems
- The Growth of Polynomials Bounded at Equally Spaced Points
- Function Approximation on Arbitrary Domains Using Fourier Extension Frames
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Frames and Numerical Approximation
- Spectral Methods
- A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids
- Optimal sampling rates for approximating analytic functions from pointwise samples
- An introduction to frames and Riesz bases
This page was built for publication: Oversampled collocation approximation method of functions via Jacobi frames