The complete root classification of a parametric polynomial on an interval
DOI10.1145/1390768.1390796zbMATH Open1489.68412OpenAlexW2028993663MaRDI QIDQ5301622FDOQ5301622
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
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
Symbolic computation and algebraic computation (68W30) Quantifier elimination, model completeness, and related topics (03C10) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Cited In (7)
- An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
- A condition for multiplicity structure of univariate polynomials
- Automatic computation of the complete root classification for a parametric polynomial
- Parametric ``non-nested discriminants for multiplicities of univariate polynomials
- Real root classification of parametric spline functions
- Minimal and maximal real roots of parametric polynomials using interval analysis
- Title not available (Why is that?)
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)
