Search arXiv⌕ Search

arXiv subjects

Markus Faustmann

Publications and source records attributed to Markus Faustmann.

At least 19 recordsLinked to original sources
arXiv2026

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

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.

math.NA↗
arXiv2024

An implementation of hp-FEM for the fractional Laplacian

We consider the discretization of the $1d$-integral Dirichlet fractional Laplacian by $hp$-finite elements. We present quadrature schemes to set up the stiffness matrix and load vector that preserve the exponential convergence of $hp$-FEM on geometric meshes. The schemes are based on Gauss-Jacobi and Gauss-Legendre rules. We show that taking a number of quadrature points slightly exceeding the polynomial degree is enough to preserve root exponential convergence. The total number of algebraic operations to set up the system is $\mathcal{O}(N^{5/2})$, where $N$ is the problem size. Numerical example illustrate the analysis. We also extend our analysis to the fractional Laplacian in higher dimensions for $hp$-finite element spaces based on shape regular meshes.

math.NA↗
arXiv2023

Weighted analytic regularity for the integral fractional Laplacian in polyhedra

On polytopal domains in $\mathbb{R}^3$, we prove weighted analytic regularity of solutions to the Dirichlet problem for the integral fractional Laplacian with analytic right-hand side. Employing the Caffarelli-Silvestre extension allows to localize the problem and to decompose the regularity estimates into results on vertex, edge, face, vertex-edge, vertex-face, edge-face and vertex-edge-face neighborhoods of the boundary. Using tangential differentiability of the extended solutions, a bootstrapping argument based on Caccioppoli inequalities on dyadic decompositions of the neighborhoods provides weighted, analytic control of higher order solution derivatives.

math.AP↗
arXiv2023

FEM-BEM coupling in Fractional Diffusion

We derive and analyze a fully computable discrete scheme for fractional partial differential equations posed on the full space $\mathbb{R}^d$ . Based on a reformulation using the well-known Caffarelli-Silvestre extension, we study a modified variational formulation to obtain well-posedness of the discrete problem. Our scheme is obtained by combining a diagonalization procedure with a reformulation using boundary integral equations and a coupling of finite elements and boundary elements. For our discrete method we present a-priori estimates as well as numerical examples.

math.NA↗
arXiv2023

Fractional Diffusion in the full space: decay and regularity

We consider fractional partial differential equations posed on the full space $\R^d$. Using the well-known Caffarelli-Silvestre extension to $\R^d \times \R^+$ as equivalent definition, we derive existence and uniqueness of weak solutions. We show that solutions to a truncated extension problem on $\R^d \times (0,\YY)$ converge to the solution of the original problem as $\YY \rightarrow \infty$. Moreover, we also provide an algebraic rate of decay and derive weighted analytic-type regularity estimates for solutions to the truncated problem. These results pave the way for a rigorous analysis of numerical methods for the full space problem, such as FEM-BEM coupling techniques.

math.NA↗
arXiv2022

Two-level error estimation for the integral fractional Laplacian

For the singular integral definition of the fractional Laplacian, we consider an adaptive finite element method steered by two-level error indicators. For this algorithm, we show linear convergence in two and three space dimensions as well as convergence of the algorithm with optimal algebraic rates in 2D, when newest vertex bisection is employed for mesh refinement.

math.NA↗
arXiv2022

Exponential Convergence of hp FEM for the Integral Fractional Laplacian in Polygons

We prove exponential convergence in the energy norm of $hp$ finite element discretizations for the integral fractional diffusion operator of order $2s\in (0,2)$ subject to homogeneous Dirichlet boundary conditions in bounded polygonal domains $\Omega\subset \mathbb{R}^2$. Key ingredient in the analysis are the weighted analytic regularity from our previous work and meshes that feature anisotropic geometric refinement towards $\partial\Omega$.

math.NA↗
arXiv2022

Exponential meshes and $\mathcal{H}$-matrices

In our previous works, we proved that the inverse of the stiffness matrix of an $h$-version finite element method (FEM) applied to scalar second order elliptic boundary value problems can be approximated at an exponential rate in the block rank by $\mathcal{H}$-matrices. Here, we improve on this result in multiple ways: (1) The class of meshes is significantly enlarged and includes certain exponentially graded meshes. (2) The dependence on the polynomial degree $p$ of the discrete ansatz space is made explicit in our analysis. (3) The bound for the approximation error is sharpened, and (4) the proof is simplified.

math.NA↗
arXiv2021

Weighted analytic regularity for the integral fractional Laplacian in polygons

We prove weighted analytic regularity of solutions to the Dirichlet problem for the integral fractional Laplacian in polygons with analytic right-hand side. We localize the problem through the Caffarelli-Silvestre extension and study the tangential differentiability of the extended solutions, followed by bootstrapping based on Caccioppoli inequalities on dyadic decompositions of vertex, edge, and edge-vertex neighborhoods.

math.AP↗
arXiv2021

$\mathcal{H}$-inverses for RBF interpolation

We consider the interpolation problem for a class of radial basis functions (RBFs) that includes the classical polyharmonic splines (PHS). We show that the inverse of the system matrix for this interpolation problem can be approximated at an exponential rate in the block rank in the $\mathcal{H}$-matrix format if the block structure of the $\mathcal{H}$-matrix arises from a standard clustering algorithm.

math.NA↗
arXiv2020

Caccioppoli-type estimates and $\mathcal{H}$-Matrix approximations to inverses for FEM-BEM couplings

We consider three different methods for the coupling of the finite element method and the boundary element method, the Bielak-MacCamy coupling, the symmetric coupling, and the Johnson-N\'ed\'elec coupling. For each coupling we provide discrete interior regularity estimates. As a consequence, we are able to prove the existence of exponentially convergent $\mathcal{H}$-matrix approximants to the inverse matrices corresponding to the lowest order Galerkin discretizations of the couplings.

math.NA↗
arXiv2020

Local convergence of the FEM for the integral fractional Laplacian

We provide for first order discretizations of the integral fractional Laplacian sharp local error estimates on proper subdomains in both the local $H^1$-norm and the localized energy norm. Our estimates have the form of a local best approximation error plus a global error measured in a weaker norm.

math.NA↗
arXiv2020

Approximating inverse FEM matrices on non-uniform meshes with $\mathcal{H}$-matrices

We consider the approximation of the inverse of the finite element stiffness matrix in the data sparse $\mathcal{H}$-matrix format. For a large class of shape regular but possibly non-uniform meshes including graded meshes, we prove that the inverse of the stiffness matrix can be approximated in the $\mathcal{H}$-matrix format at an exponential rate in the block rank. Since the storage complexity of the hierarchical matrix is logarithmic-linear and only grows linearly in the block-rank, we obtain an efficient approximation that can be used, e.g., as an approximate direct solver or preconditioner for iterative solvers.

math.NA↗
arXiv2019

On the stability of Scott-Zhang type operators and application to multilevel preconditioning in fractional diffusion

We provide an endpoint stability result for Scott-Zhang type operators in Besov spaces. For globally continuous piecewise polynomials these are bounded from $H^{3/2}$ into $B^{3/2}_{2,\infty}$; for elementwise polynomials these are bounded from $H^{1/2}$ into $B^{1/2}_{2,\infty}$. As an application, we obtain a multilevel decomposition based on Scott-Zhang operators on a hierarchy of meshes generated by newest vertex bisection with equivalent norms up to (but excluding) the endpoint case. A local multilevel diagonal preconditioner for the fractional Laplacian on locally refined meshes with optimal eigenvalue bounds is presented.

math.NA↗
arXiv2019

Quasi-optimal convergence rate for an adaptive method for the integral fractional Laplacian

For the discretization of the integral fractional Laplacian $(-\Delta)^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.

math.NA↗
arXiv2017

Local convergence of the boundary element method on polyhedral domains

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.

math.NA↗