An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
From MaRDI portal
Publication:5302906
DOI10.1007/11856290_12zbMath1156.68632OpenAlexW2125046550MaRDI QIDQ5302906
Songxin Liang, David J. Jeffrey
Publication date: 15 January 2009
Published in: Artificial Intelligence and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11856290_12
Related Items
Automatic computation of the complete root classification for a parametric polynomial ⋮ Real polynomial iterative roots in the case of nonmonotonicity height \(\geqslant 2\) ⋮ A condition for multiplicity structure of univariate polynomials ⋮ Classification of the real roots of the quartic equation and their Pythagorean tunes
Uses Software