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

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 seque...

Full description

Bibliographic Details
Main Author: Kyungsup Kim
Format: Article
Language:English
Published: Hindawi Limited 2013-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2013/878146
id doaj-4b33869242134a009fb00938088e28bf
record_format Article
spelling doaj-4b33869242134a009fb00938088e28bf2020-11-24T20:40:36ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472013-01-01201310.1155/2013/878146878146A Constructive Positive Realization with Sparse Matrices for a Continuous-Time Positive Linear SystemKyungsup Kim0Department of Computer Engineering, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon 305-764, Republic of KoreaThis 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.http://dx.doi.org/10.1155/2013/878146
collection DOAJ
language English
format Article
sources DOAJ
author Kyungsup Kim
spellingShingle Kyungsup Kim
A Constructive Positive Realization with Sparse Matrices for a Continuous-Time Positive Linear System
Mathematical Problems in Engineering
author_facet Kyungsup Kim
author_sort Kyungsup Kim
title A Constructive Positive Realization with Sparse Matrices for a Continuous-Time Positive Linear System
title_short A Constructive Positive Realization with Sparse Matrices for a Continuous-Time Positive Linear System
title_full A Constructive Positive Realization with Sparse Matrices for a Continuous-Time Positive Linear System
title_fullStr A Constructive Positive Realization with Sparse Matrices for a Continuous-Time Positive Linear System
title_full_unstemmed A Constructive Positive Realization with Sparse Matrices for a Continuous-Time Positive Linear System
title_sort constructive positive realization with sparse matrices for a continuous-time positive linear system
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2013-01-01
description 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.
url http://dx.doi.org/10.1155/2013/878146
work_keys_str_mv AT kyungsupkim aconstructivepositiverealizationwithsparsematricesforacontinuoustimepositivelinearsystem
AT kyungsupkim constructivepositiverealizationwithsparsematricesforacontinuoustimepositivelinearsystem
_version_ 1716826336969883648