{"title":"Mixed-precision conjugate gradient algorithm using the groupwise update strategy","authors":"Kensuke Aihara, Katsuhisa Ozaki, Daichi Mukunoki","doi":"10.1007/s13160-024-00644-8","DOIUrl":null,"url":null,"abstract":"<p>The conjugate gradient (CG) method is the most basic iterative solver for large sparse symmetric positive definite linear systems. In finite precision arithmetic, the residual and error norms of the CG method often stagnate owing to rounding errors. The groupwise update is a strategy to reduce the residual gap (the difference between the recursively updated and true residuals) and improve the attainable accuracy of approximations. However, when there is a severe loss of information in updating approximations, it is difficult to sufficiently reduce the true residual and error norms. To overcome this problem, we propose a mixed-precision algorithm of the CG method using the groupwise update strategy. In particular, we perform the underlying CG iterations with the standard double-precision arithmetic and compute the groupwise update with high-precision arithmetic. This approach prevents a loss of information and efficiently avoids stagnation. Numerical experiments using double-double arithmetic demonstrate that the proposed algorithm significantly improves the accuracy of the approximate solutions with a small overhead of computation time. The presented approach can be used in other related solvers as well.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"7 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-02-06","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-00644-8","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
The conjugate gradient (CG) method is the most basic iterative solver for large sparse symmetric positive definite linear systems. In finite precision arithmetic, the residual and error norms of the CG method often stagnate owing to rounding errors. The groupwise update is a strategy to reduce the residual gap (the difference between the recursively updated and true residuals) and improve the attainable accuracy of approximations. However, when there is a severe loss of information in updating approximations, it is difficult to sufficiently reduce the true residual and error norms. To overcome this problem, we propose a mixed-precision algorithm of the CG method using the groupwise update strategy. In particular, we perform the underlying CG iterations with the standard double-precision arithmetic and compute the groupwise update with high-precision arithmetic. This approach prevents a loss of information and efficiently avoids stagnation. Numerical experiments using double-double arithmetic demonstrate that the proposed algorithm significantly improves the accuracy of the approximate solutions with a small overhead of computation time. The presented approach can be used in other related solvers as well.
期刊介绍:
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.