Implementing the Tangent Graeffe Root Finding Method

DOI10.1007/978-3-030-52200-1_48zbMath1503.65097OpenAlexW4297824757MaRDI QIDQ5041082

Joris van der Hoeven, Michael B. Monagan

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-52200-1_48

Mathematics Subject Classification ID

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

Uses Software

• tangent Graeffe

Cites Work

• Deterministic root finding over finite fields using Graeffe transforms
• A new polynomial factorization algorithm and its implementation
• Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms
• Modern Computer Algebra
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Evaluating Polynomials at Fixed Sets of Points
• What Can (and Can't) we Do with Sparse Polynomials?
• An Algorithm for the Machine Calculation of Complex Fourier Series