Improved computation of polynomial roots over number fields when using complex embeddings
Andrea Lesavourey, Thomas Plantard, Willy Susilo · Journal of Computational Algebra · 2024
We explore a fairly generic method to compute roots of polynomials over number fields through complex embeddings. Our main contribution is to show how to use a structure of a relative extension to decode in a subfield. Additionally we describe several heuristic options to improve practical efficiency. We provide experimental data from our implementation and compare our methods to the state of the art algorithm implemented in Pari/Gp .