The truncated fourier transform and applications

Authors:
Joris van der Hoeven
Affiliations:
Université Paris-Sud, France
Venue:
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Year:
2004

Citing 8
Cited 25

Solving systems of nonlinear polynomial equations faster

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
Simple multivariate polynomial multiplication

Journal of Symbolic Computation
Lazy multiplication of formal power series

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Relax, but don't be too lazy

Journal of Symbolic Computation
Relaxed mltiplication using the middle product

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
The Middle Product Algorithm I

Applicable Algebra in Engineering, Communication and Computing
A long note on Mulders' short product

Journal of Symbolic Computation

Multivariate power series multiplication

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Implementation techniques for fast polynomial arithmetic in a high-level programming environment

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Improved dense multivariate polynomial factorization algorithms

Journal of Symbolic Computation
A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Multithreaded parallel implementation of arithmetic operations modulo a triangular set

Proceedings of the 2007 international workshop on Parallel symbolic computation
On the Virtues of Generic Programming for Symbolic Computation

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Fast arithmetic for triangular sets: From theory to practice

Journal of Symbolic Computation
A simple and fast algorithm for computing exponentials of power series

Information Processing Letters
A cache-friendly truncated FFT

Theoretical Computer Science
Faster polynomial multiplication via multipoint Kronecker substitution

Journal of Symbolic Computation
Computations modulo regular chains

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Space- and time-efficient polynomial multiplication

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Optimized sinusoid synthesis via inverse truncated fourier transform

IEEE Transactions on Audio, Speech, and Language Processing
Faster multiplication in GF(2)[x]

ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Newton's method and FFT trading

Journal of Symbolic Computation
Balanced dense polynomial multiplication on multi-cores

ACM Communications in Computer Algebra
An in-place truncated fourier transform and applications to polynomial multiplication

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
The modpn library: Bringing fast polynomial arithmetic into Maple

Journal of Symbolic Computation
Fast fourier transforms over poor fields

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Homotopy techniques for multiplication modulo triangular sets

Journal of Symbolic Computation
FFT-based dense polynomial arithmetic on multi-cores

HPCS'09 Proceedings of the 23rd international conference on High Performance Computing Systems and Applications
On the bit-complexity of sparse polynomial and series multiplication

Journal of Symbolic Computation
On the complexity of multivariate blockwise polynomial multiplication

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Structured FFT and TFT: symmetric and lattice polynomials

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
A new truncated fourier transform algorithm

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

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.