arXiv · hep-th/0208106
Lagrange versus Symplectic Algorithm for Constrained Systems
Abstract
The 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Heinz J. Rothe, Klaus D. Rothe. 2002-08-15. Lagrange versus Symplectic Algorithm for Constrained Systems. https://doi.org/10.1088/0305-4470%2F36%2F6%2F311
Cite the original work for its findings. Save a collection to share your selection of sources.