Unit triangular factorization of the matrix symplectic group
From MaRDI portal
Abstract: In this work, we prove that any symplectic matrix can be factored into no more than 9 unit triangular symplectic matrices. This structure-preserving factorization of the symplectic matrices immediately reveals two well-known features that, (i) the determinant of any symplectic matrix is one, (ii) the matrix symplectic group is path connected, as well as a new feature that (iii) all the unit triangular symplectic matrices form a set of generators of the matrix symplectic group. Furthermore, this factorization yields effective methods for the unconstrained parametrization of the matrix symplectic group as well as its structured subsets. The unconstrained parametrization enables us to apply faster and more efficient unconstrained optimization algorithms to the problems with symplectic constraints under certain circumstances.
Recommendations
- Optimal unit triangular factorization of symplectic matrices
- Decomposition of symplectic matrices into products of symplectic unipotent matrices of index 2
- Parametrization of the matrix symplectic group and applications
- Block algorithms for orthogonal symplectic factorizations
- Factorization of symplectic matrices into elementary factors
Cites work
- scientific article; zbMATH DE number 3125713 (Why is no real title available?)
- scientific article; zbMATH DE number 4210927 (Why is no real title available?)
- scientific article; zbMATH DE number 54047 (Why is no real title available?)
- scientific article; zbMATH DE number 3482710 (Why is no real title available?)
- scientific article; zbMATH DE number 3610787 (Why is no real title available?)
- scientific article; zbMATH DE number 1226464 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 2003146 (Why is no real title available?)
- scientific article; zbMATH DE number 923343 (Why is no real title available?)
- scientific article; zbMATH DE number 7096273 (Why is no real title available?)
- scientific article; zbMATH DE number 967725 (Why is no real title available?)
- A Riemannian-steepest-descent approach for optimization on the real symplectic group
- A Symplectic Orthogonal Method for Single Input or Single Output Discrete Time Optimal Quadratic Control Problems
- A note on symplectic block reflectors
- An SVD-like matrix decomposition and its applications
- Complementary bases in symplectic matrices and a proof that their determinant is one
- Existence, uniqueness, and parametrization of Lagrangian invariant subspaces
- Geometric Numerical Integration
- Maslov-type index, degenerate critical points, and asymptotically linear Hamiltonian systems
- Matrix factorizations for symplectic QR-like methods
- Note on Parametrization of the Four-Dimensional Real Symplectic Group
- On the Iwasawa decomposition of a symplectic matrix
- Optimization on the real symplectic group
- Parametrization of the matrix symplectic group and applications
- Solving minimal-distance problems over the manifold of real-symplectic matrices
- Structured tools for structured matrices
- Symmetric Linearizations for Matrix Polynomials
- Symplectic Geometric Algorithms for Hamiltonian Systems
- Symplectic geometry and quantum mechanics
- Symplectic methods for the symplectic eigenproblem
- Sympnets: intrinsic structure-preserving symplectic networks for identifying Hamiltonian systems
- The Parametrisation and Element of Volume of the Unitary Symplectic Group
- The autonomous linear quadratic control problem. Theory and numerical solution
- The structure of the singular symplectic matrix set
- Yet more elementary proofs that the determinant of a symplectic matrix is 1
Cited in
(7)- Every 2n-by-2n complex symplectic matrix is a product of n + 1 symplectic dilatations
- Structure-preserving recurrent neural networks for a class of Birkhoffian systems
- Structure-Preserving Doubling Algorithms That Avoid Breakdowns for Algebraic Riccati-Type Matrix Equations
- Parametrization of the matrix symplectic group and applications
- Optimal unit triangular factorization of symplectic matrices
- VPNets: volume-preserving neural networks for learning source-free dynamics
- Factorization of symplectic matrices into elementary factors
This page was built for publication: Unit triangular factorization of the matrix symplectic group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146625)
