Robust and well-conditioned eigenstructu
β
R. K. Cavin Iii; S. P. Bhattacharyya
π
Article
π
1983
π
John Wiley and Sons
π
English
β 335 KB
An algorithmic solution is given for the problem of calculating a pole assignment matrix F that makes the eigenvector matrix of A + BF well-conditioned with respect to inversion, or equivalently, maximally orthonormal. This causes A + BF to have low eigenvalue sensitivity. The algorithm relies on a