{"title":"On computing nearest singular hankel matrices","authors":"M. Hitz","doi":"10.1145/1073884.1073909","DOIUrl":null,"url":null,"abstract":"We explore the problem of computing a nearest singular matrix to a given regular Hankel matrix while preserving the structure of the matrix. Nearness is measured in a matrix norm, or a componentwise norm. A recent result for structured condition numbers leads to an efficient algorithm in the spectral norm. We devise a parametrization of singular Hankel matrices, to discuss other norms.","PeriodicalId":311546,"journal":{"name":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1073884.1073909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
We explore the problem of computing a nearest singular matrix to a given regular Hankel matrix while preserving the structure of the matrix. Nearness is measured in a matrix norm, or a componentwise norm. A recent result for structured condition numbers leads to an efficient algorithm in the spectral norm. We devise a parametrization of singular Hankel matrices, to discuss other norms.