Authors:
Kyungsup Kim
and
Jaecheol Ryou
Affiliation:
Chungnam National University, Korea, Republic of
Keyword(s):
Positive Realization, Positive Linear System, Metzler Matrix, Polyhedra Cone.
Related
Ontology
Subjects/Areas/Topics:
Adaptive Signal Processing and Control
;
Biomedical Engineering
;
Biomedical Signal Processing
;
Informatics in Control, Automation and Robotics
;
Modeling, Analysis and Control of Hybrid Dynamical Systems
;
Optimization Problems in Signal Processing
;
Signal Processing, Sensors, Systems Modeling and Control
;
System Identification
;
Time and Frequency Response
;
Time-Frequency Analysis
Abstract:
This paper discusses the realization problem of a class of linear-invariant system, in which state variables, input and output are restricted to be nonnegative to reflect physical constraints. This paper presents an efficient and general algorithm of positive realization for positive continuous-time linear systems in the case of transfer function with (multiple) real or complex poles. The solution of the corresponding problem for continuous-time positive is deduced from the discrete-time case by a transformation. We deal with the positive realization problem through convex cone analysis. We provide a simple general and unified construction method for the positive realization of the transfer function, which has multiple poles, upper-bound and a sparse realization matrix. We consider a sufficient condition of positive realization.