A Constructive Positive Realization with Sparse Matrices fora Continuous-Time Positive Linear System

Abstract EN

This paper discusses a computational method to construct positive realizations with sparse matrices for continuous-time positive linear systems with multiple complex poles.

To construct a positive realization of a continuous-time system, we use a Markov sequence similar to the impulse response sequence that is used in the discrete-time case.

The existence of the proposed positive realization can be analyzed with the concept of a polyhedral convex cone.

We provide a constructive algorithm to compute positive realizations with sparse matrices of some positive systems under certain conditions.

A sufficient condition for the existence of a positive realization, under which the proposed constructive algorithm works well, is analyzed.