Details:
Title  Constrained Hamiltonian Systems and Groebner Bases  Author(s)  Vladimir P. Gerdt, Soso A. Gogilidze  Type  Article in Journal  Abstract  In this paper we consider finitedimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods of commutative algebra based on the use of Groebner bases. As it is shown, this makes the classical Dirac method fully algorithmic. The underlying algorithm implemented in Maple is presented and some illustrative examples are given.  Length  8 
File 
 Language  English  Journal  Computer Algebra in Scientific Computing  Pages  139146  Publisher  SpringerVerlag, Berlin  Year  1999  Translation 
No  Refereed 
No 
