On Eigenstructure Assignment by Gain Output Feedback

Non-iterative pole placement technique: A step further

“…Actually, they are a bit constrained since they have to comply with (16) and to lead to independent eigenvectors v i ¼ N j z j , which is almost always true.…”

“…Spectrum assignment under Kimura's condition has been tackled in [16][17][18]. These references do not solve exactly equivalent problems since the desired spectrum is less constrained in [18].…”

“…This set is the so-called ðA; BÞ-characteristic subspace [16] and is of dimension m when ðA; BÞ is controllable. To derive v i in S i , let the vectors p i be defined by…”

An LFT approach to robust gain scheduling

“…A similar result in the MIMO case would extend generic properties (see, e.g. [13]). In other words, this problem would consist of checking the exclusion of an algebraic subspace of zero measure (genericity) from the unit ball (with non-zero measure).…”

“…Note that in the matrix case, the inversions appearing in Algorithms 3.1 and 3.3 are generically feasible ( [13]). In the LFT case we don't accept any degeneracy in the unit ball, even in an algebraic subspace of zero measure.…”