Affine approximation of parametrized kernels and model order reduction for nonlocal and fractional Laplace models
Olena Burkovska, Max Gunzburger

TL;DR
This paper develops a reduced basis method for parametrized nonlocal and fractional Laplace models, addressing challenges of non-affine, singular kernels, and variable regularity, with theoretical and numerical validation.
Contribution
It introduces an affine approximation technique for complex parametrized kernels and provides a comprehensive error analysis for model order reduction.
Findings
Effective affine kernel approximations achieved
Reliable a posteriori error estimators developed
Numerical experiments confirm theoretical results
Abstract
We consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius and fractional Laplace kernels, parametrized by the fractional power , are studied. In order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power . To address this, we derive regularity and differentiability results with respect to and , which are of independent interest for other applications such as optimization and parameter identification.…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Affine approximation of parametrized kernels and model order reduction for nonlocal and fractional Laplace models
Olena Burkovska
Computational and Applied Mathematics, Oak Ridge National Laboratory, Oak Ridge, TN 37831, USA; Department of Scientific Computing, Florida State University, 400 Dirac Science Library, Tallahassee, FL 32306-4120, USA
[email protected], [email protected]
and
Max Gunzburger
Department of Scientific Computing, Florida State University, 400 Dirac Science Library, Tallahassee, FL 32306-4120, USA
Abstract.
We consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius and fractional Laplace kernels, parametrized by the fractional power , are studied. In order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power . To address this, we derive regularity and differentiability results with respect to and , which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.
Key words and phrases:
Nonlocal diffusion, fractional Laplacian, affine approximation, parametric regularity, reduced basis method
2010 Mathematics Subject Classification:
65N15, 35R11, 49K40, 65N12
1. Introduction
Nonlocal models are a broad category of mathematical models which arise in many areas of science, such as, e.g., solid and fluid mechanics, contact mechanics, subsurface flows, turbulence modeling, image analysis [13], and finance [10]. In particular, nonlocal diffusion operators are used to model anomalous diffusion processes and an important example is given by the integral fractional Laplacian.
While nonlocal models better reflect many physical processes, in many practical applications the precise model parameters are unknown. In this case, one requires not only to approximate the solution as a function of the spatial variable, but also as a function of the model parameters. Typically, such evaluations are performed for many instances of the parameter and model order reduction techniques, such as reduced basis methods (RBM), become attractive tools for reducing the computational complexity; see, e.g., [16, 19] and the references therein.
In this paper we propose and analyze computationally efficient and reliable approximations, based on the reduced basis method, of the parametrized problem involving the nonlocal operator given as
[TABLE]
where the kernel is a non-negative symmetric function and is a bounded domain. The parameter vector collects the kernel parameters and determines the qualitative nature of the associated problem
[TABLE]
Here, is a data term, which may also depend on the parameters, and the problem is endowed with homogeneous volume constraints on the complement of the domain.
We focus on two cases of particular interest: First, we consider a general class of kernels , where the nonlocal operator is given concretely by
[TABLE]
with denoting the Euclidean ball of a radius centered at . The corresponding problem is parametrized by for , which describes the extent of the nonlocal interactions. Here, the parametrized kernel arises from a truncation of the kernel to the strip where . Problems of this form are analyzed in [12], and arise, e.g., in the peridynamics model [20]. Second, as a particular choice of kernels we also consider (truncated) fractional Laplace type kernels, with the fractional power being the parameter in the model, i.e., for , we consider kernels of the following form
[TABLE]
where . In this case, we consider to be a given and fixed quantity. We note that in the case , the problem (1.2) turns into the fractional Laplace equation in integral form with homogeneous volume constraints
[TABLE]
which is a model of particular relevance; see, e.g., [11, 1].
We point out that the reduced basis method is not a new approach, and its beginning is traced back to structural engineering applications; see, e.g., [2, 18]. By now, a strong mathematical theory for the method has been developed and it has been significantly expanded to various applications. However, the RBM has been mainly developed for local problems, i.e., problems governed by parametrized partial differential equations (PDEs). Despite the fact that nonlocal problems benefit more from model order reduction – due to the reduced sparsity of the underlying discrete system and, as a consequence, the high computational cost – the potential of the method for nonlocal problems is still not fully explored. However, we refer to recent works on the reduced basis method and proper orthogonal decomposition for some nonlocal problems [21, 15, 3].
The distinctive property of the RBM in contrast to many other approximation techniques lies in the fact that it does not try to perform an approximation of the underlying solution space, but rather an approximation of the parametric manifold. Typically, by means of a greedy search algorithm, the method captures information about parametric variations of the model. The efficiency of the method is gained by the so-called offline-online decomposition of the computational routine, and to do so, it is crucial that the parametric quantities of the model are affine in the parameters. In brief, the offline-online procedure splits the parameter-independent computations (offline) from the parameter dependent ones (online). The first phase is computationally expensive, but performed only once, while the latter one is computationally cheap and can be executed multiple times for different instances of an input parameter, which later allows to perform computations in a multi-query context.
In the situation of non-affine parameter dependency, one has to approximate the bilinear and linear forms by corresponding affine counterparts. To do so, one typically resorts to empirical interpolation (EIM), [4] or discrete empirical interpolation (DEIM) [9] methods. We note that for the problems under consideration, the dependency on the parameters is not affine, which requires special attention. In the case of , the nature of the singularity changes with the parameter, which leads to different regularity properties of the solutions. Moreover, the integral kernel is discontinuous at and has a singularity for . This makes it impossible to apply empirical interpolation in a straightforward fashion, since it is designed for continuous and bounded functions. While the continuity condition can be relaxed by using a generalized empirical interpolation method (GEIM) [17], in the present setting the choice of interpolating functional is not obvious.
To circumvent this difficulty, we develop an affine approximation of the bilinear form based on interpolation with (local) polynomials. Here, we take into account the specific regularity of the bilinear form with respect to and , which results in an efficient and offline-online separable method. In the case of , we prove an exponentially convergent approximation based on the regularity result for the bilinear form. A byproduct of our analysis is the parametric regularity of the solution in for a general class of kernels and in for the fractional Laplace problem, which is of independent interest. In particular, we show the Lipschitz continuous differentiability of the solution with respect to and -regularity with respect to . To derive these results we strongly rely on the spatial regularity of the solution [14, 7]. To the best of our knowledge, these are the first results on the study of the smoothness of the solution with respect to the nonlocal interaction radius and power of the integral fractional Laplacian.
We comment on the existing works on nonlocal model order reduction, in comparison to the approach we follow. In [15] the reduced basis method is applied in the context of uncertainty quantification for nonlocal problems with random, but affine, coefficients. The reduced basis method for the power of the spectral fractional Laplacian has been recently studied in [3]. Although the spectral fractional Laplace problem, formulated via an extension formulation [8], is different from the integral form studied here, they face a similar problem due to the non-affinity and singularity of the parametric functions. To treat it a “cut-off” procedure of the computational domain is employed, however the resulting approach is tied to the underlying finite element discretization. In the following, we present an affine approximations, which can be performed directly in the continuous formulation, and account for all incurred approximation errors in the derived a posteriori error estimates.
Finally, we briefly comment on possible direct extensions of our work: By combining the developed approaches, we can directly extend the method to the case of a truncated Laplace kernel with both and as parameters. Moreover, additional dependencies on coefficients of the form
[TABLE]
where , can easily be incorporated in to the resulting approach, as long as is affine separable in ; cf. [15].
The rest of the paper is structured as follows. In Section 2, we introduce the necessary function spaces and recall some preliminary results, which will be used in the rest of the paper. In Section 3 we analyze the parametric regularity with respect to and in Section 4 we utilize the obtained results to construct an affine approximation of the problem with respect to . Section 5 studies a parametric smoothness of the bilinear form and the solution for the fractional Laplace problem. Then, in Section 6, these findings are used to for an affine approximation of the bilinear form based on Chebyshev interpolation. Eventually, in Section 7, we piece together the reduced basis approximation for both parameters. Finally, numerical results that illustrate our theoretical findings are given in Section 8.
2. Preliminaries
Let be a bounded domain with a Lipschitz boundary. We denote by , the usual Lebesgue spaces.
2.1. General truncated kernels
For , we denote by the ball of radius centered at , . Then, for , we introduce a truncated kernel , which is a non-negative symmetric (w.r.t. and ) function, and for all it fulfills the following conditions:
[TABLE]
Note that we allow the truncation parameter to be infinite, in order to include the fractional Laplace problem into the analysis. If , by a slight abuse of notation, we simply write , implying .
In addition, we assume that there exists a function , such that
[TABLE]
and we denote
[TABLE]
where is the surface measure of the dimensional unit sphere embedded in dimension , given explicitly as
[TABLE]
In certain cases, we need to require a stronger assumption on , namely that in (H2) is such that , i.e., there exist , such that
[TABLE]
For , we define the interaction domain corresponding to as follows . In terms of these notations, we define the nonlocal operator
[TABLE]
Then, for a given function , e.g., , we consider the problem (1.2). However, due to the finite range of interaction the volume constraint (1.2b) needs to be enforced only on instead of the whole . It is the analogue to the Dirichlet type boundary condition imposed on for the local case and is essential for the well-posedness of the nonlocal problem.
2.2. Fractional Laplace type kernels
A special focus in this paper will lie on (truncated) fractional Laplace type kernels. That is, the kernels parametrized by the fractional power of the following form:
[TABLE]
Here, is considered to be a given fixed parameter. We note that for , (2.4) becomes the classical fractional Laplace kernel and reduces to the fractional Laplace operator up to the scaling constant :
[TABLE]
In [11], the convergence of the nonlocal solution of (1.2) with the (truncated) kernel (2.4) to the solution of (1.2) with the fractional Laplace kernel is analyzed.
In order to obtain the usual fractional Laplace problem from (1.2), we incorporate the scaling factor into the right hand side, by defining
[TABLE]
for some given , e.g., . Then the solution of (1.2) corresponds to the solution of the problem for .
2.3. Function spaces
By and we denote the usual Sobolev spaces, and introduce the constrained -space, , which is isometrically isomorphic to . For we define the associated inner product
[TABLE]
where is the strip
[TABLE]
The corresponding norm is given by . We introduce the following energy and constrained energy spaces
[TABLE]
which are Hilbert spaces, equipped with the inner products and . We denote by the dual space of , and by the extended duality pairing between these spaces.
Remark 2.1**.**
Often it will be convenient to consider a common spatial domain, independent of , for functions . Thus, we consider an extension by zero of outside of , which, by a slight abuse of notation also denoted by , and as a common spatial domain we chose the whole . It is clear that these functions are equivalent and we will use these equivalence representations throughout the paper.
We assume that the kernel is such that following nonlocal Poincaré inequality holds:
[TABLE]
where is a Poincaré constant, independent of . In particular, the condition (2.9) is satisfied for the fractional Laplace type kernels, see also [12], where different classes of kernels are discussed for which this property also holds.
Throughout the paper we often make use of the fractional Sobolev spaces, which are defined as follows: Let be given either by or . For we define
[TABLE]
with Gagliardo seminorm
[TABLE]
For not an integer, we define , with and , as
[TABLE]
together with the semi-norm
[TABLE]
The space is a Hilbert space that is endowed with the norm . Additionally, we define the space incorporating the volume constraints given by
[TABLE]
that is endowed with the semi-norm of . For negative exponents, we define the associated spaces by duality .
We note that for the case of a (truncated) fractional Laplace kernel, to highlight the inclusion of the parameter , we use the notation instead of . Moreover, the nonlocal space is equivalent to , which implies that we can equivalently work with either or . In particular, for , , , we have
[TABLE]
Also, for any , there exists , such that for all it holds
[TABLE]
2.4. Weak formulation
First, we provide a result that states the equivalence of nonlocal spaces w.r.t. .
Proposition 2.1** (Equivalence of nonlocal spaces).**
Let satisfy (H1) and (H2). Then, for all , the spaces are all equivalent, and for some , we have the following norm bound
[TABLE]
where , if , and , else.
Proof.
Let , and for we consider
[TABLE]
It is clear that, if , then , and . On the other hand, if , then
[TABLE]
and, hence, . Applying the same arguments as above for the case we obtain the corresponding result and conclude the proof. ∎
Since, the spaces are equivalent, for further study, it is convenient to have a common function space. For some reference we denote a pivot space , such that , for all , and it is defined as
[TABLE]
For all , we define the bilinear form , where we suppress the dependency on the parameters for now, as follows
[TABLE]
Using the equivalence of nonlocal spaces w.r.t. , we obtain that the bilinear form is continuous and coercive on , i.e., for all , we have
[TABLE]
Then, by means of the nonlocal vector calculus [12], we now pose the problem (1.2) in the following weak form: For a given , find , such that
[TABLE]
By the Lax-Milgram theorem, the problem (2.15) admits a unique solution, in addition, there exists a constant , such that
[TABLE]
where we assume that is a constant independent of the parameters.
We recall a regularity result for the solution of (2.15) with the truncated fractional Laplace kernel (2.4) stated in [7], which is essentially based on the regularity results for the fractional Laplacian [14].
Theorem 2.2**.**
Let be a domain with boundary , and let , , and let be the solution of (2.15) with the kernel (2.4) for . Then, for any there exists a constant , such that
[TABLE]
where .
3. Regularity with respect to
In this section we investigate the smoothness of the problem (2.15) with respect to . Here, we denote the parameter dependent bilinear form by , and assume that the data term is given by , for some fixed . First, we show the Lipschitz continuity of the bilinear form and the solution, which is necessary for further application of the reduced basis method. In addition, under a regularity assumption, we prove also their differentiability w.r.t. .
Proposition 3.1**.**
Let satisfy (H1)–(H3). Then the bilinear form defined in (2.13) is Lipschitz continuous with respect to , that is for all , it holds with that
[TABLE]
Proof.
For simplicity of notation we introduce the abbreviation: , , . Then, for all we compute
[TABLE]
which concludes the proof. ∎
Proposition 3.2** (Lipschitz continutiy w.r.t. ).**
The solution of (2.15) is Lipschitz continuous with respect to , i.e., for all , it holds that
[TABLE]
where and is defined in (2.12).
Proof.
For simplicity of notation we denote by , and by . Then, for , using the Lipschitz continuity of , we can write
[TABLE]
Taking , and using (2.16) together with (2.12) we obtain
[TABLE]
∎
Next, we show that under appropriate conditions we can expect differentiability of with respect to . This result will be crucial for the derivation of improved a posteriori error bounds for the reduced basis approximation.
Theorem 3.3**.**
Let be radial, i.e., , and satisfies (H1)–(H3), then is differentiable w.r.t. , i.e., there exists a bounded bilinear form such that for all , . In particular, it holds
[TABLE]
where is the surface of the ball of radius at , i.e. , and the inner integral is understood as a surface integral, together with the estimate
[TABLE]
where and is defined in (2.2). Moreover, if and if is Lipschitz continuous with respect to , i.e.,
[TABLE]
then is also Lipschitz continuous and the following holds
[TABLE]
with for .
Proof.
Shifting the inner integral to , using the radiality of the kernel, changing the order of integration, and changing to polar coordinates, we obtain
[TABLE]
where is the -sphere, and the inner integral is abbreviated as
[TABLE]
Thus, for the derivative we clearly obtain that
[TABLE]
Changing the order of integration again, and substituting , we obtain the desired representation (3.3). To obtain the boundedness, we split the integral in four parts, which leads to
[TABLE]
In the final line, we split the last term into two, shift one integral by , and recombine the result. Applying the Cauchy-Schwarz inequality to the last term, we obtain the stated inequality (3.4).
Next, we show (3.6). For with we compute
[TABLE]
Using the regularity , which also implies that , and applying the fundamental theorem of calculus, we can express
[TABLE]
and respectively for . Using Lipschitz continuity of (3.5), we can estimate
[TABLE]
Then, combining (3.8), (3.9) and using Cauchy-Schwarz inequality, we can estimate
[TABLE]
This concludes the proof. ∎
Corollary 3.1** (-regularity of the solution).**
Let , , be the solution of (2.15). Then, under the conditions of Theorem 3.3 (namely, is radial and is Lipschitz, and for all with a uniform bound), it holds that is differentiable w.r.t. , i.e., there exist , , and, moreover, is Lipschitz continuous w.r.t. , i.e., .
Proof.
It is easy to show that is the solution of the sensitivity equation
[TABLE]
In fact, this result can be directly derived by subtracting the problems for and , , forming the difference quotient, and passing to the limit for . Next, we prove the Lipschitz continuity of . For we consider
[TABLE]
where the last estimate has been obtained by applying (3.1), (3.2), (3.4), (3.6), and (2.9). Then, taking and using the coercivity of from (2.14), we obtain the desired result. ∎
Remark 3.1**.**
We note that for the truncated fractional Laplace kernel (2.4), the condition holds true if , and ; see Theorem 2.2.
4. Affine approximation with respect to
Utilizing the regularity results derived in the previous section, we present suitable approximation techniques that resolve the non-affine structure of the problem.
4.1. Approximation of the kernel with respect to
For , we consider the following partitioning of the interval :
[TABLE]
with the step size , . Then we approximate by , defined as follows
[TABLE]
In the following, we distinguish several cases for the choice of .
Case 1
First, we consider a piece-wise constant approximation, given by
[TABLE]
where and . That is, if is given as a truncated fractional Laplace kernel (2.4), then and . Thus, we approximate by if is sufficiently close to , such that the integral of the kernel from to is smaller than that to the partition point on the other side.
Case 2
To obtain an improved approximation quality, we also consider piece-wise linear approximation of the kernel. Here, we set
[TABLE]
Thus, is given by the standard linear “hat-functions” on the grid .
In both cases, for all , , we define a parametrized bilinear form corresponding to the approximated kernel as follows
[TABLE]
By the equivalence of nonlocal spaces (2.12) and the definition of , we get that is continuous and coercive on with the continuity and coercivity constants defined as in (2.14). Here, we use the “partition of unity” properties that and .
Next, we provide an estimate for the error caused by the approximation of the kernel by . In particular, we show that using Case 2 for sufficiently regular , we obtain quadratic convergence in , while Case 1 provides only a linear convergence order, but without any additional assumptions.
Proposition 4.1** (Case 1).**
Let satisfy (H1)–(H3) and let be defined as in (4.2), then for any , and we obtain
[TABLE]
where , with from (2.2) and from (H3).
Proof.
For simplicity of notation we introduce the following abbreviations: , , and . Let , . Then, invoking the definition of (4.1) and (H1)–(H3), for any , we obtain
[TABLE]
Taking the maximum over yields the desired result. ∎
For Case 2 we obtain the following result.
Proposition 4.2** (Case 2).**
Let , be such that conditions of Theorem 3.3 hold, and let be defined as in (4.3), then for any , and we obtain that
[TABLE]
where is Lipschitz continuity constant defined in (3.6).
Proof.
Using fundamental theorem of calculus, we can express for a given and :
[TABLE]
From the definition of , with specified as in Case 2, it follows that
[TABLE]
where , using the mean value theorem. Subtracting (4.7) from (4.8) and using Lipschitz continuity of in Theorem 3.3, we obtain
[TABLE]
Applying the estimate (3.6) for and using concludes the proof. ∎
4.2. Error due to the affine kernel approximation
We consider the problem related to the affine kernel : For , find , such that
[TABLE]
where is defined in (4.4). Now, using the results of Proposition 4.2 and Proposition 4.1, we provide the error in the solution caused by the affine approximation.
Proposition 4.3**.**
For , let be the solutions of the problems (2.15), (4.9), respectively. For Case 1, under conditions of Proposition 4.1, and for Case 2, under the conditions of Proposition 4.2, we obtain that
[TABLE]
Proof.
The proof can be obtained with standard methods, similarly as in Proposition 7.1, which will be provided later. ∎
5. Regularity with respect to
In this section we analyze the regularity of the solution of (2.15) with truncated fractional Laplace kernel (2.4) with respect to the kernel parameter . For simplicity of the presentation of our analysis we scale (2.15) by . Then, for , , we seek such that for all
[TABLE]
where as defined in (2.6). Throughout the next sections we also assume that for any . For the sake of analysis, we consider first only the case of finite interaction radius . The fractional Laplace case will be addressed later.
Lemma 5.1** (Derivative of the bilinear form).**
Let and with . Then, for , the bilinear form is infinitely many times differentiable, i.e., for , there exist , given by
[TABLE]
Moreover, is bounded and
[TABLE]
where and .
Proof.
The formal derivation of the derivative follows from a direct computation. In order to justify the differentiation under the integral, we can apply the dominated convergence theorem. For this purpose, we first prove the second statement. For , , using with the Hölder inequality we can estimate
[TABLE]
where we have set . Then, applying estimate (A.1) from Appendix A for the supremum, we obtain the desired result. ∎
Concerning the case , we use the splitting
[TABLE]
with , which is valid for all ; cf. [7] for a derivation of this simple identity. Then, a similar estimate as given above for can be given also in the fractional Laplace case.
Corollary 5.1**.**
Using expression (5.5), we obtain for any the derivative of the bilinear form corresponding to the fractional Laplacian as
[TABLE]
Moreover, the estimate (5.3) remains valid with the constant defined as .
However, this estimate is only of minor relevance for the purposes of this paper, since an affine separable approximation of the bilinear form can be based directly on (5.5), because the last term is already affine in the parameters, and only the truncated bilinear form for needs to be further approximated.
Theorem 5.2** (-regularity of the solution).**
Let for any , fixed , and as in (2.6) with for any , be the solution of (5.1). Then, is infinitely many times differentiable w.r.t. with values in . Thus, it holds .
Proof.
First, select any with . By subtracting equations (5.1) with and with , both tested with , for some , we obtain the following relation:
[TABLE]
It is clear that in (5.1) is arbitrarily often differentiable in , with all derivatives, denoted by , , being in , . Then, the right-hand side of (5.7) is uniformly bounded in . Indeed, taking , invoking the higher regularity of the solution from Theorem 2.2, and using the fundamental theorem of calculus together with Lemma 5.1, we obtain for all
[TABLE]
for sufficiently small. Here, is the Lipschitz constant of . Now letting in (5.7) we obtain together with the following sensitivity equation:
[TABLE]
By the density of in , we obtain that the above equation also holds for all . From Theorem 2.2, we have that . Now, we potentially decrease , such that additionally . Applying (5.3) with , , we obtain that
[TABLE]
which also implies that . Then, by denoting by the right-hand side of (5.8), we obtain that . Applying Theorem 2.2, it follows that . Similarly, the second sensitivity fulfills
[TABLE]
Then, applying (5.3) for with , and for with , , we obtain that the right-hand side of (5.9) is in . Again, applying regularity result (2.17), we conclude that . Proceeding iteratively and using an induction argument, it is easy to show that -th derivative , is the unique solution of
[TABLE]
and, in addition, . By embedding the solution spaces into the common space , we obtain the last property. ∎
6. Affine approximation with respect to
Approximation with respect to poses similar difficulties as for the case of . However, here, invoking the higher regularity properties, we can approximate the bilinear form with high order polynomials. Concretely, we adopt the Chebyshev interpolation for with respect to on the interval .
For , we consider the following partitioning of the interval : , where are the Chebyshev maximal points on the interval , given by , . Then, for a given , , and sufficiently regular , we approximate
[TABLE]
Note that, in order for to be well-defined, the regularity that both and are in is not sufficient, but, for instance, taking is sufficient. We will discuss this more thoroughly in the following.
Remark 6.1**.**
We note that for the fractional Laplace case , we can obtain an affine separable bilinear form by combining the splitting (5.5) for a choice of with the approximation (6.1).
Thus, we will restrict attention to the case in the following.
Lemma 6.1** (Interpolation error).**
Let , and , such that , . Then, for , we obtain
[TABLE]
where , if and if , where .
Proof.
We present a proof for , the case follows along the same lines. Using the Chebyshev polynomial interpolation error estimate, and the bound (5.3), we can estimate that
[TABLE]
Using the fact that and (cf. Proposition A.1), we can estimate the last term in the previous inequality as follows
[TABLE]
A combination of the estimates concludes the proof. ∎
Remark 6.2**.**
For , i.e., , the error term in (6.2) converges to zero exponentially. This can be guaranteed in two situations, where we assume that , for arbitrarily small .
- •
For and : In this case, we can choose
[TABLE]
which leads to in the case of .
- •
For and : Here, a choice of as above is prevented by the restriction . Thus, we chose
[TABLE]
which is possible using . Then, we obtain in the case of .
In the following, we will assume that one of the conditions of Remark 6.2 holds, which limits the size of the interval . However, in the case that the interval of interest is larger, we can simply subdivide it into several subintervals with , for , and , such that each subinterval fulfills the conditions of Remark 6.2. Furthermore, for any the interval can be covered by at most four subintervals, and the remaining interval can be covered by a finite number of subintervals. However, for notational simplicity we will simply accept the restrictions from Remark 6.2 and consider a single interval.
6.1. Error due to the affine kernel approximation
In the following, we analyze the error cause by the approximation (6.1). Due to the fact that the coefficents can be negative, we can not guarantee that is coercive on , . To overcome this difficulty, we introduce a regularized problem.
In what follows, we assume that the conditions from Remark 6.2 are fulfilled. We also define the mean value for the choices of and given there as
[TABLE]
For a regularization parameter , we define as
[TABLE]
We consider the following regularized problem: Find , such that
[TABLE]
Proposition 6.2**.**
Under the assumption , the bilinear form (6.3) is coercive and continuous on , with coercivity constant and continuity constant . Additionally, it is coercive on for any with constant one. Thus, there exists a unique solution of (6.4) with
Proof.
Using the error estimate (6.2) with the choices , we can write
[TABLE]
By neglecting either the first or the second term, we obtain the coercivity of as stated. Second, using the Sobolev embedding (2.11), we obtain
[TABLE]
The existence and uniqueness of the solution follows now with the Lax-Milgram lemma. The given estimate is due to the coercivity of on . ∎
Additionally, we can quantify the error between the solutions of (6.4) and (5.1).
Proposition 6.3**.**
Let , are the solutions of (5.1) and (6.4), respectively. Then, we have the following error bound
[TABLE]
where .
Proof.
From Theorem 2.2, we have that . Then for and using the Cauchy-Schwarz inequality, we can estimate
[TABLE]
with and (cf. Remark 6.2). Moreover, for we obtain that
[TABLE]
Then, taking , using coercivity of on , the estimate above, and Lemma 6.1 with the same , as above, we obtain
[TABLE]
which yields the desired result. ∎
Corollary 6.1**.**
For a choice of , the problem (6.4) is well posed, and admits the estimate
[TABLE]
with depending only on , , , and , with as given in Lemma 6.1.
7. Reduced basis approximation
Solving the problems (2.15) for various values of the parameters, e.g., by finite elements or other discretization methods, would require a substantial computational effort due to the fact that the underlying discrete system will consist of banded matrices with bandwidth related to the nonlocal interaction radius . For , as in the example of the fractional Laplacian, we need to deal with full matrices. As a remedy, one could use the affine problems (4.9) and (6.4) instead, to reduce the computational cost of assembling the matrices for different parameters. However, in this case one still has to confront the problem of solving dense high-dimensional systems.
In this section, we describe how to build the reduced basis approximation upon problems (4.9) and (6.4) – which are often referred as the “detailed problems” – and to obtain a reduced problem of much smaller dimension. We note that (4.9) and (6.4) can also be replaced by high-fidelity discrete problems, where , are substituted with high-dimensional discrete approximation spaces, e.g., finite element spaces. Subsequently, the reduced model is constructed based on an approximation of the detailed spaces by low-dimensional reduced spaces , . Various approaches exist for the construction of the reduced basis approximation spaces. Typically, this is done by applying an iterative greedy strategy to a set of snapshots, i.e., solutions computed for different parameter values; see, e.g., [6, 5]. The computational speed-up is then achieved by an offline-online computational procedure, invoking the affine-parameter dependency of the problem: In the offline routine, which is performed only once, we assemble all parameter independent forms needed in the construction of the affine approximation, i.e., we assemble in (4.4) and in (6.1), for , . During the online stage, we evaluate the parameter-dependent components, i.e., and , and solve the corresponding reduced system. This stage is executed multiple times for each new parameter value.
7.1. RBM with respect to
The RBM approximation for is rather straightforward and we outline it only briefly. Using a greedy algorithm, we construct the reduced bases spaces from the set of snapshots , where are the solutions of (2.15) for different , . To find the reduced solution we solve the following problem: For , find , such that
[TABLE]
where, we recall, is defined in (4.4) either using Case 1 or Case 2 approximations. To validate the error caused by the RB approximation, we derive the corresponding a posteriori error estimates. We define the residual by
[TABLE]
We note that the residual vanishes on , i.e., for any . Then, we obtain the following error bounds.
Proposition 7.1** (A posteriori error estimator for ).**
For any the reduced basis error for Case 1, under conditions of Proposition 4.1, and for Case 2, under the conditions of Proposition 4.2, we obtain
[TABLE]
where , , , and are from (2.14), (4.5), (2.9), and (3.6), respectively.
Proof.
For any we have
[TABLE]
Taking , using coercivity of , we obtain
[TABLE]
and applying the error bound (4.5), resp. (4.6), we conclude the proof. ∎
7.2. RBM with respect to
Upon the detailed problem (6.4), we build the corresponding reduced basis approximations. For suitably chosen approximation spaces , we have the following problem: For a given , find , such that
[TABLE]
In particular, we chose the reduced space as follows:
[TABLE]
We note that, invoking Theorem 2.2, we have that
[TABLE]
and, hence, . This also guarantees the well-posedness of the reduced problem (7.3). For any , we define the residual
[TABLE]
We note that vanishes for any . Then, we derive the a posteriori error bound associated with the reduced basis approximation.
Proposition 7.2** (A posteriori error estimator for ).**
Let for , , be a solution of (5.1) and (7.3), respectively. Then, with , the reduced basis error can be estimated as
[TABLE]
Proof.
For , we obtain
[TABLE]
Taking , we obtain by similar arguments as in Proposition 6.3
[TABLE]
Dividing by the error yields the result. ∎
We point out that the derived a-posteriori error bounds (7.2) and (7.6) can be computed efficiently in an offline-online manner. This means that parameter-independent components for the computation of the error bound can be precomputed in the offline stage, and the online evaluation of the error bound depends only on the reduced dimension and , respectively .
8. Numerical results
We consider , which is discretized with the uniform mesh of mesh size , which we set to . The interaction domain is given by , with . We consider the case of the fractional Laplace type kernels, that is kernels parametrized by and and defined in (2.4). The parameter domain for and is set to
[TABLE]
For the construction the RB method for the parameter we consider a training set , consisting of 121 uniformly distributed points with a step size . Analogously, for the parameter , we use a training set , comprising of 50 points. To validate the RB approximation we use a testing sets and consisting of 100 and 30 randomly distributed points on and , respectively.
In Figure 1 we plot the variability of the discrete solution of (2.15) w.r.t. either or and with chosen as a characteristic function on , i.e., . We observe that even having only one parameter varying in the model, there is a non-trivial parameter dependency of the solution. Moreover, we observe how the regularity of the solution deteriorates for decreasing , as indicated by the theory.
8.1. Affine approximation
First, we numerically investigate the errors solely due to the the affine approximation of the bilinear form, without any reduced basis approximation. In the following, unless otherwise stated, the pivot energy space is chosen for and the data term is chosen as , where . We note that we do not consider the error between continuous and the finite element solution, and only compare the errors in terms of the discrete solution. Hence, for notational convenience we denote the discrete solution using the same notation as for the continuous solution.
In Figure 2 we depict the pointwise errors for between discrete solutions of the original problem (2.15) and the problem (4.9) with an affine kernel for values of in (4.1) using a uniform partitioning of . We clearly observe the reduction of the error while increasing and smaller errors for Case 2 in comparison to Case 1. In addition, we notice that the maximal error is not uniformly distributed over the intervals and significantly increases for smaller values of . This suggests that using a uniform partitioning of for the construction of (4.1) may not be optimal. In fact, from the estimate (4.10), taking into account the particular form of the fractional Laplace kernel (2.4), we can deduce that distributing
[TABLE]
better equalizes the error in terms of the constant appearing in the provided estimate. Using such partitioning for the construction of for Case 2, we measure again the corresponding errors in the discrete solutions, which is depicted in Figure 2. Here, we observe an additional reduction in the maximal error over Case 2 with the uniform refinement, and, in addition, a better equilibration of the maximal error over the subintervals .
The error convergence in terms of for Case 1 and Case 2 using uniform and adaptive refinements for in (4.1) is presented on Figure 3. We observe linear for Case 1 and quadratic for Case 2 order of convergence for both type of refinements, which is in agreement with the theoretical results from Proposition 4.3. We remark that for the chosen parameter , the theory guarantees only for arbitrarily small , however, since the computation is based on the finite element solution, it still holds on the discrete level, and the corresponding norm can depend only very weakly on the mesh size .
In a similar manner, for the parameter we investigate the error between the discrete solution of the original problem (5.1) and the solution of the regularized problem (6.4) with the regularization parameter . Here, we implement the regularization term with parameter , which corresponds to a choice of below the machine precision. We note that this leads to . In Figure 4, the error is plotted for different number of Chebyshev points used in (6.1). We clearly observe the exponential convergence of the error, which numerically confirms the error bound (6.5).
8.2. Reduced basis approximation
Finally, we investigate numerically the reduced basis approximation for and . Using the greedy algorithm, based on the true error criterion, we iteratively construct the reduced basis spaces. In Figure 5 we plot the convergence of the RB error for over the test set for different dimensions of the RB space and numbers of interpolation points . That is, the error , where and are the discrete solutions of (2.15) and (7.1), respectively. Here, we set .
Similarly, we consider the problem with the parameter for different values of and . Concerning the choice of and , we follow the same settings as in the previous section. Here, we plot the relative error .
From both plots we observe a rapid convergence of the RB error. However, while we can clearly see the exponentially decaying behavior of the error in the parameter , for the case of the convergence is slower, that could be explained by the reduced parameter regularity of the solution. In the case that the number of points (resp. ) is too low, the error can not be reduced below the error caused by the affine approximation. In the case of , machine precision is reached already for .
Appendix A Auxilliary estimates
Proposition A.1**.**
For , and , we have the following estimate
[TABLE]
Proof.
For , , let . Then, we can express
[TABLE]
We analyze each term on the right-hand side of (A.1) separately. For the first term with , we obtain . Clearly, and to find a maximum, we compute the first derivative as
[TABLE]
Then, the equation for is solved exactly for . From this, we obtain
[TABLE]
For the second term, we only have to consider the case (otherwise the term is zero and ): Since is monotonically increasing function on the interval , the last term in (A.1) is realized at , i.e., . This proves the first inequality.
Finally, from the fact that , , we can write
[TABLE]
where is some positive constant. Then, taking , , we obtain that . Finally, using the fact that , we obtain the second inequality. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Acosta and J. Borthagaray , A fractional Laplace equation: regularity of solutions and finite element approximations , SIAM J. Numer. Anal., 55 (2017), pp. 472–495, https://doi.org/10.1137/15M 1033952 . · doi ↗
- 2[2] B. O. Almroth, P. Stern, and F. A. Brogan , Automatic choice of global shape functions in structural analysis , AIAA Journal, 16 (1978), pp. 525–528, https://doi.org/10.2514/3.7539 . · doi ↗
- 3[3] H. Antil, Y. Chen, and A. Narayan , Certified reduced basis methods for fractional Laplace equations via extension , ar Xiv e-prints, (2018), https://arxiv.org/abs/1808.00584 .
- 4[4] M. Barrault, Y. Maday, N. C. Nguyen, and A. T. Patera , An ’empirical interpolation’ method: application to efficient reduced-basis discretization of partial differential equations , Comptes Rendus Mathematique, 339 (2004), pp. 667 – 672, https://doi.org/10.1016/j.crma.2004.08.006 . · doi ↗
- 5[5] P. Binev, A. Cohen, W. Dahmen, R. De Vore, G. Petrova, and P. Wojtaszczyk , Convergence rates for greedy algorithms in reduced basis methods , SIAM Journal on Mathematical Analysis, 43 (2011), pp. 1457–1472.
- 6[6] A. Buffa, Y. Maday, A. T. Patera, C. Prud’homme, and G. Turinici , A priori convergence of the greedy algorithm for the parametrized reduced basis method , ESAIM Math. Model. Numer. Anal., 46 (2012), pp. 595–603, http://dx.doi.org/10.1051/m 2an/2011056 . · doi ↗
- 7[7] O. Burkovska and M. Gunzburger , Regularity analyses and approximation of nonlocal variational equality and inequality problems , Journal of Mathematical Analysis and Applications, 478 (2019), pp. 1027 – 1048, https://doi.org/10.1016/j.jmaa.2019.05.064 . · doi ↗
- 8[8] L. Caffarelli and L. Silvestre , An extension problem related to the fractional Laplacian , Comm. Partial Differential Equations, 32 (2007), pp. 1245–1260, https://doi.org/10.1080/03605300600987306 . · doi ↗
