Fast algorithms for discrete polynomial transforms

Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P coincides with CN+1 := (cos jkπ N )N j,k=0. This paper presents a new fast algorithm for the computation of the matrixvector product Pa in O(N log2 N) arithmetical operations. The algorithm divides into a fast transform which replaces Pa with CN+1˜a and a subsequent fast cosine transform. The first and central part of the algorithm is realized by a straightforward cascade summation based on properties of associated polynomials and by fast polynomial multiplications. Numerical tests demonstrate that our fast polynomial transform realizes Pa with almost the same precision as the Clenshaw algorithm, but is much faster for N ≥ 128.

• Type: Journal
• Year: 1998
• Where: MOC
• Authors: Daniel Potts, Gabriele Steidl, Manfred Tasche
• Keywords: Fast Polynomial, MOC 1998, Polynomial, Three-term Recurrence Relation