A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
DOI10.1090/S0025-5718-2011-02484-1zbMath1228.65017OpenAlexW2009904684MaRDI QIDQ3094285
Sugiura, Hiroshi, Takemitsu Hasegawa
Publication date: 24 October 2011
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02484-1
computational complexityerror estimatefast algorithmChebyshev nodesChebyshev interpolationchinese remainder theoremfast Fourier transform (FFT)quasi-Chebyshev nodes
Numerical interpolation (65D05) Numerical methods for discrete and fast Fourier transforms (65T50) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Complexity and performance of numerical algorithms (65Y20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Product integration with the Clenshaw-Curtis points: Implementation and error estimates
- A method for numerical integration on an automatic computer
- Fast Fourier transform and convolution algorithms
- An extension of Clenshaw-Curtis quadrature
- Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
- The kink phenomenon in Fejér and Clenshaw-Curtis quadrature
- Fast construction of the Fejér and Clenshaw-Curtis quadrature rules
- Chebfun: A New Kind of Numerical Computing
- Generalized Chebyshev Interpolation and Its Application to Automatic Quadrature
- Polynomial Interpolation on Quasi-Equidistributed Nodes on the Unit Disk
- An Algorithm Based on the FFT for a Generalized Chebyshev Interpolation
- Fast algorithms for discrete polynomial transforms
- Barycentric Lagrange Interpolation
- An Extension of MATLAB to Continuous Functions and Operators
- Symmetric FFTs
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Implementing Clenshaw-Curtis quadrature, I methodology and experience
- The Accuracy of the Chebyshev Differencing Method for Analytic Functions
This page was built for publication: A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
