Related papers: Multigrid algorithms for $hp$-Discontinuous Galerk…
We address the spatial discretization of an evolution problem arising from the coupling of viscoelastic and acoustic wave propagation phenomena by employing a discontinuous Galerkin scheme on polygonal and polyhedral meshes. The coupled…
In this paper we describe in detail the computational algorithm used by our parallel multigrid elliptic equation solver with adaptive mesh refinement. Our code uses truncation error estimates to adaptively refine the grid as part of the…
We develop multilevel methods for interface-driven multiphysics problems that can be coupled across dimensions and where complexity and strength of the interface coupling deteriorates the performance of standard methods. We focus on solvers…
A systematic numerical study on weak Galerkin (WG) finite element method for second order linear parabolic problems is presented by allowing polynomial approximations with various degrees for each local element. Convergence of both…
With the increasing number of components and further miniaturization the mean time between faults in supercomputers will decrease. System level fault tolerance techniques are expensive and cost energy, since they are often based on…
We design and analyze multigrid methods for the saddle point problems resulting from Raviart-Thomas-N\'ed\'elec mixed finite element methods (of order at least 1) for the Darcy system in porous media flow. Uniform convergence of the…
In this work, we propose and investigate stable high-order collocation-type discretisations of the discontinuous Galerkin method on equidistant and scattered collocation points. We do so by incorporating the concept of discrete least…
This paper develops interior penalty discontinuous Galerkin (IP-DG) methods to approximate $W^{2,p}$ strong solutions of second order linear elliptic partial differential equations (PDEs) in non-divergence form with continuous coefficients.…
In this work, we analyze an unfitted discontinuous Galerkin discretization for the numerical solution of the Stokes system based on equal higher-order discontinuous velocities and pressures. This approach combines the best from both worlds,…
We present a new line-based discontinuous Galerkin (DG) discretization scheme for first- and second-order systems of partial differential equations. The scheme is based on fully unstructured meshes of quadrilateral or hexahedral elements,…
Many subsurface engineering applications involve tight-coupling between fluid flow, solid deformation, fracturing, and similar processes. To better understand the complex interplay of different governing equations, and therefore design…
We present a class of reduced basis (RB) methods for the iterative solution of parametrized symmetric positive-definite (SPD) linear systems. The essential ingredients are a Galerkin projection of the underlying parametrized system onto a…
In recent years, there has been an increasing interest in using deep learning and neural networks to tackle scientific problems, particularly in solving partial differential equations (PDEs). However, many neural network-based methods, such…
A general framework for the numerical approximation of evolution problems is presented that allows to preserve exactly an underlying Hamiltonian- or gradient structure. The approach relies on rewriting the evolution problem in a particular…
We are interested in numerically solving the Hamilton-Jacobi (HJ) equations, which arise in optimal control and many other applications. Oftentimes, such equations are posed in high dimensions, and this poses great numerical challenges.…
The numerical analysis of higher-order mixed finite-element discretizations for saddle-point problems, such as the Stokes equations, has been well-studied in recent years. While the theory and practice of such discretizations is now…
An efficient multigrid framework is developed for the time marching of steady-state compressible flows with a spatially high-order ($p$-order polynomial) modal discontinuous Galerkin method. The core algorithm that based on a global…
We introduce an iterative scheme for discrete convex minimization problems of $p$-Laplace type such as variational graph $p$-Laplace problems and $\ell^p$ regression. In each iteration, the scheme solves only a weighted least-squares…
We present an iterative scheme, reminiscent of the Multigrid method, to solve large boundary value problems with Probabilistic Domain Decomposition (PDD). In it, increasingly accurate approximations to the solution are used as control…
We propose a hybridizable discontinuous Galerkin (HDG) method combined with convex-concave splitting for the temporal discretization of the convective Cahn-Hilliard equation. The convection term is discretized explicitly without…