Skip to main content
Springer logoLink to Springer
. 2023 Jan 26;153(2-3):359–410. doi: 10.1007/s00211-022-01342-8

Double exponential quadrature for fractional diffusion

Alexander Rieder 1,2,
PMCID: PMC9998606  PMID: 36915282

Abstract

We introduce a novel discretization technique for both elliptic and parabolic fractional diffusion problems based on double exponential quadrature formulas and the Riesz–Dunford functional calculus. Compared to related schemes, the new method provides faster convergence with fewer parameters that need to be adjusted to the problem. The scheme takes advantage of any additional smoothness in the problem without requiring a-priori knowledge to tune parameters appropriately. We prove rigorous convergence results for both, the case of finite regularity data as well as for data in certain Gevrey-type classes. We confirm our findings with numerical tests.

Mathematics Subject Classification: 65N15, 65M12

Introduction

The study of processes governed by fractional linear operators has gathered significant interest over the last few years [8, 22, 35] with applications ranging from physics [1] to image processing [1, 15, 16], inverse problems [19] and more. See [33] for an overview of applications in different fields. The goal is to solve problems of the form

(-Δ)βu=fortαu+(-Δ)βu=f

with parameters β,α(0,1]. There are multiple (non-equivalent) ways of defining fractional powers of operators. We mention the integral fractional Laplacian and the spectral definition [22]. In this paper, we focus on the spectral definition which is equivalent to the functional calculus definition.

For discretization of such problems, both stationary and time dependent, multiple approaches have been presented. A summary of the most common can be found in [2, 22]. They can be broadly distinguished into three categories. The first class of methods uses the Caffarelli-Silvestre extension to reformulate the problem as a PDE posed in one additional spatial dimension. This problem is then treated by standard finite element techniques [6, 24, 25, 2729]. The second big class of discretization schemes, and the one our new scheme is part of, was first introduced in [7] and later extended to more general operators [5] and time dependent problems [3, 4, 26]. They are based on the Riesz–Dunford calculus (sometimes also referred to as Dunford-Taylor or Riesz-Taylor) and employ a sinc quadrature scheme to discretize the appearing contour integral. sinc quadrature, and overall sinc-based numerical methods are less well known than their polynomial based counterparts, but provide rapidly converging schemes [21, 32] with very easy implementation. The quadrature relies on appropriate coordinate transforms in order to yield analytic, rapidly decaying integrands over the real line and then discretization using the trapezoidal quadrature rule. In [34] it was realized that by adding an additional sinh-transformation, it is possible to get an even faster convergence for certain integrals. Namely, writing Nq for the number of quadrature points, instead of convergence of the form e-Nq, it is possible to get rid of the square root and obtain rates of the form e-NqlnNq. Further developments in this direction are summarized in [23]. Such schemes are commonly referred to as double exponential quadrature or sinh-tanh quadrature. Thirdly there is the large class of methods based on rational approximation of the functions z-β and the Mittag Leffler-Function eγ,μ(z) (see (3.18) for the precise definition). As shown in [17], this class also encompasses the previous two approaches while also allowing some other methods, based on general rational approximation algorithms like Best-Uniform-Rational approximation (BURA) or the “Adaptive Antoulas-Anderson”-algorithm (AAA) from [30]. Finally, there exist some further methods based on reduced basis and rational Krylov methods [9, 10, 12, 13] which are strongly related to rational approximation.

In this paper we investigate whether the discretization of the Riesz–Dunford integral can benefit from using a double exponential quadrature scheme instead of the more established sinc-quadrature. We present a scheme that retains all the advantages of [35] while delivering improved convergence rates. Namely, the scheme is very easy to implement if a solver for elliptic finite element problems is available. It is almost trivially parallelizable, as the main cost consists of solving a series of independent elliptic problems. In addition, it provides (compared to sinc-methods) superior accuracy over a wide range of applications and does not require subtle tweaking of parameters in order to get good performance. Instead it will automatically pick up any additional smoothness of the underlying problem to give improved convergence. Since for each quadrature point an elliptic FEM problem needs to be solved, reducing the number of quadrature points greatly increases performance of the overall method.

Compared to the BURA and AAA rational approximation methods, the sinc- and double-exponential quadrature based algorithms have several advantages. Firstly, the implementation is very simple with quadrature nodes that are known explicitly. The quadrature points are also independent of the spectrum of the operator L and no explicit bound on the largest eigenvalue is required. This makes them better suited for highly accurate but highly ill-conditioned discretizations like the hp-FEM scheme in [26].

Secondly, the quadrature points are independent of the function that is to be approximated. Most notably, when considering the time-dependent problem with inhomogeneus right-hand side in Sect. 3.3, all the linear systems that need to be solved are independent of the time t or the integration variable τ. This makes the full time-dependent problem of the same cost (with respect to the number of systems that need solving) as the simple stationary problem. Thirdly, the quadrature based methods allow for very detailed analysis, as showcased in this article. In addition to the quadrature analysis, they also allow for detailed analysis of the error brought in by a discretization in space [26]. In practice, we also observed better numerical stability in the presence of rounding errors, as showcased in Fig. 4.

Fig. 4.

Fig. 4

Comparison of approximation schemes for 2d elliptic problems with different parameter β

The paper is structured as follows. After fixing the model problem and notation in Sects. 1.1, 3 introduces the double exponential formulas in an abstract way and we collect some known properties. In addition, we provide one small convergence result which, to our knowledge, has not yet appeared in the literature; we show that the double exponential formulas at least provide comparable convergence of order e-Nq even without requiring additional analyticity compared to standard sinc methods.

The paper is structured as follows. In Sect. 1, we introduce the general setting and the functional calculus. Sect. 2 introduces the quadrature scheme as well as the model problems we are interested in. We also state the main convergence results. Sect. 3 is devoted to proving these results. Sect. 3.1 presents the abstract analysis for sinc methods and collects some known properties. In addition, we provide one small convergence result which, to our knowledge, has not yet appeared in the literature; we show that the double exponential formulas at least provide comparable convergence of order e-Nq/ln(Nq) even without requiring additional analyticity compared to standard sinc methods. In Sect. 3.2, we look at the case of a purely elliptic problem without time dependence. It will showcase the techniques used and provide the building block for the more involved problems later on. In Sect. 3.3, we then consider what happens if we move into the time-dependent regime. Section 4 provides extensive numerical evidence supporting the theory. We also compare our new method to the standard sinc-based methods. Finally, Appendix A collects some properties of the coordinate transform involved. The proofs and calculations are elementary but somewhat lengthy and thus have been relegated to the appendix in order to not impact readability of the article.

Throughout this work we will encounter two types of error terms. For those of the form e-γk we will be content with not working out the constants γ explicitly. For the more important terms of the form e-γk we will derive explicit constants γ which prove sharp in several examples of Sect. 4.

We close with a remark on notation. Throughout this text, we write AB to mean that there exists a constant C>0, which is independent of the main quantities of interest like number of quadrature points Nq or step size k such that ACB. The detailed dependencies of C are specified in the context. We write AB to mean AB and BA.

General setting and notation

In this paper, we consider problems of applying holomorphic functions f to self-adjoint operators, for example the Laplacian. The two large classes of problems treated in this paper stem from the study of fractional diffusion problems, both in the stationary as well as in the transient version. Since it does not incur additional difficulty compared to the explicit setting of Remark 1.2, we will work in the following abstract setting:

Assumption 1.1

Let X be a Hilbert space and L be a positive definite, self adjoint operator on X such that there exists a sequence of eigenvalues λj>0 with associated eigenfunctions φjX, jN0, such that (φj)j=0 is an orthonormal basis of X.

Given the eigenvalues and eigenfunctions of L, we define the spaces for β0

Hβ:={uX:uHβ(Ω)<}withuHβ2:=j=0λjβ(u,vj)X2. 1.1

Remark 1.2

The problem we have in mind for our applications is the following: given a bounded Lipschitz domain Ω, we consider the space X:=L2(Ω) and the self adjoint operator

Lu:=-div(Au)+cu,

where AL(Ω;Rd×d) is uniformly symmetric and positive definite and cL(Ω) satisfies c0 almost everywhere. The domain of dom(L) is always taken to include homogeneous Dirichlet boundary conditions. In this case, the spaces Hβ(X) correspond to the standard (fractional) Sobolev spaces often denoted by Hβ(Ω) or H~β(Ω) in the literature.

Remark 1.3

[5] considers an even more general class of operators, namely the class of “regular accretive operators”. We expect some of the results of this article to carry over also to such a class, but since many of our proofs rely on the decomposition using real eigenvalues, such generalizations would be non-trivial.

The spaces Hβ are the natural setting for our regularity assumptions on the data. If we are interested in convergence beyond root-exponential rates, we need the following class of functions of Gevrey-type.

GL(Cf,Rf,ω):={fX:fHρCfRfρ(Γ(ρ+1))ω<ρ0}. 1.2

Compared to the standard Gevrey-class of functions, these spaces also include boundary conditions for the functions Lnf for all nN. If the boundary conditions are met, we can then estimate

fHρfX+Lρ/2fX.

Examples for such functions are those only containing a finite number of frequencies when decomposed into the eigenbasis of L, but also more complex functions such as smooth bump functions with compact support are admissible (see [31, Section 1.4]).

One natural way of defining a functional calculus for the operator L is based on the spectral decomposition.

Definition 1.4

(Spectral calculus) Let OR+ such that O contains the spectrum of L. Let g:OC be continuous with g(z)(1+z)μ for μR. We define for uH2μ(Ω):

g(L)u:=j=0g(λj)(u,vj)Xvj.

An alternative definition for holomorphic functions, which will prove more useful for approximation is given in the following Definition. For simplicity, we restrict our considerations to decaying functions g. In this case, it can be shown (see also [3, Section 2]) that the operators resulting from Definitions 1.4 and 1.5 coincide.

Definition 1.5

(Riesz–Dunford calculus) Fix parameters σ=1/2 or σ=1, θ1 and κ>0. Let OC such that C+:={zC:Re(z)>0}O. Let g:OC be holomorphic with g(z)(1+z)μ for μ<0. We define

g(L):=12πiCg(z)(L-z)-1dz, 1.3

where the integral is taken in the sense of Riemann, and C is the smooth path

C:={κ(cosh(σw)+iθsinh(w))forwR}.

The parameter κ>0 is taken sufficiently small such that κ<λ0, where λ0 is the smallest eigenvalue of L. The parameters σ and θ can be used to tweak the discretization. We have observed the best behavior for σ:=1/2 and θ:=4; cf. Sect. 4.

Remark 1.6

The choice of path in Definition 1.5 is somewhat arbitrary. It is only required to encircle the spectrum of L with winding number 1. Throughout this paper, we will only ever use the same path and thus make it part of our definition.

Remark 1.7

One could also think to allow σ(0,1). For the practical application of the scheme this does not make a big difference, but the analysis for σ1 in this paper makes heavy use of the half-angle formula. Therefore we restrict our view to the cases σ=1 or σ=1/2. In numerical experiments, methods with σ1/2 work, but we decided that the small difference in performance does not warrant the much greater complexity of analysis.

Model problems, discretization and results

In this section, we introduce the discretization methods and, in order to ease the reading of the article, we present the most important of the convergence results. All of the sometimes very technical proofs are relegated to Sect. 3.

The main role in our discretization schemes will be played by the following coordinate transform which parametrizes the contour in Definition 1.5:

ψθ,σ(y):=κ[cosh(σπ2sinh(y))+iθsinh(π2sinh(y))]. 2.1

We will focus on the cases σ{12,1} and θ1. κ is again taken sufficiently small as in Definition 1.5.

Using this transformation, we can introduce the double exponential quadrature approximation of the Riesz–Dunford calculus in Definition 1.5. Because the discretization by quadrature will appear repeatedly for different functions and operators, we introduce the following notation:

Definition 2.1

Let OC such that C+O. For g:OC holomorphic as in Definition 1.5, k0 and NqN{} we write for all uX

QL(g,Nq)u:=12πij=-NqNqg(ψσ,θ(jk))ψσ,θ(jk)(L-ψσ,θ(jk))-1u 2.2

and QL(g):=QL(g,) for the case where no cutoff is performed. The quadrature error will be denoted by

EL(g,Nq):=g(L)u-QL(g,Nq)u,udom(g(L)) 2.3

where g(L) is given via the Riesz–Dunford integral 1.5. Again, we write EL(g):=EL(g,).

Remark 2.2

In Definition 2.1, we will often work with the special case L=λ. This is taken to mean the scalar multiplication operator uλu on the vector space X.

We apply the function to the following problems:

  • (i)

    g(z):=z-β: This corresponds to solving an elliptic fractional diffusion problem; see Sect. 2.1 for the model problem and Sect. 3.2 for the proofs.

  • (ii)

    g(z)=eγ,μ(-tαzβ), with eγ,μ the Mittag–Leffler function: This corresponds to a parabolic model problem; see Sects. 2.2 and 3.3.

For both model problems, we prove two convergence results, depending on the regularity of the data. In the case of “finite regularity”, the data (f or u0) are assumed to be in a space H2ρ for some ρ>0. This results in bounds of root-exponential order Nq/ln(Nq).

The second case is the one were the data are in the Gevrey-type classes GL introduced in (1.2). For such functions, the double-exponential discretization leads to an improved convergence of the form O(e-γNqln(Nq)).

The elliptic problem

As our first model problem, we consider the following elliptic fractional diffusion problem:

GivenfL2(Ω)andβ>0,findudom(Lβ)such thatLβu=f. 2.4

Using the Riesz–Dunford formula, this is equivalent to computing

u=12πiCz-β(L-z)-1fdz.

In order to get a discrete scheme, we replace the integral with the quadrature formula. Given NqN and k>0, the approximation to (2.4) is then given by

uk:=QL(z-β,Nq)f.

Remark 2.3

Since in practice, the solution operator (L-z)-1 is not computable, one would in addition replace (L-z)-1 by a Galerkin solver in order to obtain a fully computable scheme. In the Setting of Remark 1.2, this means the following: given a closed subspace VhH01(Ω), the discrete resolvent Rh(z):L2(Ω)Vh is given as the solution

Rh(z)f:=uh,with(Auh,vh)L2(Ω)+((c-z)uh,vh)L2(Ω)=(f,vh)L2(Ω)vhVh.

Given discretization parameters VhH1(Ω), NqN and k>0, the fully discrete approximation to (2.4) is then given by

uh,k:=12πij=-NqNq(ψσ,θ(jk))-βψσ,θ(jk)Rh(ψσ,θ(jk))f. 2.5

In order to keep presentation to a reasonable length, we focus on the spatially continuous setting. We only remark that discretization in space can be easily incorporated into the analysis. For low order finite elements one can follow [3]; for an exponentially convergent hp-FEM scheme we refer to [26].

Remark 2.4

We should point out that for the elliptic problem, there exist methods based on the Balakrishnan formula (see also Sect. 4) which do not require complex arithmetic. On the other hand, since we are only approximating real valued functions, we can exploit the symmetry of (2.2) to only solve for j0, thus halving the number of linear systems. This results in (roughly) comparable computational effort for both the Balakrishnan and the double exponential schemes. Due to their better convergence the DE-schemes might therefore still be advantageous.

The convergence of the new method can be summarized in the following two theorems.

Theorem 2.5

Let u be the exact solution to (2.4) and assume fH2ρ(Ω) for some ρ0. Let ββ¯ with β¯(0,1] and uk:=QL(z-β,Nq)f denote the approximation computed using stepsize k>0 and NqN quadrature points. Then, the following estimate holds for all ε0 and r[0,β¯/2]:

u-ukH2r=EL(z-β,Nq)fH2re-[p(σ,θ)-ε]β+ρ-rkfH2ρ+[exp(-γk)+exp(-γekNq)]fX,

where the rate p(σ,θ) is given by

p(σ,θ):=22πtan-1(θ)forσ=1,2π,forσ=1/2. 2.6

For ε>0, the implied constant and γ may depend on ε,r, the smallest eigenvalue λ0 of L, β¯, κ, θ and σ. But they are independent of ρ, β, k, and f. If ε=0, the constants may in addition depend on ρ and β.

Remark 2.6

When comparing Theorem 2.5 to the estimates of the standard sinc-quadrature one might think that the double exponential method is inferior due to the k vs k behavior. This misconception can be cleared up by considering the better decay properties of the double-exponential formula. It allows to choose kln(Nq)/Nq compared to the standard sinc-quadrature choice of kNq-1/2 without the cutoff error becoming dominant. Using this choice, the exponential term scales like Nq/ln(Nq) for double exponential and Nq for standard sinc respectively. As is shown in Sect. 4, the better constants in the exponential still often outweigh the presence of the ln-term for the double-exponential quadrature.

Remark 2.7

For most of the computation, the convergence rate is determined by the factor p(σ,θ) in Corollary 3.8. We observe that for θ=1, picking σ=1/2 roughly doubles the convergence rate. Similarly, it often appears beneficial to pick larger values of θ. Especially for σ=1, we get an asymptotic rate for θ, which is the same as in the case of σ=1/2. But we need to point out that increasing θ means that we have to decrease the value d(θ), which determines the rate in the higher orders terms of the form e-γ/k, thus leading to those terms dominating in a larger and larger preasymptotic regime. Overall, the method using σ=1/2 and setting θ moderately large is expected to give the best convergence rates; cf. Sect. 4.

The previous theorem shows that in general, the convergence behaves like O(e-γk). It also shows that, if the function f in the right-hand side has some additional smoothness, the method automatically detects this and delivers an improved convergence rate. If the additional smoothness is in the right Gevrey type classes, we can establish convergence which is beyond the root exponential behavior. The details can be found in the following theorem:

Theorem 2.8

Let u be the exact solution to (2.4) and assume that there exist constants Cf,ω,Rf>0 such that fGL(Cf,Rf,ω), i.e.,

fHρCfRfρ(Γ(ρ+1))ω<ρ0.

Assume that β>β¯ with β¯(0,1]. Let uk:=QL(z-β,Nq)f denote the approximation computed using stepsize k(0,1/2) and NqN quadrature points. Then, the following estimate holds:

u-ukHβ¯=EL(z-β,Nq)Hβ¯Cfexp(-γkln(k))+Cfexp(-γekNq).

The implied constant and γ may depend on ω, the smallest eigenvalue λ0 of L, κ, θ, σ, Rf, β¯, and ω. If ω=0, the logarithmic term may be removed.

The parabolic problem

The second model problem we consider is a time-dependent fractional diffusion problem of parabolic type. We fix α,β(0,1] and a final time T>0. Given an initial condition u0X and right-hand side fC([0,T],X) we seek u:[0,T]dom(Lβ) satisfying

tαu+Lβu=fin[0,T],u(t)dom(Lβ)t>0,andu(0)=u0, 2.7

where tα denotes the Caputo fractional derivative. Following [4], the solution u can be written using the Mittag–Leffler function eα,μ (see (3.18)) as

u(t):=eα,1(-tαLβ)u0+0tτα-1eα,α(-ταLβ)f(t-τ)dτ. 2.8

Here we again use either the spectral or, equivalently, the Riesz–Dunford calculus to define the operators. We discretize this problem by using our double exponential formula. Namely for k>0 and using NqN quadrature points,

uk(t):=QL(eα,1(-tαzβ),Nq)u0+0tτα-1QL(eα,α(-ταzβ),Nq)f(t-τ)dτ. 2.9

Remark 2.9

In practice, in order to get a fully computable discrete scheme, one would again replace the resolvent by a Galerkin solver and the convolution in time by an appropriate numerical quadrature. For example, [4] presents a low order approximation scheme. In order to retain exponential convergence, [26] uses a scheme based on hp-FEM and hp-quadrature. We summarize the construction briefly. For a given degree pN0, and interval I, we denote the Gauss quadrature points and weights on (-1,1) by (xjI,p,wjI,p)I×R+, j=0,,p. See [11, Section 2.7] for details. We then consider a geometric mesh on (0, 1) with grading factor σ(0,1) and parameter LN, Lp given by

K0:=(0,σL),K1:=(σL,σL-1),,KL:=(σ,1).

On each one of these elements, we apply a Gauss quadrature, reducing the order as we approach the singularity, i.e., we get the nodes and weights as

(X,W):==0L{(xjK,p-L+,wjK,p-L+):j=0,,p}.

The convolution in (2.7) is then replaced by

0tτα-1eα,α(-ταzβ)dτt(xj,wj)(X,W)wj(txj)α-1eα,α(-(txj)αzβ)f(t-(txj))=:ht(z).

In order to get a fully discrete scheme, this function is then discretized using the double exponential quadrature scheme:

0tτα-1eα,α(-ταLβ)f(t-τ)dτQL(ht,Nq).

In order to not overwhelm the presentation of the paper, we do not consider these types of discretization errors. The analysis of such errors could be taken almost verbatim from the references [3, 26].

The analysis of the method again comes in the form of two theorems, one for the case of finite regularity and one for regularity in the Gevrey-type classes GL(Cf,Rf,ω).

Theorem 2.10

Assume that either α+β<2 or σ=1 (i.e., the case α=β=1 and σ=1/2 is not allowed). Let u be the solution to (2.7). Assume u0H2ρ for some ρ>0, and fCm([0,T],H2ρ) for some mN. Let uk be the corresponding discretization using stepsize k>0 and NqN quadrature points as defined in (2.9).

Then, the following estimate holds for all t(0,T), r[0,β/2] and any q<1:

u(t)-uk(t)H2rmax(t-m-qα,Tα)(u0H2ρ+j=0mmaxτtf(j)(τ)H2ρ)×(e-min{p(σ,θ)β+ρ-r,γ1m/α+q}k+e-γ/k+e-γekNq),

where p(σ,θ) is as in (2.6) and γ1 is the constant from Corollary 3.5. The implied constant and γ may depend on q, r, the smallest eigenvalue λ0 of L, β, α, κ, θ, σ and ρ.

Theorem 2.11

Assume that either α+β<2 or σ=1 (i.e., the case α=β=1 and σ=1/2 is not allowed). Let u be the solution to (2.7), and assume that the data satisfy

u0HρCu0Ru0ρ(Γ(ρ+1))ω<ρ0f(n)(t)HρCfRfρ+n(Γ(ρ+1))ω(n!)ω<t[0,T],ρ0,nN0. 2.10

Let uk be the corresponding discretization using stepsize k(0,1/2) and NqN quadrature points as defined in (2.9). Then, the following estimate holds:

u(t)-uk(t)Hβ(1+t)exp(-γklntlnk)+(t+t-γ/2)exp(-γekNq)

with t:=min(t,1/2). The implied constant and γ may depend on the smallest eigenvalue λ0 of L, β, θ, σ and the constants from (2.10).

Error analysis

In this section, we analyze the quadrature error when applying a double exponential formula for discretizing certain integrals.

For θ1, δ>0 we define the sets

Dd(θ):={zC:Im(z)<d(θ)},andDδexp:={zC:Im(z)<δe-Re(z)}, 3.1

where for each θ, d(θ) is a constant which is assumed sufficiently small in order for Lemmas A.3, A.4, and A.8 to hold.

Since all the proofs analyzing the properties of ψσ,θ are elementary but somewhat lengthy and cumbersome, they have been relegated to Appendix A. The most important properties are, that yψσ,θ(y) for yR traces the contour in the definition of the Riesz Dunford calculus (see Definition 1.5), and that it is analytic in Dd(θ). The other important results concern the points where ψσ,θ crosses the real axis, as these points correspond to (possible) poles in the integrand of Definition 1.5. The location of these points, as well as other important estimates are collected in Lemma A.8. Roughly summarizing, the finitely many points y satisfying ψσ,θ(y)=λ have distance 1/ln(λ) from the real axis. Away from such points ψσ,θ(y)-λλ holds and for y± the function ψσ,θ behaves doubly-exponential (Lemma A.4).

Abstract analysis of sinc-quadrature

In this section, we collect some results on sinc-quadrature formulas.

Remark 3.1

As is common in the literature, we define the sinc function as

sinc(ζ):=sin(πζ)πζζ01ζ=0.

The following result is the main work-horse when analyzing sinc-quadrature schemes. In order to reduce the required notation, we use a simplified version of [32, Problem 3.2.6].

Proposition 3.2

(Bialecki, see [32, Problem 3.2.6 and Theorem 3.1.9]) We make the following assumptions on g:

  • (i)

    g is a meromorphic function on the infinite strip Dd(θ). It is also continuous on Dd(θ). The poles (p)=1Np are all simple and located in Dd(θ)\R.

  • (ii)
    There exists a constant C>0 independent of yR such that for sufficiently large y>0,
    -d(θ)d(θ)g(y+iw)dwC. 3.2
  • (iii)
    We have
    N(g,Dd(θ)):=-g(y+id(θ))+g(y-id(θ))dy<. 3.3

Denote by res(g;p) the residue of g at p, and define γ(k;p):=1sin(πp/k).

Then for all k>0, using s:=sign(Im(p)):

|Rg(t)dt-kn=-g(kn)-π=1Npeisπpkres(g;p)γ(k;p)|e-2πd(θ)/k1-e-2πd(θ)/kN(g,Dd(θ)). 3.4

Proposition 3.2 requires certain decay properties for the integrand in a complex strip, and thus is not always applicable. As is shown in Appendix A, the transformation ψσ,θ maps partly into the left-half plane. One can even show that the real part changes sign infinitely many times when evaluating along a line of fixed imaginary part. If we therefore consider the case when f(z):=e-z is the exponential function, this means that fψ is exponentially increasing in such regions. This puts showing estimates of the form required in Proposition 3.2 (iii) out of reach.

On the other hand, Lemma A.5 shows that for σ=1, restricted to the domain Dδexp, the map ψσ,θ stays in the right half-plane. Here the exponential function is decreasing. Similarly, the Mittag–Leffler function eα,μ is decreasing on slightly larger sectors, allowing for the choice of σ=1/2 if α<1. This motivates the following modification of Proposition 3.2.

Lemma 3.3

Assume that g:DδexpC is holomorphic and is doubly-exponentially decreasing, i.e., there exist constants Cg>0, μg>0, such that g satisfies

g(y)Cgexp(-μgeRe(y))yDδexp. 3.5

Then, for all Inline graphic, there exists a constant C>0 which is independent of k, μ and g such that the following error estimate holds:

Rg(t)dt-kn=-g(kn)CCgkexp(-8πδμg-2εk). 3.6

Proof

We closely follow the proof of [21, Theorem 2.13], but picking a different contour and later exploiting the strong decay properties of g.

For NN, set RN:={yC:Re(y)(N+12),Im(y)δe-Re(y)}. For fixed tR, we fix N large enough such that tRN. By applying the residue theorem to the function

h(y):=sin(πt/k)g(y)(t-y)sin(πy/k),

one can show the equality

g(t)-kn=-NNg(nk)sinc(t-nkk)=RNsin(πt/k)g(y)(t-y)sin(πy/k)dy.

Since asymptotically g(t) decreases doubly exponentially, while 1/sin(πy/k) only grows exponentially along the path {(ξ,δe-ξ),ξR}, we can pass to the limit N to get the representation

g(t)-kn=-g(kn)sinc(t-nkk)=Dδexpsin(πt/k)g(y)(t-y)sin(πy/k)dy. 3.7

Integrating (3.7) over R and exchanging the order of integration gives:

Rg(t)dτ-kn=-g(kn)=Dδexpg(y)sin(πy/k)Rsin(πt/k)t-ydtdy.=πDδexpg(y)sin(πy/k)eisign(Im(y))πykdy, 3.8

where in the last step we invoked [21, Lemma 2.19] to explicitly evaluate the integral. What remains to be done is bound the integral on the right-hand side. For simplicity, we focus on the upper-right half-plane. The other cases follow analogously. There, we can parameterize Dδexp as y=ξ+iδe-ξ. We estimate

g(y)sin(πy/k)eisignIm(y)πyk=|g(y)||eiπyk||eiπy/k-e-iπy/k|=g(y)exp(-πδe-ξk)exp(πδe-ξk)-exp(-πδe-ξk)=g(y)exp(-2πδe-ξk)1-exp(-2πδe-ξk)g(y)keξexp(-2πδe-ξk)(3.5)Cgkexp(-μgeξ+ξ-2πδe-ξk) 3.9

For ε>0, we can absorb the linear ξ-term into the first exponential, and estimate:

(3.9)ε-1Cgkexp(-(μg-2ε)eξ-2πδe-ξk)exp(-εeξ)

where the second term will be used to regain integrability, whereas the first one will give us approximation quality. For ξ=0 and ξ, we get sufficient bounds to prove (3.6). We thus have to look for maxima of the function with respect to ξ in between (0,). Due to monotonicity of the exponential, we focus on the argument and set τ:=eξ. By setting its derivative to zero we get that the map

τ-(μg-2ε)τ-2πδτkis maximized forτmax=2δπk(μg-2ε).

Inserting all this into (3.8), we get

|Rg(t)dτ-kn=-g(kn)|Cgkexp(-8πδμg-2εk)0exp(-εeRe(y))dξCgkexp(-22πδμg-2εk).

Remark 3.4

It is also possible to admit meromorphic functions with finitely many poles into Lemma 3.3, as long as additional error terms analogous to (3.4) are introduced. Since we will not need this generalization we stay in the analytic setting.

While Lemma 3.3 provides a reduced rate of convergence compared to the more-standard sinc-quadrature of Proposition 3.2 (k-1/2 vs k-1), thus removing the advantage we want to achieve by using the double exponential transformation, we will later consider a class of functions which decay fast enough to allow us to tune the parameter μk-1 to regain almost full speed of convergence.

Finally, we show how the transformation ψσ,θ and the operator L enter the estimates. The next corollary also showcases how the cutoff error is controlled.

Corollary 3.5

Let OC contain the right half-plane, and if σ=1/2 also a sector

Sω:={zC:Arg(z)ω}for someω>π2.

Assume that g:OC is analytic and satisfies the polynomial bound

g(z)Cg(1+z)-μforμR.

Then, for all ε>0, s,rR such that μ-r+s-2ε>0, the quadrature errors can be bounded by:

EL(g,Nq)H2sH2rCCg[e-γ^μ-r+s-2εk+exp(-(μ-r+s)γekNq)].

The constant C is independent of g, k,r,s and β, but may depend on ε, σ, θ. The rate γ^ depends on θ and ω. γ depends on σ.

Proof

Let (λj,vj)j=0 denote the eigenvalues and eigenfunctions of the self-adjoint operator L. Following [3], plugging the eigen-decomposition of a function u into the Riesz–Dunford calculus, we can write the exact function g(L)u as

g(L)u=j=0(12πiCg(ψσ,θ(y))(ψσ,θ-λj)-1ψσ,θ(y)(u,vj)L2(Ω)dy)vj

and analogously for the discrete approximation QL(g,Nq)u. For the norm, as defined in (1.1), this means:

EL(g,Nq)H2r2=14π2j=0|(1+λjr)Eλj(g,Nq)(u,vj)L2(Ω)|2supλλ0|(1+λr-s)Eλ(g,Nq)|2uH2s2.

We have thus reduced the problem to one of scalar quadrature, for which we aim to apply Lemma 3.3. We fix λ>λ0>κ. ψσ,θ maps Dδexp analytically to O via Lemma A.5 (δ depends on θ and ω). What remains to be shown is a pointwise bound for the function

hλ(y):=λr-sg(ψσ,θ(y))(ψσ,θ-λ)-1ψσ,θ(y)yDδexp.

By distinguishing the cases ψσ,θ(y)<λ/2 and ψσ,θ(y)λ/2 we get using either (A6) or Lemma A.5

λψσ,θ(y)-λ-1ψσ,θ(y)ψσ,θ(y)cosh(Re(y)).

We conclude using Lemma A.5:

hλ(y)Cgψσ,θ(y)-μ(λψσ,θ(y)-λ-1ψσ,θ(y))r-s×(ψσ,θ(y)-λ-1ψσ,θ(y))1-r+sCgψσ,θ(y)-μ+r-scosh(Re(y)).

The double exponential growth of ψσ,θ (see Lemma A.4) then gives after absorbing the cosh term by slightly adjusting ε:

hλ(y)Cgc1exp(-γ1(μ-r+s)e|Re(y)|)cosh(Re(y))Cgexp(-γ1(μ-r+s-ε)e|Re(y)|). 3.10

Using Lemma 3.3, with μg:=γ1(μ-r+s-ε) then gives, after readjusting ε:

λr-s|Eλ(g)|=12π|Rhλ(y)dy-kn=-hλ(kn)|Cge-γ^μ-r+s-2εk

with γ^:=8πδγ1. The cutoff error is handled easily, also using the estimate (3.10). We calculate

Qλ(g)-Qλ(g,Nq)kjNq+1hλ(ψσ,θ(jk))Cgkλ-r+sjNq+1exp(-γ1(μ-r+s)ejk)Cgλ-r+sexp(-γ1(μ-r+s)eNqk),

where the last step follows by estimating the sum by the integral and elementary estimates.

The elliptic problem

In this section, we analyze the error when discretizing the elliptic fractional diffusion problem from Sect. 2.1. In order to analyze the quadrature error, we need to understand a specific scalar function. This is done in the next Lemma.

Lemma 3.6

Fix λ>λ0>κ and β>0. For yR, define the function

gλβ(y):=(ψσ,θ(y))-β(ψσ,θ(y)-λ)-1ψσ,θ(y).

Then the following statements hold:

  • (i)
    gλβ can be extended to a meromorphic function on Dd(θ). It has finitely many poles. All poles p satisfy ψσ,θ(p)=λ and are all simple. For any ν0, the number of poles within the strip
    ν-1ln(λ/κ)Im(y)ν+1ln(λ/κ)
    can be bounded independently of ν, β and λ. The imaginary part of p can be bounded away from zero and for large λ, the following asymptotics hold:
    Im(p)tan-1(θ)ln(λ/κ)-O(1ln(λ/κ)2)ifσ=1,π2ln(λ/κ)-O(1ln(λ/κ)2)ifσ=1/2. 3.11
    where the implied constants depend on θ, κ, and λ0.
  • (ii)
    There exist constants C>0, γ>0, independent of λ and β and a value dλ(d(θ)/2,d(θ)) such that gλβ satisfies the bounds
    |(1+λβ2)gλβ(a±idλ)|Cexp(-γβea)aR. 3.12
  • (iii)
    There exists a constant C>0 such that for dλ from (ii) and ββ¯ with β¯(0,1]
    R(1+λβ¯2)|gλβ(w±idλ)|dwC<.
    The constant C may depend on β¯ but can be chosen independently of λ and β.

Proof

Proof of (i): We note that by Lemma A.3, ψσ,θ is non-vanishing in Dd(θ). Since Dd(θ) is simply connected, we may define

h(y):=ln(κ)+0yψσ,θ(ζ)ψσ,θ(ζ)dζ.

It is easy to check that on R we have h(y)=ln(ψσ,θ(y)) since the derivative as well as the value at y=0 coincide. Thus, defining

gλβ(y):=e-βh(y)(ψσ,θ(y)-λ)-1ψσ,θ(y)

provides a valid meromorphic extension. The only poles are located where ψσ,θ(z)=λ. By Lemma A.8 (i), the number of such poles within strips of width ln(λ)-1 is uniformly bounded. By Lemma A.3, ψσ,θ has no zeros in the domain Dd(θ), which means all the poles are simple. The bound on the imaginary part follows from Lemma A.8 (ii).

Proof of (ii): We first note for y=a±idλ, if λ<ψσ,θ(y)/2, the trivial estimate ψσ,θ(y)-λ-12ψ(y) holds. Otherwise, we use Lemma A.8(iii) to get

ψσ,θ(y)-λ-1λ-12ψσ,θ(y)-1.

Overall, we can estimate using Lemma A.4

|gλβ(y)|ψσ,θ(y)-βψσ,θ(y)-λ-1ψσ,θ(y)ψσ,θ(y)-β-1ψσ,θ(y)exp(-γβeRe(y)),

where in the last step, we used that ψσ,θ has the same asymptotic behavior as ψσ,θ up to single exponential terms, which we absorb into the double exponential by slightly reducing γ.

Looking at |λβ¯2gλβ(y)|, one can calculate using two different ways to estimate ψσ,θ(y)-λ:

λβ¯/2|gλβ(y)|ψσ,θ(y)-β(λψσ,θ(y)-λ-11)β/2(ψσ,θ(y)-λ-1ψσ,θ(y)-1)1-β¯/2ψσ,θ(y)ψσ,θ(y)-βψσ,θ(y)-1+β/2ψσ,θ(y)LemmaA.4exp(-γβ2eRe(y)).

The integral bound then follows easily from the pointwise ones.

Theorem 3.7

Fix λ0>κ, β¯(0,1] and r[0,β¯/2]. Then there exist constants C>0, γ>0,γ1>0 such that for λ>λ0, ββ¯, k>0, NqN, the following estimate holds

λrEλ(z-β,Nq)k2max(1,ln(λ))2λ-β+re-max{p(σ,θ,λ),γ1}kmax(1,ln(λ/κ))+e-γk+exp(-γβekNq), 3.13a

where the rate is given by

p(σ,θ,λ)=2πtan-1(θ)-c2ln(λ/κ)ifσ=1,π2-c2ln(λ/κ)ifσ=1/2. 3.13b

Thus for kln(Nq)/Nq we get (almost) exponential convergence:

λr|Eλ(z-β,Nq)|k2max(1,ln(λ/κ))2λ-β+re-max{p(σ,θ,λ),γ1}Nqln(λ/κ)ln(Nq)+e-γNqln(Nq). 3.14

The implied constants and γ may depend on λ0, β¯, σ, θ and κ.

Proof

To cut down on notation, we only consider the case ln(λ/κ)c1>1 so that the first term in the minimum of  (3.11) dominates. If λ is small, the error can be absorbed into the e-γ/k term. The error Eλ(z-β,Nq) corresponds to approximating gλβ by sinc quadrature. We split the error into two parts, the quadrature error and the cutoff error.

λr|-gλβ(y)dy-kj=-NqNqgλβ(jk)|λr|-gλβ(y)dy-kj=-gλβ(jk)|=Eλ(z-β)+kλrj>Nq+1gλβ(jk)=:Ec.

The term Ec can be handled by the same argument as in Corollary 3.5. We therefore focus on the quadrature error Eλ(z-β) and apply Proposition 3.2. By Lemma 3.6(iii) it holds that N(gλβ,Dd(θ))<. To satisfy assumption (ii), it suffices that (for sufficiently large y) the vertical strips do not contain any poles and we can use the asymptotics of Lemma 3.6(ii).

By Lemma 3.6, there are at most finitely many simple poles. The residue of the function at these poles can be easily calculated using the well-known rule

res(f/g:z0)=f(z0)g(z0),

provided that f is analytic and g(z0)0. In our case this means, if ψσ,θ(yλ)=λ:

res(gλβ;yλ)=e-βh(yλ)ψ(yλ)ψ(yλ)=e-2iπβζ(ψ(yλ))-β=e-2iπβζλ-β,

where ζN0 denotes the branch of the complex logarithm picked by h.

Thus, for a single pole yλ with syλ:=sign(Im(yλ)), recalling the definition of Inline graphic, we can estimate

eiπsyλyλkres(gλβ,yλ)γ(k;yλ)λ-β|eiπsyλyλ/keiπsyλyλ/k-e-iπsyλyλ/k|=λ-βe-2πIm(yλ)/k1-e-2πIm(yλ)/k.

By Lemma 3.6(i), we can group poles into buckets of size 1ln(λ/κ), denoted by

B:={y:ψσ,θ(y)=λwithp(σ,θ,λ)2π+ln(λ/κ)Im(y)min(p(σ,θ,λ)2π++1ln(λ/κ),d(θ))}

such that the number of elements in each bucket B is uniformly bounded (independently of λ, β and ). This allows us to calculate for the pole contribution in Proposition 3.2:

|πyλPλyeisλπyλkres(gλβ;yλ)γ(k;yλ)|λ-βπ=0|yλBeiπsyλyλkγ(k;yλ)|λ-β=0e-p(σ,θ,λ)+kln(λ/κ)1-e-p(σ,θ,λ)+kln(λ/κ)λ-β1-e-p(σ,θ,λ)kln(λ/κ)=1e-p(σ,θ,λ)+kln(λ/κ)λ-βln(λ)2k2e-p(σ,θ,λ)kln(λ/κ),

where we used the elementary estimate 1-e-2xmin(x,1) for x0.

Applying Proposition 3.2 and inserting this estimate for the pole-contributions gives:

λrEλ(z-β)=Eλ(λrz-β)Prop.3.2e-2πdλ/k1-e-2πdλ/kN(λrgλβ,Ddλ)+λ-β+rln(λ)2k2e-p(σ,θ,λ)kln(λ/κ).

The bound from Lemma 3.6(iii) then completes the proof.

The previous estimate gives (almost) exponential convergence with respect to Nq. But the rate of the exponential deteriorates like 1/ln(λ) for large λ. In the following corollary, we give a λ-robust version of this estimate. We allow for an additional factor λρ which will allow us to make use of possible additional smoothness when considering function-valued integrals.

Corollary 3.8

Fix λ0>κ>0, β¯(0,1] and r[0,β¯/2]. Then, for every ε0, there exist constants C>0, γ>0 such that for λ>λ0, β>β¯, ρ0, k>0, NqN, the following estimate holds

λr|Eλ(z-β,Nq)|exp(-[p(σ,θ)-ε]β+ρ-rk)λρ+exp(-γk)+exp(-γekNq). 3.15

where the rate is given by (2.6). For ε>0, the implied constant in the estimate and γ may depend on λ0, σ, θ, β¯, κ. If ε=0, the constants in addition depend on ρ and β.

Proof

We first show the estimate for ε>0. We note that for ln(λ/κ)k-1, we can bound the error in Theorem 3.7 by exp(-γ/k) (for an appropriate choice of constant γ) due to the smallness of the term λ-β. Thus it remains to consider the case ln(λ/κ)<k-1. Similarly, if ln(λ)max(c2ε,-ln(κ)p(σ,θ)-2εε,1)=:μ0, the leading error term behaves like exp(-γμ0k). We are left to consider the remaining case. Writing μ:=ln(λ), the error term can be estimated:

k2ln(λ/κ)2λ-β+r-ρe-p(σ,θ,λ)max(1,ln(λ/κ))kλρexp(-(β+ρ-r)μ-p2(σ,θ)/4-c2μ(μ-ln(κ))k)λρexp(-(β+ρ-r)μ-p2(σ,θ)-2ε4μk)λρ. 3.16

We look for the minimum of the exponent. Setting the derivative of the map

μ-(β+ρ-r)μ-p2(σ,θ)-2ε4μk

to zero, we get that the minimum satisfies

0=-(β+ρ-r)μmin2+p2(σ,θ)-2ε4k,orμmin:=1(β+ρ-r)p2(σ,θ)-2ε4k.

Inserting this value into (3.16) gives the stated result (after slightly changing ε to get to the stated form).

To see the case for ε=0, we note that if ln(λ/κ)γ1k-1/2p(σ,θ)β+ρ-r, we can estimate for the leading term in Theorem 3.7:

k2ln(λ/κ)2λ-β+r-ρe-γ1μkλρk2ln(λ/κ)2λ-β+r-ρe-p(σ,θ)β+ρ-rkλρ.

In the remaining case, we can estimate the higher order term in the ln(λ/κ)-asymptotics as

ec2ln(λ/κ)2kec2p(σ,θ)β+ρ-rγ1=:C(σ,θ,β,ρ).

We can also write

λ-β+r-ρ=κ-β+r-ρ(λκ)-β+r-ρ

and continue as in the proof for δ>0 but using μ:=ln(λ/κ). This time we no longer have to compensate for the factors involving c2/μ and -ln(κ) by slightly reducing the rate. The price we pay is that the constant may blow up for ρ.

We can now leverage our knowledge about the function gλβ to gain insight into the discretization error for (2.5). This allows us to prove the two main theorems of this section. First we deal with the finite regularity case.

Proof of Theorem 2.5

Let (λj,vj)j=0 denote the eigenvalues and eigenfunctions of the self-adjoint operator L. Just as we did in the proof of Corollary 3.5, we plug the eigen-decomposition into the Riesz–Dunford calculus and Definition 2.1 to get for the discretization error:

u-ukH2r2=j=0|(1+λjr)12πiCgλjβ(y)dy-12πin=-NqNqgλjβ(kn)|2(f,vj)X2.

Applying Corollary 3.8 then gives for ρ0

u-ukH2r2e-2[p(σ,θ)-ε]β+ρ-rkj=0λj2ρ(f,vj)X2+[e-γk+e-γekNq]2fX2e-2[p(σ,θ)-ε]β+ρ-rkfH2ρ2+[e-γk+e-γekNq]2fX2.

Next we prove the improved estimates for the case of GL(Cf,Rf,ω)-regularity.

Proof of Theorem 2.8

For simplicity of notation, we ignore the cutoff error, i.e., for now consider Nq=. The cutoff error can either be easily tracked throughout the proof or added at the end, analogously to Corollary 3.5.

We first note, that by Stirling’s formula, we can estimate the derivatives of f by

fHρC~fexp(ρ(ωln(ρ)+c2)).

By assumption, we can apply Theorem 2.5 for any ρ0. Picking ρ=δkln(k)2 for δ sufficiently small and ε:=p(σ,θ)/2 (because we need ρ-robust error estimates) gives:

u-ukHβexp(-p(σ,θ)β/2+δk-1ln(k)-22k)fH2δkln(k)2+e-γkfXe-δγkln(k)Cfe2δkln(k)2(ωln(2δkln(k)2)+c2)+e-γkfXe-δkln(k)(γ-2δln(k)(ωln(2δkln(k)2)+c2)+e-γkfX. 3.17

We need to show that the bracket in the exponential is positive. In order to do this, we expand the logarithmic term as

ln(2δkln(k)2)=ln(2δ)-ln(k)-2ln(|ln(k)|).

This first term is negative, and for the others we note that

2ωδln(k)(-ln(k)-2ln(|ln(k)|)+c2)

is uniformly bounded as |ln(|ln(k)|)| grows slower than |ln(k)| as k0. Due to the leading δ term, we can make δ small enough (independently of k) to ensure that the second term in the exponent of (3.17) is smaller than γ and the statement follows. If ω=0, we don’t have to compensate the factor eωρln(ρ), therefore picking ρk-1 is sufficient and the improved statement follows.

The parabolic problem

Now that the stationary problem is well understood, we can move on to analyzing the discretization of the time dependent problem introduced in Sect. 2.2.

The Mittag Leffler function

The representation (2.8) hints that it is crucial to understand the Mittag–Leffler function if one wants to analyze the time dependent problem (2.7). We follow [20, Section 1.8]. For parameters α>0, μR, the Mittag–Leffler function is an analytic function on C and given by the power series

eα,μ(z):=n=0znΓ(nα+μ). 3.18

We collect some important properties we will need later on. We start with the following decomposition result, also giving us asymptotic estimates.

Proposition 3.9

For 0<α<2,μR and απ2<ζ<απ, we can decompose the Mittag–Leffler function as

eα,μ(z)=-n=1N1Γ(μ-αn)1zn+Rα,μN(z)forζArgzπ. 3.19

where Rα,μN is analytic away from zero and satisfies

Rα,μN(z)CΓ(αN)z-(N+1)zz0>0 3.20

for a constant C>0 depending only on z0 and ζ.

Proof

The statement can be found in [20, Eqn 1.8.28] where the dependence of the remainder term on N is not made explicit. To get the explicit estimate on the remainder, we follow [14, Section 18.1]. There, it is proven that the remainder can be written as

Rα,μN(z)=z-N-12πiC~(1-tαz)-1t(N+1)α-μetdt,

where C~ can be taken as two rays {rζ0:r1}, {rζ0¯:r1} and a small circular arc connecting the two without crossing the negative real axis. ζ0 is taken in the left half-plane such that the opening angle of C~ is sufficiently large in order to avoid possible poles of the integrand and ensure that the term (1-tα/z)-1 is uniformly bounded. The stated result then follows easily by comparing the integral under consideration to the definition of the Gamma function.

Setting N=1 in Proposition 3.9 and simple calculation yields the following estimates:

eα,μ(z)C1+zsforζArgzπ,s[0,1] 3.21

For α=μ=1, the Mittag–Leffler function e1,1 is the usual exponential function. For the decomposition result, we can skip the terms involving powers z-n in this case as ez already decays faster than any polynomial.

Finally, we need a way of computing antiderivatives of the convolution kernel in (2.8).

Proposition 3.10

For nN0, α>0, zC\{0}, λC, it holds that

zα-1eα,α(λzα)=(z)n(zα+n-1eα,α+n(λzα)). 3.22
Proof

Follows from [20, Eqn. 1.10.7] by taking β:=α+n.

Double exponential quadrature for the parabolic problem

The case of finite regularity In this section, we investigate the convergence of our method in the case that u0 and f have finite H2ρ-regularity for some ρ0. It will showcase most of the new ingredients needed to go from the elliptic case to the time dependent one while keeping the technicalities to a minimum. The step towards Gevrey-regularity will then mainly consist of carefully retracing the argument and fine-tuning parameters. We start with the case if f=0.

Lemma 3.11

Assume that either α+β<2 or σ=1 (i.e., the case α=β=1 and σ=1/2 is not allowed). Let u(t):=eα,μ(-tαLβ)u0 and assume u0H2ρ(Ω) for some ρ>0. Let uk:=QL(eα,μ(-tαzβ),Nq)u0 be the corresponding discretization using stepsize k>0 and NqN quadrature points.

Then, the following estimate holds for all η1 and r[0,β/2]:

u(t)-uk(t)H2rt-ηα(e-min{p(σ,θ)β+ρ-r,βηγ1}1k+e-γk)u0H2ρ+t-α/2exp(-γekNq)u0H2ρ.

Here γ1 is the constant from Corollary 3.5. The implied constant and γ may depend on r, the smallest eigenvalue λ0 of L, β,α, κ, θ, σ and ρ.

Proof

We start with Nq= and split the Mittag–Leffler function according to (3.19). We write

EL(eα,μ(-tαzβ))=n=1N(-1)nt-αnΓ(μ-αn)EL(z-βn)+EL(Rα,μN(-tαzβ)). 3.23

For the first terms, we apply Theorem 2.5, and for the final term we use the decay estimate (3.20) and Corollary 3.5. Note that this is where we have to exclude the case α=β=1 and σ=1/2. If α<1 the Mittag–Leffler function is contractive on a large enough sector. If β<1, the map zzβ maps the required sector into the right half plane. Otherwise, the exponential function only decays in the right half-plane, not any slightly bigger sector. Thus, if σ=1/2, Corollary 3.5 does not apply.

Overall, we get the estimate:

EL(eα,μ(tαzβ))H2rn=1N-1t-αnΓ(μ-αn)e-min{p(σ,θ)βn+ρ-rk,γk}u0H2ρ+Γ(αN)t-αNe-γ1β(N+1)+ρ-r-2εku0H2ρ.

To simplify the calculations, we make use of the fact that β-r-2εβ/2-2ε>0 and ρ>0. That way, the last term can be simplified to

Γ(αN)t-αNexp(-γ1βNk)u0H2ρ.

If η is an integer, we can pick N=η to get the statement for Nq=. For general η1, we can interpolate between η and η+1. The treatment of the cutoff error follows as in Corollary 3.5, exploiting that eα,μ(z) decays like (3.21) with s:=β/2.

Picking η large enough, Lemma 3.11 shows that for fixed times t>0 we get the same convergence rate as for the elliptic problem, though the approximation deteriorates as t gets small.

Now that we understand the homogeneous problem, we can look at the case of allowing inhomogeneous right-hand sides f by using the representation formula (2.8), and finally prove the main result Theorem  2.10. We point out that naive application of Corollary (3.16) also inside the time-convolution integral would fail to give good rates, as the error may blow up faster than τ-α for small times, leading to a non-integrable function. Instead, the following proof relies on integration by parts and (3.22) to split the convolution into point evaluations similar to Lemma 3.11 and an integrable remainder term.

Proof of Theorem 2.10

As we have already estimated the error of the homogeneous part, we only consider the part corresponding to the inhomogenity, i.e., for now let u0=0. We integrate by parts m times, using (3.22):

0tτα-1eα,α(-ταλβ)f(t-τ)dτ=j=1mtα+j-1eα,α+j(-tαλβ)f(j-1)(0)+0tτα+m-1eα,α+m(-ταλβ)f(m)(t-τ)dτ

Transferring this identity to the operator-valued setting, this means that we can analyze the quadrature error for these terms separately.

u(t)-uk(t)H2r=0tτα-1EL(eα,α(-ταzβ))f(t-τ)dτH2rj=1mtα+j-1EL(eα,α+j(-tαzβ))f(j-1)(0)H2r+0tτα+m-1EL(eα,α+m(-ταzβ))f(m)(t-τ)H2rdτ. 3.24

All the terms appearing are of the structure in Lemma 3.11. Most notably, the first m terms are evaluated at a fixed t>0 thus we don’t have to analyze them further and can just accept some t-dependence.

Investigating the remaining integral, we get by using η:=m/α+q in Lemma 3.11:

0tτα+m-1EL(eα,α+m(-ταzβ))f(m)(t-τ)H2rdτ0tτα+m-1-m-αq[e-min{p(σ,θ)β+ρ-r,γ1η}k+e-γk]f(m)(t-τ)H2ρdτ.

For q<1, this is an integrable function (with respect to τ) and the integral grows like tα(1-q).

We now focus on extracting the correct t dependencies. For small times, the dominating t-dependence in the estimates above can be found in the first term of (3.24), which behaves like t-mα(1-q). If we put back the homogeneous contribution from Lemma 3.11, this term will dominate for small times like t-m-qα. For larger times, the initial error term in (3.24) is dominant, giving behavior Tα. The cutoff error is treated like before, making use of the decay of eα,α. We just point out that the homogeneous cutoff error behaves like t-α/2 and the inhomogeneous part tα/2. We crudely estimated both by max(t-m-qα,Tα) to simplify the statement of the theorem).

Remark 3.12

Corollary 2.10 shows that, as long as we assume that f is smooth enough in time we recover the same convergence rate p(σ,θ)β+ρ-r as in the homogeneous and elliptic case.

The case of Gevrey-type regularity If the data not only satisfies some finite regularity estimates but instead is even in some Gevrey-type class of functions, we can again improve the convergence rate, and almost get rid of the square root in the exponent. We go back to the homogeneous problem and assume that k<1/2 so that the logarithmic terms can be written down succinctly.

Lemma 3.13

Assume that either α+β<2 or σ=1 (i.e., the case α=β=1 and σ=1/2 is not allowed). Let u(t):=eα,μ(-tαLβ)u0 and assume that there exist constants Cu0,ω,Ru0>0 such that

u0HρCu0Ru0ρ(Γ(ρ+1))ω<ρ0.

Let uk(t):=QL(eα,μ(-tαzβ),Nq)u0 be the discretization of u using stepsize k(0,1/2) and NqN quadrature points. Then, the following estimate holds:

u(t)-uk(t)HβCu0exp(-γkln(t)lnk)+Cu0t-α/2exp(-γekNq).

with t:=min(t,1/2). The implied constant and γ may depend on ε, the smallest eigenvalue λ0 of L, β, α, κ, θ, σ, Ru0 and ω.

Proof

We go back to (3.23), but apply Theorem 2.8 to each of the first N terms, getting:

EL(eα,μ(-tαzβ))u0HβCu0n=1Nt-αnΓ(μ-αn)exp(-γkln(k))+Γ(αN)t-αNexp(-γN-2εk)u0X. 3.25

We estimate the first N terms by

t-αnΓ(μ-αn)exp(-γkln(k))exp(-αln(t)n+c1nlog(n)-γkln(k)).

For nδkln(t)2ln(k)2, we can estimate the exponent by

-1kln(t)ln(k)[-αδln(k)-c1δln(t)ln(k)ln(δln(t)2ln(k)2k)+γln(2)]

For δ small enough, depending on c1, α and γ, the term in brackets is uniformly positive (i.e., independently of t and k), we can thus estimate for some γ1>0:

t-αnΓ(μ-αn)exp(-γkln(k))e-γ1kln(t)ln(k).

The remainder term behaves like

t-αNΓ(αN)exp(-γN-2εk)exp(-αNln(t)-c2Nln(N)-γN-2εk).

By picking N=δkln(t)2ln(k)2, the exponent be bounded up to a constant by

-δkln(t)ln(k)[-γδln(k)-c1δln(t)ln(k)ln(δkln(t)2ln(k)2)+γln(2)].

By taking the factor δ sufficiently small, we get that the term in brackets stays uniformly positive, which shows

EL(eα,μ(-tαzβ))Hβexp(-γln(t)ln(k)k).

The cutoff error can easily be dealt with as in the previous results, as the Mittag–Leffler function satisfies the decay bound (3.21) for s=1/2.

Finally, we are in a position to also include the inhomogenity f into our treatment. This means we can prove the main result Theorem 2.11. Just as in Lemma 2.10, we use integration by parts to decompose the error into parts for positive times and a remainder integral with “nice enough” behavior with respect to τ.

Proof of Theorem 2.11

We again work under the assumption u0=0 and focus on the error when dealing with the inhomogenity f alone and also start with Nq=. We also for now take t1.

Going back to (3.24) we get for NN0 to be fixed later

u(t)-uk(t)H2rj=1Ntα+j-1EL(eα,α+N(-tαzβ))f(j-1)(0)Hβ+0tτα+N-1EL(eα,α+n(-ταzβ))f(N)(t-τ)Hβdτ. 3.26

For the first terms, we apply Lemma 3.13 to get exponential convergence, as long as f(j) is in the right Gevrey-type class. Namely, we note that we can estimate

f(n)(t)H2ρeω~Nln(N)eω~ρln(ρ)

by possibly tweaking ω~ compared to ω. This allows us to estimate

j=1Ntα+j-1EL(eα,α+j(-tαzβ))f(j-1)(0)H2reω~Nln(N)e-γln(t)ln(k)k. 3.27

Again restricting ω~ to absorb the factor N due to the summation.

For the remainder in (3.26), we look at the pointwise error at fixed 0<τ<t, shortening f~(N):=f(N)(t-τ). Going back to (3.25), we can use the additional powers of t to get rid of the ln(t) term in the exponential:

τα+N-1EL(eα,α+n(-ταzβ))f~(N)Hβn=1N-1Cfeω~Nln(N)τ-α(n-1)+N-1Γ(μ-αn)exp(-γkln(k))+Γ(αN)τ(1-α)(N-1)Cfeω~Nln(N)exp(-γN-2εk).

We then proceed as in the proof of Lemma 3.13, noting that since the τ-dependent terms can be bounded independently of N we can get by without the ln(t)-term in the exponent. Overall, we get by tuning Nδ/(ln(k)2k) (also in (3.27)) appropriately:

u(t)-uk(t)H2rexp(-γkln(t)ln(k))+0texp(-γkln(k))dτ.

which easily gives the stated result. If t>1, we can skip the integration by parts step for the integration over (1, t) and directly apply Lemma 3.13. The cutoff error is treated as always.

Numerical examples

In this section, we investigate, whether the theoretical results obtained in Sects. 3.2 and 3.3 can also be observed in practice. We compare the following quadrature schemes:

  • (i)

    DE1: double exponential quadrature using σ=1/2 and θ=4,

  • (ii)

    DE2: double exponential quadrature using σ=1 and θ=4,

  • (iii)

    DE3: double exponential quadrature using σ=1 and θ=1,

  • (iv)

    sinc: standard sinc quadrature

  • (v)

    Balakrishnan: a quadrature scheme based on the Balakrishnan formula

  • (vi)

    BURA: best uniform rational approximation

For the double exponential quadrature schemes, we used k=0.9ln(rNq)/Nq with r:=1 for β>0.4 and r:=5 for β<0.4. This makes the cutoff error decay like e-βrNq0.9, which is sufficiently fast to not impact the overall convergence rate. The factor 0.9 was observed to have some slightly improved stability compared to 1. The damping constant r was introduced to get good behavior for small β; see Sect. 4.3.

For the standard sinc-quadrature, the proper tuning of k and Nq is more involved. Following [4], we picked k=2πdβNq with d=π/5. The Balakrishnan formula is only possible for the elliptic problem. It is described in detail in [5]. Following [5, Remark 3.1] we used

k:=π21.8βNM:=π22(1-β)k2,

where M is the number of negative quadrature points. This corresponds (in their notation) to taking s+:=β/10, which was taken because it yielded good results (Fig. 4).

The pure quadrature problem

In this section, we focus on a scalar quadrature problem. Namely, we investigate how well our quadrature scheme can approximately evaluate the following functions using the Riesz–Dunford calculus (a) z-β and (b) eα,1(-tαzβ) at different values λ(4,). This is equivalent to solving the elliptic and parabolic problem with data consisting of a single eigenfunction corresponding to the eigenvalue λ. Throughout, we used κ:=3. Theoretical investigations revealed, that the quadrature error is largest at ln(λ)k-1/2 (see the proof of Corollary 3.8). Therefore, we make sure that for each k under consideration, such a value of e1k is among the λ-values sampled. More precisely, the sample points consist of

Nq=1Nmax{5+exp(2β/k(Nq))}{5+exp(β/k(Nq))},

with k(Nq)=0.9ln(Nq)/Nq, and we consider the maximum error over all these samples. We used t:=1 for all experiments.

Fig. 1.

Fig. 1

Comparison of quadrature schemes—scalar problem

We observe that for the most part, choosing σ=1/2 and θ moderately large gives the best result. This agrees with our theoretical findings. This method fails to converge though if α=β=1 is chosen as the parameters for the Mittag–Leffler function. This also agrees with the theory, because in this case, ψσ,θ fails to map into the domain where eα,μ is decaying (see (3.21)). This shows that the restriction on σ in the theorems of Sect. 3.3 is necessary. If we only consider the elliptic problem, no such restriction is necessary, as the decay property is valid on all of the complex plane. All the other methods perform well in all of the cases. The straight-forward double exponential formula, i.e., σ=θ=1, is often outperformed by the simple sinc quadrature scheme, (except in the α=β=1 case of the exponential). For comparison, we’ve included the (rounded) predicted rate for the DE1 scheme in the plots. We observe that for several applications our estimates appear sharp. For f(z)=z-1 the scheme outperforms the prediction, but this might be due to a large preasymptotic regime. We note that for e-zβ, we expect better estimates than the ones presented in this article to be possible due to the exponential decay. This is also true for the standard sinc methods, see [3].

Second, we look at the case of a single frequency λ and see how the convergence rate decays as λ. In order to better see the λ-dependence of the quadrature error, we consider the relative error of the quadrature, i.e., we look at Eλ(z-β)/λ-β for β=0.5. The theory from Theorem 3.7 predicts behavior of the form e-γln(λ)k, i.e., the rate drops like ln(λ). In Fig. 2, we can see this behavior quite well. In comparison, using standard sinc quadrature gives a λ-robust asymptotic rate, but only of order Nq.

Fig. 2.

Fig. 2

Comparison of λ dependence for different quadrature schemes

A 2d example

In order to confirm our theoretical findings in a more complex setting, we now look at a 2d model problem with more realistic data than a single eigenfunction. Namely, we work in the PDE-setting of Remark 1.2 using the unit square Ω=(0,1)2 and the standard Laplacian with Dirichlet boundary conditions. We focus on two cases: first we look at what happens if the initial condition does not satisfy any compatibility condition, i.e., u0H2ρ for ρ1/4. The second example is then taken such that the data is (almost) in the Gevrey-type class as required by Theorem 2.8 and Theorem 2.11. The inhomogenity in time is taken as f(t):=sin(t)u0, thus possessing analogous regularity properties. We computed the function at t=0.1.

For the discretization in space and of the convolution in time of (2.8), we consider the scheme presented in [26]. It is based on hp-finite elements for the Galerkin solver and a hp-quadrature on a geometric grid in time for the convolution. As it is shown there, such a scheme delivers exponential convergence with respect to the polynomial degree and the number of quadrature points. Since we are not interested in these kinds of discretization errors, we fixed these discretization parameters in order to give good accuracy and only focus on the error due to discretizing the functional calculus. Namely, we used 5 layers of geometric refinement towards the boundary and vertices and a polynomial degree of p=12.

Since the exact solution is not available, we computed a reference solution with high accuracy and compared our other approximations to it. The reference solution is computed by the DE1 scheme (as it outperformed the others) by using 8 additional quadrature points to the finest approximation present in the graph. As the DE1 scheme has finished convergence at this point, we can expect this to be a good approximation.

We start with the parabolic problem. The initial condition is given by

u0(x,y):=ω-1exp(-(x-0.5)2ω)exp(-(y-0.5)2ω).

For ω:=1, this function does not vanish near the boundary of Ω and therefore only satisfies u0H1/2-ε. We are in the setting of Lemma 2.10. By inserting ρ=1/4 (up to ε) and r=0, the predicted rates for DE1 and DE2 are roughly e-6.13k and e-5.62k respectively. Figure 3a contains our findings. We observe that all methods converge with exponential rate proportional to Nq. The double exponential formulas outperforming the standard sinc quadrature. We also observe that picking σ1 and θ1 can greatly improve the convergence. The best results being delivered by DE1, i.e. σ=1/2 and θ=4. For DE1 and DE2, we observe that for a large part of the computation, the scheme outperforms the predicted asymptotic rate, but for DE2, the rate appears sharp for large values of Nq.

Fig. 3.

Fig. 3

Comparison of quadrature schemes for 2d parabolic example; α=1/2, β=0.7

As a second example, we used ω=0.05. This function is almost equal to 0 in a vicinity of the boundary of Ω. Thus we may hope to achieve the improved convergence rate of Theorem 2.11. Figure 3b shows that it is plausible that the exponential rate of order Nq is achieved, and all the double exponential schemes greatly outperform the standard sinc quadrature. The best results are again achieved by DE1 and DE2, which also greatly outperform the predicted rate for the non-smooth case.

Elliptic problem and behavior for small β

Thus far, all our estimates worked under the assumption of β>β¯>0. In order to shed some light on the behavior, and in addition gain insight into the behavior for the elliptic problem (2.4), we look at the following model problem for different values of β.

As geometry we again used the unit square. We chose f=1 as the constant function. In this class, we also included the method based on the Balakrishnan formula as well as a rational approximation method, namely the one based on computing the best uniform rational approximation as described in [17]. Where we approximate z1-β on [0, 1] using a rational function and then divide by z-1 and scale back to the interval [λmin,λmax]. For computing the approximation we used the brasil algorithm described in [18], the implementation of which can be found in the baryrat python package [18]. To determine λmax, we used a simple power iteration with 10 iterations. This gave the estimate λmax6·1015. For λmin we used the constant κ:=3 also used in the other algorithms.

For small β, preliminary experiments suggest a severe degrading of performance if the choice k:=0.9ln(Nq)/Nq is made. Therefore it was necessary to introduce the constant r in our considerations. We point out that setting r:=1 for β>0.4 is not fully necessary and only gives small improvements for larger values of β. Thus, if multiple values of β are of interest, in order to be able to reuse the approximate inverses (L-ψσ,θ(jk))-1, the choice of this damping factor should be according to the smallest value of β one is interested in.

In Fig. 4, we again observe that with θ=4 and σ{0.5,1}, the double exponential formulas significantly outperform the standard sinc based strategies, where σ=0.5 again delivers the best performance. For comparison, we included the predicted rates for the DE1 and DE2 schemes into the graphics. We observe that asymptotically our estimates appear sharp, but with a large range of values, for which the scheme outperforms the predictions. The rational approximation method performs very well for small numbers of systems, but the performance degrades severely when higher accuracy is required. This instability with respect to numerical errors is most likely due to the requirement of rewriting the rational function in the partial fraction form to apply it to a matrix as described in [17] – even though a multiprecision library is used for computing the poles and residuals of the rational function. We also tried the method based on the AAA-algorithm [30], but there the numerical instability was even more problematic.

Acknowledgements

The author would like to thank J. M. Melenk for the many fruitful discussions on the topic. Financial support was provided by the Austrian Science Fund (FWF) through the special research program “Taming complexity in partial differential systems” (grant SFB F65) and the project P29197-N32.

Appendix A: Properties of the coordinate transform ψσ,θ

In this appendix, we study the transformation ψσ,θ in detail, as it is crucial to understand the double exponential quadrature scheme. Since this transformation is itself defined in a two-part way, we introduce the following nomenclature.

Definition A.1

We call the complex plane on which ψσ,θ is defined the y-plane, mainly using the parameter y for its points. The main subset of interest there is the strip Dd(θ).

Using the function yπ2sinh(y), the y-plane is mapped to the w-plane. The most interesting set is the image of Dd(θ) under this deformation, denoted by Hθ:={π2sinh(y),yDd(θ)} (named due to its hyperbola shape).

Finally, using the function φσ,θ(w):=κ[cosh(σw)+iθsinh(w)], mapping HθC, we arrive at the z-plane which corresponds to the range of ψσ,θ, and the domain of the functions used for the Riesz–Dunford calculus. The situation is summarized in Fig. 5.

Fig. 5.

Fig. 5

Illustration of the different planes involved in the mapping ψσ,θ

If we talk about generic complex numbers without relation to any of the specific planes, we use the letter ζ instead.

We start out with some basic properties of sinh.

Lemma A.2

The map yπ2sinh(y) has the following properties:

  • (i)

    It is a bijective mapping Dd(θ)Hθ, see Fig. 5.

  • (ii)
    For Re(ζ)ζ0>0, there exist constants c1,c2>0 depending only on ζ0 such that
    c1sinh(ζ)cosh(ζ)c2sinh(ζ).
  • (iii)
    For any δ<π/2, sinh maps the domain Dδexp, as defined in (3.1), to a strip of size δ, i.e.,
    Im(sinh(y))<δyDδexp. A1

Proof

Proof of (i): It is well known that sinh is injective for Im(y)<π/2. Since Hθ is defined as the range of the map this is sufficient.

Part (ii) is an easy consequence of the fact that sinh and cosh have the same asymptotic behavior for Re(ζ). To see (iii), we estimate for yDδexp:

Im(sinh(y))=cosh(Re(y))sin(Im(y))<δcosh(Re(y))e-Re(y)δ.

Lemma A.3

ψσ,θ is analytic on the infinite strip Dd(θ). For d(θ) sufficiently small, both ψσ,θ and ψσ,θ are non-vanishing on Dd(θ).

Proof

The analyticity of ψσ,θ is clear. In order to analyze the roots, we first rewrite for w=a+ib, separating the real and imaginary parts:

cosh(σw)+iθsinh(w)=(cosh(σa)cos(σb)-θcosh(a)sin(b))+i(sinh(σa)sin(σb)+θsinh(a)cos(b)). A2

We first focus on the case σ=1. In this case,  (A2) shows that any root y of ψσ,θ must satisfy for w:=π2sinh(y)=:a+bi:

cosh(a)(cos(b)-θsin(b))=0andsinh(a)(θcos(b)+sin(b))=0.

Since cosh has no roots, we get cos(b)=θsin(b). As cos(b)=θsin(b) and θcos(b)=-sin(b) is impossible at the same time, we get that a=0 and b=tan-1(1/θ)+π for some Z.

It remains to show that π2sinh(y) does not map to these points. Looking at the real part of sinh(y) we immediately deduce that if Im(y)(-π/2,π/2), in order to produce a purely imaginary result, it must hold that Re(y)=0. For the imaginary part, we then get the equation:

sin(Im(y))=2+2tan-1(1/θ)πfor someZ

which is not possible for Im(y)d(θ)<sin-1(2tan-1(1/θ)π). Next, we show that ψσ,θ also does not vanish. A simple calculation shows

ψ1,θ(y)=iθψ1,1θ(-y)π2cosh(y). A3

Since the restriction θ1 was not crucial for the proof, ψ1,1θ and cosh have no roots in the symmetric (w.r.t. sign flip) domain Dd(θ). This shows that ψ1,θ also is non-vanishing.

The case σ=1/2 is similar, but a little more involved. We first show that all zeros of cosh(σw)+iθsinh(w) satisfy Re(w)=0 and Im(w)>w0>0 for a constant w0 depending only on θ. If cosh(w/2)0 we can use the double angle formula for sinh to get

0=cosh(w/2)(1+2θisinh(w/2))whichimpliessinh(w/2)=i2θ.

Splitting into real and imaginary part, we get for w=a+ib:

sinh(a/2)cos(b/2)=0andcosh(a/2)sin(b/2)=12θ.

If a0, we get that cos(b/2)=0 and thus sin(b/2)=±1. This would imply that cosh(a/2)=12θ1/2 which is a contradiction. If a=0, we get that

b2|sin-1(12θ)|>0.

Similarly, one can argue if cosh(w/2)=0, that a=0 and b=π(2+1). We then proceed just like in the case σ=1 to conclude that π2sinh does not map to such points.

In order to investigate its roots, we compute the derivative of ψ12,θ as

ψ12,θ(y)=(12sinh(πsinh(y)/4)+iθcosh(πsinh(y)/2))π2cosh(y). A4

Our main concern is when the first bracket reaches zero. Substituting t:=sinh(πsinh(y)/4) and using the double angle formula for cosh we get

0=t2+iθ(1+2t2).

Solving this equation, we get that t is purely imaginary and for θ1 satisfies 0<Im(t)<1. Again writing w=:a+ib we get

sinh(a/2)cos(b/2)=0andcosh(a/2)sin(b/2)=Im(t).

Just like we did when showing ψ12,θ0 we can argue that a=0. We get sin(b/2)=Im(t). Since t only depends on θ, we get that b>b0>0 with a constant only depending on θ. We proceed as when showing ψ12,θ0 to conclude that ψ12,θ has no root in Dd(θ) for d sufficiently small (depending on θ).

Next, we study the growth of ψσ,θ(y) as Re(y).

Lemma A.4

Assume that d(θ)<1/2. Then there exist constants c1,c2, γ1,γ2>0 such that for yDd(θ) we can estimate

c1exp(γ1eRe(y))ψσ,θ(y)c2exp(γ2eRe(y)), A5

i.e., the growth of ψ is double exponential. Additionally, we can bound

|ψσ,θ(y)||ψσ,θ(y)|cosh(Re(y)). A6

Proof

We start with the simple case σ=1, and focus on what happens if Re(y)>y0>0 for a to be tweaked constant y0. The values with 0Re(y)y0 can be covered by adjusting c1 and c2, due to the compactness of the set {yDd(θ):Re(y)y0} and the fact that ψσ,θ(y)>0 by Lemma A.3. We first only consider the y-w part of the transformation. We compute, since 12<cos(t)1 for t(-1/2,1/2):

Re(sinh(y))=sinh(Re(y))cos(Im(y))sinh(Re(y))c1eRe(y).

Easy calculation shows that for h1(η):=cos(η)-θsin(η) and h2(η):=θcos(η)+sin(η) it holds that [h1(η)]2+[h2(η)]2=1+θ2. Thus, for wHθ with Re(w)1, we can calculate:

cosh(w)+iθsinh(w)2=cosh(Re(w))2[h1(Im(w))]2+sinh(Re(w))2[h2(Im(w))]2min(cosh(Re(w)),sinh(Re(w)))2(1+θ2)e2Re(w). A7

Overall, we see the lower bound of (A5). The upper bound is easily seen, as sinh(y) and cosh(y) both grow exponentially and the bound only depends on the real part of the argument. (A6) follows from (A3) and the asymptotics (A7)and (A5).

We now look at how to adapt the proof to the case σ=1/2. If Re(w)2ln(1+5), we get

cosh(w/2)+iθsinh(w)θsinh(w)-cosh(w/2)12(eRe(w)-2-eRe(w)/2)14eRe(w), A8

where in the last step we used the monotonicity of the expression and the fact that eRe(w)2-eRe(w)/2=2 for Re(w)=2ln(1+5). The argument for the y-w-transformation stays the same. The upper bound also follows easily from the triangle inequality and the growth of sinh and cosh.

To see (A6), we combine (A4) with the asymptotic estimate (A8) to get

|ψσ,θ(y)|eπRe(sinh(y))/2cosh(Re(y))|ψσ,θ(y)|cosh(Re(y)).

While on the full strip Dd(θ), the image of the transformation is difficult to study, the restriction to a certain subdomain is much better behaved.

Lemma A.5

For σ=1, there exists a constant δ>0, depending on θ, such that restricted to the domain Dδexp, ψ1,θ maps to a sector in the right-half plane,

Sω:={zC:Arg(z)ω}withω<π2.

For σ=1/2, and for all ε>0, there exists a constant δ>0, depending on θ and ε, such that restricted to the domain Dδexp the transformation ψ12,θ maps to the sector Sπ/2+ε.

In both cases, there exist constants c1,c2>0 such that ψσ,θ satisfies for all λλ0>κ:

ψσ,θ(y)-λc1andψσ,θ(y)(ψσ,θ(y)-λ)-1c2cosh(Re(y))yDδexp, A9

where c1,c2 only depend on λ0 and θ.

Proof

By Lemma A.2(iii) it is sufficient to consider the mapping of φσ,θ restricted to small strips in the w-plane around the real axis. We start with the simpler case σ=1. Going back to (A2) and writing w:=π2sinh(y)=:a+ib, we note that if b is sufficiently small, we can guarantee that cos(b)-θsin(b)>c>0 for some constant c>0 depending on θ.

We have

Re(φσ,θ(w))=κcosh(a)(cos(b)-θsin(b))>cκcosh(a),Im(φσ,θ(w))=κsinh(a)|θcos(b)+sin(b)|(1+θ)κsinh(a).

This implies

0Im(φσ,θ(w))Re(φσ,θ(w))(1+θ)c-1wC,Im(w)sufficiently small.

Next, we show that for σ=1/2, sufficiently thin strips in the w-domain are mapped to sectors with opening angle π/2+ε. Such sectors are characterized by

-Re(φσ,θ(w))ε~Im(φσ,θ(w))Im(w)<b0(ε~)

for ε~>0 depending on ε. The interesting case is Re(φσ,θ(w))<0. There, we get for bπ:

-Re(φσ,θ(w))=-κcosh(a/2)cos(b/2)+κθcosh(a)sin(b)κθcosh(a)sin(b).

For the imaginary part, the double angle-formula gives:

Im(φσ,θ(w))κθsinh(a)cos(b)-κsinh(a/2)sin(b/2)κθ2sinh(a)cos(b)+κsinh(a/2)(θcosh(a/2)cos(b)-sin(b/2)).

For b sufficiently small, we get θcos(b)-sin(b/2)>0, and thus the last term is non-negative. We conclude

-Re(φσ,θ(w))2cosh(a)sinh(a)sin(b)cos(b)Im(φσ,θ(w)).

For a>1, the ratio Inline graphic is uniformly bounded. By making b sufficiently small, we can ensure sin(b)/cosb<ε~. For a<1, we note that by restricting the values of b it can be easily seen that Re(φσ,θ(w))0. Thus we can conclude that ψσ,θ maps to the stated sectors.

Next, we prove the bounds on the distance to the real axis, again primarily investigating the behavior of φσ,θ in thin strips. We focus on σ=1/2. Since φσ,θ(0)=κ<λ0 and φσ,θ is continuous, there exist constants 0<q<1 and δ~>0 such that φσ,θ(w)-φσ,θ(0)<q(λ0-κ) for all w<δ~. This gives:

φσ,θ(w)-λλ-φσ,θ(w)λ0-φσ,θ(0)-φσ,θ(w)-φσ,θ(0)>λ0-κ-q(λ0-κ)(1-q)(λ0-κ)>0wδ~.

By selecting δ<δ~/2 in the definition of Dδexp, we may then continue by only considering a:=Re(w)>δ~/2. The imaginary part of φ12,θ(y) satisfies:

Im(φ12,θ(y))=κsinh(a/2)sin(b/2)+κθsinh(a)cos(b)=κsinh(a/2)(sin(b/2)+2θcosh(a/2)cos(b)).

For bπ/4 we have sin(b/2)+2cos(b)>0 and thus can conclude that |Im(φ12,θ(y))|c>0 and in turn |φ12,θ(y)-λ|c>0. The case σ=1 follows similarly, but not using the double angle formula.

To see that ψσ,θ(y)(ψσ,θ(y)-λ)-1 can also be uniformly bounded, we only need to focus on large values of y (and therefore w). Asymptotically, we estimate for b<π/4:

Im(ψσ,θ(y))-κsinh(σa)sin(σb)+κθsinh(a)cos(b)sinh(a)(A7) or (A8)ψσ,θ(y).

Using (A6) then concludes the proof.

In order to apply the double exponential formulas for the Riesz–Dunford calculus, it is important to understand where ψσ,θ(z) hits the real line. We start with the w-domain.

Lemma A.6

Fix λλ0>1. Then the following holds for every wC with Re(w)0 and

cosh(σw)+iθsinh(w)=λ: A10
  • (i)
    There exist constants c1,c2,c3>0 such that w satisfies log(λ)-c1Re(w)log(λ)+c1 and
    Im(w)tan-1(θ)ifσ=1max(π2-c2θλ,c3)ifσ=1/2,
    where c1 depends on λ0 and θ, c2 depends on λ0, and c3 depends on θ.
  • (ii)
    Given 0<r<R, the number Nw(λ,r,R) of points w satisfying (A10) with rIm(w)R is bounded uniformly in λ by
    Nw(λ,r,R)CR-r
    The constant C depends only on θ.
  • (iii)
    There exist at most four values p1,,p4 depending on λ, θ, and σ such that all points satisfying (A10) can be written as
    w=pj+2σπifor someZ,j1,,4. A11
    If w solves (A10) then -w¯ does as well.

Proof

We start with the simpler case σ=1. By separating the real and imaginary parts as in (A2), we can observe that the critical points w=a+ib with a0 are located at

cosh(a)=λ1+θ2,b=-tan-1(θ)+2π,Z. A12

This implies that aln(λ), and we also see that for each , there are at most two such points, one in each half-plane. All the statements follow easily. Note that in (iii) only two families are needed.

For the remainder of the proof we therefore focus on the case σ=1/2. Proof of (i): We start with the bound on the real part and write w=a+ib. We note that if a>max(1,2ln(8θ)) one can estimate using elementary considerations that ea/4sinh(w) and ea/2/θea/8.

We then calculate:

ea4sinh(w)=1θλ-cosh(w/2)λθ+ea2θλθ+ea8.

From this, the statement readily follows. The other direction is shown similarly:

e|a|sinh(w)=1θλ-cosh(w/2)λθ-ea2θλθ-ea8.

For amax(1,2ln(8θ)), we use the bound φσ,θ(w)ea to see that λ=φσ,θ(w)ea, giving that ln(λ) must be uniformly bounded. By taking c1 large enough we can make the ln(λ)-c1 negative, thus making the first estimate in (i) trivial. Since ln(λ)ln(λ0)>0, we can also immediately see

graphic file with name 211_2022_1342_Equ207_HTML.gif

The final bound on the real part of w then follows for c1:=max(ln(8/θ),ln(9θ/8),c~), where c~ is used to compensate for the case of small a.

Looking at the imaginary part of equation (A10), we get from the double-angle formulas

0=sinh(a/2)sin(b/2)+θsinh(a)cos(b)=sinh(a/2)(sin(b/2)+2θcosh(a/2)(1-2sin2(b/2))). A13

Since we assume a0, we get by substituting τ:=sin(b/2)

0=τ+2θcosh(a/2)(1-2τ2)orτ=1±1+32θ2cosh2(a/2)8θcosh(a/2). A14

From this, using the asymptotic behavior

τ=±12+O(1θcosh(a/2))andsin-1(12+h)=π4+O(h)

the statement follows for large a, since b=2sin-1(τ) and cosh(a/2)λ by (i). For small a, we note that (A14) shows that Im(w)0. By continuity, it must therefore hold that Im(w)>0 uniformly.

Proof of (ii) and (iii): We square the defining equation (A10), getting

λ2=cosh2(w/2)+2iθcosh(w/2)sinh(w)-θ2sinh2(w)=cosh2(w/2)+4iθcosh2(w/2)sinh(w/2)-4θ2sinh2(w/2)cosh2(w/2). A15

Writing cosh2(w/2)=1+sinh2(w/2), we get that t:=sinh(w/2) solves the quartic equation

λ2=1+t2+4iθ(1+t2)t-4θ2t2-4θ2t4. A16

This means there can be at most 4 such values t1,t4 for any λ and it must hold that

sinh(w/2)=tjorw=wj+4πiZ A17

Here wj for j=1,,4 is the solution to sinh(wj/2)=tj with Re(wj)>0 and minimal value of Im(wj).

To see (ii), we note that for each tj at most Inline graphic values lie in the sought after strip. Therefore we can estimate

graphic file with name 211_2022_1342_Equ208_HTML.gif

The statement (iii) follows readily from (A17). The fact that -wj¯ also solves (A10) follows by conjugating both sides of the Eq. (A16).

Next, we show that points which have positive distance to the poles in the w-plane are mapped to points with distance λ in the z-plane. Note that in the following Lemma we include some additional points in order to avoid distinguishing more cases. We also exclude most of the imaginary axis, as for small values of λ it might contain poles which are structurally different than the ones involving large λ.

Lemma A.7

Define

b0:=max{b0:φσ,θ(iτ)(λ0+κ)/2τb}.

Fix λλ0>κ and define the set

Mλ:={pλ+iπ,withpλCsuch thatφσ,θ(pλ)=λandZ}{ib:bb0}.

For any δ>0, there exists a constant c(δ)>0, depending only on δ and θ, such that for all wC with dist(w,Mλ)>δ we can estimate

φσ,θ(w)-λc(δ)λ.

Proof

Without loss of generality, we assume δ<b0. We first deal with the issues close to the imaginary axis. Since φσ,θ(ib)(λ0+κ)/2 if bb0, we can find ε(0,δ/2) such that

φσ,θ(w~)<3λ0/4+κ/4for allw~Uε:={Re(w~)εandIm(w~)b0}.

If Re(w)ε, the distance condition to Mλ implies for all bb0:

δ2|w-ib|2=|Im(w)-b|2+|Re(w)|2|Im(w)-b|2+δ2/4,

or |Im(w)-b|δ/2. Since all bb0 are admissible, it can not be that |Im(w)|b0. Therefore we readily see Im(w)b0-δ/2 and thus wUε.

We can therefore calculate:

φσ,θ(w)-λλ-φσ,θ(w)λ4(1-κλ0).

Next, we deal with small values of λ. For constants Λ, Cw to be fixed later, consider λ[λ0,Λ] and define the set

R:={wC:Re(w)ε,wCw}.

We show that the stated bound holds for wR. By Lemma A.6(iii), the points of Mλ can be written as

Mλ={pj+πi,Z,j=1,,4}{ib:bb0}

for some reference points pjC, w.l.o.g. Im(pj)π. We introduce set

MΛ,Cw:={pj+πi,L,j=1,,4} A18

where L:=(Cw+1)/π is taken large enough that for all λ[λ0,Λ], it holds that

MλRMΛ,Cw,

i.e., it contains all the poles of size less or equal than Cw uniformly in λ (but possibly also some larger ones). We consider the map

Φ(λ,w):=(φσ,θ(w)-λ)-1pλMΛ,Cw(w-pλ).

By the inverse function theorem, the points pj=φσ,θ-1(λ) depend continuously on λ since φσ,θ0 away from the imaginary axis (where we stay away from by construction). Thus, also the other points pλ depend continuously on λ. Similarly, the denominator only has simple zeros for wMλ. Since, in that case the numerator also vanishes one can argue that Φ has a continuous extension to [λ0,Λ]×R which is bounded, i.e., it holds

pλMΛ,Cw(w-pλ)φσ,θ(w)-λC(Λ,Cw)

or

φσ,θ(w)-λ1C(Λ,Cw)pλMΛ,Cww-pλ.

Thus, if w is separated from Mλ and the imaginary axis by δ, we get:

φσ,θ(w)-λ1C(Λ,Cw)pλMΛ,Cww-pλδδ#MΛ,CwC(Λ,Cw)λΛ=:C(Λ,δ,Cw)λ.

Here in the last step we used the fact that the number of elements in MΛ,Cw is uniformly bounded, as can be seen from the definition in (A18).

If λ[0,Λ] and w>Cw:=max(log(2Λ/c1),4ln(2)), (where c1 is the constant in (A7) or (A8)) we get:

φσ,θ(w)-λφσ,θ(w)-λ(A7),(A8)c1eRe(w)-ΛΛλ.

We therefore may from now on assume that λ is sufficiently large as we see fit. In preparation for the rest of the proof, we note that for ζ,μR, w.l.o.g., ζμ:

cosh(μ)-cosh(ζ)=cosh(μ)-cosh(ζ)=ζμsinh(τ)dτsinh(ζ)(μ-ζ). A19

Because it is much simpler, we start with the case σ=1. We note that in this case Mλ consists of the points mapped to ±λ. We distinguish three cases, depending on whether Re(w) is small and if Im(w) is close to a pole or not.

Case 1: (1+θ)κcosh(Re(w))<λ/2: The triangle inequality gives:

κ[cosh(w)+iθsinh(w)]-λλ-(1+θ)κcosh(Re(w))λ2.

Case 2: 2(1+θ)κcosh(Re(w))λ and there exists a point pMλ with Imw-Impε1 for ε1 sufficiently small. We note that this implies that Re(w)-Re(p) is positive. Due to the symmetry in (A11) we may in addition assume that sign(Re(w))=sign(Re(p)).

By Lemma A.2 and Lemma A.6(i) we note the following estimates:

|sinh(Re(w))||cosh(Re(w))|λ,and|sinh(Re(p))||cosh(Re(p))|λ. A20

Writing h(η):=cos(η)-θsin(η), we note that h(Im(w))>c>0 by (A12) and the fact that adding π might only change the sign. If h(Im(p))0, we consider the real part of φσ,θ(w)-λ to get:

cosh(Re(w))h(Im(w)))-λ=cosh(Re(w))h(Im(p))-λ+cosh(Re(w))(h(Im(w))-h(Im(p)))cosh(Re(w))h(Im(p))-λ-cosh(Re(w))h(Im(w))-h(Im(p))(A19)min(sinh(Re(w)),sinh(Re(p)))Re(w)-Re(p)-(1+θ)cosh(Re(w))ε1(A20)λ,

where in the last step we chose ε1 sufficiently small (but independent of λ). If h(Im(p))0, by continuity we can enforce h(Im(w))0 as long as ε1 is sufficiently small. The necessary calculation then is even easier because φσ,θ(w) maps to the left half-plane.

Case 3: 2(1+θ)cosh(Re(w))λ and Im(w)-Im(p)ε1>0 for all pMλ. We estimate imaginary part of φσ,θ. Since Im(w) has positive distance from the points in (A12), we get sin(Im(w))+θcos(Im(w))>c>0. Which in term gives

sinh(Re(w))sin(Im(w))+θcos(Im(w))csinh(Re(w))λ

where the last part only holds for large enough cases of Re(w) not covered by Case 1.

Now we show, how the proof has to be adapted for the case σ=1/2, again focusing on the asymptotic case of large λ. By Lemma A.6(i), all the points pMλ satisfy Re(p)log(λ). Looking at the imaginary part of the defining equation for p we get that

cos(Im(p))=sinh(Re(p)/2)θcosh(Re(p))sin(Re(p))e-Re(p)/2θλ-1/2.

Thus, for any ε2(0,1), assuming λ is sufficiently large, all the points pMλ satisfy cos(Im(p))<ε2. We again have to distinguish three cases:

Case 1: (1+θ)cosh(Re(w))<λ/2: One can argue just like in the σ=1 case.

Case 2: 2(1+θ)cosh(Re(w))λ and there exists a point pMλ with Imw-Impε1 for ε1 sufficiently small. We note that this implies that Re(w)-Re(p) is positive. Since cos(w)<ε2, we note that sin(w)>1-ε2. By possibly adding iπ, we can write

λ=-θcosh(Re(p))sin(Im(p+iπ))+cosh(Re(p/2))sin(Im(p+iπ)/2). A21

For large values of λ, the cosh(Re(p)) term is dominating. Therefore, we have sign(Re(φσ,θ(p)))=-sign(sin(Im(p))). By continuity we can enforce that sign(sin(Im(w)))=sign(sin(Im(p))). Since for the case Re(φσ,θ(w))0 the statement is trivial, we only have to consider the case sign(sin(Im(w)))=-1 or =0 in (A21). We look at the real part of φσ,θ(w)-λ to get:

|-θcosh(Re(w))sin(Im(w))-λ+cosh(Re(w)/2)cos(Im(w)/2)|-θcosh(Re(w))sin(Im(p))+θcosh(Re(p))sin(Im(p))-cosh(Re(w))(sin(Im(w))-sin(Imp))-O(cosh(Re(w)/2))θmin(sinh(Re(w)),sinh(Re(p)))Re(w)-Re(p)-Ccosh(Re(w))ε1λ

where we absorbed the term cosh(Re(w)/2) into cosh(Re(w))ε1 by assuming λ sufficiently large and in the last step we chose ε1 sufficiently small (but independent of λ).

Case 3: 2(1+θ)cosh(Re(w))λ and Imw-Impε1>0 for all pMλ. Since all the points pMλ satisfy cos(Im(p))<ε2 and for every zero of cos, there exists a value pMλ with Im(p) close to it, this means that cos(Im(w))δ2 for a constant δ2 depending only on ε1 and ε2. We estimate

Im(φσ,θ(w))θsinh(Re(w))cos(Im(w))-cosh(w/2)sinh(Re(w))λ

where the last part only holds for large enough cases of Re(w) not covered by the first case.

Lemma A.8

Fix λλ0>κ. Consider the set

Pλy:={yDd(θ):ψσ,θ(y)=λ},

where d(θ) is taken sufficiently small. Then the following holds:

  • (i)
    For any ν0[0,d(θ)] and δ>0 there are at most finitely many points y1,,yNp(λ,δ)Pλy satisfying
    ν0-δln(λ/κ)<Im(y)<ν0+δln(λ/κ)1,,Np(λ,δ).
    The number Np(λ,δ) of such points can be bounded by a constant depending only on δ, θ, σ and d(θ), but independently of λ and ν0 .
  • (ii)
    For λ(λ0,Λ), one can bound Im(y)γ(Λ)>0yPλy, with a constant γ(Λ) depending on Λ, θ, κ, λ0. For λ sufficiently large, the following asymptotic holds:
    Im(y)tan-1(θ)ln(λ/κ)-O(1ln2(λ/κ))ifσ=1,π2ln(λ/κ)-O(1ln2(λ/κ))ifσ=1/2yPλy, A22
    where the implied constants depend only on θ, κ, λ0 .
  • (iii)
    There exists a parameter dλ(d(θ)/2,d(θ)] and a constant c>0 such that
    ψσ,θ(a±idλ)-λcλ/κaR. A23
    c depends on θ, σ and λ0 but is independent of λ.

Proof

For now, consider the case κ=1 and λ0>1. Since ψσ,θ(0)=1, due to continuity, there exists a factor d(θ)>0 and ε>0 such that

ψσ,θ(y)<1+ε<λ0<λyd(θ).

By taking d(θ) at last this small in the definition of Dd(θ) we can exclude the poles satisfying Re(w)=Re(sinh(y))=0.

Proof of (i): Since sinh is injective by Lemma A.2(i) we only need to count the points in Hθ which are mapped to λ by φσ,θ. Consider a point w=a+ib in the w domain and let π2sinh(y)=w with y=ξ+iνDd(θ). Then

a=π2sinh(ξ)cos(ν)andb=π2cosh(ξ)sin(ν).

Simple computations give atan(ν)bπ/2sin(|ν|)+atan(ν). we only show the second inequality:

b=π2cosh(ξ)sin(ν)π2(1+sinh(ξ))sin(ν)=π2(1+2|a|π|cos(ν)|)sin(ν)π2sin(|ν|)+atan(ν).

By inserting Lemma A.6(i) we get

(ln(λ)-c1)tan(ν)bπ2sin(ν)+(c1+ln(λ))tan(ν). A24

For the length L of this interval, we compute for ν±:=ν0±δln(λ/κ)-1 (without changing the number of points, we may assume 0ν-ν+d(θ)):

L=ln(λ)(tan(ν+)-tan(ν-))+π2sin(ν+)+c1tan(ν+)+c1tan(ν-)ln(λ)ν-ν+1cos2(τ)dτ+π2+2c18δln(λ)ln(λ)-ln(κ)+π2+2c1,

where in the last step we used cos(τ)>1/2 for τ<1/2 and the definition of ν±. The right-hand side stays uniformly bounded for λ. Therefore, since the length of this interval is bounded uniformly in λ, we can apply Lemma A.6(ii) to bound Np(λ,δ).

Proof of (ii): We only show the asymptotics.

Fix yDd(θ) and write w:=π2sinh(y). For 0<y<1/2 it can be easily seen that y+23y3>tan(y). Now, if Im(y)2ln(λ)-1 there is nothing left to show. Otherwise, we can bound

Im(y)tan(y)-43ln(λ)3(A24)Im(w)1+c1+ln(λ)-43ln(λ)3Im(w)ln(λ)-O(1ln(λ)2).

The result follows from Lemma A.6(i).

Proof of (iii): For dλ=d(θ), we can not guarantee that ψ(ξ+idλ) does not hit the value λ. In this case, we have to modify dλ slightly to get robust estimates. For dR, consider the hyperbolas

γd(ξ):=π2sinh(ξ+id)ξR. A25

In the light of Lemma A.7 we need to ensure that dist(γdλ,wp)1 for all wpMλ. We will be looking for dλ in a small strip around d(θ). To simplify notation we define the length

ω:=d(θ)ln(λ0)2ln(λ)such thatd(θ)/2d(θ)-ωd(θ).

To make things symmetric with respect to the real axis, we consider M~λ:=Mλ-Mλ. It will therefore be sufficient to focus on the upper right quadrant of the complex plane. All other cases follow by symmetry.

We write M~λy:=sinh-1(2πM~λ) for the corresponding points in the y-domain. We start by noting that we can easily stay away from the problematic parts of the imaginary axis by making d(θ) sufficiently small, as if Re(sinh(y))<ε we have Im(sinh(y))<(1+ε)sin(Im(y)); thus for small real parts we can ensure to fit between (-b0,b0) on the imaginary axis. This also means that we only consider points wλM~λ with Re(wλ)>ε>0 since our path will have already positive distance to other possible poles.

By (i), the number of points yλ in M~λy in the strip d(θ)-ωIm(yλ)d(θ) can be bounded by a constant N, independent of λ. In order to also avoid points in M~λy which are close but outside the critical strip we also avoid the boundary points d(θ)-ω and d(θ). Since N+2 strips of width ω2N+4 can not cover a strip of width ω, there exists a value dλ such that

d(θ)-ωdλd(θ)andIm(yλ)-dλω2(N+2)yλM~λy.

For ease of notation, we define δ:=ln(λ0)/(4N+8) and note that Im(yλ)-dλδln(λ)-1. We show that

dist(γdλ,wp)μ>0wpM~λ

for a constant μ>0 independent of λ. We fix yp:=ξp+iνpM~λy with wλ=πsinh(yp)/2 and a point on γdλ denoted by yγ=ξγ+dλi. We write sp:=sign(νp-dλ) and distinguish two cases: (ξp-ξγ)sp0 and (ξp-ξγ)sp>0. For symmetry reasons, we only consider the case ξγ,ξp,νp>0. If (ξp-ξγ)sp0, we get:

Im(sp(sinh(yp)-sinh(yγ)))=sp(cosh(ξp)sin(νp)-cosh(ξγ)sin(dλ))=cosh(ξp)sp(sin(νp)-sin(dλ))+sp(cosh(ξp)-cosh(ξγ))sin(dλ)0cosh(ξp)spdλνpcos(τ)dτcosh(ξp)δln(λ).

For the case (ξp-ξγ)sp<0, we calculate:

-spRe(sinh(yp)-sinh(yγ))=-spsinh(ξp)cos(νp)+spsinh(ξγ)cos(dλ)=-spsinh(ξp)(cos(νp)-cos(dλ))+sp(sinh(ξγ)-sinh(ξp))cos(dλ))0sinh(ξp)spdλνpsin(τ)dτsinh(ξp)sin(d(θ)/2)δln(λ). A26

We have, since sinh(ξp)2πM~λ and using Lemma A.6(i) that

sinh(ξp)=Re(sinh(ξ))cos(νp)=Re(wλ)cos(νp)ln(λ)-c1cos(νp).

Together with the previous assumption Re(wλ)ε, this gives cosh(ξp)sinh(ξp)max(ln(λ)-c1,ε). With this can conclude that for ln(λ)>2c1:

dist(γdλ,wλ)ln(λ)-c1ln(λ)1-c12c112.

For ln(λ)<2c1 we get

dist(γdλ,wλ)ε1ln(λ)>ε2c1>0.

We can now apply Lemma A.7 to get to the final result. The general case κ1 follows by dividing the equation ψσ,θ(y)=λ by κ. We can therefore just replace λ by λ/κ in all statements.

Funding Information

Open access funding provided by Austrian Science Fund (FWF).

Footnotes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Antil H, Bartels S. Spectral approximation of fractional PDEs in image processing and phase field modeling. Comput. Methods Appl. Math. 2017;17(4):661–678. doi: 10.1515/cmam-2017-0039. [DOI] [Google Scholar]
  • 2.Bonito A, Borthagaray JP, Nochetto RH, Otárola E, Salgado AJ. Numerical methods for fractional diffusion. Comput. Vis. Sci. 2018;19(5–6):19–46. doi: 10.1007/s00791-018-0289-y. [DOI] [Google Scholar]
  • 3.Bonito A, Lei W, Pasciak JE. The approximation of parabolic equations involving fractional powers of elliptic operators. J. Comput. Appl. Math. 2017;315:32–48. doi: 10.1016/j.cam.2016.10.016. [DOI] [Google Scholar]
  • 4.Bonito A, Lei W, Pasciak JE. Numerical approximation of space–time fractional parabolic equations. Comput. Methods Appl. Math. 2017;17(4):679–705. doi: 10.1515/cmam-2017-0032. [DOI] [Google Scholar]
  • 5.Bonito A, Lei W, Pasciak JE. On sinc quadrature approximations of fractional powers of regularly accretive operators. J. Numer. Math. 2019;27(2):57–68. doi: 10.1515/jnma-2017-0116. [DOI] [Google Scholar]
  • 6.Banjai L, Melenk JM, Nochetto RH, Otárola E, Salgado AJ, Schwab C. Tensor FEM for spectral fractional diffusion. Found. Comput. Math. 2019;19(4):901–962. doi: 10.1007/s10208-018-9402-3. [DOI] [Google Scholar]
  • 7.Bonito A, Pasciak JE. Numerical approximation of fractional powers of elliptic operators. Math. Comp. 2015;84(295):2083–2110. doi: 10.1090/S0025-5718-2015-02937-8. [DOI] [Google Scholar]
  • 8.Bucur, C., Valdinoci, E.: Nonlocal Diffusion and Applications, volume 20 of Lecture Notes of the Unione Matematica Italiana. Springer, Cham; Unione Matematica Italiana, Bologna (2016)
  • 9.Danczul T, Hofreither C. On rational Krylov and reduced basis methods for fractional diffusion. J. Numer. Math. 2022;30(2):121–140. doi: 10.1515/jnma-2021-0032. [DOI] [Google Scholar]
  • 10.Danczul, T., Hofreither, C., Schöberl, J.: A unified rational Krylov method for elliptic and parabolic fractional diffusion problems (2021)
  • 11.Davis PJ, Rabinowitz P. Methods of numerical integration, Computer Science and Applied Mathematics. 2. Orlando: Academic Press Inc; 1984. [Google Scholar]
  • 12.Danczul T, Schöberl J. A reduced basis method for fractional diffusion operators II. J. Numer. Math. 2021;29(4):269–287. doi: 10.1515/jnma-2020-0042. [DOI] [Google Scholar]
  • 13.Danczul T, Schöberl J. A reduced basis method for fractional diffusion operators I. Numer. Math. 2022;151(2):369–404. doi: 10.1007/s00211-022-01287-y. [DOI] [Google Scholar]
  • 14.Erdélyi, A., Magnus, W., Oberhettinger, F., Tricomi, F. G.: Higher Transcendental Functions. Vol. III. Robert E. Krieger Publishing Co., Inc., Melbourne (1981). Based on notes left by Harry Bateman, Reprint of the 1955 original
  • 15.Gatto P, Hesthaven JS. Numerical approximation of the fractional Laplacian via hp-finite elements, with an application to image denoising. J. Sci. Comput. 2015;65(1):249–270. doi: 10.1007/s10915-014-9959-1. [DOI] [Google Scholar]
  • 16.Gilboa G, Osher S. Nonlocal operators with applications to image processing. Multiscale Model. Simul. 2008;7(3):1005–1028. doi: 10.1137/070698592. [DOI] [Google Scholar]
  • 17.Hofreither C. A unified view of some numerical methods for fractional diffusion. Comput. Math. Appl. 2020;80(2):332–350. doi: 10.1016/j.camwa.2019.07.025. [DOI] [Google Scholar]
  • 18.Hofreither C. An algorithm for best rational approximation based on barycentric rational interpolation. Numer. Algorithms. 2021;88(1):365–388. doi: 10.1007/s11075-020-01042-0. [DOI] [Google Scholar]
  • 19.Kaltenbacher B, Rundell W. Regularization of a backward parabolic equation by fractional operators. Inverse Probl. Imaging. 2019;13(2):401–430. doi: 10.3934/ipi.2019020. [DOI] [Google Scholar]
  • 20.Kilbas AA, Srivastava HM, Trujillo JJ. Theory and Applications of Fractional Differential Equations North-Holland Mathematics Studies. Amsterdam: Elsevier Science B.V; 2006. [Google Scholar]
  • 21.Lund J, Bowers KL. Sinc Methods for Quadrature and Differential Equations. Philadelphia: Society for Industrial and Applied Mathematics (SIAM); 1992. [Google Scholar]
  • 22.Lischke, A., Pang, G., Gulian, M. et al.: What is the fractional Laplacian? A comparative review with new results. J. Comput. Phys., 404:109009, 62 (2020)
  • 23.Mori, M.: Developments in the double exponential formulas for numerical integration. In Proceedings of the International Congress of Mathematicians, Vol. I, II (Kyoto, 1990), pp. 1585–1594. Mathematical Society, Japan, Tokyo (1991)
  • 24.Meidner, D., Pfefferer, J., Schürholz, K., Vexler, B.: hp-finite elements for fractional diffusion (2018)
  • 25.Melenk JM, Rieder A. hp-FEM for the fractional heat equation. IMA J. Numer. Anal. 2021;41(1):412–454. doi: 10.1093/imanum/drz054. [DOI] [Google Scholar]
  • 26.Melenk, J. M., Rieder, A.: An exponentially convergent discretization for space-time fractional parabolic equations using hp-fem. to appear in IMA J. Numer. Anal. (2022). arxiv: 2202.02067
  • 27.Nochetto RH, Otárola E, Salgado AJ. A PDE approach to fractional diffusion in general domains: a priori error analysis. Found. Comput. Math. 2015;15(3):733–791. doi: 10.1007/s10208-014-9208-x. [DOI] [Google Scholar]
  • 28.Nochetto RH, Otárola E, Salgado AJ. A PDE approach to fractional diffusion in general domains: a priori error analysis. Found. Comput. Math. 2015;15(3):733–791. doi: 10.1007/s10208-014-9208-x. [DOI] [Google Scholar]
  • 29.Nochetto RH, Otárola E, Salgado AJ. A PDE approach to space-time fractional parabolic problems. SIAM J. Numer. Anal. 2016;54(2):848–873. doi: 10.1137/14096308X. [DOI] [Google Scholar]
  • 30.Nakatsukasa Y, Sète O, Trefethen LN. The AAA algorithm for rational approximation. SIAM J. Sci. Comput. 2018;40(3):A1494–A1522. doi: 10.1137/16M1106122. [DOI] [Google Scholar]
  • 31.Rodino L. Linear Partial Differential Operators in Gevrey Spaces. River Edge: World Scientific Publishing Co. Inc; 1993. [Google Scholar]
  • 32.Stenger F. Numerical Methods Based on Sinc and Analytic Functions. Springer Series in Computational Mathematics. New York: Springer; 1993. [Google Scholar]
  • 33.Sun H, Zhang Y, Baleanu D, Chen W, Chen Y. A new collection of real world applications of fractional calculus in science and engineering. Commun. Nonlinear Sci. Numer. Simul. 2018;64:213–231. doi: 10.1016/j.cnsns.2018.04.019. [DOI] [Google Scholar]
  • 34.Takahasi, H., Mori, M.: Double exponential formulas for numerical integration. Publ. Res. Inst. Math. Sci., 9:721–741 (1973/74)
  • 35.Vázquez, J. L.: The mathematical theories of diffusion: nonlinear and fractional diffusion. In Nonlocal and Nonlinear Diffusions and Interactions: New Methods and Directions, volume 2186 of Lecture Notes in Mathematics, pp. 205–278. Springer, Cham (2017)

Articles from Numerische Mathematik are provided here courtesy of Springer

RESOURCES