Convex invertible cones of matrices — a unified framework for the equations of Sylvester, Lyapunov and Riccati
Author:
- Izchak LewkowiczILIzchak Lewkowicz
- 1 January 1999
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 286 (1-3) , 107-133
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Convex invertible cones of state space systemsMathematics of Control, Signals, and Systems, 1997
- A Jacobi-like method for solving algebraic Riccati equations on parallel computersIEEE Transactions on Automatic Control, 1997
- The Matrix Sign Function Method and the Computation of Invariant SubspacesSIAM Journal on Matrix Analysis and Applications, 1997
- Convex invertible cones and the Lyapunov equationLinear Algebra and its Applications, 1997
- General matrix pencil techniques for the solution of algebraic Riccati equations: a unified approachIEEE Transactions on Automatic Control, 1997
- A Faddeev sequence method for solving Lyapunov and Sylvester equationsLinear Algebra and its Applications, 1996
- A necessary and sufficient criterion for the stability of a convex set of matricesIEEE Transactions on Automatic Control, 1993
- A systolic algorithm for riccati and lyapunov equationsMathematics of Control, Signals, and Systems, 1989
- The matrix sign function and computations in systemsApplied Mathematics and Computation, 1976
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972