Joris van der Hoeven
ABSTRACT
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminating the "jumps" in the complexity at powers of two. When applied to the multiplication of multivariate polynomials or truncated multivariate power series, we gain a logarithmic factor with respect to the best previously known algorithms.
- Bernstein, D. Fast multiplication and its applications. Available from http://cr.yp.to/papers.html#multapps|. See section 4, page 11.Google Scholar
- Canny, J., Kaltofen, E., and Lakshman, Y. Solving systems of non-linear polynomial equations faster. In Proc. ISSAC '89 Portland, Oregon, A.C.M., New York, 1989, ACM Press, pp. 121--128. Google ScholarDigital Library
- Cantor, D., and Kaltofen, E. On fast multiplication of polynomials over arbitrary algebras. Acta Informatica 28 (1991), 693--701. Google ScholarDigital Library
- Cooley, J., and Tukey, J. An algorithm for the machine calculation of complex Fourier series. Math. Computat. 19 (1965), 297--301.Google ScholarCross Ref
- Hanrot, G., Quercia, M., and Zimmermann, P. Speeding up the division and square root of power series. Research Report 3973, INRIA, July 2000. Available from http://www.inria.fr/RRRT/RR-3973.html.Google Scholar
- Hanrot, G., Quercia, M., and Zimmermann, P. The middle product algorithm I. speeding up the division and square root of power series. Accepted for publication in AAECC, 2002. Google ScholarDigital Library
- Hanrot, G., and Zimmermann, P. A long note on Mulders' short product. JSC 37, 3 (2004), 391--401. Google ScholarDigital Library
- Lecerf, G., and Schost, E. Fast multivariate power series multiplication in characteristic zero. SADIO Electronic Journal on Informatics and Operations Research 5, 1 (September 2003), 1--10.Google Scholar
- Mulders, T. On short multiplication and division. AAECC 11, 1 (2000), 69--88.Google ScholarCross Ref
- Pan, V. Y. Simple multivariate polynomial multiplication. JSC 18, 3 (1994), 183--186. Google ScholarDigital Library
- Schönhage, A., and Strassen, V. Schnelle Multiplikation grosser Zahlen. Computing 7 7 (1971), 281--292.Google ScholarCross Ref
- van der Hoeven, J. Lazy multiplication of formal power series. In Proc. ISSAC '97 (Maui, Hawaii, July 1997), W. W. Kuchlin, Ed., pp. 17--20. Google ScholarDigital Library
- van der Hoeven, J. Relax, but don't be too lazy. JSC 34 (2002), 479--542. Google ScholarDigital Library
- van der Hoeven, J. New algorithms for relaxed multiplication. Tech. Rep. 2003-44, Univ. d'Orsay, 2003.Google Scholar
- van der Hoeven, J. Relaxed multiplication using the middle product. In Proc. ISSAC '03 Philadelphia, USA, August 2003, M. Bronstein, Ed., pp. 143--147. Google ScholarDigital Library
Recommendations
An in-place truncated fourier transform and applications to polynomial multiplication
ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic ComputationThe truncated Fourier transform (TFT) was introduced by van der Hoeven in 2004 as a means of smoothing the "jumps" in running time of the ordinary FFT algorithm that occur at power-of-two input sizes. However, the TFT still introduces these jumps in ...
A New Formulation of the Fast Fractional Fourier Transform
By using a spectral approach, we derive a Gaussian-like quadrature of the continuous fractional Fourier transform. The quadrature is obtained from a bilinear form of eigenvectors of the matrix associated to the recurrence equation of the Hermite ...
Algorithm 338: algol procedures for the fast Fourier transform
The following procedures are based on the Cooley-Tukey algorithm [1] for computing the finite Fourier transform of a complex data vector; the dimension of the data vector is assumed here to be a power of two. Procedure COMPLEXTRANSFORM computes either ...
Comments