This is a short survey article about the involutive approach to investigate polynomial systems. The method is put in connection with the Buchberger algorithm. Finally the implementation of both algorithms in REDUCE are compared.
Recommendations
- Involutive bases of polynomial ideals
- scientific article; zbMATH DE number 939821
- scientific article; zbMATH DE number 1932952
- Gröbner bases and involutive methods for algebraic and differential equations
- A combinatorial approach to involution and -regularity. I: Involutive bases in polynomial algebras of solvable type
Cited in
(18)- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Systems of algebraic equations with bad reduction
- Gröbner bases and involutive methods for algebraic and differential equations
- Involutive bases of polynomial ideals
- Minimal involutive bases
- Involutive bases in the Weyl algebra.
- On constructivity of involutive divisions
- Involutive divisions: Slice and pair properties
- Geometric involutive bases and applications to approximate commutative algebra
- Canonical Reduction Systems in Symbolic Mathematics
- scientific article; zbMATH DE number 939821 (Why is no real title available?)
- scientific article; zbMATH DE number 834123 (Why is no real title available?)
- Involutive characteristic sets of algebraic partial differential equation systems
- Using dynamic memory reallocation in GInv
- ICS: A package for computing involutive characteristic set of algebraic partial differential equation systems
- Specialized computer algebra system GINV
- Involutive divisions and monomial orderings
- Asymmetric approach to computation of Gröbner bases
This page was built for publication: Involutive systems of algebraic equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894546)
