CENov 15, 2016
A discontinuous Galerkin Method for the EEG Forward Problem using the Subtraction ApproachChristian Engwer, Johannes Vorwerk, Jakob Ludewig et al.
In order to perform electroencephalography (EEG) source reconstruction, i.e., to localize the sources underlying a measured EEG, the electric potential distribution at the electrodes generated by a dipolar current source in the brain has to be simulated, which is the so-called EEG forward problem. To solve it accurately, it is necessary to apply numerical methods that are able to take the individual geometry and conductivity distribution of the subject's head into account. In this context, the finite element method (FEM) has shown high numerical accuracy with the possibility to model complex geometries and conductive features, e.g., white matter conductivity anisotropy. In this article, we introduce and analyze the application of a discontinuous Galerkin (DG) method, a finite element method that includes features of the finite volume framework, to the EEG forward problem. The DG-FEM approach fulfills the conservation property of electric charge also in the discrete case, making it attractive for a variety of applications. Furthermore, as we show, this approach can alleviate modeling inaccuracies that might occur in head geometries when using classical FE methods, e.g., so-called "skull leakage effects", which may occur in areas where the thickness of the skull is in the range of the mesh resolution. Therefore, we derive a DG formulation of the FEM subtraction approach for the EEG forward problem and present numerical results that highlight the advantageous features and the potential benefits of the proposed approach.
NAFeb 20, 2019
Efficient implementation of the Localized Orthogonal Decomposition methodChristian Engwer, Patrick Henning, Axel Målqvist et al.
In this paper we present algorithms for an efficient implementation of the Localized Orthogonal Decomposition method (LOD). The LOD is a multiscale method for the numerical simulation of partial differential equations with a continuum of inseparable scales. We show how the method can be implemented in a fairly standard Finite Element framework and discuss its realization for different types of problems, such as linear elliptic problems with rough coefficients and linear eigenvalue problems.
NAJul 30, 2014
A numerically stable a posteriori error estimator for reduced basis approximations of elliptic equationsAndreas Buhr, Christian Engwer, Mario Ohlberger et al.
The Reduced Basis (RB) method is a well established method for the model order reduction of problems formulated as parametrized partial differential equations. One crucial requirement for the application of RB schemes is the availability of an a posteriori error estimator to reliably estimate the error introduced by the reduction process. However, straightforward implementations of standard residual based estimators show poor numerical stability, rendering them unusable if high accuracy is required. In this work we propose a new algorithm based on representing the residual with respect to a dedicated orthonormal basis, which is both easy to implement and requires little additional computational overhead. A numerical example is given to demonstrate the performance of the proposed algorithm.
NANov 29, 2016
ArbiLoMod, a Simulation Technique Designed for Arbitrary Local ModificationsAndreas Buhr, Christian Engwer, Mario Ohlberger et al.
Engineers manually optimizing a structure using Finite Element based simulation software often employ an iterative approach where in each iteration they change the structure slightly and resimulate. Standard Finite Element based simulation software is usually not well suited for this workflow, as it restarts in each iteration, even for tiny changes. In settings with complex local microstructure, where a fine mesh is required to capture the geometric detail, localized model reduction can improve this workflow. To this end, we introduce ArbiLoMod, a method which allows fast recomputation after arbitrary local modifications. It employs a domain decomposition and a localized form of the Reduced Basis Method for model order reduction. It assumes that the reduced basis on many of the unchanged domains can be reused after a localized change. The reduced model is adapted when necessary, steered by a localized error indicator. The global error introduced by the model order reduction is controlled by a robust and efficient localized a posteriori error estimator, certifying the quality of the result. We demonstrate ArbiLoMod for a coercive, parameterized example with changing structure.
66.3NAMay 6
The domain-of-dependence stabilization for cut-cell meshes is fully discretely stableLouis Petri, Gunnar Birke, Christian Engwer et al.
We present a fully discrete stability analysis of the domain-of-dependence stabilization for hyperbolic problems. The method aims to address issues caused by small cut cells by redistributing mass around the neighborhood of a small cut cell at a semi-discrete level. Our analysis is conducted for the linear advection model problem in one spatial dimension. We demonstrate that fully discrete stability can be achieved under a time step restriction that does not depend on the arbitrarily small cells, using an operator norm estimate. Additionally, this analysis offers a detailed understanding of the stability mechanism and highlights some challenges associated with higher-order polynomials. We also propose a way to mitigate these issues to derive a feasible CFL-like condition. The analytical findings, as well as the proposed solution are verified numerically in one- and two-dimensional simulations.
MSJun 25, 2018
Function space bases in the dune-functions moduleChristian Engwer, Carsten Gräser, Steffen Müthing et al.
The dune-functions Dune module provides interfaces for functions and function space bases. It forms one abstraction level above grids, shape functions, and linear algebra, and provides infrastructure for full discretization frameworks like dune-pdelab and dune-fem. This document describes the function space bases provided by dune-functions. These are based on an abstract description of bases for product spaces as trees of simpler bases. From this description, many different numberings of degrees of freedom by multi-indices can be derived in a natural way. We describe the abstract concepts, document the programmer interface, and give a complete example program that solves the stationary Stokes equation using Taylor-Hood elements.
NADec 5, 2016
ArbiLoMod: Local Solution Spaces by Random Training in ElectrodynamicsAndreas Buhr, Christian Engwer, Mario Ohlberger et al.
The simulation method ArbiLoMod has the goal to provide users of Finite Element based simulation software with quick re-simulation after localized changes to the model under consideration. It generates a Reduced Order Model (ROM) for the full model without ever solving the full model. To this end, a localized variant of the Reduced Basis method is employed, solving only small localized problems in the generation of the reduced basis. The key to quick re-simulation lies in recycling most of the localized basis vectors after a localized model change. In this publication, ArbiLoMod's local training algorithm is analyzed numerically for the non-coercive problem of time harmonic Maxwell's equations in 2D, formulated in H(curl).
NAFeb 2, 2016
An unfitted discontinuous Galerkin scheme for conservation laws on evolving surfacesChristian Engwer, Thomas Ranner, Sebastian Westerheide
Motivated by considering partial differential equations arising from conservation laws posed on evolving surfaces, a new numerical method for an advection problem is developed and simple numerical tests are performed. The method is based on an unfitted discontinuous Galerkin approach where the surface is not explicitly tracked by the mesh which means the method is extremely flexible with respect to geometry. Furthermore, the discontinuous Galerkin approach is well-suited to capture the advection driven by the evolution of the surface without the need for a space-time formulation, back-tracking trajectories or streamline diffusion. The method is illustrated by a one-dimensional example and numerical results are presented that show good convergence properties for a simple test problem.
NAJan 14, 2016
Geometric Integration Over Irregular Domains with topologic GuaranteesChristian Engwer, Andreas Nüßing
Implicitly described domains are a well established tool in the simulation of time dependent problems, e.g. using level-set methods. In order to solve partial differential equations on such domains, a range of numerical methods was developed, e.g. the Immersed Boundary method, Unfitted Finite Element or Unfitted discontinuous Galerkin methods, eXtended or Generalised Finite Element methods, just to name a few. Many of these methods involve integration over cut-cells or their boundaries, as they are described by sub-domains of the original level-set mesh. We present a new algorithm to geometrically evaluate the integrals over domains described by a first-order, conforming level-set function. The integration is based on a polyhedral reconstruction of the implicit geometry, following the concepts of the Marching Cubes algorithm. The algorithm preserves various topological properties of the implicit geometry in its polyhedral reconstruction, making it suitable for Finite Element computations. Numerical experiments show second order accuracy of the integration. An implementation of the algorithm is available as free software, which allows for an easy incorporation into other projects. The software is in productive use within the DUNE framework.
NAAug 23, 2017
A Mixed Finite Element Method to Solve the EEG Forward ProblemJohannes Vorwerk, Christian Engwer, Sampsa Pursiainen et al.
Finite element methods have been shown to achieve high accuracies in numerically solving the EEG forward problem and they enable the realistic modeling of complex geometries and important conductive features such as anisotropic conductivities. To date, most of the presented approaches rely on the same underlying formulation, the continuous Galerkin (CG)-FEM. In this article, a novel approach to solve the EEG forward problem based on a mixed finite element method (Mixed-FEM) is introduced. To obtain the Mixed-FEM formulation, the electric current is introduced as an additional unknown besides the electric potential. As a consequence of this derivation, the Mixed-FEM is, by construction, current preserving, in contrast to the CG-FEM. Consequently, a higher simulation accuracy can be achieved in certain scenarios, e.g., when the diameter of thin insulating structures, such as the skull, is in the range of the mesh resolution. A theoretical derivation of the Mixed-FEM approach for EEG forward simulations is presented, and the algorithms implemented for solving the resulting equation systems are described. Subsequently, first evaluations in both sphere and realistic head models are presented, and the results are compared to previously introduced CG-FEM approaches. Additional visualizations are shown to illustrate the current preserving property of the Mixed-FEM. Based on these results, it is concluded that the newly presented Mixed-FEM can at least complement and in some scenarios even outperform the established CG-FEM approaches, which motivates a further evaluation of the Mixed-FEM for applications in bioelectromagnetism.