Robust and well-conditioned eigenstructure assignment via sylvester's equation

✍ Scribed by R. K. Cavin Iii; S. P. Bhattacharyya

• Publisher: John Wiley and Sons
• Year: 1983
• Tongue: English
• Weight: 335 KB
• Volume: 4
• Category: Article
• ISSN: 0143-2087
• DOI: 10.1002/oca.4660040302

✦ Synopsis

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 solution of Sylvester's equation and does not involve co-ordinate transformations or canonical forms. These results are steps in the direction of transforming pole assignment theory into an effective design tool for control systems.