An Algorithm Based on the FFT for a Generalized Chebyshev Interpolation
In the quadrature method of \textit{C. W. Clenshaw} and \textit{A. R. Curtis} (C-C) [Numer. Math. 2, 197-205 (1960; Zbl 0093.140)] the integrand f(t) is interpolated with a sequence of the truncated Chebyshev series, \(p_ N(t)=\sum^{N}_{k=0}a^ N_ kT_ k(t)\). In order to reduce the cost of using a cosine transformation to compute the \(a^ N_ k\), \textit{W. M. Gentleman} (G) [Commun. ACM. 15, 337-346 (1972; Zbl 0234.65024)] incorporated in the program the fast Fourier transformation (FFT). \textit{M. Branders} and \textit{R. Piessens} (B-P) [J. Comput. Appl. Math. 1, 55-65 (1975; Zbl 0303.65020)] extended the method C-C to integrands K(t)f(t) where K(t) is a singular function. The present paper extends the methods G and B-P by an algorithm for recursively generating a sequence of \(p_ N(t)\) which allows an increase of N more moderate than doubling it at each step; it also uses the FFT. Numerical comparison with G and B-P is given.
- Application of a modified FFT to product type integration
- scientific article; zbMATH DE number 1805995
- A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
- scientific article; zbMATH DE number 4011763
- A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
- Uniform approximation to fractional derivatives of functions of algebraic singularity
- Exponentially convergent Fourier-Chebyshev quadrature schemes on bounded and infinite intervals
- Application of a modified FFT to product type integration
- A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
- Hilbert and Hadamard transforms by generalized Chebyshev expansion
- Numerical integration of functions with poles near the interval of integration
- Uniform approximations to finite Hilbert transform and its derivative.
- An embedded formula of the Chebyshev collocation method for stiff problems
- On fast and stable implementation of Clenshaw-Curtis and Fejér-type quadrature rules
- A simple, efficient and more reliable scheme for automatic numerical integration
- Quadrature rule for indefinite integral of algebraic-logarithmic singular integrands
- A method for indefinite integration of oscillatory and singular functions
- An automatic integration procedure for infinite range integrals involving oscillatory kernels
- A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
- scientific article; zbMATH DE number 1805995 (Why is no real title available?)
- A practical algorithm for computing Cauchy principal value integrals of oscillatory functions
- scientific article; zbMATH DE number 6841216 (Why is no real title available?)
- An Algorithm for Nondominant Solutions of Linear Second-Order Inhomogeneous Difference Equations
- Positivity of the Weights of Extended Clenshaw-Curtis Quadrature Rules
- Approximating Cauchy-type singular integral by an automatic quadrature scheme
- An algorithm for interpolation at real frequencies with a minimal reactance function by the discrete Chebyshev approximation method
- A quadrature rule of interpolatory type for Cauchy integrals
- A quadrature rule for weighted Cauchy integrals
- A trigonometric quadrature rule for Cauchy integrals with Jacobi weight
- A Chebyshev quadrature rule for one sided finite part integrals
- An approximation method for high-order fractional derivatives of algebraically singular functions
- An error embedded method based on generalized Chebyshev polynomials
- Quadrature rule for Abel's equations: Uniformly approximating fractional derivatives
- On the convergence of the method for indefinite integration of oscillatory and singular functions
This page was built for publication: An Algorithm Based on the FFT for a Generalized Chebyshev Interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4203686)