A fast algorithm for the evaluation of Legendre expansions
SIAM Journal on Scientific and Statistical Computing
Some perspectives on the eigenvalue problem
SIAM Review
Fast algorithms for discrete polynomial transforms
Mathematics of Computation
CMV matrices: Five years after
Journal of Computational and Applied Mathematics
A First Course in the Numerical Analysis of Differential Equations
A First Course in the Numerical Analysis of Differential Equations
Practical Extrapolation Methods: Theory and Applications
Practical Extrapolation Methods: Theory and Applications
A fast and simple algorithm for the computation of Legendre coefficients
Numerische Mathematik
Hi-index | 0.00 |
A recently introduced fast algorithm for the computation of the first N terms in an expansion of an analytic function into ultraspherical polynomials consists of three steps: Firstly, each expansion coefficient is represented as a linear combination of derivatives; secondly, it is represented, using the Cauchy integral formula, as a contour integral of the function multiplied by a kernel; finally, the integrand is transformed to accelerate the convergence of the Taylor expansion of the kernel, allowing for rapid computation using Fast Fourier Transform. In the current paper we demonstrate that the first two steps remain valid in the general setting of orthogonal polynomials on the real line with finite support, orthogonal polynomials on the unit circle and Laurent orthogonal polynomials on the unit circle.