Sciweavers

AISC
2006
Springer

An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial

14 years 2 months ago
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together with the conditions its coefficients should satisfy for each case. Here an algorithm is given for the automatic computation of the complete root classification of a polynomial with complex symbolic coefficients. The application of complete root classifications to some real quantifier elimination problems is also described.
Songxin Liang, David J. Jeffrey
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where AISC
Authors Songxin Liang, David J. Jeffrey
Comments (0)