4.7 Article

A multilevel approach for trace system in HDG discretizations

Journal

JOURNAL OF COMPUTATIONAL PHYSICS
Volume 407, Issue -, Pages -

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcp.2020.109240

Keywords

Iterative solvers; Multilevel solvers; Hybridized discontinuous Galerkin methods; Transport equation; Convection-diffusion equation; Nested dissection

Funding

  1. DOE [DE-SC0018147]
  2. NSF [NSF-DMS1620352]
  3. Department of Energy Office of Science, Advanced Scientific Computing Research (ASCR) Applied Math Program
  4. U.S. Department of Energy's National Nuclear Security Administration [DE-NA-0003525]
  5. U.S. Department of Energy (DOE) [DE-SC0018147] Funding Source: U.S. Department of Energy (DOE)

Ask authors/readers for more resources

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/preconditioner depends on the smoothness of the solution and can offer significant speedups and memory savings compared to the nested dissection direct solver. While the proposed algorithms are developed within the HDG framework, they are applicable to other hybrid(ized) high-order finite element methods. Moreover, we show that our multilevel algorithms can be interpreted as a multigrid method with specific intergrid transfer and smoothing operators. With several numerical examples from Poisson, pure transport, and convection-diffusion equations we demonstrate the robustness and scalability of the algorithms with respect to solution order. While scalability with mesh size in general is not guaranteed and depends on the smoothness of the solution and the type of equation, improving it is a part of future work. (C) 2020 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available