Constrained Hamiltonian Systems and Gröbner Bases

Vladimir P. Gerdt and Soso A. Gogilidze
Additional contact information
Vladimir P. Gerdt: Joint Institute for Nuclear Research, Laboratory of Computing Techniques and Automation
Soso A. Gogilidze: Tbilisi State University, Institute of High Energy Physics

A chapter in Computer Algebra in Scientific Computing CASC’99, 1999, pp 139-146 from Springer

Abstract: Abstract In this paper we consider finite-dimensional 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 Gröbner 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.

Keywords: Hamiltonian System; Poisson Bracket; Constraint Function; Singular System; Class Constraint (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-60218-4_10

Ordering information: This item can be ordered from
http://www.springer.com/9783642602184

DOI: 10.1007/978-3-642-60218-4_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().