Lyapunov-like equations and reachability/observabiliy Gramians for descriptor systems

From MaRDI portal
Publication:3754292

DOI10.1109/TAC.1987.1104589zbMath0613.34002MaRDI QIDQ3754292

Douglas J. Bender

Publication date: 1987

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)




Related Items

Model reduction of singular systemsOn Generalised Stein's Inequalites and the Inertias of Their Solutions: Application to Pencil Finite Root-ClusteringA modified matrix sign function method for projected Lyapunov equationsDesign of observers for descriptor systems using a descriptor standard formMixed optimization approach to model approximation of descriptor systemsBalanced realization and model reduction of singular systemsEfficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equationsContour integral solutions of Sylvester-type matrix equationsGramian matrices and balanced model of generalized systems.On the perturbation bounds of projected generalized continuous-time Sylvester equationsRemarks on observability of implicit linear discrete-time systemsKrylov subspace methods for projected Lyapunov equationsWeighted steepest descent method for solving matrix equationsA tutorial on the geometric analysis of linear time-invariant implicit systemsOn equivalence and explicit solutions of a class of matrix equationsObservability of linear discrete-time systems of algebraic and difference equationsBalanced truncation model reduction for semidiscretized Stokes equationA Lyapunov approach to analysis of discrete singular systemsExplicit solution of the matrix equation \(AXB-CXD=E\)Stability and inertia theorems for generalized Lyapunov equationsReachability and controllability of discrete-time descriptor systemsEnclosing the solution set of the parametric generalised Sylvester matrix equation A(p)XB(p) + C(p)XD(p) = F(p)Numerical solution and perturbation theory for generalized Lyapunov equations