Improved initialization of the accelerated and robust QR-like polynomial root-finding.
Improvements on the Cantor-Zassenhaus factorization algorithm
The paper presents a careful analysis of the Cantor-Zassenhaus polynomial factorization algorithm, thus obtaining tight bounds on the performances, and proposing useful improvements. In particular, a new simplified version of this algorithm is described, which entails a lower computational cost. The key point is to use linear test polynomials, which not only reduce the computational burden, but can also provide good estimates and deterministic bounds of the number of operations needed for factoring....
Indecomposable polynomials and their spectrum
Iterations of concave maps, the Perron-Frobenius theory, and applications to circle packings.