Higher order Euler-like methods.
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.
Laguerre-Like Methods for the Simultaneous Approximation of Polynomial Multiple Zeros
Le calcul de la racine cubique selon Héron.
More on polynomial Bézoutians with respect to a general basis.
Near solutions of polynomial equations
Note sur les relations entre les racines d’un polynôme réductible
Dans cet article, nous exploitons la réductibilité d’un polynôme d’une variable pour calculer efficacement l’idéal des relations algébriques entre ses racines.
Note sur les relations entre les racines d'un polynôme réductible
Dans cet article, nous exploitons la réductibilité d'un polynôme d'une variable pour calculer efficacement l'idéal des relations algébriques entre ses racines.
On a class of higher order methods for simultaneous rootfinding of generalized polynomials.
On convergence of Börsch-Supan's method with Weierstrass' corrections.
On searching for roots of a polynomial in a circular annulus
On the construction of explicit solutions to the matrix equation .
On the convergence of Halley-like method.
On the fourth order root finding methods of Euler's type.
On the guaranteed convergence of the Japanese zero-finding method.
On the height of the Sylvester resultant.
On the number of terms of a composite polynomial