A general approach to the eigenstructure assignment for reachability and stabilizability subspaces

Access Status

Authors

Date

Type

Metadata

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.

Citation

Ntogramatzidis, 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.

Related items

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 ...

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 ...

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 ...