Matthias Schlottbom

NA
7papers
44citations
Novelty37%
AI Score21

7 Papers

NADec 3, 2015
A class of Galerkin schemes for time-dependent radiative transfer

Herbert Egger, Matthias Schlottbom

The numerical solution of time-dependent radiative transfer problems is challenging, both, due to the high dimension as well as the anisotropic structure of the underlying integro-partial differential equation. In this paper we propose a general framework for designing numerical methods for time-dependent radiative transfer based on a Galerkin discretization in space and angle combined with appropriate time stepping schemes. This allows us to systematically incorporate boundary conditions and to preserve basic properties like exponential stability and decay to equilibrium also on the discrete level. We present the basic a-priori error analysis and provide abstract error estimates that cover a wide class of methods. The starting point for our considerations is to rewrite the radiative transfer problem as a system of evolution equations which has a similar structure like first order hyperbolic systems in acoustics or electrodynamics. This analogy allows us to generalize the main arguments of the numerical analysis for such applications to the radiative transfer problem under investigation. We also discuss a particular discretization scheme based on a truncated spherical harmonic expansion in angle, a finite element discretization in space, and the implicit Euler method in time. The performance of the resulting mixed PN-finite element time stepping scheme is demonstrated by computational results.

NANov 20, 2015
Error analysis of a diffuse interface method for elliptic problems with Dirichlet boundary conditions

Matthias Schlottbom

We use a diffuse interface method for solving Poisson's equation with a Dirichlet condition on an embedded curved interface. The resulting diffuse interface problem is identified as a standard Dirichlet problem on approximating regular domains. We estimate the errors introduced by these domain perturbations, and prove convergence and convergence rates in the $H^1$-norm, the $L^2$-norm and the $L^\infty$-norm in terms of the width of the diffuse layer. For an efficient numerical solution we consider the finite element method for which another domain perturbation is introduced. These perturbed domains are polygonal and non-convex in general. We prove convergence and convergences rates in the $H^1$-norm and the $L^2$-norm in terms of the layer width and the mesh size. In particular, for the $L^2$-norm estimates we present a problem adapted duality technique, which crucially makes use of the error estimates derived for the regularly perturbed domains. Our results are illustrated by numerical experiments, which also show that the derived estimates are sharp.

OPTICSApr 24, 2023
Unsupervised Machine Learning to Classify the Confinement of Waves in Periodic Superstructures

Marek Kozoň, Rutger Schrijver, Matthias Schlottbom et al.

We employ unsupervised machine learning to enhance the accuracy of our recently presented scaling method for wave confinement analysis [1]. We employ the standard k-means++ algorithm as well as our own model-based algorithm. We investigate cluster validity indices as a means to find the correct number of confinement dimensionalities to be used as an input to the clustering algorithms. Subsequently, we analyze the performance of the two clustering algorithms when compared to the direct application of the scaling method without clustering. We find that the clustering approach provides more physically meaningful results, but may struggle with identifying the correct set of confinement dimensionalities. We conclude that the most accurate outcome is obtained by first applying the direct scaling to find the correct set of confinement dimensionalities and subsequently employing clustering to refine the results. Moreover, our model-based algorithm outperforms the standard k-means++ clustering.

APNov 8, 2018
Parameter identification in a structured population model

Alexander Lorz, Jan-Frederik Pietschmann, Matthias Schlottbom

We study parameter identification problems in a structured population model without mutations. Given measurements of the total population size or critical points of the population, we aim to recover its growth rate, death rate or initial distribution. We present uniqueness results under suitable assumptions and present counterexamples when these assumptions are violated. Our results a supplemented by numerical studies, either based on Tikhonov regularization or the use of explicit reconstruction formulas.

NAFeb 22, 2018
A perfectly matched layer approach for radiative transfer in highly scattering regimes

Herbert Egger, Matthias Schlottbom

We consider the numerical approximation of boundary conditions in radiative transfer problems by a perfectly matched layer approach. The main idea is to extend the computational domain by an absorbing layer and to use an appropriate reflection boundary condition at the boundary of the extended domain. A careful analysis shows that the consistency error introduced by this approach can be made arbitrarily small by increasing the size of the extension domain or the magnitude of the artificial absorption in the surrounding layer. A particular choice of the reflection boundary condition allows us to circumvent the half-space integrals that arise in the variational treatment of the original vacuum boundary conditions and which destroy the sparse coupling observed in numerical approximation schemes based on truncated spherical harmonics expansions. A combination of the perfectly matched layer approach with a mixed variational formulation and a PN-finite element approximation leads to discretization schemes with optimal sparsity pattern and provable quasi-optimal convergence properties. As demonstrated in numerical tests these methods are accurate and very efficient for radiative transfer in the scattering regime.

NAJul 10, 2015
Diffuse Interface Methods for Inverse Problems: Case Study for an Elliptic Cauchy Problem

Martin Burger, Ole Loseth Elvetun, Matthias Schlottbom

Many inverse problems have to deal with complex, evolving and often not exactly known geometries, e.g. as domains of forward problems modeled by partial differential equations. This makes it desirable to use methods which are robust with respect to perturbed or not well resolved domains, and which allow for efficient discretizations not resolving any fine detail of those geometries. For forward problems in partial differential equations methods based on diffuse interface representations gained strong attention in the last years, but so far they have not been considered systematically for inverse problems. In this work we introduce a diffuse domain method as a tool for the solution of variational inverse problems. As a particular example we study ECG inversion in further detail. ECG inversion is a linear inverse source problem with boundary measurements governed by an anisotropic diffusion equation, which naturally cries for solutions under changing geometries, namely the beating heart. We formulate a regularization strategy using Tikhonov regularization and, using standard source conditions, we prove convergence rates. A special property of our approach is that not only operator perturbations are introduced by the diffuse domain method, but more important we have to deal with topologies which depend on a parameter $\eps$ in the diffuse domain method, i.e. we have to deal with $\eps$-dependent forward operators and $\eps$-dependent norms. In particular the appropriate function spaces for the unknown and the data depend on $\eps$. This prevents to apply some standard convergence techniques for inverse problems, in particular interpreting the perturbations as data errors in the original problem does not yield suitable results. We consequently develop a novel approach based on saddle-point problems.

NADec 17, 2014
Analysis of the Diffuse Domain Method for second order elliptic boundary value problems

Martin Burger, Ole Løseth Elvetun, Matthias Schlottbom

The diffuse domain method for partial differential equations on complicated geometries recently received strong attention in particular from practitioners, but many fundamental issues in the analysis are still widely open. In this paper we study the diffuse domain method for approximating second order elliptic boundary value problems posed on bounded domains, and show convergence and rates of the approximations generated by the diffuse domain method to the solution of the original second order problem when complemented by Robin, Dirichlet or Neumann conditions. The main idea of the diffuse domain method is to relax these boundary conditions by introducing a family of phase-field functions such that the variational integrals of the original problem are replaced by a weighted average of integrals of perturbed domains. From an functional analytic point of view, the phase-field functions naturally lead to weighted Sobolev spaces for which we present trace and embedding results as well as various type of Poincaré inequalities with constants independent of the domain perturbations. Our convergence analysis is carried out in such spaces as well, but allows to draw conclusions also about unweighted norms applied to restrictions on the original domain. Our convergence results are supported by numerical examples.