Related papers: Hybrid multigrid methods for high-order discontinu…
The embedded discontinuous Galerkin (EDG) method by Cockburn et al. [SIAM J. Numer. Anal., 2009, 47(4), 2686-2707] is obtained from the hybridizable discontinuous Galerkin method by changing the space of the Lagrangian multiplier from…
This paper introduces a novel staggered discontinuous Galerkin (SDG) method tailored for solving elliptic equations on polytopal meshes. Our approach utilizes a primal-dual grid framework to ensure local conservation of fluxes,…
We propose and analyze an iterative high-order hybridized discontinuous Galerkin (iHDG) discretization for linear partial differential equations. We improve our previous work (SIAM J. Sci. Comput. Vol. 39, No. 5, pp. S782--S808) in several…
A multigrid method for the Stokes system discretized with an Hdiv-conforming discontinuous Galerkin method is presented. It acts on the combined velocity and pressure spaces and thus does not need a Schur complement approximation. The…
This work develops a nonlinear multigrid method for diffusion problems discretized by cell-centered finite volume methods on general unstructured grids. The multigrid hierarchy is constructed algebraically using aggregation of degrees of…
We present and analyze a new space-time parallel multigrid method for parabolic equations. The method is based on arbitrarily high order discontinuous Galerkin discretizations in time, and a finite element discretization in space. The key…
The efficient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for…
The simulation of high-dimensional problems with manageable computational resource represents a long-standing challenge. In a series of our recent work [25, 17, 18, 24], a class of sparse grid DG methods has been formulated for solving…
We present a scalable and efficient iterative solver for high-order hybridized discontinuous Galerkin (HDG) discretizations of hyperbolic partial differential equations. It is an interplay between domain decomposition methods and HDG…
A considerable amount of attention has been given to discontinuous Galerkin methods for hyperbolic problems in numerical relativity, showing potential advantages of the methods in dealing with hydrodynamical shocks and other…
This paper builds on the algebraic theory in the companion paper [Algebraic Error Analysis for Mixed-Precision Multigrid Solvers] to obtain discretization-error-accurate solutions for linear elliptic partial differential equations (PDEs) by…
We consider discontinuous Galerkin methods for an elliptic distributed optimal control problem and we propose multigrid methods to solve the discretized system. We prove that the $W$-cycle algorithm is uniformly convergent in the energy…
We present a divergence-free and $H(div)$-conforming hybridized discontinuous Galerkin (HDG) method and a computationally efficient variant called embedded-HDG (E-HDG) for solving stationary incompressible viso-resistive magnetohydrodynamic…
This work presents and compares efficient implementations of high-order discontinuous Galerkin methods: a modal matrix-free discontinuous Galerkin (DG) method, a hybridizable discontinuous Galerkin (HDG) method, and a primal formulation of…
We develop a hybrid spatial discretization for the wave equation in second order form, based on high-order accurate finite difference methods and discontinuous Galerkin methods. The hybridization combines computational efficiency of finite…
We consider geometric multigrid methods for the solution of linear systems arising from isogeometric discretizations of elliptic partial differential equations. For classical finite elements, such methods are well known to be fast solvers…
This paper describes a massively parallel algebraic multigrid method based on non-smoothed aggregation. It is especially suited for solving heterogeneous elliptic problems as it uses a greedy heuristic algorithm for the aggregation that…
Multilevel techniques are efficient approaches for solving the large linear systems that arise from discretized partial differential equations and other problems. While geometric multigrid requires detailed knowledge about the underlying…
The geometric multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared…
We present an algebraic method for constructing a highly effective coarse grid correction to accelerate domain decomposition. The coarse problem is constructed from the original matrix and a small set of input vectors that span a low-degree…