A geometric multigrid preconditioning strategy for DPG system matrices. (15th October 2017)

• Record Type: Journal Article
• Authors: Roberts, Nathan V.; Chan, Jesse
• Is Part Of: Computers & mathematics with applications. Volume 74:issue 8(2017)
• Page Start: 2018
• Page End: 2043
• Publication Date: 2017-10-15
• Subjects: Discontinuous Petrov–Galerkin -- Adaptive finite elements -- Iterative solvers -- Geometric multigrid; Electronic data processing -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.28541
• DOI: 10.1016/j.camwa.2017.06.055
• Languages: English
• ISSNs: 0898-1221

Abstract

Abstract: The discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan (2010, 2011) guarantees the optimality of the solution in an energy norm, and provides several features facilitating adaptive schemes. A key question that has not yet been answered in general – though there are some results for Poisson, e.g.– is how best to precondition the DPG system matrix, so that iterative solvers may be used to allow solution of large-scale problems. In this paper, we detail a strategy for preconditioning the DPG system matrix using geometric multigrid which we have implemented as part of Camellia (Roberts, 2014, 2016), and demonstrate through numerical experiments its effectiveness in the context of several variational formulations. We observe that in some of our experiments, the behavior of the preconditioner is closely tied to the discrete test space enrichment. We include experiments involving adaptive meshes with hanging nodes for lid-driven cavity flow, demonstrating that the preconditioners can be applied in the context of challenging problems. We also include a scalability study demonstrating that the approach – and our implementation – scales well to many MPI ranks.