Constrained Hamiltonian Systems and Groebner Bases

Details Constrained Hamiltonian Systems and Groebner Bases Constrained Hamiltonian Systems and Groebner Bases

1999-09-20

arxiv.org/abs/math/9909113v2

Computer Algebra in Scientific Computing, V.G.Ganzha, E.W.Mayr and E.V.Vorozhtsov, eds., Springer-Verlag, Berlin, 1999, pp.139

Mathematics

Numerical Analysis

8 pages, LaTeX, uses the Springer file lncse.cls

Scientific paper

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 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.

Affiliated with

Also associated with

No associations

Rating

Constrained Hamiltonian Systems and Groebner Bases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constrained Hamiltonian Systems and Groebner Bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constrained Hamiltonian Systems and Groebner Bases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-429621