Triviality and Dimension of a System of Algebraic Differential Equations

Authors:
Abdelilah Kandri Rody;Hamid MaÂRouf;Mohamed Ssafini
Affiliations:
Département de mathématiques, Faculté des Sciences Semlalia, B.P S15, Avenue Safi, Marrakech, Maroc;Département de mathématiques, Faculté des Sciences Semlalia, B.P S15, Avenue Safi, Marrakech, Maroc;Département de mathématiques, Faculté des Sciences Semlalia, B.P S15, Avenue Safi, Marrakech, Maroc
Venue:
Journal of Automated Reasoning
Year:
1998

Citing 8
Cited 3

Computing dimension and independent sets for polynomial ideals

Journal of Symbolic Computation
Combinatorial dimension theory of algebraicvarieties

Journal of Symbolic Computation
A new method for solving algebraic systems of positive dimension

Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Differential-algebraic decision methods and some applications to system theory

Theoretical Computer Science - Selected papers of the 2nd workshop on algebraic and computer-theoretic aspects of formal power series
Solving zero-dimensional algebraic systems

Journal of Symbolic Computation
A generalized Euclidean algorithm for computing triangular representations of algebraic varieties

Journal of Symbolic Computation
Algorithmic algebra

Algorithmic algebra
Representation for the radical of a finitely generated differential ideal

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation

Cited References

Computer algebra handbook
Fast computation of discrete invariants associated to a differential rational mapping

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Notes on triangular sets and triangulation-decomposition algorithms I: polynomial systems

SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present an algorithm that tests the triviality and computes thedifferential dimension and a parametric set for an ordinary differentialpolynomial ideal. No factorization is needed. The basic operation in ouralgorithm is the test of invertibility of an algebraic polynomial withrespect to a finite set of algebraic polynomials. The algorithm has beenimplemented in the computer algebra system MAPLE and has been testedsuccessfully on many examples.