Related papers: Hybrid multigrid methods for high-order discontinu…
The incompressible Euler equations are an important model system in computational fluid dynamics. Fast high-order methods for the solution of this time-dependent system of partial differential equations are of particular interest: due to…
We present a novel high-order accurate nodal discontinuous Galerkin (DG) method for solving nonlinear hyperbolic systems of partial differential equations (PDEs) on fully unstructured three-dimensional polyhedral meshes. A mesh generator is…
The mass flow rate of Poiseuille flow of rarefied gas through long ducts of two-dimensional cross-sections with arbitrary shape are critical in the pore-network modeling of gas transport in porous media. In this paper, for the first time,…
In this paper, we prove necessary and sufficient conditions for a hybridizable discontinuous Galerkin (HDG) method to satisfy a multisymplectic conservation law, when applied to a canonical Hamiltonian system of partial differential…
This paper is concerned with developing accurate and efficient discontinuous Galerkin methods for fully nonlinear second order elliptic and parabolic partial differential equations (PDEs) in the case of one spatial dimension. The primary…
In this paper, we derive discrete Poincar\'e and trace inequalities for the hybridizable discontinuous Galerkin (HDG) method. We employ the Crouzeix-Raviart space as a bridge, connecting classical discrete functional tools from Brenner's…
Multigrid algorithms are among the fastest iterative methods known today for solving large linear and some non-linear systems of equations. Greatly optimized for serial operation, they still have a great potential for parallelism not fully…
A novel discontinuous Galerkin (DG) method is developed to solve time-dependent bi-harmonic type equations involving fourth derivatives in one and multiple space dimensions. We present the spatial DG discretization based on a mixed…
We introduce a geometric multigrid method for solving linear systems arising from variational problems on surfaces in geometry processing, Gravo MG. Our scheme uses point clouds as a reduced representation of the levels of the multigrid…
This paper reviews the adaptive sparse grid discontinuous Galerkin (aSG-DG) method for computing high dimensional partial differential equations (PDEs) and its software implementation. The C\texttt{++} software package called AdaM-DG,…
We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable…
With the hardware support for half-precision arithmetic on NVIDIA V100 GPUs, high-performance computing applications can benefit from lower precision at appropriate spots to speed up the overall execution time. In this paper, we investigate…
Kernel methods for solving partial differential equations on surfaces have the advantage that those methods work intrinsically on the surface and yield high approximation rates if the solution to the partial differential equation is smooth…
We present multigrid methods for solving elliptic partial differential equations on arbitrary domains using the nodal ghost finite element method, an unfitted boundary approach where the domain is implicitly defined by a level-set function.…
We propose a multigrid method to solve the linear system of equations arising from a hybrid discontinuous Galerkin (in particular, a single face hybridizable, a hybrid Raviart--Thomas, or a hybrid Brezzi--Douglas--Marini) discretization of…
We propose a new tool, which we call $M$-decompositions, for devising superconvergent hybridizable discontinuous Galerkin (HDG) methods and hybridized-mixed methods for linear elasticity with strongly symmetric approximate stresses on…
We combine continuous and discontinuous Galerkin methods in the setting of a model diffusion problem. Starting from a hybrid discontinuous formulation, we replace element interiors by more general subsets of the computational domain -…
In this work, we study the approximation properties of multi-patch dG-IgA methods, that apply the multipatch Isogeometric Analysis (IgA) discretization concept and the discontinuous Galerkin (dG) technique on the interfaces between the…
Presented in this paper is a new sparse linear solver methodology motivated by multigrid principles and based around general local transformations that diagonalize a matrix while maintaining its sparsity. These transformations are…
This paper presents a matrix-free multigrid method for solving the Stokes problem, discretized using $H^{\text{div}}$-conforming discontinuous Galerkin methods. We employ a Schur complement method combined with the fast diagonalization…