Asymptotically fast algorithms for the numerical muitiplication and division of polynomials with complex coefficients
Multiplication of univariate n-th degree polynomials over ℂ by straight application of FFT's carried out numerically in ℓ-bit precision will require time O(n log n ψ(ℓ)), where ψ(m) bounds the time for multiplication of m-bit integers, e.g. ψ(m) = cm for pointer machines or ψ(m) = cm·log(m+1)·log log(m+2) for multitape Turing machines. Here a new method is presented, based upon long integer multiplication, by which even faster algorithms can be obtained. Under reasonable assumptions (like ℓ≥log(n+1), and on the coefficient size) polynomial multiplication and discrete Fourier transforms of length n and in ℓ-bit precision are possible in time O(ψ (nℓ)), and division of polynomials in O(ψ(n(ℓ+n))). Included is also a new version of integer multiplication mod(2N+1).
KeywordsDiscrete Fourier Transform Algebraic Model Polynomial Multiplication Complex Coefficient Integer Multiplication
Unable to display preview. Download preview PDF.
- A. Borodin, I. Munro: The computational complexity of algebraic and numeric problems. New York, American Elsevier, 1975.Google Scholar
- D. E. Knuth: The art of computer programming, vol. 2: Seminumerical algorithms. 2nd edition; Reading, Mass. 1981.Google Scholar
- A. Schönhage, V. Strassen: Schnelle Multiplikation großer Zahlen. Computing 7, 281–292 (1971).Google Scholar
- M. Sieveking: An algorithm for division of power series. Computing 10, 153–156 (1972).Google Scholar