Masatoshi Kawai, Akihiro Ida, Hiroya Matsuba, K. Nakajima, M. Bolten
{"title":"Multiplicative Schwartz-Type Block Multi-Color Gauss-Seidel Smoother for Algebraic Multigrid Methods","authors":"Masatoshi Kawai, Akihiro Ida, Hiroya Matsuba, K. Nakajima, M. Bolten","doi":"10.1145/3368474.3368481","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a multiplicative Schwartz-type block multi-color Gauss-Seidel (MS-BMC-GS) smoother for algebraic multigrid (AMG) methods. AMG is an excellent solver and one of the most effective preconditioners for Krylov subspace methods such as the conjugate gradient method. The achievable degree of parallelism, convergence ratio, and computational cost of AMG strongly depend on the chosen smoother. As multiple unknowns are relaxed simultaneously, the MS-BMC-GS smoother realizes higher convergence than the existing parallel Gauss-Seidel smoother. Although this increases the amount of computation, the increase in the computational time is mitigated by the high cache hit ratio owing to the novel blocking technique. Numerical experiments demonstrate that MS-BMC-GS outperforms the block multi-color GS smoother by 18%.","PeriodicalId":314778,"journal":{"name":"Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3368474.3368481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose a multiplicative Schwartz-type block multi-color Gauss-Seidel (MS-BMC-GS) smoother for algebraic multigrid (AMG) methods. AMG is an excellent solver and one of the most effective preconditioners for Krylov subspace methods such as the conjugate gradient method. The achievable degree of parallelism, convergence ratio, and computational cost of AMG strongly depend on the chosen smoother. As multiple unknowns are relaxed simultaneously, the MS-BMC-GS smoother realizes higher convergence than the existing parallel Gauss-Seidel smoother. Although this increases the amount of computation, the increase in the computational time is mitigated by the high cache hit ratio owing to the novel blocking technique. Numerical experiments demonstrate that MS-BMC-GS outperforms the block multi-color GS smoother by 18%.