Comparison of four numerical algorithms for solving the Liapunov matrix equation†
From MaRDI portal
Publication:5577947
DOI10.1080/00207177008905898zbMATH Open0185.40102OpenAlexW2004421509MaRDI QIDQ5577947FDOQ5577947
Authors:
Publication date: 1970
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207177008905898
Cites Work
Cited In (15)
- A computational method for parameter optimization problems arising in control†
- Solution of Lyapunov equations by alternating direction implicit iteration
- Accelerated convergence of the matrix sign function method of solving Lyapunov, Riccati and other matrix equations
- On the numerical analtsys of generated sylvester equations
- Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
- Iterative solution of the Lyapunov matrix equation
- Empirical studies of an MRAC algorithm with minimal controller synthesis
- The simplification of linear discrete-time systems by model-following methods
- On a numerical method of solving the Lyapunov and Sylvester equations
- The solution of the matrix equation XC – BX = D as an eigenvalue problem
- Comparison of numerical methods for solving Liapunov matrix equations†
- The use of model following methods to generate suboptimal feedback control†
- A direct approach to the design of asymptotically optimal control lers†
- Stabilizing uncertain systems with bounded control
- Explicit solutions of the matrix equation AX - XB = C
This page was built for publication: Comparison of four numerical algorithms for solving the Liapunov matrix equation†
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5577947)