{"title":"An Inexact Balancing Preconditioner for Large-Scale Structural Analysis","authors":"M. Ogino, R. Shioya, H. Kanayama","doi":"10.1299/JCST.2.150","DOIUrl":null,"url":null,"abstract":"The balancing domain decomposition (BDD) method is a well-known preconditioner due to its excellent convergence rate. The BDD method includes the Neumann-Neumann preconditioner and a coarse grid correction. Several studies have considered applications of the BDD method to various phenomena and improvement of its convergence rate. However, in applying the BDD method to large-scale problems, it is difficult to solve the coarse problem of a coarse grid correction since the size of the coarse problem increases in proportion to the number of subdomains (i.e., the size of the original problem). Other preconditioners with a coarse grid correction have the same problem. To overcome this problem, use of a new preconditioner, namely, incomplete balancing domain decomposition with a diagonal-scaling (IBDD-DIAG) method is proposed in this study. The method is based on the BDD method, and constructed by an incomplete balancing preconditioner and a simplified diagonal-scaling preconditioner. Moreover, it is parallelized by the hierarchical domain decomposition method. To evaluate this new approach, some computational examples of large-scale problems are demonstrated.","PeriodicalId":196913,"journal":{"name":"Journal of Computational Science and Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1299/JCST.2.150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43
Abstract
The balancing domain decomposition (BDD) method is a well-known preconditioner due to its excellent convergence rate. The BDD method includes the Neumann-Neumann preconditioner and a coarse grid correction. Several studies have considered applications of the BDD method to various phenomena and improvement of its convergence rate. However, in applying the BDD method to large-scale problems, it is difficult to solve the coarse problem of a coarse grid correction since the size of the coarse problem increases in proportion to the number of subdomains (i.e., the size of the original problem). Other preconditioners with a coarse grid correction have the same problem. To overcome this problem, use of a new preconditioner, namely, incomplete balancing domain decomposition with a diagonal-scaling (IBDD-DIAG) method is proposed in this study. The method is based on the BDD method, and constructed by an incomplete balancing preconditioner and a simplified diagonal-scaling preconditioner. Moreover, it is parallelized by the hierarchical domain decomposition method. To evaluate this new approach, some computational examples of large-scale problems are demonstrated.