A new method for Chebyshev polynomial interpolation based on cosine transforms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1382382 (Why is no real title available?)
- scientific article; zbMATH DE number 3733846 (Why is no real title available?)
- scientific article; zbMATH DE number 48633 (Why is no real title available?)
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 486633 (Why is no real title available?)
- scientific article; zbMATH DE number 1099343 (Why is no real title available?)
- scientific article; zbMATH DE number 762608 (Why is no real title available?)
- scientific article; zbMATH DE number 3245839 (Why is no real title available?)
- A New Method for Chebyshev Approximation of Complex-Valued Functions
- A stability barrier for reconstructions from Fourier samples
- A two-dimensional nonuniform sampling expansion model
- Adaptive Polynomial Interpolation on Evenly Spaced Meshes
- Algebraic Signal Processing Theory: 1-D Space
- Algebraic Signal Processing Theory: Foundation and 1-D Time
- Approximation theory and approximation practice
- Chebyshev approximation by exponential-power expression
- Chebyshev nonuniform sampling cascaded with the discrete cosine transform for optimum interpolation
- Chebyshev's approximation algorithms and applications
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- Finite element computation and analysis on complex contact boundary
- Interpolation and approximation with splines and fractals
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Sparse polynomial interpolation in Chebyshev bases
- The Discrete Cosine Transform
- Two-dimensional polynomial interpolation from nonuniform samples
Cited in
(1)
This page was built for publication: A new method for Chebyshev polynomial interpolation based on cosine transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q308050)