The truncated fourier transform and applications

DOI10.1145/1005285.1005327MaRDI QIDQ4657338zbMATH OpenOpenAlexFDO

Authors Joris van der Hoeven

Publication date 14 March 2005

Published in Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.3872

zbMATH Keywords

algorithmsfast Fourier transformmultivariate polynomialsjump phenomenonmultivariate power seriesFFT-multiplicationtruncated multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• The truncated Fourier transform for mixed radices
• A new truncated Fourier transform algorithm
• Convolutions, Fourier trigonometric transforms and applications
• An in-place truncated Fourier transform
• The truncated Fourier operator. General results
• The Fractional Fourier Transform and Applications
• A Generalized Fourier Transform and Its Applications
• scientific article; zbMATH DE number 1549707
• scientific article; zbMATH DE number 726514

Cited in

(35)

• Structured FFT and TFT: symmetric and lattice polynomials
• A simple and fast online power series multiplication and its analysis
• An in-place truncated Fourier transform and applications to polynomial multiplication
• On the complexity of multivariate polynomial division
• Multiplication
• Computing characteristic polynomials of matrices of structured polynomials
• scientific article; zbMATH DE number 2151179 (Why is no real title available?)
• Faster Multiplication in GF(2)[x]
• The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
• A simple and fast algorithm for computing exponentials of power series
• Faster truncated integer multiplication
• A cache-friendly truncated FFT
• Faster algorithms for the square root and reciprocal of power series
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
• Fast convolutions meet Montgomery
• Fast Hermite interpolation and evaluation over finite fields of characteristic two
• Homotopy techniques for multiplication modulo triangular sets
• Newton's method and FFT trading
• Irregular primes to 163 million
• Irregular primes to two billion
• Improved dense multivariate polynomial factorization algorithms
• Fast multivariate multi-point evaluation revisited
• High detail stationary optimization models for gas networks
• Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform
• An in-place truncated Fourier transform
• A new truncated Fourier transform algorithm
• On the complexity of integer matrix multiplication
• Fast transforms over finite fields of characteristic two
• The truncated Fourier transform for mixed radices
• Multi-point evaluation in higher dimensions
• Fast arithmetic for triangular sets: from theory to practice
• On fast multiplication of polynomials, the Fourier and Hartley transforms
• Computing clipped products
• Faster polynomial multiplication via multipoint Kronecker substitution
• scientific article; zbMATH DE number 5557637 (Why is no real title available?)

This page was built for publication: The truncated fourier transform and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657338)