An algorithm for computing the complete root classification of a parametric polynomial

Authors:
Songxin Liang;David J. Jeffrey
Affiliations:
Department of Applied Mathematics, The University of Western Ontario, London, Ontario, Canada;Department of Applied Mathematics, The University of Western Ontario, London, Ontario, Canada
Venue:
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Year:
2006

Citing 12
Cited 2

Solving systems of polynomial inequalities in subexponential time

Journal of Symbolic Computation
Quantifier elimination: Optimal solution for two classical examples

Journal of Symbolic Computation
Geometric reasoning with logic and algebra

Artificial Intelligence - Special issue on geometric reasoning
Partial Cylindrical Algebraic Decomposition for quantifier elimination

Journal of Symbolic Computation
Quantifier elimination for real algebra—the cubic case

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Recent advances on determining the number of real roots of parametric polynomials

Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Simple CAD construction and its applications

Journal of Symbolic Computation
Polynomial Algorithms in Computer Algebra

Polynomial Algorithms in Computer Algebra
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
On Mechanical Quantifier Elimination for Elementary Algebra and Geometry: Solution of a Non-Trivial Problem

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Real solving for positive dimensional systems

Journal of Symbolic Computation
QEPCAD B: a program for computing with semi-algebraic sets using CADs

ACM SIGSAM Bulletin

The complete root classification of a parametric polynomial on an interval

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Automatic computation of the complete root classification for a parametric polynomial

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

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.