The Frobenius FFT

DOI10.1145/3087604.3087633MaRDI QIDQ5119972zbMATH OpenOpenAlexFDO

Authors Joris van der Hoeven, Robin Larrieu

Publication date 9 September 2020

Published in Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3087604.3087633

zbMATH Keywords

complexity boundFFTfinite fieldFrobenius automorphism

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Frobenius additive fast Fourier transform
• Fast Fourier transforms over poor fields
• Conformal mappings between canonical multiply connected domains
• A method for fast computation of the Fourier transform over a finite field
• On arithmetical algorithms over finite fields

Cited in

(10)

• Panjer recursion versus FFT for compound distributions
• Conformal mappings between canonical multiply connected domains
• scientific article; zbMATH DE number 89728 (Why is no real title available?)
• An improved FFT-based version of Ramaswami's formula
• Fibonacci Spectral Transforms: Calculation, Algorithms and Circuit Realizations
• Finite Fourier transforms computed by a modified Filon-Euler-Maclaurin method
• Frobenius additive fast Fourier transform
• Multiplication
• FFT Implementation with Fused Floating-Point Operations
• Sparse polynomial interpolation: faster strategies over finite fields

This page was built for publication: The Frobenius FFT

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