Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Barcelos-Wotzasek symplectic algorithm for constrained systems revisited

M. A. de Andrade, C. Neves, E. V. Corrêa Silva

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.

Barcelos-Wotzasek symplectic algorithm for constrained systems revisited

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.

Paper Structure

This paper contains 17 sections, 106 equations.

Table of Contents

  1. Introduction
  2. Comparison of Dirac's and Barcelos-Wotzasek algorithms
  3. Free Particle on a Hypersphere
  4. From Dirac's perspective
  5. From the BW perspective
  6. A Toy Model
  7. From Dirac's Perspective
  8. From the BW perspective
  9. The Relativistic Free Particle
  10. From Dirac's Perspective
  11. From the BW perspective
  12. Barcelos-Wotzasek symplectic algorithm modified
  13. Revisiting the Free Particle on a Hypersphere
  14. Revisiting The Toy Model
  15. Revisiting the Relativistic free particle
  16. ...and 2 more sections