{"title":"An algorithm to assign canonical forms by state feedback","authors":"B. Datta, K. Datta","doi":"10.1109/CDC.1989.70600","DOIUrl":null,"url":null,"abstract":"A procedure for assigning an arbitrary normalized Hessenberg matrix is presented. Specifically, given a controller-Hessenberg pair (A,b) and a normalized upper Hessenberg matrix B, the algorithm computes an upper triangular matrix L=(l/sub ij/) and a row vector f/sup T/ such that L(A-b/sup T/f/sup T/)L/sup -1/=B/sup T/. It is formulated in such a way that the columns of L can be scaled to have unit lengths. Since the class of normalized Hessenberg matrices contains important canonical forms, such as companion, Schwarz, Rough, a Jordan matrix associated with a single eigenvalue, or any bidiagonal matrix having its eigenvalues on the diagonal, the method can be used to assign all these important canonical forms and also an arbitrary set of eigenvalues. After the initial reduction to the Hessenberg form, the method requires only the evaluation of a simple recursion, which becomes extremely simplified in all of these cases. It is also easy to program on a computer. A theoretical operations count suggests that the method is more efficient as an eigenvalue-assignment procedure than the best-known previous procedures.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"885 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 28th IEEE Conference on Decision and Control,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1989.70600","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
A procedure for assigning an arbitrary normalized Hessenberg matrix is presented. Specifically, given a controller-Hessenberg pair (A,b) and a normalized upper Hessenberg matrix B, the algorithm computes an upper triangular matrix L=(l/sub ij/) and a row vector f/sup T/ such that L(A-b/sup T/f/sup T/)L/sup -1/=B/sup T/. It is formulated in such a way that the columns of L can be scaled to have unit lengths. Since the class of normalized Hessenberg matrices contains important canonical forms, such as companion, Schwarz, Rough, a Jordan matrix associated with a single eigenvalue, or any bidiagonal matrix having its eigenvalues on the diagonal, the method can be used to assign all these important canonical forms and also an arbitrary set of eigenvalues. After the initial reduction to the Hessenberg form, the method requires only the evaluation of a simple recursion, which becomes extremely simplified in all of these cases. It is also easy to program on a computer. A theoretical operations count suggests that the method is more efficient as an eigenvalue-assignment procedure than the best-known previous procedures.<>