Engineering↗
Root Finding over Finite Fields
Finding roots of a polynomial in a finite field by GCD with the Frobenius polynomial followed by probabilistic splitting.
Every page in the KEVOS library tagged root finding. 2 pages.
Finding roots of a polynomial in a finite field by GCD with the Frobenius polynomial followed by probabilistic splitting.
Numerical root finding for polynomials with exact coefficients, root isolation over the reals, and the precision required to be reliable.