A note on Hammarling's algorithm for the discrete Lyapunov equation
From MaRDI portal
Publication:2277205
DOI10.1016/0167-6911(90)90121-AzbMATH Open0724.93018OpenAlexW2056772853MaRDI QIDQ2277205FDOQ2277205
Publication date: 1990
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6911(90)90121-a
Cites Work
Cited In (7)
- On the numerical solution of large-scale sparse discrete-time Riccati equations
- NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS
- Factorized squared Smith method for large-scale Stein equations with high-rank terms
- Parallel algorithms for model reduction of discrete-time systems
- Computational Methods for Linear Matrix Equations
- Parametric Smith iterative algorithms for discrete Lyapunov matrix equations
- Numerical solution of the discrete-time, convergent, non-negative definite Lyapunov equation
Recommendations
- Numerical solution of the discrete-time, convergent, non-negative definite Lyapunov equation π π
- Stabilization of a System by Output Feedback π π
- Block variants of Hammarling's method for solving Lyapunov equations π π
- A numerical algorithm for Lyapunov equations π π
- Direct methods for matrix Sylvester and Lyapunov equations π π
This page was built for publication: A note on Hammarling's algorithm for the discrete Lyapunov equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277205)