Finite Element Approximation of Elliptic Homogenization Problems in Nondivergence-Form
Yves Capdeboscq, Timo Sprekeler, Endre S\"uli

TL;DR
This paper develops and analyzes a finite element numerical scheme for solving elliptic homogenization problems in nondivergence form, providing error estimates and demonstrating effectiveness through numerical experiments.
Contribution
It introduces a new finite element approach for nondivergence-form homogenization problems with rigorous analysis and numerical validation.
Findings
The scheme achieves accurate approximation of solutions.
Numerical experiments confirm the scheme's effectiveness.
Error estimates are established for the proposed method.
Abstract
We use uniform estimates to obtain corrector results for periodic homogenization problems of the form subject to a homogeneous Dirichlet boundary condition. We propose and rigorously analyze a numerical scheme based on finite element approximations for such nondivergence-form homogenization problems. The second part of the paper focuses on the approximation of the corrector and numerical homogenization for the case of nonuniformly oscillating coefficients. Numerical experiments demonstrate the performance of the scheme.
Peer 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.
Finite Element Approximation of Elliptic Homogenization Problems in Nondivergence-Form
Yves Capdeboscq*∗*
Université de Paris, CNRS, Sorbonne Université, Laboratoire Jacques-Louis Lions UMR7598, Paris, France
,
Timo Sprekeler*†*
University of Oxford, Mathematical Institute, Woodstock Road, Oxford OX2 6GG, UK.
and
Endre Süli*‡*
University of Oxford, Mathematical Institute, Woodstock Road, Oxford OX2 6GG, UK.
(Date: May 28, 2019)
Abstract.
We use uniform estimates to obtain corrector results for periodic homogenization problems of the form subject to a homogeneous Dirichlet boundary condition. We propose and rigorously analyze a numerical scheme based on finite element approximations for such nondivergence-form homogenization problems. The second part of the paper focuses on the approximation of the corrector and numerical homogenization for the case of nonuniformly oscillating coefficients. Numerical experiments demonstrate the performance of the scheme.
Key words and phrases:
Homogenization, nondivergence-form elliptic PDE, finite element methods
2010 Mathematics Subject Classification:
35B27, 35J15, 65N12, 65N30
Contents
1. Introduction
In this work we consider second-order elliptic equations of nondivergence structure, involving rapidly oscillating coefficients, of the form
[TABLE]
subject to the homogeneous Dirichlet boundary condition
[TABLE]
Here we assume that is a sufficiently regular bounded domain, is small, and that is a symmetric, uniformly elliptic and -periodic matrix-valued function such that
[TABLE]
where denotes the unit cell, see (2.1). The main goal of this paper is to propose and analyze a numerical homogenization scheme for (1.1), (1.2) that is based on finite element approximations.
The theory of periodic homogenization is concerned with the limiting behavior of the solutions as the oscillation parameter tends to zero. For the problem (1.1), (1.2) under consideration a classical homogenization theorem (see [6, Sec. 3, Theorem 5.2]) states that the solution sequence converges in an appropriate Sobolev space to the solution to the problem
[TABLE]
Here is the constant matrix given by
[TABLE]
and is the invariant measure, i.e. the solution to the problem
[TABLE]
see Section 2 for further details. The task of numerical homogenization is the numerical approximation of the matrix and the solution to the homogenized problem (1.3). As it turns out, provides a good approximation to in , and by adding corrector terms it is possible to obtain an -norm approximation. Note that the approximation of (1.1), (1.2) by a standard -conforming finite element method does not yield error bounds independent of , since for one has that
[TABLE]
The motivation for investigating second-order elliptic problems in nondivergence-form comes from physics, engineering, as well as mathematical areas such as stochastic analysis. A notable example of a nonlinear PDE of nondivergence structure is the Hamilton–Jacobi–Bellman equation, which arises in stochastic control theory. The asymptotic behavior of PDEs with rapidly oscillating coefficients is also of importance when micro-inhomogeneous media are investigated.
Over the past decades significant work has been done on periodic homogenization of elliptic problems in divergence-form; numerical homogenization for nondivergence-form problems is however less developed.
The theory of homogenization of divergence-form problems such as
[TABLE]
with periodic and sufficiently regular and is extensively covered in the books [1, 6, 9, 20]. For divergence-form problems, various multiscale finite element methods (MsFEM) have been developed, which have the advantage over classical finite element methods of providing accurate approximations for very small values of even for moderate values of the grid size. The book [10] by Efendiev and Hou contains a detailed overview of these methods.
It is important to note that although, if is sufficiently smooth, equation (1.1) can be rewritten in divergence-form,
[TABLE]
this equation does not fit into the framework of divergence-form homogenization problems such as (1.5), because of the term in front of the first-order term in (1.6).
For the theory of homogenization of nondivergence-form problems such as (1.1) we refer to the monograph [6] by Bensoussan, Lions and Papanicolaou, to the paper [2] by Avellaneda and Lin, and the references therein. In [5], Bensoussan, Boccardo and Murat study the more general problem involving a Hamiltonian with quadratic growth. Numerical homogenization for nondivergence-form problems using finite difference schemes has been considered in [11] by Froese and Oberman.
The first step in the development of the proposed numerical homogenization scheme is the construction of a finite element method to obtain approximations to the invariant measure with optimal order convergence rate
[TABLE]
where denotes the finite-dimensional subspace of consisting of continuous -periodic piecewise linear functions on the triangulation with zero mean over ; see Theorem 3.1.
Throughout this work, we use the notation for to denote that for some constant that does not depend on and the discretization parameters.
The second step is to obtain approximations to the constant matrix ; see Lemma 3.1. To this end, the integrand in (1.4) is replaced by its continuous piecewise linear interpolant and the invariant measure is replaced by the approximation , i.e.,
[TABLE]
which can be computed exactly using an appropriate quadrature rule.
The third step is to perform an -conforming () finite element approximation for the problem
[TABLE]
on a family of triangulations of the computational domain , parametrized by a discretization parameter , measuring the granularity of the triangulation, to obtain with
[TABLE]
where the constant is independent of ; see Lemma 3.3. Note that for the sake of approximating , an -conforming finite element method is sufficient.
The approximation obtained by this procedure approximates , i.e., the solution to (1.3), with convergence rate
[TABLE]
which can be improved to for more regular ; see Theorem 3.2, Theorem 3.3 and Remark 3.3.
Concerning the approximation of , i.e., the solution to (1.1), (1.2), we show in Section 2 that under certain assumptions on the domain and the right-hand side, one has that
[TABLE]
where the corrector functions , , are defined as the solutions to
[TABLE]
This provides us with the estimate
[TABLE]
which shows that is a good approximation to for small , and we show in Sections 3.2 and 3.3 how the above estimate can be used to obtain approximations to . Note that in order to approximate in the -norm, it is sufficient to approximate in the -norm. However, for an approximation of based on the above corrector estimate, we need to approximate in the -norm.
In Section 3.4, we extend our results to the case of nonuniformly oscillating coefficients, i.e., to problems of the form
[TABLE]
where is a symmetric, uniformly elliptic matrix-valued function that is -periodic in for fixed , and such that
[TABLE]
We prove the corrector estimate
[TABLE]
where is the solution to the homogenized problem corresponding to (1.7) and are certain corrector functions. We then discuss the numerical approximation of based on this corrector estimate, see Section 3.4.
2. Homogenization of Elliptic Problems in Nondivergence-Form
2.1. Framework
We denote the unit cell in by
[TABLE]
and consider a symmetric matrix-valued function
[TABLE]
with the properties
[TABLE]
By Sobolev embedding, we then have that
[TABLE]
For , we are concerned with the problem
[TABLE]
where the triple satisfies one of the following sets of assumptions.
Definition 2.1** (Sets of assumptions , ).**
For and , we define the set of assumptions as
[TABLE]
and the set of assumptions as
[TABLE]
Remark 2.1**.**
For , the Cordes condition, i.e., that there exists a such that
[TABLE]
is a consequence of the uniform ellipticity condition. Indeed, for satisfying (2.1), we have that
[TABLE]
with . Therefore, when , the set can be simplified to
[TABLE]
The following theorem asserts well-posedness of the problem (2.2); see [12, Theorem 9.15] and [19, Theorem 3].
Theorem 2.1** (Existence and uniqueness of strong solutions).**
Assume either that for some , or that and . Then, for any , the problem (2.2) admits a unique solution .
2.2. Transformation into Divergence-Form
We recall a well-known procedure to transform the problem (2.2) into divergence-form; see [2, 6]. We use the notation
[TABLE]
Let us start by introducing the notion of invariant measure; see [6].
Lemma 2.1** (Invariant measure and solvability condition).**
Let satisfy (2.1). Then, there exists a unique solution to the problem
[TABLE]
The function is called the invariant measure. There holds , see [7, 8], and there exist constants such that
[TABLE]
Moreover, for a -periodic function , the (adjoint) problem
[TABLE]
admits a solution if and only if
[TABLE]
With the invariant measure at hand, we can easily convert the problem into divergence-form as follows. We define a matrix-valued function by
[TABLE]
with denoting the solution to
[TABLE]
for . Since and , by elliptic regularity one has that for any . Hence, we have
[TABLE]
Further, we observe that is skew-symmetric, -periodic with zero mean over , and that
[TABLE]
Now we let
[TABLE]
Then, since
[TABLE]
and using the fact that is skew-symmetric, we obtain
[TABLE]
i.e., we have converted (2.2) into divergence-form
[TABLE]
and it is straightforward to check that is -periodic, Hölder continuous on and uniformly elliptic.
2.3. Uniform Estimates and Homogenization Theorem
The transformation described in the previous section can be used to obtain uniform a priori estimates for the solution of (2.2), which are crucial in deriving homogenization results.
Theorem 2.2** (Uniform a priori estimates).**
Assume either that for some , or that and . Then, for , the solution to (2.2), whose existence and uniqueness are guaranteed by Theorem 2.1, satisfies
[TABLE]
with the constant absorbed into the notation being independent of .
Proof.
Let us first assume that for some . We showed in the previous section that we can transform problem (2.2) into the divergence-form problem (2.6), where is a -periodic, Hölder continuous, and uniformly elliptic matrix-valued function satisfying
[TABLE]
Therefore, we can apply [3, Theorem D] to problem (2.6) to obtain
[TABLE]
with constants independent of , where we have used the property (2.4) of the invariant measure in the second inequality.
Let us now assume that . Noting that (2.3) implies the Cordes condition for with the same constant for any , the proof of [19, Theorem 3] yields the estimate
[TABLE]
where is the function given by
[TABLE]
We observe that by (2.1), there exist constants such that
[TABLE]
Therefore, we obtain from (2.7) the bound
[TABLE]
with a constant that is independent of . ∎
This leads to a simple proof of the homogenization theorem for problem (2.2), using the compactness of the embedding and the fact that we can rewrite the problem as (2.6).
Theorem 2.3** (Homogenization theorem for nondivergence-form problems).**
Assume either that for some , or that and . Then the solution to (2.2) converges weakly in to the solution of the homogenized problem
[TABLE]
with being the constant matrix whose entries are given by
[TABLE]
where is the invariant measure, as defined in Lemma 2.1.
Proof.
By Theorem 2.2, the reflexivity of , the compactness of the embedding , and the properties of the trace operator, there exists a such that (for a subsequence, not indicated,)
[TABLE]
We can transform (2.2) as in Section 2.2 into the divergence-form problem (2.6) with
[TABLE]
being -periodic, Hölder continuous and uniformly elliptic on . Recalling that is of mean zero over , we have
[TABLE]
Since we have that
[TABLE]
we can pass to the limit in the weak formulation of (2.6) to obtain that solves (2.8). We conclude the proof by noting that (2.8) admits a unique strong solution in . ∎
2.4. Correctors
We show that by adding corrector terms to the solution of the homogenized problem, we obtain a convergence result.
Theorem 2.4** (Corrector estimate I).**
Assume either that for some , or that and . Let and assume that
[TABLE]
Introducing the corrector function , , as the solution to
[TABLE]
and a boundary corrector , as the solution to
[TABLE]
the following bound holds:
[TABLE]
Proof.
First, we note that since , we have for any by elliptic regularity theory. A direct computation shows that the function
[TABLE]
solves the problem
[TABLE]
where
[TABLE]
Note that since , one has that
[TABLE]
with the constant being independent of . We then have that satisfies
[TABLE]
Therefore, by the definition of the boundary corrector,
[TABLE]
We conclude using the estimate from Theorem 2.2 that
[TABLE]
and (2.10) holds. ∎
The following theorem shows that if , then we can absorb the term involving the boundary corrector into the right-hand side at the cost of powers of .
Theorem 2.5** (Corrector estimate II).**
Assume either that for some , or that and . Let and assume that
[TABLE]
Then,
[TABLE]
Proof.
Let be a cut-off function with ,
[TABLE]
and let satisfy
[TABLE]
We introduce the function
[TABLE]
and verify that
[TABLE]
where and are given by
[TABLE]
Therefore, satisfies
[TABLE]
Since by assumption, the right-hand side belongs to , and we have by Theorem 2.2 that
[TABLE]
We look at the terms on the right-hand side separately and start with . Using the boundedness of and the fact that , we have
[TABLE]
For , we obtain similarly that
[TABLE]
Finally, for , we have that
[TABLE]
Altogether, we have shown that
[TABLE]
By direct computation, using the bounds
[TABLE]
we can show that
[TABLE]
Therefore, using the triangle inequality, we obtain that
[TABLE]
We conclude that
[TABLE]
The claim now follows from (2.10). ∎
Let us remark that for , i.e., assumption (2.11) is a consequence of ; in particular, for dimensions and , one can replace condition (2.11) by .
Let us recall that is the solution to the elliptic constant-coefficient problem (2.8). For bounded convex polygonal domains (), can be ensured by assuming that satisfies certain compatibility conditions at the corners of the domain. In the case of Poisson’s equation on , a necessary and sufficient condition for is that and at the corners of , see [15]. We note that these conditions are satisfied for functions such that , see [13].
3. The Numerical Scheme
3.1. Numerical Homogenization Scheme
The first step is to approximate the invariant measure.
3.1.1. Approximation of
For the approximation of the invariant measure , we consider a shape-regular triangulation of into triangles with longest edge and let
[TABLE]
be the finite-dimensional subspace of consisting of continuous -periodic piecewise linear functions on the triangulation with zero mean over . We assume that
[TABLE]
Then we have the following approximation result for .
Theorem 3.1** (Approximation of the invariant measure).**
Let satisfy (2.1). Then, for sufficiently small, there exists a unique such that
[TABLE]
and writing
[TABLE]
we have that
[TABLE]
where is the invariant measure, as defined in Lemma 2.1.
Remark 3.1**.**
In particular, since
[TABLE]
we have that
[TABLE]
as tends to zero.
Proof of Theorem 3.1.
We observe that , where is the unique solution to the problem
[TABLE]
i.e.,
[TABLE]
where
[TABLE]
We further observe that (3.1) is equivalent to
[TABLE]
We start by showing boundedness of and a Gårding-type inequality. We claim that there exist constants such that
[TABLE]
and
[TABLE]
Let us first show (3.3). For , by Hölder’s inequality and Sobolev embeddings (note that, according to (2.1), ), we have that
[TABLE]
Using the fact that since , we obtain the bound
[TABLE]
for any , i.e. (3.3) holds.
Let us now show the estimate (3.4). For , by ellipticity and Hölder’s inequality, we have
[TABLE]
For the second term we use the Gagliardo–Nirenberg inequality and Young’s inequality to obtain
[TABLE]
Therefore, we have
[TABLE]
for any , i.e., (3.4) holds with
[TABLE]
We use Schatz’s method to derive an a priori estimate; see [18].
From our Gårding-type inequality (3.4) we see that (note )
[TABLE]
By Galerkin-orthogonality and boundedness, we have for any that
[TABLE]
and taking the infimum over all , we find
[TABLE]
Combining this estimate with (3.5) yields
[TABLE]
Next, we use an Aubin–Nitsche-type duality argument.
Let be the unique solution to
[TABLE]
We note that the solvability condition (2.5) is satisfied:
[TABLE]
We have, using the bounds on the invariant measure (2.4), the weak formulation of (3.7) and the symmetry of , that
[TABLE]
Next, we use Galerkin orthogonality, the boundedness (3.3) and an interpolation inequality to obtain
[TABLE]
where denotes the continuous piecewise linear interpolant of on the triangulation. Finally, by a regularity estimate for and the bounds on the invariant measure (2.4), we arrive at the bound
[TABLE]
which provides us with the estimate
[TABLE]
for some . Combining this with (3.6) we have
[TABLE]
Therefore, for sufficiently small, we arrive at the bounds
[TABLE]
and
[TABLE]
We have thus established the a priori estimate
[TABLE]
which immediately implies existence and uniqueness of solutions to (3.2).
Finally, using that and , we conclude that
[TABLE]
∎
3.1.2. Approximation of
We use this finite element approximation of the invariant measure to obtain an approximation to the constant matrix
[TABLE]
To this end, we first replace the invariant measure by the approximation from Theorem 3.1, and then replace the integrand by its piecewise linear interpolant,
[TABLE]
This integral can be computed exactly using an appropriate quadrature rule. The following lemma gives an error estimate for this approximation.
Lemma 3.1** (Approximation of ).**
Let satisfy (2.1). Further, let be the constant matrix given by Theorem 2.3, let be the approximation to the invariant measure given by Theorem 3.1, and let be the matrix given by
[TABLE]
Then, for sufficiently small, is elliptic and
[TABLE]
Proof.
Fix . Using the definition of , i.e.,
[TABLE]
we obtain the estimate
[TABLE]
For the first term, we have
[TABLE]
For the second term, let us first note that using with and Sobolev embeddings, we have
[TABLE]
Therefore, using a standard interpolation error bound, we obtain
[TABLE]
By Theorem 3.1, for sufficiently small, we have that
[TABLE]
Finally, we note that this implies that for sufficiently small, is elliptic. ∎
3.1.3. Approximation of
For the approximation of the solution to the homogenized problem, we use the following comparison result for the error committed when replacing by .
Lemma 3.2** (Comparison result).**
Assume either that or that . Let be the approximation to as in Lemma 3.1. Then, for sufficiently small, we have that
[TABLE]
where is the solution to the problem
[TABLE]
and is the solution to the homogenized problem (2.8).
Proof.
We let and note that is the unique solution to the boundary-value problem
[TABLE]
We recall that is an elliptic constant matrix. For sufficiently small, by an a priori estimate, the Cauchy–Schwarz inequality and Lemma 3.1,
[TABLE]
Finally, we show that for sufficiently small, we have
[TABLE]
with the constant being independent of . This can be seen by rewriting (3.8) as
[TABLE]
Then, again by an a priori estimate and Lemma 3.1,
[TABLE]
with constants independent of , i.e., for sufficiently small, (3.9) holds with the constant being independent of . ∎
Finally, we can use an -conforming finite element approximation to the solution of (3.8), satisfying the error bound
[TABLE]
with constants independent of . By the triangle inequality and the results obtained in this section, we have the following approximation result for .
Theorem 3.2** ( approximation of ).**
Assume either that , or that . Then, the approximation obtained by the procedure described above satisfies
[TABLE]
Let us now assume either that or that . Further, assume that for sufficiently small, we have that with
[TABLE]
where the constant is independent of . The following lemma provides two situations where this is satisfied.
Lemma 3.3**.**
Let be such that
* with , or*
* with being a polygon and .*
Then, for sufficiently small, (3.11) holds.
Before we prove Lemma 3.3, we need the following result on the regularity of solutions to Poisson’s problem on convex polygons, see also [13, 15, 16, 17].
Lemma 3.4**.**
Let be a convex polygonal domain and . Then the solution to the problem
[TABLE]
satisfies the bound
[TABLE]
Proof.
First, note that since is a convex polygonal domain, we have with , see [13]. Since , there exists a sequence of smooth functions with compact support such that in . Let be the sequence of solutions in to in , and note that since the functions satisfy compatibility conditions of any order, see [13, Sec. 5.1]. Again we use the -regularity result for solutions of Poisson’s problem on convex polygons to obtain
[TABLE]
i.e., in .
Next, we shall use the fact that
[TABLE]
see [17]. We apply (3.13) to the difference of two elements of the sequence to find that is a Cauchy sequence in , using that in . Thus, in and passing to the limit in (3.13) applied to the functions yields
[TABLE]
Since , we conclude the bound (3.12). ∎
Remark 3.2**.**
The assumption in Lemma 3.4 can be weakened provided satisfies certain compatibility conditions, see [13, Theorem 5.1.2.4].
Now we are in a position to prove Lemma 3.3, using standard elliptic regularity theory, Lemma 3.4, and a scaling argument.
Proof of Lemma 3.3.
We start with the case . To this end, let with . Then, by elliptic regularity theory, we have . Using elliptic regularity for problem (3.10) yields
[TABLE]
with constants independent of , i.e., for sufficiently small, (3.11) holds with the constant being independent of .
Let us now show the claim for the case . To this end, let with being a polygon and . Since
[TABLE]
is symmetric and elliptic for sufficiently small, there exists an orthogonal matrix with such that
[TABLE]
where are given by
[TABLE]
We note that, by Lemma 3.1, the entries of satisfy , and therefore, for sufficiently small, we have .
The problem (3.8) in the new coordinates reads
[TABLE]
where , , and . Note that is still a bounded convex polygonal domain and that . By the change of variables formula and the orthogonality of ,
[TABLE]
Using Lemma 3.4, we have that, for sufficiently small, the solution to (3.14) satisfies
[TABLE]
with constants independent of . It remains to show the bound
[TABLE]
By the change of variables formula and the orthogonality of , we obtain similarly as before,
[TABLE]
i.e., we have established the bound (3.15). We conclude that, for sufficiently small, we have (3.11), i.e.,
[TABLE]
where the constant is independent of . ∎
Then an -conforming finite element approximation to the solution of (3.8), that satisfies the error bound
[TABLE]
provides by Lemma 3.2 and the triangle inequality an approximation to .
Theorem 3.3** (-norm approximation of ).**
Assume either that or that , and assume (3.11). Then, the approximation obtained by the procedure described above satisfies
[TABLE]
Remark 3.3** (Improvements).**
We note that if we assume that , then we have the following improved results.
Approximation of : In this case, and we have that
[TABLE]
by choosing , and using an interpolation error bound. Therefore, Theorem 3.1 yields
[TABLE]
Approximation of : By an interpolation error bound and the fact that is piecewise linear, one has
[TABLE]
Therefore, the proof of Lemma 3.1 yields
[TABLE]
Approximation of : It follows that the results of Lemma 3.2, Theorem 3.2 and Theorem 3.3 can be improved to second-order convergence in , i.e.,
[TABLE]
for , respectively.
For the approximation of derivatives of of higher than second order, the post-processing method of Babuška in [4] can be used to obtain error bounds in norms involving derivatives of higher order than the energy norm (the norm natural to the problem).
For bounded convex polygonal domains , an -conforming approximation to the solution of (3.8) can be obtained as follows. Assume that so that (3.11) holds. Consider a shape-regular triangulation of into triangles with longest edge , and let
[TABLE]
be an appropriate finite element space. In practice, the Hsieh–Clough–Tocher element and the Argyris element can be used as -conforming elements. Then, for sufficiently small, standard finite element analysis can be used to show that there is a unique function such that
[TABLE]
and that the error bound (3.16) holds.
3.2. Approximation of the Corrector
We now address problem (2.9) and present a method for . To simplify the notation and the arguments, we assume that we know the invariant measure and the matrix exactly instead of working with our approximation .
For a given -periodic right-hand side , we address the problem
[TABLE]
Obtaining an approximation for second-order derivatives via finite elements is not straightforward since the natural solution space is . We present a method of successively approximating higher derivatives.
Let be a -conforming finite element approximation to , i.e.,
[TABLE]
with finite-dimensional, and satisfying the error estimate
[TABLE]
Let and write . Then, using the equation
[TABLE]
we find that weakly, there holds
[TABLE]
Further, we claim that . Indeed, this follows from the regularity and periodicity of and
[TABLE]
Therefore, satisfies
[TABLE]
Now we use our -conforming approximation for for the right-hand side and use a -conforming finite element method for approximating the solution to the following problem:
[TABLE]
where is such that this problem admits a unique solution (such that the solvability condition (2.5) is satisfied). By looking at the problem for , one obtains the comparison result
[TABLE]
Let be a -conforming finite element approximation of (3.18) satisfying
[TABLE]
for some constant . Then, using the triangle inequality, we obtain
[TABLE]
for some constant . Using this procedure for , we eventually obtain approximations to derivatives of order up to two of .
3.3. Approximation of
We assume either that or that . Let , , and assume that
[TABLE]
Then we know that (2.11) is satisfied, and by Theorem 2.5 we have that
[TABLE]
where is the solution to the homogenized problem, and are the corrector functions given as the solutions to (2.9). This result can be used to construct an approximation of , i.e., to the solution of problem (2.2) for small . We note that (3.19) implies that
[TABLE]
This leads to the following approximation result for .
Theorem 3.4** (Approximation of ).**
In the situation described above, let be a family of -conforming approximations for satisfying the error bound
[TABLE]
and for , let be a family of approximations for satisfying the error bound
[TABLE]
Then, by writing
[TABLE]
we have that
[TABLE]
Proof.
We use (3.20) and the triangle inequality to obtain
[TABLE]
and for ,
[TABLE]
It remains to study the last term on the right-hand side of the above inequality. For fixed , we use again the triangle inequality to obtain
[TABLE]
In the last step, we used that by the transformation formula and periodicity (cover by many cells of unit length), there holds
[TABLE]
We claim that
[TABLE]
Indeed, we use the triangle inequality, (3.21) and the fact that to obtain
[TABLE]
∎
The approximations of and the corrector functions can be obtained as described in Section 3.1 and 3.2. Let us conclude this section by remarking that if the second derivatives of the corrector functions are approximated in the space or if the solution to the homogenized problem is approximated in the space , then one obtains by a similar proof an approximation result for the second derivatives of in .
Remark 3.4**.**
If is a family of approximations for satisfying the error bound
[TABLE]
and is as in Theorem 3.4, then we have that
[TABLE]
The same holds true when is a family of -conforming approximations for satisfying the error bound
[TABLE]
and is as in Theorem 3.4.
3.4. Nonuniformly Oscillating Coefficients
In this section, we discuss the case of nonuniformly oscillating coefficients, i.e., coefficients depending on and . We consider the problem
[TABLE]
where the triple satisfies one of the following sets of assumptions.
Definition 3.1** (Sets of assumptions ).**
For , we write
* if and only if is a bounded domain, , and satisfies*
[TABLE]
* if and only if is a bounded convex domain, , and satisfies (3.23) and*
[TABLE]
In view of Remark 2.1, we see that the Cordes condition (3.24) is always satisfied when . Well-posedness to the problem (3.22) is guaranteed by the following theorem, see [12, Theorem 9.15] and [19, Theorem 3].
Theorem 3.5** (Existence and uniqueness of strong solutions).**
Assume either that , or that . Then, for any , the problem (3.22) admits a unique solution .
As in Section 2, uniform a priori estimates for the solution to (3.22) allow passage to the limit in equation (3.22), see [5, 6]. The coefficient matrix of the homogenized problem now depends on the slow variable , and is obtained by integrating against an invariant measure. Corrector results can then be shown as before.
Theorem 3.6** (Nonuniformly oscillating coefficients).**
Assume that and either that , or that . Then the following assertions hold.
Uniform a priori estimate: The solution to (3.22) satisfies
[TABLE]
Homogenization: The solution to (3.22) converges weakly in to the solution of the homogenized problem
[TABLE]
with given by
[TABLE]
where is the unique function with , for some constants , such that
[TABLE]
for any fixed . The function is called the invariant measure.
Corrector estimate: Assume that and . Introducing the corrector function , , as the solution to
[TABLE]
we have that
[TABLE]
Proof.
For , one shows similarly to the proof of [19, Theorem 3] and Theorem 2.2 that
[TABLE]
For , the claim follows from the method of freezing coefficients, using the uniform estimate from Theorem 2.2 for the operators for fixed .
The uniform estimate from yields weak convergence in and strong convergence in for a subsequence of to some limit function . We multiply (3.22) by and follow the transformation performed in [5] to find that
[TABLE]
holds weakly, where and denotes . Passing to the limit, we obtain that is a weak solution of (3.25). We conclude the proof by noting that (3.25) admits a unique strong solution, since is uniformly elliptic and Lipschitz continuous on , see [12, 13].
This can be proved similarly to Theorem 2.4 and Theorem 2.5, using that, by the assumptions made on and elliptic regularity, we have
[TABLE]
for any . ∎
Let us explain how the numerical scheme from Section 3.1 can be used for the numerical homogenization of (3.22).
First, we consider a triangulation on consisting of nodes with grid size , and a triangulation on with grid size . Then, for any , we can use the scheme from Section 3.1 (see Theorem 3.1) to obtain an approximation to such that
[TABLE]
Further, we obtain that
[TABLE]
is an approximation to (see Lemma 3.1),
[TABLE]
Now we define to be a continuous piecewise linear function on such that
[TABLE]
Then, using (3.26) and denoting the continuous piecewise linear interpolant of a function on the grid by , we have
[TABLE]
We observe that, similarly to the proof of Lemma 3.2, we obtain that the solution to
[TABLE]
satisfies, for sufficiently small,
[TABLE]
and in view of (3.27),
[TABLE]
where is the solution to the homogenized problem (3.25). Finally, the solution to (3.28) can be approximated by a standard finite element method on the triangulation which yields an approximation to in the -norm.
The approximation of can be obtained based on the corrector estimate from Theorem 3.6 analogously as in Section 3.3.
4. Numerical Experiments
4.1. Problem with a Known
We consider the homogenization problem
[TABLE]
on the domain
[TABLE]
with the matrix-valued map
[TABLE]
and the right-hand side to be specified below. We observe that the matrix-valued function satisfies (2.1) with . Further, note that
[TABLE]
depends only on the first coordinate of ; see Figure 1.
In this case we know that the homogenized problem is given by
[TABLE]
where denotes the constant matrix
[TABLE]
with being the invariant measure
[TABLE]
see [11]. Explicit computation yields that
[TABLE]
We consider the right-hand side given by
[TABLE]
Then it is straightforward to check that the exact solution to the homogenized problem (4.2) is given by
[TABLE]
Note that we are in the situation , that in the corners of and that .
We use the scheme presented in Section 3.1 to approximate , and . We use the same mesh for approximating and . The Hsieh–Clough–Tocher (HCT) element in FreeFem++ is used in the formulation (3.17) for the approximation of ; see [14]. The gradient on the boundary is set to be the gradient of an approximation by elements on a fine mesh.
Figure 2 shows the error in the approximation of and . For the approximation of the invariant measure we observe convergence of order
[TABLE]
and superconvergence of order for when grid points fall on the line , which is the set along which possesses a jump. The observed rate of convergence (4.3) is consistent with Theorem 3.1. Indeed, we have for any , and Theorem 3.1 yields
[TABLE]
by making the choice , and using an interpolation error bound. In connection with the superconvergence we note that and . For the approximation of the matrix , we observe second-order convergence.
Concerning the approximation of , from Sections 2 and 3.3 we obtain that
[TABLE]
where () denotes the solution to
[TABLE]
Note that since only depends on , we have that
[TABLE]
Therefore, there holds
[TABLE]
For the numerical approximation, we replace by an -conforming finite element approximation on a fine mesh, based on the formulation
[TABLE]
where . To this end, we use again the HCT element and set the gradient on the boundary to be the gradient of an approximation by elements on a fine mesh.
Figure 3 shows the error in the approximation of and we observe second-order convergence. Further, with the exact being available, we can compute the error (4.4) for different values of ; see Figure 3. We observe first-order convergence as tends to zero, as expected from (4.4).
4.2. Problem with an Unknown
Next, let us consider the problem (4.1) with the same domain and matrix-valued function as before, but with the right-hand side given by
[TABLE]
Note that we are in the situation . Further, since the right-hand side of the homogenized problem (4.2) satisfies at the corners of , the solution to (4.2) belongs to the class ; see [16, Prop. 2.6].
As before, we use the scheme presented in Section 3.1 to approximate , and . Using the second-order approximation to obtained as previously described,
[TABLE]
we have that
[TABLE]
Figure 4 shows the squared error (4.5) of the approximation of for different grid sizes and fixed. We observe fourth-order convergence in for the squared error as expected from (4.5).
4.3. Nonuniformly Oscillating Coefficients
We consider the homogenization problem
[TABLE]
on the domain
[TABLE]
with the matrix-valued map ,
[TABLE]
and the right-hand side to be specified below. We observe that the matrix-valued function satisfies (3.23) with . Further, note that it is of the form
[TABLE]
In this case we know that the homogenized problem is given by
[TABLE]
where is given by
[TABLE]
with being the invariant measure
[TABLE]
see [11]. Therefore, we have
[TABLE]
We consider the right-hand side given by
[TABLE]
Then it is straightforward to check that the exact solution to the homogenized problem (4.7) is given by
[TABLE]
Note that the assumptions of Theorem 3.6 are satisfied.
For such that , we take a triangulation on consisting of nodes , and a triangulation on with grid size . We use the scheme presented in Section 3.4 to approximate and , and we observe second-order convergence; see Figure 5.
For the approximation of , Theorem 3.6 yields
[TABLE]
where () denotes the solution to
[TABLE]
We observe that we have
[TABLE]
Therefore, we have that
[TABLE]
where for . For the numerical approximation, we replace by an -conforming finite element method on a fine mesh, based on the formulation
[TABLE]
where . To this end, we use again the HCT element and set the gradient on the boundary to be the gradient of an approximation by elements on a fine mesh.
Finally, let us consider the problem (4.6) with the same domain and matrix-valued function as before, but with the right-hand side given by
[TABLE]
Note that we are in the situation . Further, since the right-hand side of the homogenized problem (4.7) satisfies at the corners of , the solution to (4.7) belongs to the class , see [16, Prop. 2.6].
Using the second-order -conforming approximation to obtained as previously described (again with ),
[TABLE]
we have that
[TABLE]
Figure 6 shows the squared error (4.9) of the approximation of for different grid sizes and fixed. We observe fourth-order convergence in for the squared error as expected from (4.9).
5. Conclusion
In this paper we introduced a scheme for the numerical approximation of elliptic problems in nondivergence-form with rapidly oscillating coefficients on and polygonal domains, which is based on a corrector estimate for such problems derived in the first part of this work.
We proved an optimal-order error bound for a finite element approximation of the corresponding invariant measure using continuous -periodic piecewise linear basis functions on a shape-regular triangulation of the unit cell under weak regularity assumptions on the coefficients. The coefficients are integrated against the so obtained approximation of the invariant measure after piecewise linear interpolation on the mesh to obtain an approximation of the constant coefficient-matrix of the homogenized problem. Using an comparison result for the solution of this perturbed problem, we eventually obtained an approximation of the solution to the homogenized problem in the -norm. In the case of a polygonal domain in two space dimensions, we made use of compatibility conditions for the source term to ensure sufficiently high Sobolev-regularity of .
We obtained an approximation to the solution of the original problem, i.e., the problem with oscillating coefficients, by making use of the approximation of , finite element approximations to second-order derivatives of the corrector functions, as well as an corrector result. A method of successively approximating higher derivatives for the approximation of corrector functions was provided and analyzed. The corrector functions are necessary in order to obtain an approximation of whereas the task of approximating in the -norm can be achieved using only an approximation of .
Furthermore, we generalized our results to the case of nonuniformly oscillating coefficients, i.e., we derived an analogous corrector result and studied the approximation of the solution to the homogenized problem and the solution of the -dependent problem in this case.
In the final part of the paper, we presented numerical experiments matching the theoretical results for problems with both known and unknown , as well as problems with nonuniformly oscillating coefficients. We illustrated the performance of the scheme for the approximation of the invariant measure, the solution to the homogenized problem and the solution to the problem involving oscillating coefficients for a fixed value of .
Future work will focus on weakening of the regularity assumptions on the coefficients and the approximation of fully nonlinear nondivergence-form problems with oscillating coefficients such as the Hamilton–Jacobi–Bellman equation.
Acknowledgements
This work was supported by the UK Engineering and Physical Sciences Research Council [EP/L015811/1].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Allaire. Shape optimization by the homogenization method , volume 146 of Applied Mathematical Sciences . Springer-Verlag, New York, 2002.
- 2[2] M. Avellaneda and F.-H. Lin. Compactness methods in the theory of homogenization. II. Equations in nondivergence form. Comm. Pure Appl. Math. , 42(2):139–172, 1989.
- 3[3] M. Avellaneda and F.-H. Lin. L p superscript 𝐿 𝑝 L^{p} bounds on singular integrals in homogenization. Comm. Pure Appl. Math. , 44(8-9):897–910, 1991.
- 4[4] I. Babuška. Computation of derivatives in the finite element method. Comment. Math. Univ. Carolinae , 11:545–558, 1970.
- 5[5] A. Bensoussan, L. Boccardo, and F. Murat. Homogenization of elliptic equations with principal part not in divergence form and Hamiltonian with quadratic growth. Comm. Pure Appl. Math. , 39(6):769–805, 1986.
- 6[6] A. Bensoussan, J.-L. Lions, and G. Papanicolaou. Asymptotic analysis for periodic structures . AMS Chelsea Publishing, Providence, RI, 2011. Corrected reprint of the 1978 original.
- 7[7] V. I. Bogachev, N. V. Krylov, and M. Röckner. On regularity of transition probabilities and invariant measures of singular diffusions under minimal conditions. Comm. Partial Differential Equations , 26(11-12):2037–2080, 2001.
- 8[8] V. I. Bogachev and S. V. Shaposhnikov. Integrability and continuity of solutions to double divergence form equations. Ann. Mat. Pura Appl. (4) , 196(5):1609–1635, 2017.
