Comparison of four numerical algorithms for solving the Liapunov matrix equation†
From MaRDI portal
Publication:5577947
Cites work
- scientific article; zbMATH DE number 3125712 (Why is no real title available?)
- scientific article; zbMATH DE number 3172224 (Why is no real title available?)
- A Finite Series Solution of the Matrix Equation $AX - XB = C$
- Matrix calculations for Liapunov quadratic forms
- Solution of the Equation $AX + XB = C$ by Inversion of an $M \times M$ or $N \times N$ Matrix
Cited in
(15)- A computational method for parameter optimization problems arising in control†
- Solution of Lyapunov equations by alternating direction implicit iteration
- Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
- Accelerated convergence of the matrix sign function method of solving Lyapunov, Riccati and other matrix equations
- On the numerical analtsys of generated sylvester equations
- 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†
- Stabilizing uncertain systems with bounded control
- A direct approach to the design of asymptotically optimal control lers†
- 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)
