Results 231 to 240 of about 53,587 (267)

Decompositions of Descriptor Systems

2004
In this chapter, we focus on the structural decomposition of a more general type of linear time-invariant systems, namely, linear descriptor systems. Descriptor systems, also commonly called singular or generalized systems in the literature, appear in many practical applications including engineering systems, economic systems, network analysis, and ...
Ben M. Chen, Zongli Lin, Yacov Shamash
openaire   +1 more source

Descriptor systems in the 1990s

29th IEEE Conference on Decision and Control, 1990
After briefly summarizing the growth in the theory of descriptors, or differential algebraic equations (DAEs), over the last two decades, the current challenges and potential successes are discussed. Among these major challenges facing DAE theory are: numerical software for index 3 systems; implicit Runge-Kutta code for low index problems; boundary ...
openaire   +1 more source

D-dissipativity analysis for descriptor systems

2008 American Control Conference, 2008
The paper is concerned with the D-dissipativity of descriptor systems, that is dissipativity with respect to a region in the complex plane. The region can be a half plane or a disc. It naturally covers continuous-time and discrete-time descriptor systems as special cases. Necessary and sufficient LMI conditions are provided to check the D-dissipativity.
O. Rejichi, Olivier Bachelier, Mohamed Chaabane, Driss Mehdi, T. Al-chaer   +4 more
openaire   +1 more source

Observers for descriptor systems

International Journal of Control, 1992
For a singular, non-causal descriptor system of order n, a (p — k)lh order observer is proposed where p =n — q, q is the number of infinite non-dynamic modes of the system and k is the rank of a matrix obtained from a transformed system derived by using the singular value decomposition.
openaire   +1 more source

An Identification Approach for Descriptor Systems

IEEE Control Systems Letters, 2023
Jiabao He, Xuan Zhang 0004, Feng Xu 0006, Xueqian Wang 0001   +3 more
openaire   +1 more source

Controllability of piecewise linear descriptor systems

Proceedings of the 2004 American Control Conference, 2004
The controllability of piecewise linear descriptor systems is considered in this paper. Necessary and sufficient geometric criteria for C-controllability and R-controllability of such systems are established, respectively. These conditions can be easily transformed into algebraic form. Furthermore, the intrinsic relationship between our results and the
Guangming Xie, Long Wang 0001
openaire   +1 more source

On Functional Observers for Descriptor Systems

2021 American Control Conference (ACC), 2021
Juhi Jaiswal, Mahendra Kumar Gupta, Nutan Kumar Tomar   +2 more
openaire   +1 more source

Inversion of Descriptor Systems

1983 American Control Conference, 1983
A modified form of the Luenberger shuffle algorithm and the Silverman structure algorithm are combined to form a descriptor system structure algorithm. This algorithm is used to extend known results on inversion of state-space systems to the case of descriptor systems.
openaire   +1 more source

Nonlinear Descriptor Systems

1999
Implicit or descriptor systems, F(x′, x, u, t) = 0, arise in many applications. Much of the early work on linear time invariant systems was done in the electrical engineering and control literature. Subsequent nonlinear and time varying results have tended to be in other areas.
S. L. Campbell, R. Nikoukhah, F. Delebecque   +2 more
openaire   +1 more source

Controllability of descriptor systems

International Journal of Control, 1987
Different concepts of controllability for descriptor systems Ex = Ax + Bu have been proposed and investigated. In this paper, their relationship, their interpretation in terms of the Kronecker canonical form of (E,A), and the implications in terms of pole assignment, regularity and robustness of the closed-loop system, are discussed.
openaire   +1 more source