Ginv

Specialized computer algebra system GINV. The computer algebra system GINV (Gröbner INVolutive) is presented. It is designed for studying and solving systems of algebraic, differential, and difference equations of polynomial type by their completion to involution. The system is based on algorithms for constructing involutive Janet and Janet-like bases for polynomial ideals and modules, as well as reduced Gröbner bases, developed by the authors. GINV consists of a library of C++ programs, which is a module of the Python language. It is available at http://invo.jinr.ru/ginv/ and is distributed under the terms of the GPL v2.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 8 articles )

Showing results 1 to 8 of 8.
Sorted by year (citations)

  1. Robertz, Daniel: Formal algorithmic elimination for PDEs (2014)
  2. Gerdt, Vladimir P.; Hashemi, Amir; M.-Alizadeh, Benyamin: Involutive bases algorithm incorporating F(_5) criterion (2013)
  3. Bächler, Thomas; Gerdt, Vladimir; Lange-Hegermann, Markus; Robertz, Daniel: Algorithmic Thomas decomposition of algebraic and differential systems (2012)
  4. Gerdt, Vladimir P.; Blinkov, Yuri A.: Involutive division generated by an antigraded monomial ordering (2011)
  5. Jambor, Sebastian: Computing minimal associated primes in polynomial rings over the integers (2011)
  6. Gerdt, V. P.; Zinin, M. V.; Blinkov, Yu. A.: On computation of Boolean involutive bases (2010)
  7. Blinkov, Yu. A.; Gerdt, V. P.: Specialized computer algebra system GINV (2008)
  8. Gerdt, V.; Khvedelidze, A.; Palii, Yu.: Towards an algorithmisation of the Dirac constraint formalism (2006)