Improved initialization of the accelerated and robust QR-like polynomial root-finding.
The search session has expired. Please query the service again.
Page 1
Displaying 1 – 4 of 4
Improvements on the Cantor-Zassenhaus factorization algorithm
Michele Elia, Davide Schipani (2015)
Mathematica Bohemica
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
Arnaud Bodin, Pierre Dèbes, Salah Najib (2009)
Acta Arithmetica
Iterations of concave maps, the Perron-Frobenius theory, and applications to circle packings.
Peretz, Ronen (2002)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Currently displaying 1 – 4 of 4
Page 1