Geometrical method of decoupling

The computation of tunes and matched beam distributions are essential steps in the analysis of circular accelerators. If certain symmetries-like midplane symmetry-are present, then it is possible to treat the betatron motion in the horizontal, the vertical plane, and (under certain circumstances) the longitudinal motion separately using the well-known Courant-Snyder theory, or to apply transformations that have been described previously as, for instance, the method of Teng and Edwards. In a preceding paper, it has been shown that this method requires a modification for the treatment of isochronous cyclotrons with non-negligible space charge forces. Unfortunately, the modification was numerically not as stable as desired and it was still unclear, if the extension would work for all conceivable cases. Hence, a systematic derivation of a more general treatment seemed advisable. In a second paper, the author suggested the use of real Dirac matrices as basic tools for coupled linear optics and gave a straightforward recipe to decouple positive definite Hamiltonians with imaginary eigenvalues. In this article this method is generalized and simplified in order to formulate a straightforward method to decouple Hamiltonian matrices with eigenvalues on the real and the imaginary axis. The decoupling of symplectic matrices which are exponentials of such Hamiltonian matrices can be deduced from this in a few steps. It is shown that this algebraic decoupling is closely related to a geometric "decoupling" by the orthogonalization of the vectors (E) over right arrow, (B) over right arrow, and (P) over right arrow, which were introduced with the so-called "electromechanical equivalence." A mathematical analysis of the problem can be traced down to the task of finding a structure-preserving block diagonalization of symplectic or Hamiltonian matrices. Structure preservation means in this context that the (sequence of) transformations must be symplectic and hence canonical. When used iteratively, the decoupling algorithm can also be applied to n-dimensional systems and requires O(n(2)) iterations to converge to a given precision. DOI:10.1103/PhysRevSTAB.15.124001