Volume 51, pp. 118-134, 2019.

Revisiting aggregation-based multigrid for edge elements

Artem Napov and Ronan Perrussel


We consider a modification of the Reitzinger-Schöberl algebraic multigrid method for the iterative solution of the curl-curl boundary value problem discretized with edge elements. The Reitzinger-Schöberl method is attractive for its low memory requirements and moderate cost per iteration, but the number of iterations typically tends to increase with the problem size. Here we propose several modifications to the method that aim at curing the size-dependent convergence behavior without significantly affecting the attractive features of the original method. The comparison with an auxiliary space preconditioner, a state-of-the-art solver for the considered problems, further indicates that both methods typically require a comparable amount of work to solve a given discretized problem but that the proposed approach requires less memory.

Full Text (PDF) [327 KB], BibTeX

Key words

algebraic multigrid, edge elements, preconditioning, aggregation

AMS subject classifications

65N12, 65N22, 65N55

Links to the cited ETNA articles

[20]Vol. 37 (2010), pp. 123-146 Yvan Notay: An aggregation-based algebraic multigrid method

ETNA articles which cite this article

Vol. 51 (2019), pp. 387-411 Artem Napov and Ronan Perrussel: Algebraic analysis of two-level multigrid methods for edge elements

< Back