Big Prime Field FFT on Multi-core Processors

DOI10.1145/3326229.3326273MaRDI QIDQ5120481zbMATH OpenOpenAlexWikidataFDO

Authors Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza, Linxiao Wang

Publication date 10 September 2020

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

Full work available at URL https://hal.inria.fr/hal-02191652/file/cmmw-2019.ISSAC.sigconf.pdf

zbMATH Keywords

fast Fourier transformsfinite fieldsgeneralized Fermat numbersIntel CilkPlusmulti-core processorsspecialized arithmetic

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel algorithms in computer science (68W10)

Recommendations

• Big prime field FFT on the GPU
• Multiprocessor FFTs
• Further Symmetries of in-Place FFTs
• scientific article; zbMATH DE number 1131691
• scientific article; zbMATH DE number 991433
• scientific article; zbMATH DE number 3976283
• Publication:4860111

Cited in

(4)

• Employing C++ templates in the design of a computer algebra library
• Big prime field FFT on the GPU
• Design and implementation of multi-threaded algorithms in polynomial algebra
• Computational schemes for subresultant chains

This page was built for publication: Big Prime Field FFT on Multi-core Processors

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