Skip Navigation

IMA Journal of Mathematical Control and Information 1998 15(1):53-62; doi:10.1093/imamci/15.1.53
© 1998 by Institute of Mathematics and its Applications
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 DEBELIKOVIC, D. L.
Right arrow Articles by MILINKOVIC, S. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Lyapunov analysis of stability robustness for discrete linear descriptor systems

D. LJ DEBELIKOVIC1, V. B. BAJIC2, T. N. ERIC1 and S. A. MILINKOVIC3

1Department of Control Engineering, Faculty of Mechanical Engineering, University of Belgrade 27 Marta 80, 11000 Beograd, Yugoslavia
2Centre for Engineering Research, Technikon Natal P.O. Box 953, Durban 4000, Republic of South Africa
3System Control Group, Faculty of Technology and Metallurgy, University of Belgrade Karnegijeva 4, Beograd, Yugoslavia

Discrete descriptor systems are those for which the dynamics are governed by a mixture of algebraic and difference equations. This paper examines the existence of solutions that are attracted by the origin of the phase space, for regular and irregular discrete linear descriptor systems. By a suitable transformation, the original system is transformed to a convenient form that enables development and easy application of Lyapunov's direct method for the existence analysis of a subclass of solutions characterized by convergence to the origin. A potential (weak) domain of attraction of the origin is underestimated on the basis of a symmetric positive definite solution of a reduced-order discrete Lyapunov matrix equations. Also, it has been shown that the same result can be efficiently used in determining quantitative measures of robustness for a class of perturbed discrete linear descriptor systems.


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.