Algebraic multigrid methods based on element preconditioning

From MaRDI portal





Adapted from the authors' abstract: This paper presents a new algebraic multigrid (AMG) solution strategy for large linear systems with a sparse matrix arising from a finite element discretization of some self-adjoint, second order, scalar, elliptic partial differential equations. The AMG solver is based on \textit{J. W. Ruge} and \textit{K. Stüben}'s method [Algebraic multigrid (AMG), methods, S. McCormick (Ed.), Frontiers in Applied Mathematics 3, SIAM, Philadelphia, 73-130 (1986; Zbl 0659.65094)] which is robust for \(M\)-matrices. Since robustness may be lost for general symmetric positive matrices, an element preconditioning technique is introduced in this paper. This technique aims at the construction of an \(M\)-matrix \(B\) that is spectrally equivalent to the original stiffness matrix \(K\), in the sense that \(B^{-1}A\) has a small condition number. This is done by finding such \(M\)-matrices \(B^r\) for each element stiffness matrix \(K^r\) and building \(B\) with the element connectivity matrices that are used to construct \(K\) from the \(K^r\). The \(B^r\) are found by solving suitable restricted optimization problems for which algorithms are presented. If the element stiffness matrices can be classified into a few groups with similar spectral properties, only a few \(B^r\) need to be found. AMG is then applied to the spectrally equivalent \(M\)-matrix \(B\) as a preconditioner in the conjugate gradient method to solve the original system. Numerical experiments show that the method is efficient and robust.




Cited in
(22)








This page was built for publication: Algebraic multigrid methods based on element preconditioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776796)