Automatic computation of the complete root classification for a parametric polynomial
The authors present an improvement of their algorithm to compute complete root classifications (CRC) of univariate polynomials with real parametric coefficients [An algorithm for computing the complete root classification of a parametric polynomial. Artificial intelligence and symbolic computation. 8th international conference, AISC 2006, Beijing, China, September 20--22, 2006. Proceedings. Berlin: Springer. Lecture Notes in Artificial Intelligence, Lecture Notes Comput. Sci. 4120, 116--130 (2006; Zbl 1156.68632)]. This improvement consists mainly on working directly with 'sign lists' rather than 'revised sign lists'. A second improvement is to simplify the set of generated conditions, by means of a test for extraneous cases (empty conditions). The authors discuss the equivalence of discriminant sequences, principal Sturm-Habicht coefficient sequences, and principal and signed subresultant coefficient sequences for CRC computations. They also review some previous algorithms by different authors and present some sparse examples.
- 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
- 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
- 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
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)
