On the computation of reachability, stabilisability and output-nulling subspaces using the Rosenbrock system matrix
MetadataShow full item record
In this paper we offer a set of algorithms for the computation of the fundamental subspaces of linear time invariant (LTI) systems, which appear in the solution of a large number of control and estimation problems. In particular, we employ the Rosenbrock system matrix pencil to provide algorithms for the computation of output-nulling, reachability and stabilisability subspaces. We show via an example that these methods can offer superior reliability than other commonly used methods employing subspace recursions.
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 ...