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

doi:10.1137/18M1193505

This content will become publicly available on October 29, 2020

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.  doi: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.  doi:10.1137/18M1193505.

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

This content will become publicly available on October 29, 2020

Publisher's Version of Record

DOI: 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 OSTI.GOV collections:

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
DOI: 10.1137/090747774
On Multigrid for Overlapping Grids

Journal Article Henshaw, W - SIAM Journal of 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
DOI: 10.1137/040603735

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
Numerical Multilevel Upscaling for Incompressible Flow in Reservoir Simulation: An Element-Based Algebraic Multigrid (AMGe) Approach

Journal Article la Cour Christensen, Max ; Villa, Umberto ; Engsig-Karup, Allan P. ; ... - SIAM Journal on Scientific Computing

Here, we study the application of a finite element numerical upscaling technique to the incompressible two-phase porous media total velocity formulation. Specifically, an element-agglomeration-based algebraic multigrid (AMGe) technique with improved approximation properties is used, for the first time, to generate upscaled and accurate coarse systems for the reservoir simulation equations. The upscaling technique is applied to both the mixed system for velocity and pressure and to the hyperbolic transport equations, providing fully upscaled systems. By introducing additional degrees of freedom associated with nonplanar interfaces between agglomerates, the coarse velocity space has guaranteed approximation properties. The employed AMGe technique provides coarsemore »« less
Cited by 3
DOI: 10.1137/140988991

Full Text Available
Variational multiscale element-free Galerkin method combined with the moving Kriging interpolation for solving some partial differential equations with discontinuous solutions

Journal Article Dehghan, Mehdi ; Abbaszadeh, Mostafa - Computational and Applied Mathematics

Solving partial differential equations with discontinuous solutions is an important challenging problem in numerical analysis. To this end, there are some methods such as finite volume method, discontinuous Galerkin approach and particle technique that are able to solve these problems. In the current paper, the moving Kriging element-free Galerkin method has been combined with the variational multiscale algorithm to obtain acceptable and high-resolution solutions. For testing this technique, we select some PDEs with discontinuous solution such as Burgers’, Sod’s shock tube, advection–reaction–diffusion, Kuramoto–Sivashinsky, Boussinesq and shallow water equations. First, we obtain a time-discrete scheme by approximating time derivative via finitemore »« less
DOI: 10.1007/S40314-017-0546-6

Similar Records