Automatic symbolic computation for discontinuous Galerkin finite element methods

04/06/2018
by   Paul Houston, et al.
0

The implementation of discontinuous Galerkin finite element methods (DGFEMs) represents a very challenging computational task, particularly for systems of coupled nonlinear PDEs, including multiphysics problems, whose parameters may consist of power series or functionals of the solution variables. Thereby, the exploitation of symbolic algebra to express a given DGFEM approximation of a PDE problem within a high level language, whose syntax closely resembles the mathematical definition, is an invaluable tool. Indeed, this then facilitates the automatic assembly of the resulting system of (nonlinear) equations, as well as the computation of Fréchet derivative(s) of the DGFEM scheme, needed, for example, within a Newton-type solver. However, even exploiting symbolic algebra, the discretisation of coupled systems of PDEs can still be extremely verbose and hard to debug. Thereby, in this article we develop a further layer of abstraction by designing a class structure for the automatic computation of DGFEM formulations. This work has been implemented within the FEniCS package, based on exploiting the Unified Form Language. Numerical examples are presented which highlight the simplicity of implementation of DGFEMs for the numerical approximation of a range of PDE problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2022

Unified Implementation of Adaptive Finite Element Methods in Matlab

We provide a unified implementation of the adaptive finite element metho...
research
11/30/2021

Discontinuous Galerkin discretization in time of systems of second-order nonlinear hyperbolic equations

In this paper we study the finite element approximation of systems of se...
research
12/23/2022

Unfitted Trefftz discontinuous Galerkin methods for elliptic boundary value problems

We propose a new geometrically unfitted finite element method based on d...
research
06/29/2020

Irksome: Automating Runge–Kutta time-stepping for finite element methods

While implicit Runge–Kutta methods possess high order accuracy and impor...
research
12/24/2022

Automatic stabilization of finite-element simulations using neural networks and hierarchical matrices

Petrov-Galerkin formulations with optimal test functions allow for the s...
research
02/01/2018

A domain-specific language for the hybridization and static condensation of finite element methods

In this paper, we introduce a domain-specific language (DSL) for concise...

Please sign up or login with your details

Forgot password? Click here to reset