The truncated fourier transform and applications
From MaRDI portal
Publication:4657338
DOI10.1145/1005285.1005327zbMath1064.65158MaRDI QIDQ4657338
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
algorithms; fast Fourier transform; multivariate polynomials; jump phenomenon; multivariate power series; FFT-multiplication; truncated multiplication
68Q25: Analysis of algorithms and problem complexity
65T50: Numerical methods for discrete and fast Fourier transforms
Related Items
On the Complexity of Multivariate Polynomial Division, Unnamed Item, Unnamed Item, Irregular primes to two billion, Faster Multiplication in GF(2)[x], Fast convolutions meet Montgomery, A simple and fast online power series multiplication and its analysis, The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}, Homotopy techniques for multiplication modulo triangular sets, Faster polynomial multiplication via multipoint Kronecker substitution, Newton's method and FFT trading, A simple and fast algorithm for computing exponentials of power series, Fast arithmetic for triangular sets: from theory to practice, A cache-friendly truncated FFT, On the complexity of integer matrix multiplication, Multi-point evaluation in higher dimensions, An in-place truncated Fourier transform, Fast transforms over finite fields of characteristic two, Fast multivariate multi-point evaluation revisited, Fast Hermite interpolation and evaluation over finite fields of characteristic two, High detail stationary optimization models for gas networks, Improved dense multivariate polynomial factorization algorithms, Computing Characteristic Polynomials of Matrices of Structured Polynomials, Faster algorithms for the square root and reciprocal of power series, Irregular primes to 163 million
