2000 character limit reached
A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity (1503.04380v1)
Published 15 Mar 2015 in cs.SC
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
