首页 | 本学科首页   官方微博 | 高级检索  
     检索      

An algorithm for decomposing a polynomial system into normal ascending sets
作者姓名:Ding-kang WANG~ Yan ZHANG Key Laboratory of Mathematics Mechanization  Academy of Mathematics and Systems Science  Chinese Academy of Sciences  Beijing  China
作者单位:Ding-kang WANG~ Yan ZHANG Key Laboratory of Mathematics Mechanization,Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100080,China
摘    要: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.

收稿时间:4 August 2006
修稿时间:16 April 2007

An algorithm for decomposing a polynomial system into normal ascending sets
Ding-kang WANG Yan ZHANG Key Laboratory of Mathematics Mechanization,Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing ,China.An algorithm for decomposing a polynomial system into normal ascending sets[J].Science in China(Mathematics),2007,50(10):1441-1450.
Authors:Ding-kang Wang  Yan Zhang
Institution:Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China
Abstract: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.
Keywords:zero decomposition  normal ascending set  polynomial system
本文献已被 CNKI 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号