NANADec 2, 2016

A scalable preconditioner for a DPG method

arXiv:1612.008389 citationsh-index: 40
AI Analysis

This work provides a practical preconditioner for large-scale DPG simulations, addressing a key bottleneck in computational mechanics.

The authors developed a scalable algebraic multigrid preconditioner for the DPG method, achieving the first massively scalable algebraic preconditioner for such problems.

We show how a scalable preconditioner for the primal discontinuous Petrov-Galerkin (DPG) method can be developed using existing algebraic multigrid (AMG) preconditioning techniques. The stability of the DPG method gives a norm equivalence which allows us to exploit existing AMG algorithms and software. We show how these algebraic preconditioners can be applied directly to a Schur complement system of interface unknowns arising from the DPG method. To the best of our knowledge, this is the first massively scalable algebraic preconditioner for DPG problems.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes