Controllability completion problems of partial upper triangular matrices∗
Cristina Jordán, Juan Ramon Torregrosa, Ana M. Urbano · Linear and Multilinear Algebra · 2000
The main result of this paper states sufficient conditions for the existence of a completion Ac of an n × n partial upper triangular matrix A, such that the pair (Ac B) has prescribed controllability indices, being B an n×m matrix. If A is a partial Hessenberg matrix some conditions may be dropped. An algorithm that obtains a completion Ac of A such that pair (Ac ek ) is completely controllable, where ek is a unit vector, is used to proof the results.