排序方式: 共有1条查询结果,搜索用时 31 毫秒
1
1.
CHENG Jin-San GAO Xiao-Shan 《系统科学与复杂性》2014,(6):1320-1344
In this paper, a multiplicity-preserving triangular set decomposition algorithm is proposed for a system of two polynomials, which involves only computing the primitive polynomial remainder sequence of two polynomials once and certain GCD computations. The algorithm decomposes the unmixed variety defined by two polynomials into square free and disjoint (for non-vertical components, see Definition 4) algebraic cycles represented by triangular sets which may have negative multiplicities. Thus, the authors can count the multiplicities of the non-vertical components. In the bivariate case, the amthors give a complete algorithm to decompose tile system into zeros represented by triangular sets with multiplicities. The authors also analyze the complexity of the algorithm in the bivariate ease. The authors implement the algorithm and show the effectiveness of the method with extensive experiments. 相似文献
1