A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity

ZHU Wei,GAO Xiao-Shan

Journal of Systems Science & Complexity ›› 2017, Vol. 30 ›› Issue (2) : 464-483.

PDF(308 KB)
PDF(308 KB)
Journal of Systems Science & Complexity ›› 2017, Vol. 30 ›› Issue (2) : 464-483. DOI: 10.1007/s11424-016-5040-5

A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity

Author information +
History +

Abstract

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.

Cite this article

Download Citations
ZHU Wei , GAO Xiao-Shan. A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity. Journal of Systems Science and Complexity, 2017, 30(2): 464-483 https://doi.org/10.1007/s11424-016-5040-5
PDF(308 KB)

116

Accesses

0

Citation

Detail

Sections
Recommended

/