Solving Minimal-Distance Problems over the Manifold of Real-Symplectic Matrices
Author:
- 1 July 2011
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 32 (3) , 938-968
Abstract
The present paper discusses the question of formulating and solving minimal-distance problems over the group-manifold of real-symplectic matrices. In order to tackle the related optimization problem, the real-symplectic group is regarded as a pseudo-Riemannian manifold, and a metric is chosen that affords the computation of geodesic arcs in closed forms. Then, the considered minimal-distance problem can be solved numerically via a gradient-steepest-descent algorithm implemented through a geodesic-stepping method. The minimal-distance problem investigated in this paper relies on a suitable notion of distance—induced by the Frobenius norm—as opposed to the natural pseudodistance that corresponds to the pseudo-Riemannian metric that the real-symplectic group is endowed with. Numerical tests about the computation of the empirical mean of a collection of symplectic matrices illustrate the discussed framework.Keywords
This publication has 33 references indexed in Scilit:
- Descent methods for optimization on homogeneous manifoldsMathematics and Computers in Simulation, 2008
- Optimal Control and Geodesics on Quadratic Matrix Lie GroupsFoundations of Computational Mathematics, 2008
- Geometric Means in a Novel Vector Space Structure on Symmetric Positive‐Definite MatricesSIAM Journal on Matrix Analysis and Applications, 2007
- Smooth singular value decomposition on the symplectic group and Lyapunov exponents approximation*Calcolo, 2006
- Neural learning by geometric integration of reduced ‘rigid-body’ equationsJournal of Computational and Applied Mathematics, 2004
- Efficient Classical Simulation of Continuous Variable Quantum Information ProcessesPhysical Review Letters, 2002
- Natural Gradient Works Efficiently in LearningNeural Computation, 1998
- The Geometry of Algorithms with Orthogonality ConstraintsSIAM Journal on Matrix Analysis and Applications, 1998
- Two complementary representations of multiple time series in state‐space innovation formsJournal of Forecasting, 1994
- Lie Algebraic Treatment of Linear and Nonlinear Beam DynamicsAnnual Review of Nuclear and Particle Science, 1988