A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity |
| |
| Authors: | Wei Zhu Xiao-Shan Gao |
| |
| Institution: | 1.Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing,China |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
|
