View in EDS

On improving the robustness and scalability of shared-memory AMG solvers for point-block problems.

Saved in:
Bibliographic Details
Title: On improving the robustness and scalability of shared-memory AMG solvers for point-block problems.
Authors: Konshin, Igor N.1,2,3 (AUTHOR), Terekhov, Kirill M.1 (AUTHOR) terekhov@inm.ras.ru
Source: Russian Journal of Numerical Analysis & Mathematical Modelling. Apr2026, Vol. 41 Issue 2, p119-149. 31p.
Subjects: Algebraic multigrid methods, Matrix multiplications, Interpolation, Benchmark problems (Computer science), Numerical analysis
Abstract: A number of modifications of the basic algorithms for constructing a multilevel structure to improve the performance of the algebraic multigrid method for both scalar and point-block systems are considered in this paper. We explore the basic operations of transposing and multiplying sparse matrices, as well as ways to select the maximum independent subset in the graph of strong connections, methods for constructing the prolongation operator, and approaches to aggressive coarsening that reduce the operation complexity of the method. It is shown that the construction of an extended prolongation operator can significantly increase the accuracy of the method, but at the cost of higher operator complexity and longer execution times. This disadvantage can be compensated either by filtering small weights from the prolongation operator, or by using aggressive coarsening. Several approaches to aggressive coarsening are considered. To confirm the conclusions, a number of numerical experiments were performed on a series of matrices from a publicly available collection for problems on progressively refined grids. The method applicability is evaluated on systems derived from adaptively generated grids. Some performance analisys of shared and hybrid memory is provided. [ABSTRACT FROM AUTHOR]
Copyright of Russian Journal of Numerical Analysis & Mathematical Modelling is the property of De Gruyter and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:A number of modifications of the basic algorithms for constructing a multilevel structure to improve the performance of the algebraic multigrid method for both scalar and point-block systems are considered in this paper. We explore the basic operations of transposing and multiplying sparse matrices, as well as ways to select the maximum independent subset in the graph of strong connections, methods for constructing the prolongation operator, and approaches to aggressive coarsening that reduce the operation complexity of the method. It is shown that the construction of an extended prolongation operator can significantly increase the accuracy of the method, but at the cost of higher operator complexity and longer execution times. This disadvantage can be compensated either by filtering small weights from the prolongation operator, or by using aggressive coarsening. Several approaches to aggressive coarsening are considered. To confirm the conclusions, a number of numerical experiments were performed on a series of matrices from a publicly available collection for problems on progressively refined grids. The method applicability is evaluated on systems derived from adaptively generated grids. Some performance analisys of shared and hybrid memory is provided. [ABSTRACT FROM AUTHOR]
ISSN:09276467
DOI:10.1515/rnam-2026-0009