A geometric multigrid preconditioning strategy for DPG system matrices
Abstract
Here, 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 largescale problems.
 Authors:
 Sandia National Lab. (SNLNM), Albuquerque, NM (United States)
 Rice Univ., Houston, TX (United States)
 Publication Date:
 Research Org.:
 Sandia National Lab. (SNLNM), Albuquerque, NM (United States)
 Sponsoring Org.:
 USDOE National Nuclear Security Administration (NNSA)
 OSTI Identifier:
 1399559
 Report Number(s):
 SAND20177727J
Journal ID: ISSN 08981221; PII: S0898122117304133
 Grant/Contract Number:
 AC0494AL85000; AC0206CH11357; NA0003525
 Resource Type:
 Journal Article: Accepted Manuscript
 Journal Name:
 Computers and Mathematics with Applications (Oxford)
 Additional Journal Information:
 Journal Name: Computers and Mathematics with Applications (Oxford); Journal Volume: 74; Journal Issue: 8; Journal ID: ISSN 08981221
 Publisher:
 Elsevier
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICS AND COMPUTING; Discontinuous Petrov–Galerkin; Adaptive finite elements; Iterative solvers; Geometric multigrid
Citation Formats
Roberts, Nathan V., and Chan, Jesse. A geometric multigrid preconditioning strategy for DPG system matrices. United States: N. p., 2017.
Web. doi:10.1016/j.camwa.2017.06.055.
Roberts, Nathan V., & Chan, Jesse. A geometric multigrid preconditioning strategy for DPG system matrices. United States. doi:10.1016/j.camwa.2017.06.055.
Roberts, Nathan V., and Chan, Jesse. 2017.
"A geometric multigrid preconditioning strategy for DPG system matrices". United States.
doi:10.1016/j.camwa.2017.06.055.
@article{osti_1399559,
title = {A geometric multigrid preconditioning strategy for DPG system matrices},
author = {Roberts, Nathan V. and Chan, Jesse},
abstractNote = {Here, 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 largescale problems.},
doi = {10.1016/j.camwa.2017.06.055},
journal = {Computers and Mathematics with Applications (Oxford)},
number = 8,
volume = 74,
place = {United States},
year = 2017,
month = 8
}
Free Publicly Available Full Text
This content will become publicly available on August 23, 2018
Publisher's Version of Record
Other availability
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.

A Combined Preconditioning Strategy for Nonsymmetric Systems
Here, we present and analyze a class of nonsymmetric preconditioners within a normal (weighted leastsquares) matrix form for use in GMRES to solve nonsymmetric matrix problems that typically arise in finite element discretizations. An example of the additive Schwarz method applied to nonsymmetric but definite matrices is presented for which the abstract assumptions are verified. Variable preconditioner, which combines the original nonsymmetric one and a weighted leastsquares version of it, and it is shown to be convergent and provides a viable strategy for using nonsymmetric preconditioners in practice. Numerical results are included to assess the theory and the performance ofmore » 
New preconditioning strategy for Jacobianfree solvers for variably saturated flows with Richards’ equation
We develop a new approach for solving the nonlinear Richards’ equation arising in variably saturated flow modeling. The growing complexity of geometric models for simulation of subsurface flows leads to the necessity of using unstructured meshes and advanced discretization methods. Typically, a numerical solution is obtained by first discretizing PDEs and then solving the resulting system of nonlinear discrete equations with a NewtonRaphsontype method. Efficiency and robustness of the existing solvers rely on many factors, including an empiric quality control of intermediate iterates, complexity of the employed discretization method and a customized preconditioner. We propose and analyze a new preconditioningmore »Cited by 1 
A scalable blockpreconditioning strategy for divergenceconforming Bspline discretizations of the Stokes problem
The recently introduced divergenceconforming Bspline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergencefree. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddlepoint linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddlepoint type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show howmore »