A scalable preconditioner for a primal discontinuous Petrov–Galerkin method

Citation data:

SIAM Journal on Scientific Computing, ISSN: 1095-7197, Vol: 40, Issue: 2, Page: A1187-A1203

Publication Year:
2018
Usage 53
Downloads 28
Abstract Views 25
Captures 1
Readers 1
Repository URL:
https://pdxscholar.library.pdx.edu/pics_pub/2; https://works.bepress.com/jay-gopalakrishnan/105
DOI:
10.1137/16m1104780
Author(s):
Barker, Andrew T.; Dobrev, Veselin A.; Gopalakrishnan, Jay; Kolev, Tzanio
Tags:
Mathematics; Discontinuous functions; Galerkin methods; Numerical analysis
article description
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 arising from the DPG method. One of our intermediate results shows that a generic stable decomposition implies a stable decomposition for the Schur complement. This justifies the application of algebraic solvers directly to the interface degrees of freedom. Combining such results, we obtain the first massively scalable algebraic preconditioner for the DPG system.