𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Digraph characterization of structural controllability for linear descriptor systems

✍ Scribed by Kurt J. Reinschke; Gunter Wiedemann

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
1015 KB
Volume
266
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

AB STBACT

For linear descriptor systems of the form Ei = Ax + Bu, the different kinds of controllability are analyzed by graph-theoretic means. Starting from known algebraic criteria, digraph conditions for structural r-controllability, structural impulse controllability, and structural complete controllability are derived. A nontrivial electrical example system illustrates the application of the results.

πŸ“œ SIMILAR VOLUMES

Robust controllability for linear uncert
Robust controllability for linear uncertain descriptor systems
✍ Jyh-Horng Chou; Shinn-Horng Chen; Qing-Ling Zhang πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 222 KB

In this paper, under assumptions that the linear nominal descriptor system is regular and controllable, some sufficient conditions are proposed to preserve the assumed properties when both structured (elemental) and unstructured (norm-bounded) parameter uncertainties are added into the nominal descr

Structural controllability/observability
Structural controllability/observability of linear systems represented by bond graphs
✍ C. Sueur; G. Dauphin-Tanguy πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 673 KB

Structural properties qf linear systems are pointed out directly from the bond graph representation and,fiom the junction structure matrix S. Necessary and sufji'cient conditions are presented,fbr any class of bond graphs usinq the concept of' causal connection between dynumical elements.

Model reduction for a class of linear de
Model reduction for a class of linear descriptor systems
✍ G. Hechme; Yu.M. Nechepurenko; M. Sadkane πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 479 KB

For linear descriptor systems of the form BαΊ‹ = Ax + Cu, y = Ox, this paper constructs reduced order systems associated with a given part of the finite spectrum of the pencil It is known that the reduction can be obtained by a block diagonalization of the generalized Schur decomposition of P(Ξ»). In

Some aspects of the optimal control of n
Some aspects of the optimal control of non-linear descriptor systems
✍ P.C. MΓΌller πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 611 KB

The modification of the algorithms of the calculus of variations and Pontryagin's maximum principle required for them to be applicable to non-linear descriptor control systems is demonstrated. The classical calculus of variations is still applicable in optimization without constraints on the control