Computing the Maslov index for large systems
Margaret Beck, Simon J.A. Malham

TL;DR
This paper presents new methods for efficiently computing the Maslov index in large symplectic systems by characterizing Riccati singularities and introducing trace formulae, improving robustness and computational feasibility.
Contribution
The paper introduces novel trace formulae and a Cayley map-based approach to compute the Maslov index for large systems, addressing singularities and computational complexity.
Findings
Riccati singularities correspond to intersections with the reference plane.
Trace of the Cayley map relates to the angle between Lagrangian planes.
The proposed methods are effective in large eigenvalue problems.
Abstract
We address the problem of computing the Maslov index for large linear symplectic systems on the real line. The Maslov index measures the signed intersections (with a given reference plane) of a path of Lagrangian planes. The natural chart parameterization for the Grassmannian of Lagrangian planes is the space of real symmetric matrices. Linear system evolution induces a Riccati evolution in the chart. For large order systems this is a practical approach as the computational complexity is quadratic in the order. The Riccati solutions, however, also exhibit singularites (which are traversed by changing charts). Our new results involve characterizing these Riccati singularities and two trace formulae for the Maslov index as follows. First, we show that the number of singular eigenvalues of the symmetric chart representation equals the dimension of intersection with the reference plane.…
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.
Taxonomy
TopicsAdvanced Topics in Algebra · Quantum chaos and dynamical systems · Nonlinear Waves and Solitons
