arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/9909113math.NAcs.NAmath-phmath.MP
收藏

约束哈密顿系统与格罗布纳基

Constrained Hamiltonian Systems and Groebner Bases

Vladimir P. Gerdt, Soso A. Gogilidze

AI总结:

本文利用格罗布纳基的交换代数算法,将经典狄拉克方法完全算法化,用于计算和分类多项式型有限维约束哈密顿系统的约束,并在Maple中实现。

摘要:

本文考虑多项式类型的有限维约束哈密顿系统。为了计算完整的约束集并将其分为第一类和第二类,我们应用了基于格罗布纳基的现代交换代数算法方法。如所示,这使得经典狄拉克方法完全算法化。给出了在Maple中实现的底层算法,并给出了一些说明性示例。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑