multiplicitypreservingtriangularsetdecompositionoftwopolynomials
Cheng Jinsan; Gao Xiaoshan
刊名journalofsystemsscienceandcomplexity
2014
卷号27期号:6页码:1320
ISSN号1009-6124
英文摘要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 authors give a complete algorithm to decompose the system into zeros represented by triangular sets with multiplicities. The authors also analyze the complexity of the algorithm in the bivariate case. The authors implement the algorithm and show the effectiveness of the method with extensive experiments.
资助项目[NKBRPC] ; [National Natural Science Foundation of China] ; [SRF for ROCS, SEM] ; [China-France cooperation project EXACTA]
语种英语
内容类型期刊论文
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/50161]  
专题系统科学研究所
作者单位中国科学院数学与系统科学研究院
推荐引用方式
GB/T 7714
Cheng Jinsan,Gao Xiaoshan. multiplicitypreservingtriangularsetdecompositionoftwopolynomials[J]. journalofsystemsscienceandcomplexity,2014,27(6):1320.
APA Cheng Jinsan,&Gao Xiaoshan.(2014).multiplicitypreservingtriangularsetdecompositionoftwopolynomials.journalofsystemsscienceandcomplexity,27(6),1320.
MLA Cheng Jinsan,et al."multiplicitypreservingtriangularsetdecompositionoftwopolynomials".journalofsystemsscienceandcomplexity 27.6(2014):1320.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace