An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial

An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
复制标题

DOI：
10.1007/11856290_12
复制
发表时间：
2006-09
期刊：
--
影响因子：
--
通讯作者：
Songxin Liang;D. J. Jeffrey
Songxin Liang;D. J. Jeffrey
中科院分区：
其他
文献类型：
--
作者：
Songxin Liang;D. J. Jeffrey

文献摘要

被引文献

相似文献

一元符号系数多项式的完全根分类是其根分类的所有可能情况的集合，以及其系数应满足的条件。本文给出了一个自动计算复符号系数多项式的完全根分类的算法。本文还介绍了完全根分类在某些真实的量词消去问题中的应用。
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.