Computing one billion roots using the tangent Graeffe method

DOI10.1145/3457341.3457342zbMath1504.12001OpenAlexW3045916595MaRDI QIDQ5102031

Joris van der Hoeven, Michael B. Monagan

Publication date: 6 September 2022

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

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

zbMATH Keywords

polynomial root findingsmooth finite fieldstangent Graeffe root finding algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Numerical computation of roots of polynomial equations (65H04) Computational methods for problems pertaining to field theory (12-08)

Related Items (2)

On the computation of rational solutions of underdetermined systems over a finite field ⋮ tangent Graeffe

Uses Software

• Dagwood
• SPIRAL
• FFTW
• TeXmacs

This page was built for publication: Computing one billion roots using the tangent Graeffe method