Markus Faustmann

NA
6papers
61citations
Novelty30%
AI Score34

6 Papers

NAMar 26, 2019
Quasi-optimal convergence rate for an adaptive method for the integral fractional Laplacian

Markus Faustmann, Jens Markus Melenk, Dirk Praetorius

For the discretization of the integral fractional Laplacian $(-Δ)^s$, $0 < s < 1$, based on piecewise linear functions, we present and analyze a reliable weighted residual a posteriori error estimator. In order to compensate for a lack of $L^2$-regularity of the residual in the regime $3/4 < s < 1$, this weighted residual error estimator includes as an additional weight a power of the distance from the mesh skeleton. We prove optimal convergence rates for an $h$-adaptive algorithm driven by this error estimator. Key to the analysis of the adaptive algorithm are local inverse estimates for the fractional Laplacian.

NAMay 15, 2017
Robust exponential convergence of hp-FEM in balanced norms for singularly perturbed reaction-diffusion problems: corner domains

Jens Markus Melenk, Markus Faustmann

The hp-version of the finite element method is applied to singularly perturbed reaction-diffusion type equations on polygonal domains. The solution exhibits boundary layers as well as corner layers. On a class of meshes that are suitable refined near the boundary and the corners, robust exponential convergence (in the polynomial degree) is shown in both a balanced norm and the maximum norm.

NAMar 6, 2015
Existence of $\mathcal{H}$-matrix approximants to the inverse of BEM matrices: the hyper-singular integral operator

Markus Faustmann, Jens Markus Melenk, Dirk Praetorius

We consider discretizations of the hyper-singular integral operator on closed surfaces and show that the inverses of the corresponding system matrices can be approximated by blockwise low-rank matrices at an exponential rate in the block rank. We cover in particular the data-sparse format of $\mathcal{H}$-matrices. We show the approximability result for two types of discretizations. The first one is a saddle point formulation, which incorporates the constraint of vanishing mean of the solution. The second discretization is based on a stabilized hyper-singular operator, which leads to symmetric positive definite matrices. In this latter setting, we also show that the hierarchical Cholesky factorization can be approximated at an exponential rate in the block rank.

NAFeb 14, 2017
Local convergence of the boundary element method on polyhedral domains

Markus Faustmann, Jens Markus Melenk

The local behavior of the lowest order boundary element method on quasi-uniform meshes for Symm's integral equation and the stabilized hyper-singular integral equation on polygonal/polyhedral Lipschitz domains is analyzed. We prove local a priori estimates in $L^2$ for Symm's integral equation and in $H^1$ for the hypersingular equation. The local rate of convergence is limited by the local regularity of the sought solution and the sum of the global regularity and additional regularity provided by the shift theorem for a dual problem.

1.3NAMar 13
Exponential Convergence of $hp$-FEM for the Integral Fractional Laplacian on cuboids

Björn Bahr, Markus Faustmann, Carlo Marcati et al.

For the Dirichlet integral fractional Laplacian, we prove root exponential convergence of tensor-product $hp$-finite element approximations on $(0,1)^3$, for forcing $f$ that is analytic in $[0,1]^3$. Exploiting analytic regularity estimates in weighted Sobolev spaces, we prove for $hp$-GLL interpolation approximations with $N$ degrees of freedom the energy norm error bound $\lesssim \exp(-b\sqrt[6]{N})$. Tensor product mesh families which are geometrically refined towards all sides of $(0,1)^3$ are used. Numerical experiments with $hp$-Galerkin FEM confirm the bound.

NANov 6, 2014
Existence of $\mathcal{H}$-matrix approximants to the inverses of BEM matrices: the simple-layer operator

Markus Faustmann, Jens Markus Melenk, Dirk Praetorius

We consider the question of approximating the inverse $\mathbf W = \mathbf V^{-1}$ of the Galerkin stiffness matrix $\mathbf V$ obtained by discretizing the simple-layer operator $V$ with piecewise constant functions. The block partitioning of $\mathbf W$ is assumed to satisfy any of the standard admissibility criteria that are employed in connection with clustering algorithms to approximate the discrete BEM operator $\mathbf V$. We show that $\mathbf W$ can be approximated by blockwise low-rank matrices such that the error decays exponentially in the block rank employed. Similar exponential approximability results are shown for the Cholesky factorization of $\mathbf V$.