Strict Positive Realness of Descriptor Systems in State Space

In this paper we give necessary and sufficient spectral conditions for various notions of strict positive realness for single input single output, impulse free Descriptor Systems. These conditions only require calculation of eigenvalues of a single matrix. A characterization of a KYP-like lemma for descriptor systems is also derived, and its implications for the stability of a class of switched descriptor systems are briefly discussed

New positive realness conditions for uncertain discrete descriptor systems: Analysis and synthesis

This paper deals with the problems of positive real (PR) analysis and PR control for uncertain discrete-time descriptor systems. The parameter uncertainties are assumed to be time-invariant norm bounded and appear in both the state and input matrices. A new necessary and sufficient condition for a discrete-time descriptor system to be regular, causal, stable and extended strictly PR (ESPR) is proposed in terms of a strict linear matrix inequality. Based on this, the concepts of strong robust admissibility with ESPR and strong robust admissibilizability with ESPR were introduced. Without any additional assumptions on the system matrices, necessary and sufficient conditions for strong robust admissibility with ESPR and strong robust admissibilizability with ESPR are obtained. Through these results, the problems of PR analysis and PR control are solved. Furthermore, an explicit expression of a desired state feedback controller is also given, which involves no decomposition of the system matrices. © 2004 IEEE.published_or_final_versio

On positive realness of descriptor systems

In this brief, the positive realness of descriptor systems is studied. For the continuous-time case, two positive real lemmas are given, based on a generalized algebraic Riccati equation and inequality respectively. For the discrete-time case, the positive real lemma is given in terms of a generalized algebraic Riccati inequality.published_or_final_versio

Structured backward errors for eigenvalues of linear port-Hamiltonian descriptor systems

When computing the eigenstructure of matrix pencils associated with the passivity analysis of perturbed port-Hamiltonian descriptor system using a structured generalized eigenvalue method, one should make sure that the computed spectrum satisfies the symmetries that corresponds to this structure and the underlying physical system. We perform a backward error analysis and show that for matrix pencils associated with port-Hamiltonian descriptor systems and a given computed eigenstructure with the correct symmetry structure there always exists a nearby port-Hamiltonian descriptor system with exactly that eigenstructure. We also derive bounds for how near this system is and show that the stability radius of the system plays a role in that bound

Passivity check of S-Parameter descriptor systems via S-Parameter generalized hamiltonian methods

This paper extends the generalized Hamiltonian method (GHM) (Zhang , 2009; Zhang and Wong, 2010) and its half-size variant (HGHM) (Zhang and Wong, 2010) to their S-parameter counterparts (called S-GHM and S-HGHM, respectively), for testing the passivity of S-parameter descriptor-form models widely used in high-speed circuit and electromagnetic simulations. The proposed methods are capable of accurately detecting the possible nonpassive regions of descriptor-form models with either scattering or hybrid (impedance or admittance) transfer matrices. Their effectiveness and accuracy are verified with several practical examples. The S-GHM and S-HGHM methods presented here provide a foundation for the passivity enforcement of $S$- parameter descriptor systems. © 2006 IEEE.published_or_final_versio

Stability results for constrained dynamical systems

Differential-Algebraic Equations (DAE) provide an appropriate framework to model and analyse dynamic systems with constraints. This framework facilitates modelling of the system behaviour through natural physical variables of the system, while preserving the topological constraints of the system. The main purpose of this dissertation is to investigate stability properties of two important classes of DAEs. We consider some special cases of Linear Time Invariant (LTI) DAEs with control inputs and outputs, and also a special class of Linear switched DAEs. In the first part of the thesis, we consider LTI systems, where we focus on two properties: passivity and a generalization of passivity and small gain theorems called mixed property. These properties play an important role in the control design of large-scale interconnected systems. An important bottleneck for a design based on the aforementioned properties is their verification. Hence we intend to develop easily verifiable conditions to check passivity and mixedness of Single Input Single Output (SISO) and Multiple Input Multiple Output (MIMO) DAEs. For linear switched DAEs, we focus on the Lyapunov stability and this problem forms the basis for the second part of the thesis. In this part, we try to find conditions under which there exists a common Lyapunov function for all modes of the switched system, thus guaranteeing exponential stability of the switched system. These results are primarily developed for continuous-time systems. However, simulation and control design of a dynamic system requires a discrete-time representation of the system that we are interested in. Thus, it is critical to establish whether discrete-time systems, inherit fundamental properties of the continuous-time systems from which they are derived. Hence, the third part of our thesis is dedicated to the problems of preserving passivity, mixedness and Lyapunov stability under discretization. In this part, we examine several existing discretization methods and find conditions under which they preserve the stability properties discussed in the thesis

Stability results for constrained dynamical systems

Differential-Algebraic Equations (DAE) provide an appropriate framework to model and analyse dynamic systems with constraints. This framework facilitates modelling of the system behaviour through natural physical variables of the system, while preserving the topological constraints of the system. The main purpose of this dissertation is to investigate stability properties of two important classes of DAEs. We consider some special cases of Linear Time Invariant (LTI) DAEs with control inputs and outputs, and also a special class of Linear switched DAEs. In the first part of the thesis, we consider LTI systems, where we focus on two properties: passivity and a generalization of passivity and small gain theorems called mixed property. These properties play an important role in the control design of large-scale interconnected systems. An important bottleneck for a design based on the aforementioned properties is their verification. Hence we intend to develop easily verifiable conditions to check passivity and mixedness of Single Input Single Output (SISO) and Multiple Input Multiple Output (MIMO) DAEs. For linear switched DAEs, we focus on the Lyapunov stability and this problem forms the basis for the second part of the thesis. In this part, we try to find conditions under which there exists a common Lyapunov function for all modes of the switched system, thus guaranteeing exponential stability of the switched system. These results are primarily developed for continuous-time systems. However, simulation and control design of a dynamic system requires a discrete-time representation of the system that we are interested in. Thus, it is critical to establish whether discrete-time systems, inherit fundamental properties of the continuous-time systems from which they are derived. Hence, the third part of our thesis is dedicated to the problems of preserving passivity, mixedness and Lyapunov stability under discretization. In this part, we examine several existing discretization methods and find conditions under which they preserve the stability properties discussed in the thesis