Skip Navigation

IMA Journal of Mathematical Control and Information 2005 22(1):12-25; doi:10.1093/imamci/dni002
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Antoniou, E. N.
Right arrow Articles by Vardulakis, A. I. G.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Institute of Mathematics and its Applications 2005; all rights reserved. For permissions please email: journals.permissions@oupjournals.org

On the computation and parametrization of proper denominator assigning compensators for strictly proper plants

E. N. Antoniou * and A. I. G. Vardulakis §

Department of Mathematics, Aristotle University of Thessaloniki, 54006 - Thessaloniki, Greece  *

Given a right coprime MFD of a strictly proper plant P(s) = NR(s) DR(s)–1 with DR(s) column proper a simple numerical algorithm is derived for the computation of all polynomial solutions [XL(s), YL(s)] of the polynomial matrix Diophantine equation XL(s) DR(s) + YL(s) NR(s) = DC(s) which give rise to the class {Phi} (P, DC) of proper compensators C(s) colone XL(s)–1 YL(s) that when employed in a unity feedback loop, result in closed-loop systems S(P, C) with a desired denominator DC(s). The parametrization of the proper compensators C(s) {Phi}(P, DC) is obtained and the number of independent parameters in the parametrization is given.

Keywords: linear multivariable control; coprime factorizations; diophantine euqations.


Received on 1 August 2003.

* Corresponding author. Email: antoniou{at}math.auth.gr

§ Email: avardula{at}auth.gr


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.