Optimal finite elements for ergodic stochastic two-scale elliptic equations
Abstract
We develop an essentially optimal finite element approach for solving ergodic stochastic two-scale elliptic equations whose two-scale coefficient may depend also on the slow variable. We solve the limiting stochastic two-scale homogenized equation obtained from the stochastic two-scale convergence in the mean (A. Bourgeat, A. Mikelic and S. Wright, J. reine angew. Math, Vol. 456, 1994), whose solution comprises of the solution to the homogenized equation and the corrector, by truncating the infinite domain of the fast variable and using the sparse tensor product finite elements. We show that the convergence rate in terms of the truncation level is equivalent to that for solving the cell problems in the same truncated domain. Solving this equation, we obtain the solution to the homogenized equation and the corrector at the same time, using only a number of degrees of freedom that is essentially equivalent to that required for solving one cell problem. Optimal complexity is obtained when the corrector possesses sufficient regularity with respect to both the fast and the slow variables. Although the regularity norm of the corrector depends on the size of the truncated domain, we show that the convergence rate of the approximation for the solution to the homogenized equation is independent of the size of the truncated domain. With the availability of an analytic corrector, we construct a numerical corrector for the solution of the original stochastic two-scale equation from the finite element solution to the truncated stochastic two-scale homogenized equation. Numerical examples of quasi-periodic two-scale equations, and a stochastic two-scale equation of the checker board type, whose coefficient is discontinuous, confirm the theoretical results.
1 Introduction
We develop an essentially optimal finite element (FE) method to solve ergodic stochastic two-scale problems. For these problems, the homogenized coefficient can be found from solutions of abstract cell problems that are posed in the abstract probability space (see, e.g, [4], [23], [2], [16]). Each corresponding real realization of the solution of these abstract equations satisfies an equation in the whole real space. To establish the homogenized coefficient numerically, we need to solve cell problems in a truncated real domain. The accuracy of the approximation of the homogenized coefficient, which is also the accuracy of the approximation of the solution to the homogenized equation, depends essentially on the size of the truncated domain ([6]). When the two-scale coefficient depends also on the slow variable, homogenization is more complicated to justify ([5]). Further, for each macroscopic point in the slow variable domain, we need to solve a set of cell problems to approximate the homogenized coefficient at that point, leading to a large level of complexity.
Motivated by our previous works of solving locally periodic multiscale problems, we develop in this paper a high dimensional FE approach that provides the solution of the homogenized equation that approximates the solution of the two-scale equation macroscopically, and the corrector that encodes the microscopic information, at the same time. For the case of locally periodic problems, the multiscale homogenized equation ([25, 1]) contains all the necessary information on the solution of the multiscale problem: its solution provides the solution to the homogenized equation and the corrector. However, this equation is posed in a high dimensional tensorized domain. Schwab [26] and Hoang and Schwab [21] develop the sparse tensor product FE approach that solves this equation with an essentially optimal level of complexity for obtaining an approximation of its solution within a prescribed level of accuracy. The method has been successfully applied to other classes of equations: wave equation ([29]), elasticity ([30, 31]), electro-magnetic equations ([10, 11]), nonlinear equations ([20, 27, 28]). For ergodic stochastic two-scale equations, the corresponding stochastic version of the two-scale homogenized equation is obtained from the stochastic two-scale convergence in the mean which is developed by Bourgeat et al. [5]. In the stochastic two-scale homogenized equation (3.1), and are the solution of the homogenized equation and the abstract corrector which is obtained from and the solutions of the abstract cell problems respectively. We show that and the realization of the corrector (here is the ergodic dynamical system on the probability space) can be approximated by the solution of the truncated stochastic two-scale homogenized equation which depends on real variables and where belongs to the real physical domain, and belongs to a truncated domain. Solving this equation with the sparse tensor product FEs, we obtain an approximation whose accuracy in terms of the FE mesh width and the truncation level of the domain of the fast variable is essentially equal to the accuracy of the approximation of the homogenized coefficient, obtained by solving the cell problems in the same truncated domain using the same FE mesh width. We thus obtain an approximation for the solution of the homogenized equation and the corrector at the same time, using an essentially optimal number of degrees of freedom which is equivalent (apart from a possible logarithmic multiplying factor) to that required for solving one cell problem in the truncated domain, for the same level of accuracy. The essential optimality of the sparse tensor product FEs is achieved when the corrector possesses sufficient regularity. However, in this case, the regularity norm of the corrector grows with the size of the truncated domain. Nevertheless, we show that the approximation rate for the solution of the homogenized equation is independent of the size of the truncated domain. Given an analytic corrector, we construct a numerical corrector from the numerical solution of the truncated stochastic two-scale homogenized equation. Numerical experiments confirm our theory.
We note that general multiscale methods have been applied for ergodic stochastic multiscale problems. We mention exemplarily the work by Efendiev and Pankov [13] using the Multiscale Finite Element method ([22, 14]) and Gallistl and Peterseim [15] using the localization approach ([24]). These approaches need to solve multiscale local problems using microscopic meshes that must be at most of the order of the microscopic scale. In this paper, our mesh width is macroscopic; the convergence rate depends on the level of the truncation of the fast variable domain, which depends solely on the statistics of the ergodic random field, and not on the microscopic scale.
The paper is organized as follows.
In the next section, we formulate the ergodic two-scale equation and review some results on their homogenization. In section 3, we recall the concept of stochastic two-scale convergence in the mean of Bourgeat et al. [5]. We then establish the approximation of this equation by the truncated stochastic two-scale homogenized equation, where we consider a truncated domain for the fast variable with size , and show that the approximation accuracy in terms of the truncated level of the fast variable domain is equal to that of the cell problems. In Section 4, we solve the truncated stochastic two-scale homogenized problem by tensor product FEs. We show that the sparse tensor product FEs obtain essentially equal convergence rate as the full tensor product FEs using a far smaller number of degrees of freedom, which is essentially optimal, given that the solution possesses sufficient regularity. In Section 5, with the availability of an analytic corrector result, we construct a numerial corrector for the solution of the two-scale equation from the FE solution of the truncated stochastic two-scale homogenized equation, when the microscopic scale, the FE mesh width converge to 0, and the size of the truncated domain tends to infinity. Section 6 presents some numerical experiments. We solve two-scale quasi periodic problems in one and two dimensional domains where the exact homogenized coefficient can be approximated highly accurately, so a reference solution can be approximated with a high level of accuracy. The numerical results confirm the theory. When the mesh size is larger, the decaying rate of the total error is similar to that of the FE error as the effect of truncation of the fast variable domain is less significant. However, when the FE mesh gets smaller, the decaying rate deteriorates due to the more prominent effect of the truncated fast variable domain. When we increase the size of the truncated domain, the total error gets smaller. We then solve a two dimensional checker board type problem whose coefficient is piecewise constant. We observe similar behaviour in the total error. The appendices contain the involved proofs of some technical results.
Throughout the paper, by we denotes a generic constant whose value may change between different appearances. Repeated indices indicate summation.
2 Problem setting
2.1 Ergodic two-scale problem
Let be a bounded Lipschitz domain in . Let be a probability space. We assume that there is an ergodic dynamical system such that for and , . Furthermore, any invariant subsets of have either probability 0 or 1. Let . There are positive constants and such that for all
(2.1) |
for a.a. . We assume further that . Let be a small quantity that represents the microscopic scale that the problem depends on. We define the ergodic random two-scale coefficient as
We denote by and . Let . We consider the problem
(2.2) |
with the Dirichlet boundary condition for .
2.2 Homogenized equation
We review in this section the well known results on homogenization of problem (2.2). We refer to the standard references such as [4] and [23] for details. We denote by where is the generator of the semingroup and is the th unit vector in the standard basis of . Following [23] and [6], we define the completion of the space of all functions in of the form for belonging to the domain of ; and by the completion in of all functions whose components belong to the domain of the operator such as . For each basis vector in the standard basis of , we consider the cell problem: Find such that
(2.3) |
Then the homogenized coefficient can be expressed as
(2.4) |
We have that when , in a.s. where the deterministic function satisfies the homogenized problem
(2.5) |
with the Dirichlet boundary condition on . We note that Jikov et al. [23] only consider the case where i.e. it does not depend on , but the results hold identically for the case where depends on as considered in this paper. For , let be the cube . We consider the problem
(2.6) |
with the Dirichet boundary condition for . We define the coefficient as
(2.7) |
We then have
Proposition 2.1
Assume that for all , where is independent of and . Almost surely, .
Bourgeat and Piatnitski [6] show this result in the case where does not depend on , i.e. (see also [16, 2]). We show this proposition for the case where also depends on in Appendix A. We note that with further assumption on the structure of the probability space , we also have the stronger convergence result ([6]):
(2.8) |
for .
3 Stochastic two-scale convergence in the mean
In this section we recall the stochastic two-scale convergence in the mean and the stochastic two-scale homogenized equation obtained from it of Bourgeat et al. [5]. We then study approximation of its solution by the truncated stochastic two-scale homogenized equation.
3.1 Stochastic two-scale convergence in the mean
The homogenized problem can also be established by using the ”stochastic two-scale convergence in the mean” as defined by Bourgeat et al. [5]. This extends the concept of two-scale homogenization ([25],[1]) to the stochastic setting. Following [5] we say that a function is admissible if belongs to . We first recall the definition
Definition 3.1
A sequence in stochastically two-scale converges in the mean to a function if for every admissible function ,
This definition makes sense due to the following result ([5] Theorem 3.4):
Lemma 3.2
From a bounded sequence in we can extract a stochastic two-scale convergent in the mean subsequence.
For a bounded sequence in we have the following result ([5] Theorem 3.7):
Lemma 3.3
Let be a bounded sequence in . There is a subsequence (not renumbered), a function and a function such that stochastically two-scale converges in the mean to and stochastically two-scale converges in the mean to .
Using these, we have the following result on the stochastic two-scale convergence in the mean limit for the solution of problem (2.2).
Proposition 3.4
There are functions and such that the sequence of solution to problem (2.2) stochastic two-scale converges in the mean to , and stochastic two-scale converges in the mean to . The functions and form the unique solution of the problem:
(3.1) |
.
We refer to Bourgeat et al. [5] Theorem 4.1.1 for a proof.
3.2 The truncated equation
We note the following result.
Lemma 3.5
Let (), and be such that
for all belonging to the domain of the generator of the semi group for all . Then a.s. for all
The proof of this result can be found, e.g. in Beliaev and Kozlov [3] page 12 (though Beliaev and Kozlov consider the more complicated case of a randomly perforated domain). From (3.1), we have
for all and belonging to the domain of . Therefore
From this, we have for almost all
(3.2) |
. On the other hand, as
due to ergodicity
for almost all . Thus almost surely
(3.3) |
As is a potential vector with respect to , this leads us to consider the following approximation problem. We denote by and with the norm
for . We define the bilinear form by
. From (2.1), it is straightforward to verify that is bounded and coercive for almost all . We consider the approximate problem: Find such that
(3.4) |
. From the boundedness and the coercivity conditions of the bilinear form , this problem has a unique solution . We have the following estimate
Lemma 3.6
There is a positive constant which is independent of such that for almost all
It is straighforward to verify that satisfies the problem
(3.5) |
with the Dirichlet boundary condition on , where is defined in (2.7). We then have the following approximation.
Proposition 3.7
Let be the solution of problem (3.4). Then almost surely
Proof First we show that the coefficient is uniformly bounded and coercive for almost all . As is uniformly bounded for all and , we have
is uniformly bounded for almost all and . From (A.4), we have
For the coercivity, we note that
so for ,
Therefore is uniformly bounded. From (3.5) and (2.5), we have
Thus
Therefore
We then get the conclusion.
Approximation for in terms of is presented in Lemma 5.2.
4 Finite element approximation of problem (3.4)
We develop finite element approximations for the solution of problem (3.4) in this section. Due to the tensorized structure of the problem, we use tensor product FE approximations. We will first develop the full tensor product FE approximation which only requires regularity for with respect to the variables and separately, but the dimension of the FE space is exceedingly large. We then develop the sparse tensor product FE approximation which requires a stronger regularity condition to get the same level of accuracy but uses only an essentially optimal number of degrees of freedom. We will show later that this stronger regularity condition is obtained under sufficient regularity conditions on the domain , the coefficient and the forcing . Comparing to previous work on sparse tensor FEs for locally periodic problems such as [21] where the periodic unit cell has size 1, in this paper, we show that although the cube has size , and the regularity norm of grows with , the FE rate of convergence for is independent of ; it only depends on the mesh size.
Let be a polygonal domain in . We partition into hierarchical families of regular simplices. First the family is obtained by dividing into triangular simplices of mesh size . For , the family of simplices is obtained by dividing each simplex in into 4 congruent triangles when and 8 tetrahedra when . The mesh size of simplices in is . Similarly, we divide the cube into families of simplices of mesh size (which does not depend on ). We define the following spaces:
We then have the following approximation
where the constant in the last estimate does not depend on (see, e.g., [12] or [7]). As , we employ tensor product FEs to approximate .
4.1 Full tensor product FE approximation
We consider the full tensor product FE space . We define the FE space . We consider the full tensor product FE problem: Find such that
(4.1) |
We then have the following approximation.
Lemma 4.1
There is a positive constant which is independent of such that for almost all , the solution of the full tensor product approximating problem (4.1) satisfies
.
Proof The proof of this lemma is straightforward. We have
. From (2.1), we have
From this we get the conclusion.
To quantify the error of the approximate problem (4.1), we define the following regularity space. Let be the space . We define the semi norm
We then have the following approximating properties.
Lemma 4.2
There is a positive constant independent of such that for all
The proof of this result is standard (see, e.g., [9, 21]). The fact that the constant in the lemma is independent of is because we can choose a constant independent of such that
Lemma 4.3
Assume that is a convex domain or a domain of the class, and , and . Then and . Further, there is a positive constant independent of such that
We prove this lemma in Apprendix B. From Lemmas 4.1, 4.2 and 4.3, we have the following error estimate for the full tensor product FE approximating problem (4.1).
Proposition 4.4
Remark 4.5
The dimension of the full tensor product FE space is .
4.2 Sparse tensor product FE approximation
We develop in this section the sparse tensor product FE approximation which requires a far less number of degrees of freedom to achieve a prescribed level of accuracy. To this end, we define the orthogonal projection
with respect to the norm of and respectively. We define the detail spaces
with the convention that and . We note that
so
We define the sparse tensor product FE space as
Let . We consider the sparse tensor product FE problem: Find such that
(4.2) |
An identical proof to that of Lemma 4.1 shows that
Lemma 4.6
There is a positive constant which is independent of such that for almost all , the solution of the sparse tensor product FE approximating problem (4.2) satisfies
.
We define the regularity space as the space of functions such that for all with and ,
In other words, . We define the semi norm
We have the following approximating result.
Lemma 4.7
There is a positive constant independent of such that for all
As for the proof of Lemma 4.2, the proof of this lemma is standard (see, e.g., [9, 21]). We then have the following results on the regularity of the solution of problem (3.4).
Lemma 4.8
Assume that is a convex domain or belongs to the class, , , and . Then and . There is a positive constant independent of and such that
We prove this lemma in Appendix B. From Lemmas 4.6, 4.7 and 4.8, we have the following error etimate.
Proposition 4.9
Remark 4.10
The dimension of the sparse tensor product FE space is which is, apart from the multiplying factor , equal to the dimension of the FE space for solving one truncated cell problem in the cube .
Remark 4.11
We note that tensor product FEs as considered above work equally in the case where the domain is not a polygon. For example, when is a smooth convex domain, to discretize , we consider a polygon inscribed inside whose boundary edges (faces) are of the size . For constructing the sparse tensor product FEs to approximate , we consider a polygon that contains . The sparse tensor product FE spaces for approximating is the restriction of those for approximating functions in to . We refer to [20] and [30] for details.
Alternatively, we can use parametric FEs as considered in [18].
Remark 4.12
Brown and Hoang [8] develop an algorithm using multilevels of FE resolution and of numbers of Monte Carlo approximation samples at different macroscopic points to compute the expectation of the effective coefficient on the truncated domain to approximate the homogenized coefficient . The algorithm needs an essentially optimal number of degrees of freedom for approximating the homogenized coefficients at a dense grid of macroscopic points .
5 Numerical corrector
We use the FE solutions of problem (3.4) developed in the previous sections to construct a numerical corrector for the solution of the stochastic two-scale problem (2.2). To derive a numerical corrector for the solution of the two-scale problem (2.2), we assume the following corrector result.
(5.1) |
Remark 5.1
Jikov et al. [23] prove that when the coefficient does not depend on the slow variable, i.e. , then if
almost surely, which implies (5.1). Examining the proof [23], we find that this result holds under the weaker condition that . We do not find a similar result in the literature for the case where the coefficient depends also on the slow variable , i.e. . However, for quasi-periodic problems, assuming boundedness for the solution of the cell problems, we can derive this corrector result for the case where depends on the slow variable, following the standard procedure for the periodic case ([4], [23]).
From (3.1), we have
Thus we can write (5.1) as
(5.2) |
We use the FE approximations for and in the previous section to construct a numerical corrector in this section. We first note the following convergence result.
Proof We consider the expression
From ergodicity property and (3.1), we have almost surely
Further
We find the limit of
when . From (3.2),
We now show that
almost surely. From the ergodicity property and equation (3.1), we have
We consider
From (3.7),
Due to ergodicity, we have
so almost surely
is bounded. Thus
Therefore
Thus
almost surely. From (2.1), we have
From now on, we denote the FE solution of both the full tensor product FE and sparse tensor product FE approximating problems (4.1) and (4.2) by and . We will use these together with (5.2) to construct a numerical corrector for . However, although approximates in , in general, does not approximate in . We thus define the following map and use it to construct the numerical corrector. For , we denote the cube by and the cube by . Let be the set of all such that . For , we define
if . The function is understood as if . We then have the following result.
Lemma 5.3
For ,
where .
Proof We have
Making the change of variable , we get the conclusion.
For and , we define the function by
if . We have the following result.
Lemma 5.4
For all we have
Proof For all , we have
Thus
From Lemma 5.3, using ergodicity
(note that and are understood as when in the definition of the operator .
Next we show the following estimate
Lemma 5.5
Assume that . Then
Proof Let be the set of the index such that . We then have
We note that
We have
due to (A.3). Thus
As is uniformly bounded with respect to , we now show that
As , it is sufficient to to show that for ,
The proof is similar to that of Lemma 5.5 in [19]. We include the proof here for completeness. We have
Let be the neighbourhood of . We have that . Thus
as . We further have
We then get the conclusion.
We then have the following numerical corrector result.
Theorem 5.6
Proof We note that
From Lemma 5.4, we have
From Proposition 4.4, Proposition 4.9, equation (5.2), Lemma 5.2, Lemma 5.5, we get the conclusion.
Remark 5.7
If the hypothesis of Lemmas 4.3 and 4.8 does not hold, i.e. the regularity requirements on for the convergence rate of the full and sparse tensor product FE approximation do not hold, then we still have
albeit an explicit convergence rate in terms of the mesh size is not available (here we denote the numerical solution of both the full and sparse tensor product FE approximations as and ). The numerical corrector result in Theorem 5.6 still holds but the constant now depends on .
Remark 5.8
For random homogenization, there are limited results on the homogenization rate of convergence (see, e.g., Yurinskii [32], Gloria and Otto [16], Armstrong et al. [2]). However, assume that we have a homogenization convergence rate
for , then with the convergence rate (2.8) and Proposition 3.7, we have
for the solution of the full tensor product FE approximation problem (4.1); and
for the solution of the sparse tensor product FE approximation problem (4.2).
6 Numerical experiments
We first consider a quasi-periodic problem on the one dimensional domain . Let the probability space be the square in with the Lebesgue probability measure. Let be the vector . The dynamical system is defined as
We consider the coefficient
for . We note that for a differentiable function belonging to the domain of ,
The cell problem (2.3) is of the form
We solve this cell problem numerically by FEs with a high accuracy level to compute the homogenized coefficient from (2.4). We find that approximately
We choose the function in (2.2) such that the homogenized problem (2.5) has the exact solution . Problem (3.4) is solved by sparse tensor product FEs. We record in Table 1 the numerical errors for computed by using a highly accurate Gauss-Legendre quadrature rule in .
mesh level | error for | error for | error for | error for |
---|---|---|---|---|
1 | 0.08643387 | 0.08642242 | 0.08640925 | 0.08639875 |
2 | 0.02175469 | 0.02168175 | 0.02163293 | 0.02160448 |
3 | 0.00547390 | 0.00541613 | 0.00535287 | 0.00530344 |
4 | 0.00153847 | 0.00147204 | 0.00139897 | 0.00134186 |
5 | 0.00056918 | 0.00050014 | 0.00042423 | 0.00036492 |
6 | 0.00032794 | 0.00025823 | 0.00018158 | 0.00012169 |
7 | 0.00026771 | 0.00019782 | 0.00012098 | 0.00006095 |
8 | 0.00025265 | 0.00018272 | 0.00010584 | 0.00004577 |
9 | 0.00024889 | 0.00017895 | 0.00010205 | 0.00004198 |
The numerical results show that for a fixed , when we reduce the mesh size, the error reduces as the theoretical error estimate for the sparse tensor product FE approximations at first until the error due to the truncated cube becomes more significant than the FE error. However, when we increase , the error for smaller mesh sizes, where the FE error is less significant, decreases. This shows that the approximation gets more accurate when we enlarge the cube .
We then consider a two-scale problem in the two dimensional domain . Let be the matrix
We consider the dynamical system such as
The coefficient for and is
For a function belonging to the domain of , we have
For the cell problems (2.3), we solve the problems
, and
, numerically by FEs. We find that the homogenized coefficient is approximately
We then choose the function so that the homogenized equation (2.5) has the exact solution
for . We have the following numerical result.
mesh level | error for | error for | error for |
---|---|---|---|
1 | 0.00600307 | 0.00600258 | 0.00600243 |
2 | 0.00143868 | 0.00143325 | 0.00143156 |
3 | 0.00035356 | 0.00035110 | 0.00035004 |
4 | 0.00008871 | 0.00008734 | 0.00008708 |
5 | 0.00002200 | 0.00002191 | 0.00002175 |
In the chosen range of the mesh sizes we experiment, the sparse tensor product FE approximation on the truncated domain converges to the exact solution . The FE error dominates the error due to the truncated cube so that the total error behaves as the theoretical error proved above for the sparse tensor product FE approximations. For the same FE mesh size, the total error is lightly reduced when the size of the cube increases.
The sparse tensor product FE convergence rate established in the paper holds when the coefficient is sufficiently smooth so that the solution of the truncated stochastic two-scale homogenized equation is sufficiently regular. However, when is not continuous, the sparse tensor product FEs may still work when the FE mesh fits into the surface of discontinuity. Now we consider the checker board problem where the two-scale coefficient is discontinuous. The problem is studied in details in [23] where the homogenized coefficient can be computed explicitly in two dimensions. The two dimensional space is split into squares of size 1 whose centres are of integer components. Let be the probability space of functions that takes values or in each square with probability . Let be the probability measure on . This probability space is ergodic with respect to the integer shift. We then define the probability space to be the one of all piecewise constant functions obtained from those in by a shift with a vector belonging to the unit cube , i.e.
The probability space is associated with the product space with the product probability measure. It is invariant and ergodic with respect to the shift operator. For , we define the coefficient
The coefficient is of the checker board type with value or in each square. The homogenized coefficient is . We choose so that the homogenized equation has exact solution for . The average over the probability space involving taking the integral with respect to the shift and average over all the realizations of in . We solve equation (3.4) with and by the sparse tensor product FEs. Integral over the unit cube is approximated by the Newton-Cotes rule with 5 quadrature points on each direction. When , average over is computed exactly. When and , average over is approximated with the Monte Carlo procedure with 1000 samples. Table 3 presents the error for . The results clearly indicates that the approximation gets better with larger values of . The reduction rate of the error gets worse with smaller mesh sizes; this shows the more prominent effect of the domain truncating error when the FE mesh size gets smaller.
mesh level | error for | error for | error for |
---|---|---|---|
2 | 0.0632550 | 0.003578 | 0.003514 |
3 | 0.0384572 | 0.001048 | 0.000974 |
4 | 0.0274870 | 0.000372 | 0.000296 |
Appendix A
We show Proposition 2.1. Let be the solution of the cell problem
(A.1) |
with the Dirichlet boundary condition when ; is the th unit vector in the standard basis of . Following [6], we let . Then is the solution of the problem
with the Dirichlet boundary condition on . By the homogenization theory, almost surely, in when where is the solution of the homogenized equation
(A.2) |
with the Dirichlet boundary condition on ; is the homogenized coefficient in (2.4). Almost surely, we have
when . As the solution , and
we have that
when . We now show that almost surely the convergence is uniform with respect to . First we show that is uniformly continuous in . From (2.3), for , we have
and
Thus
From (2.3), we have that is uniformly bounded in with respect to . Thus
(A.3) |
From (2.4)
Thus
Next we show that is also uniformly Lipschitz with respect to and . From (2.6), we have
so
(A.4) |
From (2.6), for we have
(A.5) |
Therefore
(A.6) |
From (2.7), we have
From (A.6) and the fact that is uniformly bounded in , we have that is uniformly Lipschitz in . For each , we consider the cubes () of size with vertices having coordinates of the form for that intersects . In each cube for we choose a point . Then there is a set with such that for all when for all . For each , and . For each , there is a constant such that when
for all . Thus for , for all for all , when
Let . For , .
Appendix B
Proof of Lemma 4.8. We show Lemma 4.8 (which implies Lemma 4.3). From (3.5), we deduce that
where the constant only depends on the convex domain and the norm of (see Grisvard [17] Theorems 3.1.3.1 and 3.2.1.2).
We note that
where is the solution of the cell problem (A.1). To show that , it is sufficient to show that
for all . From (A.1)
From the proof of Lemma 3.1.3.2 of [17], there is a constant that only depends on the Lipschitz norm of the coefficient so that the following inequality on the semi norm holds:
Indeed, Grisvard [17] proves this estimate for the full norm so the constant depends on the diameter of the domain. However, from the proof of Theorem 3.1.2.1 of [17], we have that for the semi norm only, this constant does not depend on the diameter of the domain (the only part of the proof in [17] where this constant depends on the domain is when using the Poincare inequality to bound the norm of the solution). Thus using (A.4), we have
(B.1) |
For from (A.5), we have
for a constant independent of and . We thus have for a constant independent of and .
Acknowledgment VHH and WCT gratefully acknowledge the financial support of the Singapore Ministry of Education Academic Research Fund Tier 2 grant MOE2017-T2-2-144. CHP is supported by a Graduate Scholarship of Nanyang Technological University.
References
- [1] G. Allaire. Homogenization and two-scale convergence. SIAM J. Math. Anal., 23(6):1482–1518, 1992.
- [2] Scott Armstrong, Tuomo Kuusi, and Jean-Christophe Mourrat. Quantitative stochastic homogenization and large-scale regularity, volume 352 of Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Cham, 2019.
- [3] A. Yu. Beliaev and S. M. Kozlov. Darcy equation for random porous media. Comm. Pure Appl. Math., 49(1):1–34, 1996.
- [4] Alain Bensoussan, Jacques-Louis Lions, and George Papanicolaou. Asymptotic analysis for periodic structures, volume 5 of Studies in Mathematics and its Applications. North-Holland Publishing Co., Amsterdam, 1978.
- [5] Alain Bourgeat, Andro Mikelic, and Steve Wright. Stochastic two-scale convergence in the mean and applications. Journal für die reine und angewandte Mathematik, 456:19–52, 1994.
- [6] Alain Bourgeat and Andrey Piatnitski. Approximations of effective coefficients in stochastic homogenization. Ann. Inst. H. Poincaré Probab. Statist., 40(2):153–165, 2004.
- [7] S.C. Brenner and R. Scott. The Mathematical Theory of Finite Element Methods. Texts in Applied Mathematics. Springer, 2008.
- [8] Donald L. Brown and Viet Ha Hoang. A hierarchical finite element Monte Carlo method for stochastic two-scale elliptic equations. J. Comput. Appl. Math., 323:16–35, 2017.
- [9] Hans-Joachim Bungartz and Michael Griebel. Sparse grids. Acta Numer., 13:147–269, 2004.
- [10] Van Tiep Chu and Viet Ha Hoang. High dimensional finite elements for multiscale Maxwell equations. IMA J. Numer. Anal., 38:227–270, 2018.
- [11] Van Tiep Chu and Viet Ha Hoang. High dimensional finite elements for two-scale Maxwell wave equations. J. Comput. Appl. Math., 375:112756, 32, 2020.
- [12] Philippe G. Ciarlet. The finite element method for elliptic problems, volume 40 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2002. Reprint of the 1978 original [North-Holland, Amsterdam; MR0520174 (58 #25001)].
- [13] Y. Efendiev and A. Pankov. Numerical homogenization and correctors for nonlinear elliptic equations. SIAM J. Appl. Math., 65(1):43–68, 2004.
- [14] Yalchin Efendiev and Thomas Y. Hou. Multiscale Finite Element Methods: Theory and Applications. Surveys and Tutorials in the Applied Mathematical Sciences. Springer, 2009.
- [15] Dietmar Gallistl and Daniel Peterseim. Numerical stochastic homogenization by quasilocal effective diffusion tensors. Commun. Math. Sci., 17(3):637–651, 2019.
- [16] Antoine Gloria and Felix Otto. Quantitative results on the corrector equation in stochastic homogenization. J. Eur. Math. Soc. (JEMS), 19(11):3489–3548, 2017.
- [17] Pierre Grisvard. Elliptic problems in nonsmooth domains, volume 69 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2011.
- [18] Helmut Harbrecht and Christoph Schwab. Sparse tensor finite elements for elliptic multiple scale problems. Computer Methods in Applied Mechanics and Engineering, 200(45-46):3100 – 3110, 2011.
- [19] V. H. Hoang and Ch. Schwab. Analytic regularity and polynomial approximation of stochastic, parametric elliptic multiscale PDEs. Analysis and Applications, 11(01):1350001, 2013.
- [20] Viet Ha Hoang. Sparse tensor finite element method for periodic multiscale nonlinear monotone problems. Multiscale Modeling & Simulation, 7(3):1042–1072, 2008.
- [21] Viet Ha Hoang and Christoph Schwab. High-dimensional finite elements for elliptic problems with multiple scales. Multiscale Model. Simul., 3(1):168–194, 2004/05.
- [22] Thomas Y. Hou and Xiao-Hui Wu. A multiscale finite element method for elliptic problems in composite materials and porous media. Journal of Computational Physics, 134(1):169 – 189, 1997.
- [23] V. V. Jikov, S. M. Kozlov, and O. A. Oleĭnik. Homogenization of differential operators and integral functionals. Springer-Verlag, Berlin, 1994. Translated from the Russian by G. A. Yosifian [G. A. Iosifyan].
- [24] Axel Målqvist and Daniel Peterseim. Localization of elliptic multiscale problems. Math. Comp., 83(290):2583–2603, 2014.
- [25] Gabriel Nguetseng. A general convergence result for a functional related to the theory of homogenization. SIAM J. Math. Anal., 20(3):608–623, 1989.
- [26] Ch. Schwab. High dimensional finite elements for elliptic problems with multiple scales and stochastic data. In Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002), pages 727–734. Higher Ed. Press, Beijing, 2002.
- [27] Wee Chin Tan and Viet Ha Hoang. High dimensional finite element method for multiscale nonlinear monotone parabolic equations. J. Comput. Appl. Math., 345:471–500, 2019.
- [28] Wee Chin Tan and Viet Ha Hoang. Sparse tensor product finite element for nonlinear multicale varitional inequalities of monotone type. IMA J. Numer. Anal., 2020 https://doi.org/10.1093/imanum/drz011.
- [29] Bingxing Xia and Viet Ha Hoang. High dimensional finite elements for multiscale wave equations. Multiscale Modeling & Simulation, 12(4):1622–1666, 2014.
- [30] Bingxing Xia and Viet Ha Hoang. High-dimensional finite element method for multiscale linear elasticity. IMA Journal of Numerical Analysis, 35(3):1277–1314, 2015.
- [31] Bingxing Xia and Viet Ha Hoang. Sparse tensor finite elements for elastic wave equation with multiple scales. Journal of Computational and Applied Mathematics, 282:179 – 214, 2015.
- [32] V. V. Yurinskiĭ. Averaging of symmetric diffusion in a random medium. Sibirsk. Mat. Zh., 27(4):167–180, 215, 1986.