Show simple item record

dc.contributor.authorNtogramatzidis, Lorenzo
dc.contributor.authorPadula, Fabrizio
dc.date.accessioned2017-08-24T02:21:39Z
dc.date.available2017-08-24T02:21:39Z
dc.date.created2017-08-23T07:21:41Z
dc.date.issued2017
dc.identifier.citationNtogramatzidis, L. and Padula, F. 2017. A general approach to the eigenstructure assignment for reachability and stabilizability subspaces. Systems and Control Letters. 106: pp. 58-67.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/55957
dc.identifier.doi10.1016/j.sysconle.2017.06.003
dc.description.abstract

This paper is concerned with the problem of determining basis matrices for the supremal output-nulling, reachability and stabilizability subspaces, and the simultaneous computation of the associated friends that place the assignable closed-loop eigenvalues at desired locations. Our aim is to show that the Moore–Laub algorithm in Moore and Laub (1978) for the computation of these subspaces was stated under unnecessary restrictive assumptions. We prove the same result under virtually no system-theoretic hypotheses. This provides a theoretical foundation to a range of recent geometric techniques that are more efficient and robust, and as general as the standard ones based on the computation of sequences of subspaces.

dc.publisherElsevier BV
dc.titleA general approach to the eigenstructure assignment for reachability and stabilizability subspaces
dc.typeJournal Article
dcterms.source.volume106
dcterms.source.startPage58
dcterms.source.endPage67
dcterms.source.issn0167-6911
dcterms.source.titleSystems and Control Letters
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusFulltext not available


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record