Previous Articles     Next Articles

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

ZHU Wei ,GAO Xiao-Shan     

  1. Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China.
  • Online:2017-04-25 Published:2017-03-24

ZHU Wei,GAO Xiao-Shan. A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity[J]. Journal of Systems Science and Complexity, 2017, 30(2): 464-483.

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.

No related articles found!
Viewed
Full text


Abstract