Search

We present a shift theorem for solutions of the Poisson equation in a finite planar cone (and hence also on plane polygons) for Dirichlet, Neumann, and mixed boundary conditions. The range in which the shift theorem holds depends on the angle of the cone. For the right endpoint of the range, the shift theorem is described in terms of Besov spaces rather than Sobolev spaces.

We prove piecewise Sobolev regularity of vector fields that have piecewise regular curl and divergence, but may fail to be globally continuous. The main idea behind our approach is to employ recently developed parametrices for the curl-operator and the regularity theory of Poisson transmission problems. We conclude our work by applying our findings to the heterogeneous time-harmonic Maxwell equations with either a) impedance, b) natural or c) essential boundary conditions and providing wavenumber-explicit piecewise regularity estimates for these equations.

We consider divergence-based high order discretizations of an $L^2$-based first order system least squares formulation of a second order elliptic equation with Robin boundary conditions. For smooth geometries, we show optimal convergence rates in the $L^2(\Omega)$ norm for the scalar variable. Convergence rates for the $L^2(\Omega)$-norm error of the gradient of the scalar variable as well as vectorial variable are also derived. Numerical examples illustrate the analysis.

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.

We present a wavenumber-explicit analysis of FEM-BEM coupling methods for time-harmonic Helmholtz problems proposed in arXiv:2004.03523 for conforming discretizations and in arXiv:2105.06173 for discontinuous Galerkin (DG) volume discretizations. We show that the conditions that $kh/p$ be sufficiently small and that $\log(k) / p$ be bounded imply quasi-optimality of both conforming and DG-method, where $k$ is the wavenumber, $h$ the mesh size, and $p$ the approximation order. The analysis relies on a $k$-explicit regularity theory for a three-field coupling formulation.

This paper is dedicated to the efficient numerical computation of solutions to the 1D stationary Schr\"odinger equation in the highly oscillatory regime. We compute an approximate solution based on the well-known WKB-ansatz, which relies on an asymptotic expansion w.r.t. the small parameter $\varepsilon$. Assuming that the coefficient in the equation is analytic, we derive an explicit error estimate for the truncated WKB series, in terms of $\varepsilon$ and the truncation order $N$. For any fixed $\varepsilon$, this allows to determine the optimal truncation order $N_{opt}$ which turns out to be proportional to $\varepsilon^{-1}$. When chosen this way, the resulting error of the optimally truncated WKB series behaves like $\mathcal{O}(\exp(-r/\varepsilon))$, with some parameter $r>0$. The theoretical results established in this paper are confirmed by several numerical examples., Comment: 39 pages, 11 figures

In this chapter we provide an introduction to fractional dissipative partial differential equations (PDEs) with a focus on trying to understand their dynamics. The class of PDEs we focus on are reaction-diffusion equations but we also provide an outlook on closely related classes of PDEs. To simplify the exposition, we only discuss the cases of fractional time derivatives and fractional space derivatives in the PDE separately. As our main tools, we describe analytical as well as numerical methods, which are generically necessary to study nonlinear dynamics. We start with the analytical study of steady states and local linear stability for fractional time derivatives. Then we extend this view to a global perspective and consider time-fractional PDEs and gradient flows. Next, we continue to steady states, linear stability analysis and bifurcations for space-fractional PDEs. As a final analytical consideration we discuss existence and stability of traveling waves for space-fractional PDEs. In the last parts, we provide numerical discretization schemes for fractional (dissipative) PDEs and we utilize these techniques within numerical continuation in applied examples of fractional reaction-diffusion PDEs. We conclude with a brief summary and outlook on open questions in the field., Comment: book chapter

We discuss the numerical solution of initial value problems for $\varepsilon^2\,\varphi''+a(x)\,\varphi=0$ in the highly oscillatory regime, i.e., with $a(x)>0$ and $0<\varepsilon\ll 1$. We analyze and implement an approximate solution based on the well-known WKB-ansatz. The resulting approximation error is of magnitude $\mathcal{O}(\varepsilon^{N})$ where $N$ refers to the truncation order of the underlying asymptotic series. When the optimal truncation order $N_{opt}$ is chosen, the error behaves like $\mathcal{O}(\varepsilon^{-2}\exp(-c\varepsilon^{-1}))$ with some $c>0$., Comment: 4 pages, 2 figures

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., Comment: arXiv admin note: text overlap with arXiv:2112.08151

In a time-harmonic setting, we show for heterogeneous acoustic and homogeneous electromagnetic wavesguides stability estimates with the stability constant depending linearly on the length $L$ of the waveguide. These stability estimates are used for the analysis of the (ideal) ultraweak (UW) variant of the Discontinuous Petrov Galerkin (DPG) method. For this UW DPG, we show that the stability deterioration with $L$ can be countered by suitably scaling the test norm of the method. We present the ``full envelope approximation'', a UW DPG method based on non-polynomial ansatz functions that allows for treating long waveguides.

We consider fractional Sobolev spaces $H^\theta$, $\theta\in (0,1)$, on 2D domains and $H^1$-conforming discretizations by globally continuous piecewise polynomials on a mesh consisting of shape-regular triangles and quadrilaterals. We prove that the norm obtained from interpolating between the discrete space equipped with the $L^2$-norm on the one hand and the $H^1$-norm on the other hand is equivalent to the corresponding continuous interpolation Sobolev norm, and the norm-equivalence constants are independent of meshsize and polynomial degree. This characterization of the Sobolev norm is then used to show an inverse inequality between $H^1$ and $H^\theta$.

We consider scalar semilinear elliptic PDEs where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. We formulate an adaptive iterative linearized finite element method (AILFEM) which steers the local mesh refinement as well as the iterative linearization of the arising nonlinear discrete equations. To this end, we employ a damped Zarantonello iteration so that, in each step of the algorithm, only a linear Poisson-type equation has to be solved. We prove that the proposed AILFEM strategy guarantees convergence with optimal rates, where rates are understood with respect to the overall computational complexity (i.e., the computational time). Moreover, we formulate and test an adaptive algorithm where also the damping parameter of the Zarantonello iteration is adaptively adjusted. Numerical experiments underline the theoretical findings.

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$.

A generalized finite element method is proposed for solving a heterogeneous reaction-diffusion equation with a singular perturbation parameter $\varepsilon$, based on locally approximating the solution on each subdomain by solution of a local reaction-diffusion equation and eigenfunctions of a local eigenproblem. These local problems are posed on some domains slightly larger than the subdomains with oversampling size $\delta^{\ast}$. The method is formulated at the continuous level as a direct discretization of the continuous problem and at the discrete level as a coarse-space approximation for its standard FE discretizations. Exponential decay rates for local approximation errors with respect to $\delta^{\ast}/\varepsilon$ and $\delta^{\ast}/h$ (at the discrete level with $h$ denoting the fine FE mesh size) and with the local degrees of freedom are established. In particular, it is shown that the method at the continuous level converges uniformly with respect to $\varepsilon$ in the standard $H^{1}$ norm, and that if the oversampling size is relatively large with respect to $\varepsilon$ and $h$ (at the discrete level), the solutions of the local reaction-diffusion equations provide good local approximations for the solution and thus the local eigenfunctions are not needed. Numerical results are provided to verify the theoretical results.

We prove weighted analytic regularity for the solution of the integral fractional Poisson problem on bounded intervals with analytic right-hand side. Based on this regularity result, we prove exponential convergence of the hp-FEM on geometric boundary-refined meshes.

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.

We consider a space-time fractional parabolic problem. Combining a sinc-quadrature based method for discretizing the Riesz-Dunford integral with $hp$-FEM in space yields an exponentially convergent scheme for the initial boundary value problem with homogeneous right-hand side. For the inhomogeneous problem, an $hp$-quadrature scheme is implemented. We rigorously prove exponential convergence with focus on small times $t$, proving robustness with respect to startup singularities due to data incompatibilities.

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.

We formulate and analyze a goal-oriented adaptive finite element method (GOAFEM) for a semilinear elliptic PDE and a linear goal functional. The strategy involves the finite element solution of a linearized dual problem, where the linearization is part of the adaptive strategy. Linear convergence and optimal algebraic convergence rates are shown.

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.

We design and analyze a coupling of a discontinuous Galerkin finite element method with a boundary element method to solve the Helmholtz equation with variable coefficients in three dimensions. The coupling is realized with a mortar variable that is related to an impedance trace on a smooth interface. The method obtained has a block structure with nonsingular subblocks. We prove quasi-optimality of the $h$- and $p$-versions of the scheme, under a threshold condition on the approximability properties of the discrete spaces. Amongst others, an essential tool in the analysis is a novel discontinuous-to-continuous reconstruction operator on tetrahedral meshes with curved faces.

The inverse of the stiffness matrix of the time-harmonic Maxwell equation with perfectly conducting boundary conditions is approximated in the blockwise low-rank format of ${\mathcal H}$-matrices. We prove that root exponential convergence in the block rank can be achieved if the block structure conforms to a standard admissibility criterion.

We analyze a divergence based first order system least squares method applied to a second order elliptic model problem with homogeneous boundary conditions. We prove optimal convergence in the $L^2(\Omega)$ norm for the scalar variable. Numerical results confirm our findings.

We consider acoustic scattering in heterogeneous media with piecewise constant wave number. The discretization is carried out using a Galerkin boundary element method in space and Runge-Kutta convolution quadrature in time. We prove well-posedness of the scheme and provide a priori estimates for the convergence in space and time.

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.

We study numerically the one-dimensional Allen-Cahn equation with the spectral fractional Laplacian $(-\Delta)^{\alpha/2}$ on intervals with homogeneous Neumann boundary conditions. In particular, we are interested in the speed of sharp interfaces approaching and annihilating each other. This process is known to be exponentially slow in the case of the classical Laplacian. Here we investigate how the width and speed of the interfaces change if we vary the exponent $\alpha$ of the fractional Laplacian. For the associated model on the real-line we derive asymptotic formulas for the interface speed and time-to-collision in terms of $\alpha$ and a scaling parameter $\varepsilon$. We use a numerical approach via a finite-element method based upon extending the fractional Laplacian to a cylinder in the upper-half plane, and compute the interface speed, time-to-collapse and interface width for $\alpha\in(0.2,2]$. A comparison shows that the asymptotic formulas for the interface speed and time-to-collision give a good approximation for large intervals.

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.

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.

We present a FEM-BEM coupling strategy for time-harmonic acoustic scattering in media with variable sound speed. The coupling is realized with the aid of a mortar variable that is an impedance trace on the coupling boundary. The resulting sesquilinear form is shown to satisfy a Garding inequality. Quasi-optimal convergence is shown for sufficiently fine meshes. Numerical examples confirm the theoretical convergence results.

We consider the approximation to an abstract evolution problem with inhomogeneous side constraint using $A$-stable Runge-Kutta methods. We derive a priori estimates in norms other than the underlying Banach space. Most notably, we derive estimates in the graph norm of the generator. These results are used to study convolution quadrature based discretizations of a wave scattering and a heat conduction problem.

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.

The semidiscretization of a sound soft scattering problem modelled by the wave equation is analyzed. The spatial treatment is done by integral equation methods. Two temporal discretizations based on Runge-Kutta convolution quadrature are compared: one relies on the incoming wave as input data and the other one is based on its temporal derivative. The convergence rate of the latter is shown to be higher than previously established in the literature. Numerical results indicate sharpness of the analysis. The proof hinges on a novel estimate on the Dirichlet-to-Impedance map for certain Helmholtz problems. Namely, the frequency dependence can be lowered by one power of $\abs{s}$(up to a logarithmic term for polygonal domains) compared to the Dirichlet-to-Neumann map.

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.

We consider a time dependent problem generated by a nonlocal operator in space. Applying a discretization scheme based on $hp$-Finite Elements and a Caffarelli-Silvestre extension we obtain a semidiscrete semigroup. The discretization in time is carried out by using $hp$-Discontinuous Galerkin based timestepping. We prove exponential convergence for such a method in an abstract framework for the discretization in the original domain $\Omega$.

We consider fractional Sobolev spaces $H^\theta(\Gamma)$, $\theta \in [0,1]$, on a 2D surface $\Gamma$. We show that functions in $H^\theta(\Gamma)$ can be decomposed into contributions with local support in a stable way. Stability of the decomposition is inherited by piecewise polynomial subspaces. Applications include the analysis of additive Schwarz preconditioners for discretizations of the hypersingular integral operator by the $p$-version of the boundary element method with condition number bounds that are uniform in the polynomial degree $p$.

Extending the wavenumber-explicit analysis of [Chen & Qiu, J. Comput. Appl. Math. 309 (2017)], we analyze the $L^2$-convergence of a least squares method for the Helmholtz equation with wavenumber $k$. For domains with an analytic boundary, we obtain improved rates in the mesh size $h$ and the polynomial degree $p$ under the scale resolution condition that $hk/p$ is sufficiently small and $p/\log k$ is sufficiently large.

The integral version of the fractional Laplacian on a bounded domain is discretized by a Galerkin approximation based on piecewise linear functions on a quasi-uniform mesh. We show that the inverse of the associated stiffness matrix can be approximated by blockwise low-rank matrices at an exponential rate in the block rank.

The time-harmonic Maxwell equations at high wavenumber $k$ are discretized by edge elements of degree $p$ on a mesh of width $h$. For the case of a ball and exact, transparent boundary conditions, we show quasi-optimality of the Galerkin method under the $k$-explicit scale resolution condition that a) $kh/p$ is sufficient small and b) $p/\log k$ is bounded from below.

On the reference tetrahedron $\widehat K$, we define three projection-based interpolation operators on $H^2(\widehat K)$, ${\mathbf H}^1(\widehat K,\operatorname{\mathbf{curl}})$, and ${\mathbf H}^1(\widehat K,\operatorname{div})$. These operators are projections onto space of polynomials, they have the commuting diagram property and feature the optimal convergence rate as the polynomial degree increases in $H^{1-s}(\widehat K)$, ${\mathbf H}^{-s}(\widehat K,\operatorname{\mathbf{curl}})$, ${\mathbf H}^{-s}(\widehat K,\operatorname{div})$ for $0 \leq s \leq 1$.

Butterfly algorithms are an effective multilevel technique to compress discretizations of integral operators with highly oscillatory kernel functions. The particular version of the butterfly algorithm considered here realizes the transfer between levels by Chebyshev interpolation. We present a refinement of the analysis that improves the stability estimates underlying the error bounds.

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.