Answers are grounded in this paper and cite their sources.
We derive a new representation of Lagrangian subspaces in the form Im ΠT[smallmatrixI \\ Xsmallmatrix], where Π is a symplectic matrix which is the product of a permutation matrix and a real orthogonal diagonal matrix, and X satisfies Xᵢⱼ ≤ cases1 & ifi=j,\\ √2 & ifi≠ j. cases This representation allows us to limit element growth in the context of doubling algorithms for the computation of Lagrangian subspaces and the solution of Riccati equations. It is shown that a simple doubling algorithm using this representation can reach full machine accuracy on a wide range of problems, obtaining invariant subspaces of the same quality as those computed by the state-of-the-art algorithms based on orthogonal transformations. The same idea carries over to representations of arbitrary subspaces and can be used for other types of structured pencils.
No takes yet. Share an insight, caveat, or question.
Mehrmann et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: