中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity

文献类型:期刊论文

作者Zhu Wei; Gao Xiao-Shan
刊名JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
出版日期2017-04-01
卷号30期号:2页码:464-483
关键词Differential polynomial system regular triangular set saturated triangular set triangular decomposition
ISSN号1009-6124
DOI10.1007/s11424-016-5040-5
英文摘要In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of polynomials in one step using the theory of multivariate resultant. This seems to be the first differential triangular decomposition algorithm with elementary computation complexity.
资助项目National Natural Science Foundation of China[60821002] ; National Key Basic Research Project of China
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000397332200013
出版者SPRINGER HEIDELBERG
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/25005]  
专题系统科学研究所
通讯作者Zhu Wei
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Math Mechanizat, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Zhu Wei,Gao Xiao-Shan. A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity[J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,2017,30(2):464-483.
APA Zhu Wei,&Gao Xiao-Shan.(2017).A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity.JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,30(2),464-483.
MLA Zhu Wei,et al."A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity".JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 30.2(2017):464-483.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

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