On the computation of the fundamental subspaces for descriptor systems
Abstract
In this paper, we investigate several theoretical and computational aspects of fundamental subspaces for linear time-invariant descriptor systems, which appear in the solution of many control and estimation problems. Different types of reachability and controllability for descriptor systems are described and discussed. The Rosenbrock system matrix pencil is employed for the computation of supremal output-nulling subspaces and supremal output-nulling reachability subspaces for descriptor systems.
Citation
Source Title
ISSN
School
Remarks
This is an Author's Original Manuscript of an article published by Taylor & Francis in the International Journal of Control on 12/02/2016 available online at http://www.tandfonline.com/10.1080/00207179.2015.1135510
Collection
Related items
Showing items related by title, author, creator and subject.
-
Kazantzidou, Christina; Ntogramatzidis, Lorenzo (2016)This paper deals with the computation of basis matrices of output-nulling and reachability subspaces for linear time-invariant (LTI) descriptor systems, which have been found to appear in the solution of many control and ...
-
Gupta, Sunil; Phung, Dinh; Adams, Brett; Tran, Truyen; Venkatesh, Svetha (2010)Although tagging has become increasingly popular in online image and video sharing systems, tags are known to be noisy, ambiguous, incomplete and subjective. These factors can seriously affect the precision of a social ...
-
Zhang, G.; Wang, S.; Liu, Wan-quan; Zuo, Z. (2009)This paper deals with the problem of H∞ norm computation for general symmetric systems and descriptor symmetric systems. The computation of H∞ norm for state-space symmetric systems is extended to descriptor symmetric ...