Open Access

ARTICLE

Algebraic Multigrid Methods Based on Generic Approximate Banded Inverse Matrix Techniques

by George A. Gravvanis¹, Christos K. Filelis-Papadopoulos¹, Paschalis I.Matskanidis¹

1 Department of Electrical and Computer Engineering, School of Engineering, Democritus University of Thrace, University Campus, Kimmeria, GR 67100 Xanthi, Greece.

Computer Modeling in Engineering & Sciences 2014, 100(4), 323-345. https://doi.org/10.3970/cmes.2014.100.323

Abstract

Since the introduction of the Algebraic MultiGrid algorithm (AMG) over twenty years ago, significant progress has been made in improving the coarsening and the convergence behavior of the method. In this paper, an AMG method is introduced that utilizes a new generic approximate inverse algorithm as a smoother in conjunction with common coarsening techniques, such as classical Ruge-Stüben coarsening, CLJP and PMIS coarsening. The proposed approximate inverse scheme, namely Generic Approximate Banded Inverse (GenAbI), is a banded approximate inverse based on Incomplete LU factorization with zero fill–in (ILU(0)). The new class of Generic Approximate Banded Inverse can be computed for any sparsity pattern of the coefficient matrix, in an analogous way as the explicit approximate inverse, yielding a suitable smoother to be used in conjunction with an Algebraic Multigrid method. The proposed smoother is parameterized and thus by increasing the “retention” parameter the smoothing scheme becomes more effective in terms of required number of cycles for convergence. Finally, the applicability and effectiveness of the proposed AMG method along with implementation issues, based on the Generic Approximate Banded Inverse matrix, is demonstrated by solving two and three dimensional problems and numerical results on the convergence behavior and convergence factor are given.

---

Keywords

---