A constructive positive realization with sparse matrices for a continuous-time positive linear system (Q474707)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A constructive positive realization with sparse matrices for a continuous-time positive linear system |
scientific article; zbMATH DE number 6373223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A constructive positive realization with sparse matrices for a continuous-time positive linear system |
scientific article; zbMATH DE number 6373223 |
Statements
A constructive positive realization with sparse matrices for a continuous-time positive linear system (English)
0 references
24 November 2014
0 references
Summary: 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.
0 references
0.8017296195030212
0 references
0.7890785932540894
0 references
0.786236584186554
0 references
0.7774419784545898
0 references