Lyapunov-like equations and reachability/observabiliy Gramians for descriptor systems
From MaRDI portal
Publication:3754292
DOI10.1109/TAC.1987.1104589zbMATH Open0613.34002MaRDI QIDQ3754292FDOQ3754292
Publication date: 1987
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 2062309
- A generalized Lyapunov theorem for descriptor system
- A standard Lyapunov equation for descriptor systems
- Lyapunov and Riccati equations of discrete-time descriptor systems
- Lyapunov matrix equations for the stability analysis of linear time-invariant descriptor systems
- scientific article; zbMATH DE number 2159117
- On the use of reachability Gramians for the stabilization of linear periodic systems
- Boundary-value descriptor systems: well-posedness, reachability and observability
- Reachability and controllability indices for linear descriptor systems
- Lyapunov Stability and Strong Passivity Analysis for Nonlinear Descriptor Systems
Controllability (93B05) Observability (93B07) Canonical structure (93B10) Linear systems in control theory (93C05) General theory for ordinary differential equations (34A99)
Cited In (26)
- Balanced truncation model reduction for semidiscretized Stokes equation
- A modified matrix sign function method for projected Lyapunov equations
- On Generalised Stein's Inequalites and the Inertias of Their Solutions: Application to Pencil Finite Root-Clustering
- Gramian matrices and balanced model of generalized systems.
- A generalized Lyapunov theorem for descriptor system
- Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations
- A tutorial on the geometric analysis of linear time-invariant implicit systems
- Mixed optimization approach to model approximation of descriptor systems
- Balanced realization and model reduction of singular systems
- Stability and inertia theorems for generalized Lyapunov equations
- A Lyapunov approach to analysis of discrete singular systems
- Design of observers for descriptor systems using a descriptor standard form
- Explicit solution of the matrix equation \(AXB-CXD=E\)
- Enclosing the solution set of the parametric generalised Sylvester matrix equation A(p)XB(p) + C(p)XD(p) = F(p)
- Reachability and controllability of discrete-time descriptor systems
- Remarks on observability of implicit linear discrete-time systems
- Contour integral solutions of Sylvester-type matrix equations
- Weighted steepest descent method for solving matrix equations
- Krylov subspace methods for projected Lyapunov equations
- On the perturbation bounds of projected generalized continuous-time Sylvester equations
- Observability of linear discrete-time systems of algebraic and difference equations
- On equivalence and explicit solutions of a class of matrix equations
- Model reduction of singular systems
- Fundamental, reachability, and observability matrices for discrete descriptor systems
- The equivalence structure of descriptor representations of systems with possibly inconsistent initial conditions
- Numerical solution and perturbation theory for generalized Lyapunov equations
This page was built for publication: Lyapunov-like equations and reachability/observabiliy Gramians for descriptor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754292)