Oversampled collocation approximation method of functions via Jacobi frames
From MaRDI portal
Recommendations
- Jacobi approximations in non-uniformly Jacobi-weighted Sobolev spaces
- Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
- Localized polynomial frames on the interval with Jacobi weights
- Frames and numerical approximation
- Optimal error estimates for Chebyshev approximations of functions with limited regularity in fractional Sobolev-type spaces
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
- An introduction to frames and Riesz bases
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- 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
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- On the numerical stability of Fourier extensions
- Optimal sampling rates for approximating analytic functions from pointwise samples
- Spectral Methods
- Spectral Methods for Time-Dependent Problems
- Spectral methods. Algorithms, analysis and applications.
- The Growth of Polynomials Bounded at Equally Spaced Points
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)
