From an approximate to an exact absolute polynomial factorization

• Autores: Guillaume Chèze, André Galligo
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 41, Nº 6, 2006, págs. 682-696
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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 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.