{"title":"新的极点放置算法:多项式矩阵法","authors":"B. Shafai, L. Keel","doi":"10.23919/ACC.1990.4791020","DOIUrl":null,"url":null,"abstract":"A simple and direct pole placement algorithm is introduced for dynamical systems having a block companion matrix A. The algorithm utilizes well established properties of matrix polynomials. Pole placement is achieved by appropriately assigning coefficient matrices of the corresponding matrix polynomial. This involves only matrix additions and multiplications without requiring matrix inversion. A numerical example is given for the purpose of illustration.","PeriodicalId":307181,"journal":{"name":"1990 American Control Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New Pole Placement Algorithm: Polynomial Matrix Approach\",\"authors\":\"B. Shafai, L. Keel\",\"doi\":\"10.23919/ACC.1990.4791020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A simple and direct pole placement algorithm is introduced for dynamical systems having a block companion matrix A. The algorithm utilizes well established properties of matrix polynomials. Pole placement is achieved by appropriately assigning coefficient matrices of the corresponding matrix polynomial. This involves only matrix additions and multiplications without requiring matrix inversion. A numerical example is given for the purpose of illustration.\",\"PeriodicalId\":307181,\"journal\":{\"name\":\"1990 American Control Conference\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1990 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ACC.1990.4791020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1990 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ACC.1990.4791020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New Pole Placement Algorithm: Polynomial Matrix Approach
A simple and direct pole placement algorithm is introduced for dynamical systems having a block companion matrix A. The algorithm utilizes well established properties of matrix polynomials. Pole placement is achieved by appropriately assigning coefficient matrices of the corresponding matrix polynomial. This involves only matrix additions and multiplications without requiring matrix inversion. A numerical example is given for the purpose of illustration.