Wednesday, April 18, 2007 - 1:30pm - 2:20pm
Grégoire Lecerf (Université Versailles/Saint Quentin-en-Yvelines)
I will present new deterministic and probabilistic
algorithms to compute the irreducible factorization of
polynomials via the classical Hensel lifting technique, and for
dense representation model. In bi-degree (dx,
dy) with dy
dx, and whatever the characteristic of the base field is,
these algorithms only require the precision of the lifting to be
dx+1. The cost of the deterministic recombination algorithm
Monday, October 23, 2006 - 3:00pm - 3:50pm
Zhonggang Zeng (Northeastern Illinois University)
This talk presents a Maple/Matlab toolbox for basic polynomial computations with exact or approximate data. The toolbox includes software for computing the approximate GCD, approximate factorization, dual basis and multiplicity identification, as well as numerical elimination in solving polynomial systems. We shall present the underlying theory of approximate polynomial algebra, the main approach of the algorithms, and computational results.
Subscribe to RSS - Polynomials