A new method for Chebyshev polynomial interpolation based on cosine transforms
DOI10.1007/s00034-015-0087-4zbMath1346.94010OpenAlexW601330049MaRDI QIDQ308050
Bing-Zhao Li, Yan-Li Zhang, Xian Wang, Qi-Yuan Cheng
Publication date: 5 September 2016
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-015-0087-4
error analysisChebyshev polynomialdiscrete cosine transformcoefficientspolynomial interpolationChebyshev nonuniform sampling
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for trigonometric approximation and interpolation (65T40) Application of orthogonal and other special functions (94A11)
Cites Work
- Chebyshev approximation by exponential-power expression
- A two-dimensional nonuniform sampling expansion model
- Sparse polynomial interpolation in Chebyshev bases
- Chebyshev nonuniform sampling cascaded with the discrete cosine transform for optimum interpolation
- A New Method for Chebyshev Approximation of Complex-Valued Functions
- Two-dimensional polynomial interpolation from nonuniform samples
- The Discrete Cosine Transform
- Algebraic Signal Processing Theory: Foundation and 1-D Time
- Algebraic Signal Processing Theory: 1-D Space
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- A Stability Barrier for Reconstructions from Fourier Samples
- Adaptive Polynomial Interpolation on Evenly Spaced Meshes
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Chebyshev's approximation algorithms and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new method for Chebyshev polynomial interpolation based on cosine transforms