An inverse‐free ADI algorithm for computing Lagrangian invariant subspaces
From MaRDI portal
Publication:5739755
DOI10.1002/nla.2018zbMath1438.65079OpenAlexW1828815086MaRDI QIDQ5739755
Federico Poloni, Volker Mehrmann
Publication date: 19 July 2016
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/775263
Lyapunov matrix equationRiccati equationLagrangian subspacelow-rank ADI methodinverse-free arithmeticpermuted Lagrangian subspacepermuted-graph basis
Numerical methods for low-rank matrix approximation; matrix compression (65F55) Numerical methods for matrix equations (65F45)
Related Items (3)
Structure Preserving Model Reduction of Parametric Hamiltonian Systems ⋮ An inverse‐free ADI algorithm for computing Lagrangian invariant subspaces ⋮ Linear Algebra Properties of Dissipative Hamiltonian Descriptor Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Using permuted graph bases in \(\mathcal{H}_\infty\) control
- Robust formulas for \(H_{\infty }\) optimal controllers
- A numerical method for computing the Hamiltonian Schur form
- On the reduction of a Hamiltonian matrix to Hamiltonian Schur form
- On the solution of large-scale algebraic Riccati equations by using low-dimensional invariant subspaces
- A robust numerical method for the \(\gamma\)-iteration in \(H_{\infty}\) control
- A Schur decomposition for Hamiltonian matrices
- A new block method for computing the Hamiltonian Schur form
- Iterative solution of the Lyapunov matrix equation
- The autonomous linear quadratic control problem. Theory and numerical solution
- Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
- On condition numbers of a basis
- An arithmetic for matrix pencils: theory and new algorithms
- Numerical solution of large and sparse continuous time algebraic matrix Riccati and Lyapunov equations: a state of the art survey
- Mathematical Systems Theory I
- Semi-optimal bases for linear dependencies
- Convergence Analysis of Projection Methods for the Numerical Solution of Large Lyapunov Equations
- Parametrization of the Matrix Symplectic Group and Applications
- Numerical solution of large‐scale Lyapunov equations, Riccati equations, and linear‐quadratic optimal control problems
- Accurate Computation of the Product-Induced Singular Value Decomposition with Applications
- A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
- Accuracy and Stability of Numerical Algorithms
- Doubling Algorithms with Permuted Lagrangian Graph Bases
- Product Eigenvalue Problems
- On two numerical methods for the solution of large-scale algebraic Riccati equations
- An inverse‐free ADI algorithm for computing Lagrangian invariant subspaces
This page was built for publication: An inverse‐free ADI algorithm for computing Lagrangian invariant subspaces
