Doubling Algorithms with Permuted Lagrangian Graph Bases

DOI10.1137/110850773zbMath1260.65059OpenAlexW2034347866MaRDI QIDQ4902921

Federico Poloni, Volker Mehrmann

Publication date: 18 January 2013

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4ec49bdee11313fc7df485c1f745f028f5c9e3c9

zbMATH Keywords

optimal controlconvergenceinvariant subspacesHamiltonian matrixKronecker canonical formLagrangian subspacematrix pencilsymplectic matrixstructure-preserving doubling algorithmgraph subspace

Mathematics Subject Classification ID

Related Items (13)

Structure-Preserving Flows of Symplectic Matrix Pairs ⋮ Methods for verified stabilizing solutions to continuous-time algebraic Riccati equations ⋮ The asymptotic analysis of the structure-preserving doubling algorithms ⋮ Stable and Efficient Computation of Generalized Polar Decompositions ⋮ Structure Preserving Model Reduction of Parametric Hamiltonian Systems ⋮ Structure-Preserving Doubling Algorithms That Avoid Breakdowns for Algebraic Riccati-Type Matrix Equations ⋮ Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction ⋮ Optimization on a Grassmann manifold with application to system identification ⋮ Using permuted graph bases in \(\mathcal{H}_\infty\) control ⋮ An inverse‐free ADI algorithm for computing Lagrangian invariant subspaces ⋮ Duality of matrix pencils, Wong chains and linearizations ⋮ Principal Pivot Transforms of Quasidefinite Matrices and Semidefinite Lagrangian Subspaces ⋮ A structure preserving flow for computing Hamiltonian matrix exponential

Uses Software

• Matlab
• LYAPACK
• PGDoubling

This page was built for publication: Doubling Algorithms with Permuted Lagrangian Graph Bases