{"title":"A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices","authors":"R. Byers","doi":"10.1137/0909059","DOIUrl":null,"url":null,"abstract":"We describe a bisection method to determine the 2-norm and Frobenius norm distances from a given matrix A to the nearest matrix with an eigenvalue on the imaginary axis. If A is stable in the sense that its eigenvalues lie in the open-left half plane, then this distance measures how “nearly unstable“ A is. Each step provides either a rigorous upper bound or a rigorous lower bound on the distance. A few bisection steps can bracket the distance within an order of magnitude. Bisection avoids the difficulties associated with nonlinear minimization techniques and the occasional failures associated with heuristic estimates. We show how the method might be used to estimate the distance to the nearest matrix with an eigenvalue on the unit circle.","PeriodicalId":200176,"journal":{"name":"Siam Journal on Scientific and Statistical Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"237","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Siam Journal on Scientific and Statistical Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/0909059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 237
Abstract
We describe a bisection method to determine the 2-norm and Frobenius norm distances from a given matrix A to the nearest matrix with an eigenvalue on the imaginary axis. If A is stable in the sense that its eigenvalues lie in the open-left half plane, then this distance measures how “nearly unstable“ A is. Each step provides either a rigorous upper bound or a rigorous lower bound on the distance. A few bisection steps can bracket the distance within an order of magnitude. Bisection avoids the difficulties associated with nonlinear minimization techniques and the occasional failures associated with heuristic estimates. We show how the method might be used to estimate the distance to the nearest matrix with an eigenvalue on the unit circle.