Name
Title | ||
|---|---|---|
An algorithm for computing the complete root classification of a parametric polynomial |
Abstract | ||
|---|---|---|
The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together with the conditions its coefficients should satisfy for each case. Here an algorithm is given for the automatic computation of the complete root classification of a polynomial with complex symbolic coefficients. The application of complete root classifications to some real quantifier elimination problems is also described. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11856290_12 | AISC |
Keywords | Field | DocType |
univariate polynomial,complete root classification,real quantifier elimination problem,possible case,complex symbolic coefficient,parametric polynomial,symbolic coefficient,automatic computation,root classification,quantifier elimination,satisfiability | Quantifier elimination,Discrete mathematics,Polynomial,Symbolic computation,Algorithm,Parametric statistics,Wilkinson's polynomial,Univariate,Mathematics,Computation | Conference |
Volume | ISSN | ISBN |
4120 | 0302-9743 | 3-540-39728-0 |
Citations | PageRank | References |
2 | 0.40 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Songxin Liang | 1 | 21 | 5.09 |
| David J. Jeffrey | 2 | 1172 | 132.12 |