Discontinuous Galerkin Methods for Mass Transfer through Semi-Permeable Membranes

A discontinuous Galerkin (dG) method for the numerical solution of initial/boundary value multi-compartment partial differential equation (PDE) models, interconnected with interface conditions, is presented and analysed. The study of interface problems is motivated by models of mass transfer of solutes through semi-permeable membranes. More specifically, a model problem consisting of a system of semilinear parabolic advection-diffusion-reaction partial differential equations in each compartment, equipped with respective initial and boundary conditions, is considered. Nonlinear interface conditions modelling selective permeability, congestion and partial reflection are applied to the compartment interfaces. An interior penalty dG method is presented for this problem and it is analysed in the space-discrete setting. The a priori analysis shows that the method yields optimal a priori bounds, provided the exact solution is sufficiently smooth. Numerical experiments indicate agreement with the theoretical bounds and highlight the stability of the numerical method in the advection-dominated regime

Discontinuous Galerkin finite element approximation of quasilinear elliptic boundary value problems II: Strongly monotone quasi-Newtonian flows

In this article we develop both the a priori and a posteriori error analysis of hp–version interior penalty discontinuous Galerkin finite element methods for strongly monotone quasi-Newtonian fluid flows in a bounded Lipschitz domain $\Omega \subset R^{d}, d$ = 2,3. In the latter case, computable upper and lower bounds on the error are derived in terms of a natural energy norm which are explicit in the local mesh size and local polynomial degree of the approximating finite element method. A series of numerical experiments illustrate the performance of the proposed a posteriori error indicators within an automatic hp–adaptive refinement algorithm

Discontinuous Galerkin approximations in computational mechanics: hybridization, exact geometry and degree adaptivity

Discontinuous Galerkin (DG) discretizations with exact representation of the geometry and local polynomial degree adaptivity are revisited. Hybridization techniques are employed to reduce the computational cost of DG approximations and devise the hybridizable discontinuous Galerkin (HDG) method. Exact geometry described by non-uniform rational B-splines (NURBS) is integrated into HDG using the framework of the NURBS-enhanced finite element method (NEFEM). Moreover, optimal convergence and superconvergence properties of HDG-Voigt formulation in presence of symmetric second-order tensors are exploited to construct inexpensive error indicators and drive degree adaptive procedures. Applications involving the numerical simulation of problems in electrostatics, linear elasticity and incompressible viscous flows are presented. Moreover, this is done for both high-order HDG approximations and the lowest-order framework of face-centered finite volumes (FCFV).Peer ReviewedPostprint (author's final draft

hp-Version discontinuous Galerkin finite element methods for semilinear parabolic problems

We consider the hp-version interior penalty discontinuous Galerkin finite element method (hp-DGFEM) for semilinear parabolic equations with mixed Dirichlet and Neumann boundary conditions. Our main concern is the error analysis of the hp--DGFEM on shape--regular spatial meshes. We derive error bounds under various hypotheses on the regularity of the solution, for both the symmetric and non--symmetric versions of DGFEM

Adjoint-Based Error Estimation and Mesh Adaptation for Hybridized Discontinuous Galerkin Methods

We present a robust and efficient target-based mesh adaptation methodology, building on hybridized discontinuous Galerkin schemes for (nonlinear) convection-diffusion problems, including the compressible Euler and Navier-Stokes equations. Hybridization of finite element discretizations has the main advantage, that the resulting set of algebraic equations has globally coupled degrees of freedom only on the skeleton of the computational mesh. Consequently, solving for these degrees of freedom involves the solution of a potentially much smaller system. This not only reduces storage requirements, but also allows for a faster solution with iterative solvers. The mesh adaptation is driven by an error estimate obtained via a discrete adjoint approach. Furthermore, the computed target functional can be corrected with this error estimate to obtain an even more accurate value. The aim of this paper is twofold: Firstly, to show the superiority of adjoint-based mesh adaptation over uniform and residual-based mesh refinement, and secondly to investigate the efficiency of the global error estimate

Discontinuous Galerkin finite element approximation of Hamilton-Jacobi-Bellman equations with Cordès coefficients

We propose an hp-version discontinuous Galerkin finite element method for fully nonlinear second-order elliptic Hamilton-Jacobi-Bellman equations with Cord�ès coefficients. The method is proven to be consistent and stable, with convergence rates that are optimal with respect to mesh size, and suboptimal in the polynomial degree by only half an order. Numerical experiments on problems with strongly anisotropic diffusion coefficients illustrate the accuracy and computational efficiency of the scheme. An existence and uniqueness result for strong solutions of the fully nonlinear problem, and a semismoothness result for the nonlinear operator are also provided

Discontinuous Galerkin finite element approximation of quasilinear elliptic boundary value problems II: strongly monotone quasi-Newtonian flows

In this article we develop both the a priori and a posteriori error analysis of hp– version interior penalty discontinuous Galerkin finite element methods for strongly monotone quasi-Newtonian fluid flows in a bounded Lipschitz domain Ω ⊂ R^d, d = 2, 3. In the latter case, computable upper and lower bounds on the error are derived in terms of a natural energy norm which are explicit in the local mesh size and local polynomial degree of the approximating finite element method. A series of numerical experiments illustrate the performance of the proposed a posteriori error indicators within an automatic hp–adaptive refinement algorithm

Discontinuous Galerkin finite element methods for time-dependent Hamilton--Jacobi--Bellman equations with Cordes coefficients

We propose and analyse a fully-discrete discontinuous Galerkin time-stepping method for parabolic Hamilton--Jacobi--Bellman equations with Cordes coefficients. The method is consistent and unconditionally stable on rather general unstructured meshes and time-partitions. Error bounds are obtained for both rough and regular solutions, and it is shown that for sufficiently smooth solutions, the method is arbitrarily high-order with optimal convergence rates with respect to the mesh size, time-interval length and temporal polynomial degree, and possibly suboptimal by an order and a half in the spatial polynomial degree. Numerical experiments on problems with strongly anisotropic diffusion coefficients and early-time singularities demonstrate the accuracy and computational efficiency of the method, with exponential convergence rates under combined $hp$- and $\tau q$-refinement.Comment: 40 pages, 3 figures, submitted; extended version with supporting appendi

hp-adaptive discontinuous Galerkin solver for elliptic equations in numerical relativity

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 discontinuities. This paper investigates discontinuous Galerkin methods for the solution of elliptic problems in numerical relativity. We present a novel hp-adaptive numerical scheme for curvilinear and non-conforming meshes. It uses a multigrid preconditioner with a Chebyshev or Schwarz smoother to create a very scalable discontinuous Galerkin code on generic domains. The code employs compactification to move the outer boundary near spatial infinity. We explore the properties of the code on some test problems, including one mimicking Neutron stars with phase transitions. We also apply it to construct initial data for two or three black holes