{"title":"三乘三块鞍点问题的新块三角形预处理器","authors":"Jun Li, Xiangtuan Xiong","doi":"10.21136/AM.2023.0289-22","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, to solve the three-by-three block saddle-point problem, a new block triangular (NBT) preconditioner is established, which can effectively avoid the solving difficulty that the coefficient matrices of linear subsystems are Schur complement matrices when the block preconditioner is applied to the Krylov subspace method. Theoretical analysis shows that the iteration method produced by the NBT preconditioner is unconditionally convergent. Besides, some spectral properties are also discussed. Finally, numerical experiments are provided to show the effectiveness of the NBT preconditioner.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new block triangular preconditioner for three-by-three block saddle-point problem\",\"authors\":\"Jun Li, Xiangtuan Xiong\",\"doi\":\"10.21136/AM.2023.0289-22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, to solve the three-by-three block saddle-point problem, a new block triangular (NBT) preconditioner is established, which can effectively avoid the solving difficulty that the coefficient matrices of linear subsystems are Schur complement matrices when the block preconditioner is applied to the Krylov subspace method. Theoretical analysis shows that the iteration method produced by the NBT preconditioner is unconditionally convergent. Besides, some spectral properties are also discussed. Finally, numerical experiments are provided to show the effectiveness of the NBT preconditioner.</p></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.21136/AM.2023.0289-22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.21136/AM.2023.0289-22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new block triangular preconditioner for three-by-three block saddle-point problem
In this paper, to solve the three-by-three block saddle-point problem, a new block triangular (NBT) preconditioner is established, which can effectively avoid the solving difficulty that the coefficient matrices of linear subsystems are Schur complement matrices when the block preconditioner is applied to the Krylov subspace method. Theoretical analysis shows that the iteration method produced by the NBT preconditioner is unconditionally convergent. Besides, some spectral properties are also discussed. Finally, numerical experiments are provided to show the effectiveness of the NBT preconditioner.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
