{"title":"A note on Oishi’s lower bound for the smallest singular value of linearized Galerkin equations","authors":"","doi":"10.1007/s13160-024-00645-7","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Recently Oishi published a paper allowing lower bounds for the minimum singular value of coefficient matrices of linearized Galerkin equations, which in turn arise in the computation of periodic solutions of nonlinear delay differential equations with some smooth nonlinearity. The coefficient matrix of linearized Galerkin equations may be large, so the computation of a valid lower bound of the smallest singular value may be costly. Oishi’s method is based on the inverse of a small upper left principal submatrix, and subsequent computations use a Schur complement with small computational cost. In this note some assumptions are removed and the bounds improved. Furthermore a technique is derived to reduce the total computationally cost significantly allowing to treat infinite dimensional matrices.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Japan Journal of Industrial and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s13160-024-00645-7","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Recently Oishi published a paper allowing lower bounds for the minimum singular value of coefficient matrices of linearized Galerkin equations, which in turn arise in the computation of periodic solutions of nonlinear delay differential equations with some smooth nonlinearity. The coefficient matrix of linearized Galerkin equations may be large, so the computation of a valid lower bound of the smallest singular value may be costly. Oishi’s method is based on the inverse of a small upper left principal submatrix, and subsequent computations use a Schur complement with small computational cost. In this note some assumptions are removed and the bounds improved. Furthermore a technique is derived to reduce the total computationally cost significantly allowing to treat infinite dimensional matrices.
期刊介绍：
Japan Journal of Industrial and Applied Mathematics (JJIAM) is intended to provide an international forum for the expression of new ideas, as well as a site for the presentation of original research in various fields of the mathematical sciences. Consequently the most welcome types of articles are those which provide new insights into and methods for mathematical structures of various phenomena in the natural, social and industrial sciences, those which link real-world phenomena and mathematics through modeling and analysis, and those which impact the development of the mathematical sciences. The scope of the journal covers applied mathematical analysis, computational techniques and industrial mathematics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
