1999/09/20 by Vladimir P. Gerdt, Gerdt, Vladimir P., S. A. Gogilidze +1
Computer Science · Mathematics · #Algebraic and Geometric Analysis #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Numerical Analysis (math.NA) #Numerical methods for differential equations #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.math/9909113
openalex publication_date 1999/09/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.