The complete root classification of a parametric polynomial on an interval

DOI10.1145/1390768.1390796MaRDI QIDQ5301622zbMATH OpenOpenAlexFDO

Authors Songxin Liang, D. J. Jeffrey, Marc Moreno Maza

Publication date 20 January 2009

Published in Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1390768.1390796

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Automatic computation of the complete root classification for a parametric polynomial
• An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
• Polynomial parametrization of nonsingular complete intersection curves
• Minimal and maximal real roots of parametric polynomials using interval analysis
• Real root classification of parametric spline functions

Cited in

(8)

• A condition for multiplicity structure of univariate polynomials
• scientific article; zbMATH DE number 1226305 (Why is no real title available?)
• An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
• Minimal and maximal real roots of parametric polynomials using interval analysis
• Parametric ``non-nested discriminants for multiplicities of univariate polynomials
• Solving parameter-dependent semi-algebraic systems
• Automatic computation of the complete root classification for a parametric polynomial
• Real root classification of parametric spline functions

This page was built for publication: The complete root classification of a parametric polynomial on an interval

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