Robust eigenstructure assignment in the computation of friends of output-nulling subspaces
MetadataShow full item record
In this paper we develop a strategy for the computation of basis matrices of output-nulling subspaces, as well as of reachability and stabilisability output-nulling subspaces, with the simultaneous computation of the corresponding friend that also delivers a robust closed-loop eigenstructure. We show that the methods introduced in this paper offer considerably more robust eigenstructure assignment than the other commonly used methods employing subspace recursions.
Copyright © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Showing items related by title, author, creator and subject.
Gupta, Sunil Kumar (2011)The growing number of information sources has given rise to joint analysis. While the research community has mainly focused on analyzing data from a single source, there has been relatively few attempts on jointly analyzing ...
Pham, DucSon; Arandjelovic, O.; Venkatesh, S. (2016)We propose an effective subspace selection scheme as a post-processing step to improve results obtained by sparse subspace clustering (SSC). Our method starts by the computation of stable subspaces using a novel random ...
Chen, X.; Fan, K.; Liu, Wan-Quan; Zhang, X.; Xue, M. (2014)Manifold learning aims to map the original data from a high-dimensional space into a low-dimensional feature space with possible better discriminative structure. In this paper, we propose a supervised manifold learning ...