Barcelos-Wotzasek symplectic algorithm for constrained systems revisited
M.A. de Andrade, C. Neves, E.V. Corr\^ea Silva
TL;DR
This paper revisits the Barcelos-Wotzasek symplectic algorithm for constrained systems, proposing a minor modification to address criticisms and align it more closely with Dirac's algorithm.
Contribution
A small change is introduced to improve the BW symplectic algorithm, making it more comparable to Dirac's method for constrained systems.
Findings
The modification addresses previous criticisms of the BW algorithm.
The revised formalism aligns better with Dirac's algorithm.
The approach enhances the robustness of the symplectic method.
Abstract
A minor change in the Barcelos-Wotzasek (BW) symplectic algorithm for constrained systems is proposed. The change addresses some criticism that formalism has received, placing it on the same footing as Dirac's algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.