Accessibility navigation


Conversion of descriptor representations to state-space form: an extension of the shuffle algorithm

Galvão, R. K. H., Kienitz, K. H. and Hadjiloucas, S. (2018) Conversion of descriptor representations to state-space form: an extension of the shuffle algorithm. International Journal of Control, 91 (10). pp. 2199-2213. ISSN 0020-7179

[img]
Preview
Text (Open Access) - Published Version
· Available under License Creative Commons Attribution.
· Please see our End User Agreement before downloading.

1MB
[img] Text - Accepted Version
· Restricted to Repository staff only

546kB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1080/00207179.2017.1336671

Abstract/Summary

This paper proposes a systematic procedure for the determination of state-space models from an available descriptor representation of a linear dynamic system. The goal is to determine a state equation, a set of algebraic equations and an output equation in terms of the state and input variables. It is shown that standard methods may fail to convert the descriptor representation to state-space form, even for simple electrical circuit models obtained from Kirchoff’s laws and constitutive element equations. A novel procedure to address this problem is then proposed as an extension of the classic shuffle algorithm combined with a singular value decomposition approach. In addition to an illustrative example involving a simple electrical circuit, the proposed method is employed in a case study involving the modeling of three-dimensional RLC networks with a large number of components.

Item Type:Article
Refereed:Yes
Divisions:Faculty of Life Sciences > School of Biological Sciences > Department of Bio-Engineering
ID Code:70606
Publisher:Taylor & Francis

Downloads

Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation