{"title":"A rank-updating technique for the Kronecker canonical form of singular pencils","authors":"Dimitrios Christou , Marilena Mitrouli , Dimitrios Triantafyllou","doi":"10.1016/j.apnum.2024.01.015","DOIUrl":null,"url":null,"abstract":"<div><div>For a linear time-invariant system <span><math><mover><mrow><mi>x</mi></mrow><mrow><mo>˙</mo></mrow></mover><mo>(</mo><mi>t</mi><mo>)</mo><mo>=</mo><mi>A</mi><mi>x</mi><mo>(</mo><mi>t</mi><mo>)</mo><mo>+</mo><mi>B</mi><mi>u</mi><mo>(</mo><mi>t</mi><mo>)</mo></math></span><span>, the Kronecker canonical form<span> (KCF) of the matrix pencil </span></span><span><math><mo>(</mo><mi>s</mi><mi>I</mi><mo>−</mo><mi>A</mi><mspace></mspace><mo>|</mo><mspace></mspace><mi>B</mi><mo>)</mo></math></span><span> provides the controllability indices, also called column minimal indices, of the system and their sum corresponds to the dimension of the controllable subspace. In this paper we introduce a fast numerical algorithm for computing the sets of column/row minimal indices of a singular pencil </span><span><math><mi>s</mi><mi>F</mi><mo>−</mo><mi>G</mi></math></span><span> using a rank-updating technique and the properties of piecewise arithmetic progression sequences defined by the size of the null spaces of appropriate Toeplitz matrices. The method is demonstrated and tested on various data sets.</span></div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 135-145"},"PeriodicalIF":2.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Numerical Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168927424000151","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
For a linear time-invariant system , the Kronecker canonical form (KCF) of the matrix pencil provides the controllability indices, also called column minimal indices, of the system and their sum corresponds to the dimension of the controllable subspace. In this paper we introduce a fast numerical algorithm for computing the sets of column/row minimal indices of a singular pencil using a rank-updating technique and the properties of piecewise arithmetic progression sequences defined by the size of the null spaces of appropriate Toeplitz matrices. The method is demonstrated and tested on various data sets.
期刊介绍:
The purpose of the journal is to provide a forum for the publication of high quality research and tutorial papers in computational mathematics. In addition to the traditional issues and problems in numerical analysis, the journal also publishes papers describing relevant applications in such fields as physics, fluid dynamics, engineering and other branches of applied science with a computational mathematics component. The journal strives to be flexible in the type of papers it publishes and their format. Equally desirable are:
(i) Full papers, which should be complete and relatively self-contained original contributions with an introduction that can be understood by the broad computational mathematics community. Both rigorous and heuristic styles are acceptable. Of particular interest are papers about new areas of research, in which other than strictly mathematical arguments may be important in establishing a basis for further developments.
(ii) Tutorial review papers, covering some of the important issues in Numerical Mathematics, Scientific Computing and their Applications. The journal will occasionally publish contributions which are larger than the usual format for regular papers.
(iii) Short notes, which present specific new results and techniques in a brief communication.