Automatic computation of the complete root classification for a parametric polynomial

DOI10.1016/J.JSC.2009.05.003MaRDI QIDQ840716zbMATH OpenOpenAlexFDO

Authors Songxin Liang, D. J. Jeffrey

Publication date 14 September 2009

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2009.05.003

zbMATH Keywords

complete root classificationparametric polynomialreal quantifier eliminationreal rootsubresultant polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
• The complete root classification of a parametric polynomial on an interval
• A complete discrimination system for polynomials with complex coefficients and its automatic generation
• scientific article; zbMATH DE number 1226305
• scientific article; zbMATH DE number 1263360
• Generating approximate parametric roots of parametric polynomials
• scientific article; zbMATH DE number 2015305
• On the automatizability of polynomial calculus
• Computation of all polynomial solutions of a class of nonlinear differential equations
• An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system

Cites work

• A complete discrimination system for polynomials
• A complete discrimination system for polynomials with complex coefficients and its automatic generation
• Algorithms in real algebraic geometry
• An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
• Computing real zeros of polynomials with parametric coefficients
• Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
• Geometric reasoning with logic and algebra
• scientific article; zbMATH DE number 1263329 (Why is no real title available?)
• scientific article; zbMATH DE number 1157660 (Why is no real title available?)
• scientific article; zbMATH DE number 1157665 (Why is no real title available?)
• Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
• New structure theorem for subresultants
• On the Theoretical and Practical Complexity of the Existential Theory of Reals
• QEPCAD B
• Real quantifier elimination is doubly exponential
• Recent advances on determining the number of real roots of parametric polynomials
• Solution of a hydrodynamic lubrication problem with Maple
• Subresultants and Reduced Polynomial Remainder Sequences
• Sylvester-Habicht sequences and fast Cauchy index computation

Cited in

(6)

• A recursive algorithm for constructing generalized Sturm sequence
• Stability analysis of delayed food chain systems with heterogeneous free parameters
• Classification of minimum global embeddings for nonrotating black holes
• The complete root classification of a parametric polynomial on an interval
• An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
• Real root classification of parametric spline functions

Describes a project that uses

Uses Software

• QEPCAD

This page was built for publication: Automatic computation of the complete root classification for a parametric polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840716)