TY - JOUR
T1 - EIGENVALUE ASSIGNMENT IN LINEAR OPTIMAL-CONTROL SYSTEMS VIA REDUCED-ORDER MODELS.
AU - Rao, S. Vittal
AU - Lamba, S. S.
PY - 1975
Y1 - 1975
N2 - Algorithms are currently available for the solution of certain types of optimal-eigenvalue-assignment problems in which the eigenvalues of a given system are required to be shifted into preassigned locations or region while also minimizing an appropriate quadratic-performance criterion. All the known methods for a solution of the above problem are based on manipulation of the original nth-order system matrices even if only r eigenvalues (r less than n) of the original system are to be reassigned. On the contrary, the method proposed in this paper, for a solution of the above problem, employs an rth-order equivalent model, which leads to a solution via manipulation of rth-order matrices only. The method also ensures that the remaining n-r eigenvalues of the original system are not disturbed and are carried over to the resultant feedback system. It is shown that the suggested procedure brings about a considerable saving in computation time, and also requires less computer storage. Two numerical examples have been included.
AB - Algorithms are currently available for the solution of certain types of optimal-eigenvalue-assignment problems in which the eigenvalues of a given system are required to be shifted into preassigned locations or region while also minimizing an appropriate quadratic-performance criterion. All the known methods for a solution of the above problem are based on manipulation of the original nth-order system matrices even if only r eigenvalues (r less than n) of the original system are to be reassigned. On the contrary, the method proposed in this paper, for a solution of the above problem, employs an rth-order equivalent model, which leads to a solution via manipulation of rth-order matrices only. The method also ensures that the remaining n-r eigenvalues of the original system are not disturbed and are carried over to the resultant feedback system. It is shown that the suggested procedure brings about a considerable saving in computation time, and also requires less computer storage. Two numerical examples have been included.
UR - http://www.scopus.com/inward/record.url?scp=0016465299&partnerID=8YFLogxK
U2 - 10.1049/piee.1975.0047
DO - 10.1049/piee.1975.0047
M3 - Article
AN - SCOPUS:0016465299
SN - 0020-3270
VL - 122
SP - 197
EP - 201
JO - Proceedings of the Institution of Electrical Engineers
JF - Proceedings of the Institution of Electrical Engineers
IS - 2
ER -