Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs

J. R. Driscoll, D. M. Healy, D. N. Rockmore
1997 SIAM journal on computing (Print)  
Let P = fP 0 ; : : : ; P n?1 g denote a set of polynomials with complex coe cients. Let Z = fz 0 ; : : : ; z n?1 g C denote any set of sample points. For any f = (f 0 ; : : : ; f n?1 ) 2 C n the discrete polynomial transform of f (with respect to P and Z) is de ned as the collection
doi:10.1137/s0097539792240121 fatcat:5c2gds4ni5fljpvwebav5cgaja