Document Type
Thesis
Date of Award
5-31-1989
Degree Name
Master of Science in Electrical Engineering - (M.S.)
Department
Electrical Engineering
First Advisor
Yun Q. Shi
Second Advisor
Frederick D. Chichester
Third Advisor
Chung H. Lu
Abstract
In system design, the coefficients of a characterizing polynomial are usually not precisely known but can be bounded from above and below by real numbers. The requirement of robust system design from the stability standpoint demands, then, the guaranteeing of the stability of a set of polynomials.
Stability theorems for continuous-time systems and discrete-time systems, are studied in this report. It is shown that one more condition has to be included into each of the theorem. The revised theorem for continuous-time systems is proved through network realizability theory. The one for discrete-time systems is, then, proved via the use of a bilinear transform. The even (odd) part of a characteristic polynomial in continuous-time domain and the symmetric (antisymmetric) part of the bilinearly transformed polynomial in discrete-time domain are, thus, shown to be the bilinear transform pair.
Kharitonov gave an elegant and simple stability criterion for a set of interval polynomials in continuous-time systems. An attempt is made to obtain similar results for discrete-time systems having complex coefficients via network realizability.
Recommended Citation
Rasiah, Sri Indran, "Network realizability approach to robust stability of discrete-time systems characterized by polynomials" (1989). Theses. 2873.
https://digitalcommons.njit.edu/theses/2873
