A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity
Symbolic Computation
2015-03-17 v1
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
@article{arxiv.1503.04380,
title = {A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity},
author = {Wei Zhu and Xiao-Shan Gao},
journal= {arXiv preprint arXiv:1503.04380},
year = {2015}
}