Automatic computation of the complete root classification for a parametric polynomial
From MaRDI portal
Publication:840716
DOI10.1016/j.jsc.2009.05.003zbMath1186.12003OpenAlexW2145025251MaRDI QIDQ840716
Songxin Liang, David 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
real rootcomplete root classificationparametric polynomialreal quantifier eliminationsubresultant polynomial
Related Items (3)
Classification of minimum global embeddings for nonrotating black holes ⋮ Real root classification of parametric spline functions ⋮ Stability analysis of delayed food chain systems with heterogeneous free parameters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete discrimination system for polynomials
- Solution of a hydrodynamic lubrication problem with Maple
- Geometric reasoning with logic and algebra
- Real quantifier elimination is doubly exponential
- A complete discrimination system for polynomials with complex coefficients and its automatic generation
- New structure theorem for subresultants
- Recent advances on determining the number of real roots of parametric polynomials
- Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
- On the Theoretical and Practical Complexity of the Existential Theory of Reals
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- Computing real zeros of polynomials with parametric coefficients
- QEPCAD B
- An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
- Subresultants and Reduced Polynomial Remainder Sequences
- Algorithms in real algebraic geometry
- Sylvester-Habicht sequences and fast Cauchy index computation
This page was built for publication: Automatic computation of the complete root classification for a parametric polynomial
