{"title":"通过 BCR 迭代法求解周期耦合算子矩阵方程及其在周期性状态反馈极点分配中的应用","authors":"Wenling Wang, Caiqin Song","doi":"10.1108/ec-03-2024-0177","DOIUrl":null,"url":null,"abstract":"<h3>Purpose</h3>\n<p>The paper aims to study the constraint solutions of the periodic coupled operator matrix equations by the biconjugate residual algorithm. The new algorithm can solve a lot of constraint solutions including Hamiltonian solutions and symmetric solutions, as special cases. At the end of this paper, the new algorithm is applied to the pole assignment problem.</p><!--/ Abstract__block -->\n<h3>Design/methodology/approach</h3>\n<p>When the studied periodic coupled operator matrix equations are consistent, it is proved that constraint solutions can converge to exact solutions. It is demonstrated that the solutions of the equations can be obtained by the new algorithm with any arbitrary initial matrices without rounding error in a finite number of iterative steps. In addition, the least norm-constrained solutions can also be calculated by selecting any initial matrices when the equations of the periodic coupled operator matrix are inconsistent.</p><!--/ Abstract__block -->\n<h3>Findings</h3>\n<p>Numerical examples show that compared with some existing algorithms, the proposed method has higher convergence efficiency because less data are used in each iteration and the data is sufficient to complete an update. It not only has the best convergence accuracy but also requires the least running time for iteration, which greatly saves memory space.</p><!--/ Abstract__block -->\n<h3>Originality/value</h3>\n<p>Compared with previous algorithms, the main feature of this algorithm is that it can synthesize these equations together to get a coupled operator matrix equation. Although the equation of this paper contains multiple submatrix equations, the algorithm in this paper only needs to use the information of one submatrix equation in the equation of this paper in each iteration so that different constraint solutions of different (coupled) matrix equations can be studied for this class of equations. However, previous articles need to iterate on a specific constraint solution of a matrix equation separately.</p><!--/ Abstract__block -->","PeriodicalId":50522,"journal":{"name":"Engineering Computations","volume":"535 1","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving the periodic coupled operator matrix equations via BCR iterative method and its application in periodic state feedback pole assignment\",\"authors\":\"Wenling Wang, Caiqin Song\",\"doi\":\"10.1108/ec-03-2024-0177\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3>Purpose</h3>\\n<p>The paper aims to study the constraint solutions of the periodic coupled operator matrix equations by the biconjugate residual algorithm. The new algorithm can solve a lot of constraint solutions including Hamiltonian solutions and symmetric solutions, as special cases. At the end of this paper, the new algorithm is applied to the pole assignment problem.</p><!--/ Abstract__block -->\\n<h3>Design/methodology/approach</h3>\\n<p>When the studied periodic coupled operator matrix equations are consistent, it is proved that constraint solutions can converge to exact solutions. It is demonstrated that the solutions of the equations can be obtained by the new algorithm with any arbitrary initial matrices without rounding error in a finite number of iterative steps. In addition, the least norm-constrained solutions can also be calculated by selecting any initial matrices when the equations of the periodic coupled operator matrix are inconsistent.</p><!--/ Abstract__block -->\\n<h3>Findings</h3>\\n<p>Numerical examples show that compared with some existing algorithms, the proposed method has higher convergence efficiency because less data are used in each iteration and the data is sufficient to complete an update. It not only has the best convergence accuracy but also requires the least running time for iteration, which greatly saves memory space.</p><!--/ Abstract__block -->\\n<h3>Originality/value</h3>\\n<p>Compared with previous algorithms, the main feature of this algorithm is that it can synthesize these equations together to get a coupled operator matrix equation. Although the equation of this paper contains multiple submatrix equations, the algorithm in this paper only needs to use the information of one submatrix equation in the equation of this paper in each iteration so that different constraint solutions of different (coupled) matrix equations can be studied for this class of equations. However, previous articles need to iterate on a specific constraint solution of a matrix equation separately.</p><!--/ Abstract__block -->\",\"PeriodicalId\":50522,\"journal\":{\"name\":\"Engineering Computations\",\"volume\":\"535 1\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Computations\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1108/ec-03-2024-0177\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Computations","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1108/ec-03-2024-0177","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Solving the periodic coupled operator matrix equations via BCR iterative method and its application in periodic state feedback pole assignment
Purpose
The paper aims to study the constraint solutions of the periodic coupled operator matrix equations by the biconjugate residual algorithm. The new algorithm can solve a lot of constraint solutions including Hamiltonian solutions and symmetric solutions, as special cases. At the end of this paper, the new algorithm is applied to the pole assignment problem.
Design/methodology/approach
When the studied periodic coupled operator matrix equations are consistent, it is proved that constraint solutions can converge to exact solutions. It is demonstrated that the solutions of the equations can be obtained by the new algorithm with any arbitrary initial matrices without rounding error in a finite number of iterative steps. In addition, the least norm-constrained solutions can also be calculated by selecting any initial matrices when the equations of the periodic coupled operator matrix are inconsistent.
Findings
Numerical examples show that compared with some existing algorithms, the proposed method has higher convergence efficiency because less data are used in each iteration and the data is sufficient to complete an update. It not only has the best convergence accuracy but also requires the least running time for iteration, which greatly saves memory space.
Originality/value
Compared with previous algorithms, the main feature of this algorithm is that it can synthesize these equations together to get a coupled operator matrix equation. Although the equation of this paper contains multiple submatrix equations, the algorithm in this paper only needs to use the information of one submatrix equation in the equation of this paper in each iteration so that different constraint solutions of different (coupled) matrix equations can be studied for this class of equations. However, previous articles need to iterate on a specific constraint solution of a matrix equation separately.
期刊介绍:
The journal presents its readers with broad coverage across all branches of engineering and science of the latest development and application of new solution algorithms, innovative numerical methods and/or solution techniques directed at the utilization of computational methods in engineering analysis, engineering design and practice.
For more information visit: http://www.emeraldgrouppublishing.com/ec.htm