atriangulardecompositionalgorithmfordifferentialpolynomialsystemswithelementarycomputationcomplexity

CSpace > 系统科学研究所

	atriangulardecompositionalgorithmfordifferentialpolynomialsystemswithelementarycomputationcomplexity
	Zhu Wei; Gao Xiaoshan
	2017
发表期刊	journalofsystemsscienceandcomplexity
ISSN	1009-6124
卷号	30 期号:2 页码:464
摘要	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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/45007
专题	系统科学研究所
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Zhu Wei,Gao Xiaoshan. atriangulardecompositionalgorithmfordifferentialpolynomialsystemswithelementarycomputationcomplexity[J]. journalofsystemsscienceandcomplexity,2017,30(2):464.
APA	Zhu Wei,&Gao Xiaoshan.(2017).atriangulardecompositionalgorithmfordifferentialpolynomialsystemswithelementarycomputationcomplexity.journalofsystemsscienceandcomplexity,30(2),464.
MLA	Zhu Wei,et al."atriangulardecompositionalgorithmfordifferentialpolynomialsystemswithelementarycomputationcomplexity".journalofsystemsscienceandcomplexity 30.2(2017):464.