Factorization-free decomposition algorithms in differential algebra

91Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Insight on the structure of differential ideals defined by coherent autoreduced set allows one to uncouple the differential and algebraic computations in a decomposition algorithm. Original results as well as concise new proofs of already presented theorems are exposed. As a consequence, an effective version of Ritt's algorithm can be simply described. © 2000 Academic Press.

Cite

CITATION STYLE

APA

Hubert, E. (2000). Factorization-free decomposition algorithms in differential algebra. Journal of Symbolic Computation, 29(4–5), 641–662. https://doi.org/10.1006/jsco.1999.0344

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free