Abstract
In this paper we initiate a program to study the controllability properties of matrix eigenvalue algorithms arising in numerical linear algebra. Our focus is on a well-known eigenvalue method, the inverse power iteration defined on projective space. A complete characterization of the reachable sets and their closures is given via cyclic invariant subspaces. Moreover, a necessary and sufficient condition for almost controllability of the inverse power method is derived.
Original language | English |
---|---|
Pages (from-to) | 57-66 |
Number of pages | 10 |
Journal | Systems and Control Letters |
Volume | 41 |
Issue number | 1 |
DOIs | |
State | Published - 15 Sep 2000 |
Keywords
- Controllability
- Eigenvalue method
- Invariant subspaces
- Projective space
ASJC Scopus subject areas
- Control and Systems Engineering
- General Computer Science
- Mechanical Engineering
- Electrical and Electronic Engineering