多项式与快速傅立叶变换.pdfVIP

Polynomial and FFT Yu Jiangsheng Institute of Computational Linguistics Peking University November 18, 2002 Topics 1. Problem 2. Representation of polynomials 3. The DFT and FFT 4. Efficient FFT implementations 5. Conclusion 1 Problem Definition 1 A polynomial in variable x over a field F (such as, R or C) is n−1 A(x) = a xj (1) j j =0 where aj ∈ F is called a coefficient. Problem 1 The straightforward method of polynomial multiplication is Θ(n2), where n is the degree of polynomials. While the Fast Fourier Transform (FFT) can reduce the time to Θ(n log n). 2 Representation of Polynomials Definition 2 For the polynomial (1), we have two ways of representing it: Coefficient Representation: a = (a0 , a1, · · · , an−1) is a coefficient rep- resentation of (1). Point-value Representation: P = {(x0, y0), (x1, y1), · · · , (xn−1, yn−1)} is a point-value representation of (1), where all of the xk are distinct and yk = A(xk), k = 0, 1, · · · , n − 1. 3 Coefficient Representation Property 1 Evaluating the polynomial (1) at a given point x0 by Horner’s Rule: A(x ) = a + x (a + x (a + · · · + x (a + x a ))) 0 0 0 1 0