From an approximate to an exact absolute polynomial factorization

We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebraic integers over Z and is certified. It relies on a study of the perturbations in a Vandermonde system. We provide a sufficient condition on the precision of the approximate factors, depending only on the height and the degree of the polynomial. c 2005 Elsevier Ltd. All rights reserved.

• Type: Journal
• Year: 2006
• Where: JSC
• Authors: Guillaume Chèze, André Galligo
• Keywords: Algorithm, Bivariate Polynomial, Exact Absolute Factorization, JSC 2006