Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization
From MaRDI portal
Publication:5021025
DOI10.1137/21M1390621zbMath1480.15011arXiv2101.02618OpenAlexW4205616708WikidataQ115246870 ScholiaQ115246870MaRDI QIDQ5021025
Tatjana Stykel, Nguyen Thanh Son, Pierre-Antoine Absil, Bin Gao
Publication date: 11 January 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.02618
Riemannian optimizationtrace minimizationsymmetric positive-definite matricessymplectic Stiefel manifoldpositive-definite Hamiltonian matrixsymplectic eigenpairsWilliamson's diagonal form
Determinants, permanents, traces, other special matrix functions (15A15) Eigenvalues, singular values, and eigenvectors (15A18) Manifolds and measure-geometric topics (49Q99)
Related Items (4)
On generalizing trace minimization principles. II ⋮ A collection of efficient retractions for the symplectic Stiefel manifold ⋮ Optimization on the symplectic Stiefel manifold: SR decomposition-based retraction and applications ⋮ Symplectic eigenvalues of positive-semidefinite matrices and the trace minimization theorem
Uses Software
Cites Work
- An indefinite variant of LOBPCG for definite matrix pencils
- Convergence of the block Lanczos method for eigenvalue clusters
- A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
- A course in \(H_{\infty}\) control theory
- A truncated-CG style method for symmetric generalized eigenvalue problems
- Solving large-scale quadratic eigenvalue problems with Hamiltonian eigenstructure using a structure-preserving Krylov subspace method
- Gaussian quantum marginal problem
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- Wielandt and Ky-Fan theorem for matrix pairs.
- Riemannian geometry of Grassmann manifolds with a view on algorithmic computation
- The trace minimization method for the symmetric generalized eigenvalue problem
- Symplectic spaces and pairs of symmetric and nonsingular skew-symmetric matrices under congruence
- A Riemannian steepest descent approach over the inhomogeneous symplectic group: application to the averaging of linear optical systems
- On the symplectic eigenvalues of positive definite matrices
- Trace minimization and definiteness of symmetric pencils
- On Hamiltonian and symplectic Lanczos processes
- Trace minimization principles for positive semi-definite pencils
- Optimization on the real symplectic group
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- Perturbation bounds for Williamson's symplectic normal form
- First-order methods almost always avoid strict saddle points
- Symplectic invariants and Hamiltonian dynamics
- Minimization principles and computation for the generalized linear response eigenvalue problem
- Numerical methods for general and structured eigenvalue problems.
- Symplectic geometry and quantum mechanics
- Canonical forms for symmetric/skew-symmetric real matrix pairs under strict equivalence and congruence
- The parameterized 𝑆𝑅 algorithm for symplectic (butterfly) matrices
- The Symmetry Group of Gaussian States in $${L}^{2}({\mathbb{R}}^{n})$$
- Minimization Principles for the Linear Response Eigenvalue Problem II: Computation
- Numerical Methods for Large Eigenvalue Problems
- On symplectic eigenvalues of positive definite matrices
- Symplectic Model Reduction of Hamiltonian Systems
- A Symplectic Lanczos-Type Algorithm to Compute the Eigenvalues of Positive Definite Hamiltonian Matrices
- An Implicit Riemannian Trust-Region Method for the Symmetric Generalized Eigenproblem
- Conservative perturbations of positive definite Hamiltonian matrices
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- Stability radii of linear discrete‐time systems and symplectic pencils
- Eigensystem Computation for Skew-Symmetric and a Class of Symmetric Matrices
- The Geometry of Algorithms with Orthogonality Constraints
- Congruences and canonical forms for a positive matrix: Application to the Schweinler–Wigner extremum principle
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Riemannian Optimization on the Symplectic Stiefel Manifold
- Port-Hamiltonian Systems Theory: An Introductory Overview
- Derivatives of symplectic eigenvalues and a Lidskii type theorem
- Inequalities for quantum marginal problems with continuous variables
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Morembs—A Model Order Reduction Package for Elastic Multibody Systems and Beyond
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- The Matrix Eigenvalue Problem
- Functions of Matrices
- Computational Science – ICCS 2005
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization
