Lagrange versus Symplectic Algorithm for Constrained Systems

Simple item page
dc.creatorRothe, Heinz J.
dc.creatorRothe, Klaus D.
dc.date2002-08-15
dc.date.accessioned2026-07-07T10:49:26Z
dc.date.available2026-07-07T10:49:26Z
dc.descriptionThe systematization of the purely Lagrangean approach to constrained systems in the form of an algorithm involves the iterative construction of a generalized Hessian matrix W taking a rectangular form. This Hessian will exhibit as many left zero-modes as there are Lagrangean constraints in the theory. We apply this approach to a general Lagrangean in the first order formulation and show how the seemingly overdetermined set of equations is solved for the velocities by suitably extending W to a rectangular matrix. As a byproduct we thereby demonstrate the equivalence of the Lagrangean approach to the traditional Dirac-approach. By making use of this equivalence we show that a recently proposed symplectic algorithm does not necessarily reproduce the full constraint structure of the traditional Dirac algorithm.
dc.description20 pages, LaTeX
dc.identifierhttps://arxiv.org/abs/hep-th/0208106
dc.identifierhttp://arxiv.org/abs/hep-th/0208106
dc.identifierJ.Phys.A36:1671-1682,2003
dc.identifierdoi:10.1088/0305-4470/36/6/311
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/184216
dc.subjectHigh Energy Physics - Theory
dc.titleLagrange versus Symplectic Algorithm for Constrained Systems
dc.typetext

Files

Collections

arXiv