Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods

Wildey, Tim; Muralikrishnan, Sriramkrishnan; Bui-Thanh, Tan

doi:10.1137/18M1193505

Title: Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods

Full Record
Other Related Research

Abstract

In this paper, we consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. The proposed unified approach is applicable to any locally conservative hybridized finite element method including multinumerics with different hybridized methods in different parts of the domain. For these methods, the linear system involves only the unknowns residing on the mesh skeleton, and constructing intergrid transfer operators is therefore not trivial. The key to our geometric multigrid algorithm is the physics-based energy-preserving intergrid transfer operators which depend only on the fine scale DtN maps. Thanks to these operators, we completely avoid upscaling of parameters and no information regarding subgrid physics is explicitly required on coarse meshes. Moreover, our algorithm is agglomeration-based and can straightforwardly handle unstructured meshes. We perform extensive numerical studies with hybridized mixed methods, hybridized discontinuous Galerkin methods, weak Galerkin methods, and hybridized versions of interior penalty discontinuous Galerkin methods on a range of elliptic problems including subsurface flow through highly heterogeneous porous media. We compare the performance of different smoothers and analyze the effect of stabilization parameters on the scalability of the multigrid algorithm.

Authors:

Wildey, Tim ^[1]; Muralikrishnan, Sriramkrishnan ^[2]; Bui-Thanh, Tan ^[2]

Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Univ. of Texas, Austin, TX (United States)

Publication Date:: 2019-10-29

Research Org.:: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

Sponsoring Org.:: USDOE National Nuclear Security Administration (NNSA); USDOE Office of Science (SC); National Science Foundation (NSF)

OSTI Identifier:: 1595039

Report Number(s):: SAND-2018-11044J
Journal ID: ISSN 1064-8275; 669660

Grant/Contract Number:: AC04-94AL85000; SC0018147; NSF-DMS1620352; NA-0003525

Resource Type:: Accepted Manuscript

Journal Name:: SIAM Journal on Scientific Computing

Additional Journal Information:: Journal Volume: 41; Journal Issue: 5; Journal ID: ISSN 1064-8275

Publisher:: SIAM

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Citation Formats


                    Wildey, Tim, Muralikrishnan, Sriramkrishnan, and Bui-Thanh, Tan. Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods.  United States: N. p., 2019. 
Web.  doi:10.1137/18M1193505.

Copy to clipboard


                    Wildey, Tim, Muralikrishnan, Sriramkrishnan, & Bui-Thanh, Tan. Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods.  United States.  https://doi.org/10.1137/18M1193505

Copy to clipboard


                    Wildey, Tim, Muralikrishnan, Sriramkrishnan, and Bui-Thanh, Tan. Tue .  
"Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods".  United States.  https://doi.org/10.1137/18M1193505.  https://www.osti.gov/servlets/purl/1595039.

Copy to clipboard


                    
@article{osti_1595039,

  title        = {Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods},

  author       = {Wildey, Tim and Muralikrishnan, Sriramkrishnan and Bui-Thanh, Tan},

  abstractNote = {In this paper, we consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. The proposed unified approach is applicable to any locally conservative hybridized finite element method including multinumerics with different hybridized methods in different parts of the domain. For these methods, the linear system involves only the unknowns residing on the mesh skeleton, and constructing intergrid transfer operators is therefore not trivial. The key to our geometric multigrid algorithm is the physics-based energy-preserving intergrid transfer operators which depend only on the fine scale DtN maps. Thanks to these operators, we completely avoid upscaling of parameters and no information regarding subgrid physics is explicitly required on coarse meshes. Moreover, our algorithm is agglomeration-based and can straightforwardly handle unstructured meshes. We perform extensive numerical studies with hybridized mixed methods, hybridized discontinuous Galerkin methods, weak Galerkin methods, and hybridized versions of interior penalty discontinuous Galerkin methods on a range of elliptic problems including subsurface flow through highly heterogeneous porous media. We compare the performance of different smoothers and analyze the effect of stabilization parameters on the scalability of the multigrid algorithm.},

  doi          = {10.1137/18M1193505},

  journal      = {SIAM Journal on Scientific Computing},

  number       = 5,

  volume       = 41,

  place        = {United States},

  year         = {2019},

  month        = {10}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (DOE)

Publisher's Version of Record

https://doi.org/10.1137/18M1193505

Other availability

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

A multilevel approach for trace system in HDG discretizations

Journal Article Muralikrishnan, Sriramkrishnan ; Bui-Thanh, Tan ; Shadid, John N. - Journal of Computational Physics

We propose a multilevel approach for trace systems resulting from hybridized discontinuous Galerkin (HDG) methods. The key is to blend ideas from nested dissection, domain decomposition, and high-order characteristic of HDG discretizations. Specifically, we first create a coarse solver by eliminating and/or limiting the front growth in nested dissection. This is accomplished by projecting the trace data into a sequence of same or high-order polynomials on a set of increasingly h-coarser edges/faces. We then combine the coarse solver with a block-Jacobi fine scale solver to form a two-level solver/preconditioner. Numerical experiments indicate that the performance of the resulting two-level solver/preconditionermore »« less
https://doi.org/10.1016/j.jcp.2020.109240

Full Text Available
A parallel geometric multigrid method for finite elements on octree meshes

Journal Article Sampath, Rahul S ; Biros, George - SIAM Journal on Scientific Computing

In this article, we present a parallel geometric multigrid algorithm for solving variable-coefficient elliptic partial differential equations on the unit box (with Dirichlet or Neumann boundary conditions) using highly nonuniform, octree-based, conforming finite element discretizations. Our octrees are 2:1 balanced, that is, we allow no more than one octree-level difference between octants that share a face, edge, or vertex. We describe a parallel algorithm whose input is an arbitrary 2:1 balanced fine-grid octree and whose output is a set of coarser 2:1 balanced octrees that are used in the multigrid scheme. Also, we derive matrix-free schemes for the discretized finitemore »« less
https://doi.org/10.1137/090747774
On Multigrid for Overlapping Grids

Journal Article Henshaw, W - SIAM Journal on Scientific Computing

The solution of elliptic partial differential equations on composite overlapping grids using multigrid is discussed. An approach is described that provides a fast and memory efficient scheme for the solution of boundary value problems in complex geometries. The key aspects of the new scheme are an automatic coarse grid generation algorithm, an adaptive smoothing technique for adjusting residuals on different component grids, and the use of local smoothing near interpolation boundaries. Other important features include optimizations for Cartesian component grids, the use of over-relaxed Red-Black smoothers and the generation of coarse grid operators through Galerkin averaging. Numerical results in twomore »« less
https://doi.org/10.1137/040603735

Full Text Available
Efficient Operator-Coarsening Multigrid Schemes for Local Discontinuous Galerkin Methods

Journal Article Fortunato, Daniel ; Rycroft, Chris H. ; Saye, Robert - SIAM Journal on Scientific Computing

An efficient hp-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We show that traditional multigrid coarsening of the primal formulation leads to poor and suboptimal multigrid performance, whereas coarsening of the flux formulation leads to essentially optimal convergence and is equivalent to a purely geometric multigrid method. The resulting operator-coarsening schemes do not require the entire mesh hierarchy to be explicitly built, thereby obviating the need to compute quadrature rules, lifting operators, and other mesh-related quantities on coarse meshes. We showmore »« less
https://doi.org/10.1137/18m1206357

Full Text Available
Multigrid methods for nonconforming finite elements

Miscellaneous Brenner, S C

Approximate solutions of elliptic boundary value problems can be obtained by using finite elements. In the multigrid method, and algorithm is constructed recursively to solve a sequence of discretized problems that comes from a family of triangulations of the domain of the elliptic boundary value problem. The algorithm has two main features: smoothing on the current grid and coarser-grid error correction. The smoothing step has the effect of damping out the oscillatory part of the error. The smooth part of the error can be accurately captured on the coarser grid. Furthermore, since the error correction is done on a coarsermore »« less

Similar Records