Reachability and Observability of Periodic Descriptor Systems

نویسندگان

  • Eric King-Wah Chu
  • Hung-Yuan Fan
  • Wen-Wei Lin
چکیده

In the second-half of the last century, the development of systems and control theory, together with the achievements of digital control and signal processing, has set the stage for renewed interest in the study of periodic systems, both in continuous and discrete time; see, e.g., [24, 45, 36, 10, 43, 12] and the survey papers [3, 4]. This has been amplified by specific application demands in the aerospace realm [17, 25, 16], computer control of industrial processes [5] and communication systems [35, 10, 34, 44]. The number of contributions on linear time-varying discrete-time periodic systems has been increasing in recent times; see, e.g., [13, 15, 18, 37, 39, 40] and the references therein. This increasing interest in periodic systems has also been motivated by the large variety of processes that can be modelled through linear discrete-time periodic systems (e.g., multirate sampled-data systems, chemical processes, periodically time-varying filters and networks, and seasonal phenomena [2, 3, 7, 14, 23, 26, 42]). We consider here a periodic time-varying descriptor system of the form

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reachability/Observability Gramians and Balanced Realization of Periodic Descriptor Systems

In this paper necessary and sufficient conditions are derived for complete reachability and observability of periodic time-varying descriptor systems. Applying these conditions, the symmetric positive semi-definite reachability/observability Gramians are defined and can be shown to satisfy some projected generalized discrete-time periodic Lyapunov equations. We propose a numerical method for so...

متن کامل

Projected Generalized Discrete-Time Periodic Lyapunov Equations and Balanced Realization of Periodic Descriptor Systems

From the necessary and sufficient conditions for complete reachability and observability of periodic time-varying descriptor systems, the symmetric positive semi-definite reachability/observability Gramians are defined. These Gramians can be shown to satisfy some projected generalized discrete-time periodic Lyapunov equations. We propose a numerical method for solving these projected Lyapunov e...

متن کامل

Model Reduction of Periodic Descriptor Systems Using Balanced Truncation

Linear periodic descriptor systems represent a broad class of time evolutionary processes in micro-electronics and circuit simulation. In this paper, we consider discrete-time linear periodic descriptor systems and study the concepts of periodic reachability and observability Gramians. We also discuss a lifted representation of periodic descriptor systems and propose a balanced truncation model...

متن کامل

On Model Reduction for Periodic Descriptor Systems Using Balanced Truncation

Linear periodic descriptor systems represent a broad class of time evolutionary processes in micro-electronics and circuit simulation in particular. In this paper we consider discrete-time linear periodic descriptor systems and study the concepts of periodic reachability and observability of the systems based on earlier ideas of Chu et al. [1]. We define reachability and observability Gramians ...

متن کامل

On computing minimal realizations of periodic descriptor systems

We propose computationally efficient and numerically reliable algorithms to compute minimal realizations of periodic descriptor systems. The main computational tool employed for the structural analysis of periodic descriptor systems (i.e., reachability and observability) is the orthogonal reduction of periodic matrix pairs to Kronecker-like forms. Specializations of a general reduction algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005