The truncated fourier transform and applications
DOI10.1145/1005285.1005327zbMATH Open1064.65158OpenAlexW2104070031MaRDI QIDQ4657338FDOQ4657338
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
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
algorithmsfast Fourier transformmultivariate polynomialsjump phenomenonmultivariate power seriesFFT-multiplicationtruncated multiplication
Analysis of algorithms and problem complexity (68Q25) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (34)
- Fast Hermite interpolation and evaluation over finite fields of characteristic two
- Computing characteristic polynomials of matrices of structured polynomials
- Faster Multiplication in GF(2)[x]
- Faster polynomial multiplication via multipoint Kronecker substitution
- On the complexity of integer matrix multiplication
- Fast convolutions meet Montgomery
- Multi-point evaluation in higher dimensions
- A simple and fast algorithm for computing exponentials of power series
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On fast multiplication of polynomials, the Fourier and Hartley transforms
- High detail stationary optimization models for gas networks
- Newton's method and FFT trading
- A cache-friendly truncated FFT
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Faster truncated integer multiplication
- A new truncated Fourier transform algorithm
- Fast transforms over finite fields of characteristic two
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
- An in-place truncated Fourier transform
- A simple and fast online power series multiplication and its analysis
- Faster algorithms for the square root and reciprocal of power series
- Irregular primes to two billion
- Improved dense multivariate polynomial factorization algorithms
- Fast multivariate multi-point evaluation revisited
- Title not available (Why is that?)
- Computing clipped products
- Homotopy techniques for multiplication modulo triangular sets
- Irregular primes to 163 million
- Fast arithmetic for triangular sets: from theory to practice
- Structured FFT and TFT: symmetric and lattice polynomials
- An in-place truncated Fourier transform and applications to polynomial multiplication
- On the complexity of multivariate polynomial division
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)