Related papers: A quasi-robust discretization error estimate for d…
In this paper, we investigate Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) methods for conforming Galerkin discretizations on multi-patch computational domains with inexact subdomain solvers. Recently, the authors have…
We study the high-order local discontinuous Galerkin (LDG) method for the $p$-Laplace equation. We reformulate our spatial discretization as an equivalent convex minimization problem and use a preconditioned gradient descent method as the…
We propose a new discretization method for the Stokes equations. The method is an improved version of the method recently presented in [C. Lehrenfeld, J. Sch\"oberl, Comp. Meth. Appl. Mech. Eng., 361 (2016)] which is based on an…
We propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modelling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved…
Discontinuous Galerkin (DG) methods are extensions of the usual Galerkin finite element methods. Although there are vast amount of studies on DG methods, most of them have assumed shape-regularity conditions on meshes for both theoretical…
We provide a unified analysis of a posteriori and a priori error bounds for a broad class of discontinuous Galerkin and $C^0$-IP finite element approximations of fully nonlinear second-order elliptic Hamilton--Jacobi--Bellman and Isaacs…
We examine and extend Sparse Grids as a discretization method for partial differential equations (PDEs). Solving a PDE in $D$ dimensions has a cost that grows as $O(N^D)$ with commonly used methods. Even for moderate $D$ (e.g. $D=3$), this…
In this article, using the weighted discrete least-squares, we propose a patch reconstruction finite element space with only one degree of freedom per element. As the approximation space, it is applied to the discontinuous Galerkin methods…
In this paper we provide a priori error estimates in standard Sobolev (semi-)norms for approximation in spline spaces of maximal smoothness on arbitrary grids. The error estimates are expressed in terms of a power of the maximal grid…
We propose an arbitrary-order discontinuous Galerkin method for second-order elliptic problem on general polygonal mesh with only one degree of freedom per element. This is achieved by locally solving a discrete least-squares over a…
Robust discretization methods for (nearly-incompressible) linear elasticity are free of volume-locking and gradient-robust. While volume-locking is a well-known problem that can be dealt with in many different discretization approaches, the…
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,…
A discontinuous Galerkin method by patch reconstruction is proposed for Stokes flows. A locally divergence-free reconstruction space is employed as the approximation space, and the interior penalty method is adopted which imposes the normal…
This paper introduces optimally-blended quadrature rules for isogeometric analysis and analyzes the numerical dispersion of the resulting discretizations. To quantify the approximation errors when we modify the inner products, we generalize…
We introduce a discontinuous Galerkin method for the mixed formulation of the elasticity eigenproblem with reduced symmetry. The analysis of the resulting discrete eigenproblem does not fit in the standard spectral approximation framework…
In this paper, we derive improved a priori error estimates for families of hybridizable interior penalty discontinuous Galerkin (H-IP) methods using a variable penalty for second-order elliptic problems. The strategy is to use a…
In this paper we propose an algorithm for the formation of matrices of isogeometric Galerkin methods. The algorithm is based on three ideas. The first is that we perform the external loop over the rows of the matrix. The second is that we…
This work focuses on multidimensional summation-by-parts (SBP) discretizations of linear elliptic operators with variable coefficients. We consider a general SBP discretization with dense simultaneous approximation terms (SATs), which serve…
In this paper, we propose and analyze an efficient preconditioning method for the elliptic problem based on the reconstructed discontinuous approximation method. We reconstruct a high-order piecewise polynomial space that arbitrary order…
Discontinuous Galerkin (DG) methods are widely adopted to discretize the radiation transport equation (RTE) with diffusive scalings. One of the most important advantages of the DG methods for RTE is their asymptotic preserving (AP)…