An algorithm for decomposing a polynomial system into normal ascending sets

An algorithm for decomposing a polynomial system into normal ascending sets
复制标题

DOI:
10.1007/s11425-007-0118-0
复制
发表时间:
2007-07
期刊:
Science in China Series A: Mathematics
影响因子:
--
通讯作者:
Dingkang Wang;Yan Zhang
Dingkang Wang;Yan Zhang
中科院分区:
其他
文献类型:
--
作者:
Dingkang Wang;Yan Zhang

文献摘要

被引文献

相似文献

给出了一个将多项式系统分解为有限个正规升集的算法,使得多项式系统的零点集是正规升集的正则零点集的并.如果多项式系统是零维的,则多项式的零点集是正常升集的零点集的并集。
We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets. If the polynomial system is zero dimensional, the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.