Effective models and numerical homogenization for wave propagation in heterogeneous media on arbitrary timescales
Assyr Abdulle, Timoth\'ee Pouchon

TL;DR
This paper introduces a family of effective equations for wave propagation in periodic media valid over arbitrary timescales, ensuring well-posedness without regularization and providing a computationally efficient method for calculating effective tensors.
Contribution
The paper develops a new family of effective wave equations for arbitrary timescales, proving their well-posedness and introducing a novel, cost-effective numerical method for computing effective tensors of any order.
Findings
Effective equations are well-posed without regularization.
Effective solutions are close to original wave solutions in a specific norm.
A new relation reduces computational cost for effective tensor calculation.
Abstract
A family of effective equations for wave propagation in periodic media for arbitrary timescales , where is the period of the tensor describing the medium, is proposed. The well-posedness of the effective equations of the family is ensured without requiring a regularization process as in previous models [A. Benoit and A. Gloria, arXiv:1701.08600, 2017], [G. Allaire, A. Lamacz, and J. Rauch, arXiv:1803.09455, 2018]. The effective solutions in the family are proved to be close to the original wave in a norm equivalent to the norm. In addition, a numerical procedure for the computation of the effective tensors of arbitrary order is provided. In particular, we present a new relation between the correctors of arbitrary order, which allows to substantially reduce the…
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.
Effective models and numerical homogenization for wave propagation in heterogeneous media on arbitrary timescales
Assyr Abdulle111[email protected]
ANMC, Institute of Mathematics, École Polytechnique Fédérale de Lausanne, Station 8, CH-1015 Lausanne, Switzerland 333The authors are partially supported by the Swiss National Foundation, grant No. 200020_172710.
Timothée Pouchon222[email protected]
University of Edinburgh, School of Mathematics, James Clerk Maxwell Building, Peter Guthrie Tait Road, Edinburgh EH9 3FD, United Kingdom. 333The authors are partially supported by the Swiss National Foundation, grant No. 200020_172710.
Abstract
A family of effective equations for wave propagation in periodic media for arbitrary timescales , where is the period of the tensor describing the medium, is proposed. The well-posedness of the effective equations of the family is ensured without requiring a regularization process as in previous models [A. Benoit and A. Gloria, arXiv:1701.08600, 2017], [G. Allaire, A. Lamacz, and J. Rauch, arXiv:1803.09455, 2018]. The effective solutions in the family are proved to be close to the original wave in a norm equivalent to the norm. In addition, a numerical procedure for the computation of the effective tensors of arbitrary order is provided. In particular, we present a new relation between the correctors of arbitrary order, which allows to substantially reduce the computational cost of the effective tensors of arbitrary order. This relation is not limited to the effective equations presented in this paper and can be used to compute the effective tensors of alternative effective models.
Keywords. homogenization, effective equations, wave equation, heterogeneous media, long-time behavior, dispersive waves, a priori error analysis, multiscale method
AMS subject classifications. 35B27, 74Q10, 74Q15, 35L05, 65M60, 65N30
1 Introduction
The wave equation in heterogeneous media is widely used in many applications such as seismic inversion, medical imaging or the manufacture of composite materials. We consider the following model problem: let be a hypercube and let be the solution of
[TABLE]
where we require to be -periodic and the initial conditions and are given. As we allow the domain to be arbitrarily large, (1.1) can be used to model wave propagation in infinite media. We assume here that the tensor varies at the scale while the initial conditions and the source have wavelength of order . In such multiscale situations, standard numerical methods such as the finite element (FE) method or the finite difference (FD) method are accurate only if the size of the grid resolves the microscopic scale . Hence, as or as the domain grows the computational cost of the method becomes prohibitive and multiscale numerical methods are needed.
Several multiscale methods for the approximation of (1.1) are available in the literature. They can be divided into two groups (see [3] for a review). First, the methods suited when the medium does not have scale separation: [33], [27, 26], [34], and [4]. These methods rely on sophisticated finite element spaces relying on the solutions of localized problems at the fine scale. Second, the methods suited when the medium has scale separation (i.e., a special structure of the medium is required). These methods are built in the framework of the heterogeneous multiscale method (HMM): the FD-HMM [23, 11] and the FE-HMM [1]. In both methods, the effective behavior of the wave is approximated by solving micro problems in small sampling domains.
The FD-HMM and the FE-HMM rely on homogenization theory [14, 36, 12, 28, 17, 32]: they are built to approximate the homogenized equation and thus provide approximations of in an sense. The homogenization of the wave equation (1.1) is provided in [15]. For a given sequence of tensors , we have the existence of a subsequence of that converges weakly∗ in to as (definitions of the functional spaces are provided below). The limit , called the homogenized solution, solves the homogenized equation
[TABLE]
with the same initial conditions as for . The homogenized tensor in (1.2) is obtained as the -limit of a subsequence of (see [38, 19]). In general, depends on the choice of the subsequence and thus no formula is available for its computation. In this paper, we consider periodic media, i.e., we assume that the medium is described by
[TABLE]
where is a reference cell (typically ). Under assumption (1.3), is proved to be constant and an explicit formula is obtained (see e.g. [14, 12, 28, 17]): it can be computed by means of the first order correctors, which are defined as the solutions of cell problems (i.e., elliptic equations in based on with periodic boundary conditions). Therefore, in the periodic case the homogenized solution can be accurately approximated independently of .
However, for wave propagation on large timescales, develops dispersive effects at the macroscopic scale that are not captured by . Furthermore, if the initial conditions or the source have high spatial frequencies (in between and ), the dispersion appears at shorter times. Hence, to develop numerical homogenization methods for long-time propagation, or in high frequency regimes, new effective models are required.
The study of this dispersion phenomenon has recently been the subject of considerable interest. Analyses for periodic media and timescales are provided in [37, 29, 20, 21, 6, 8, 5] and numerical approaches are studied in [2, 10]. A result for locally periodic media for timescales was also obtained in [7]. For arbitrary timescales , , effective equations were proposed in [9] and [13]. The well-posedness of these equations is obtained using regularization techniques: in [13], the regularization relies on the tuning of an unknown parameter, which poses problems in practice; in [9] a filtering process is introduced (yet not tested in practice).
In this paper, we present two main results first reported in [35, Chap. 5]. The first main result is the definition of a family of effective equations that approximate for arbitrary timescales . The effective equations, derived by generalizing the technique introduced for timescales in [5], have the form 111In the whole paper we use the shorthand to denote the operator , see (1.10).
[TABLE]
where is the homogenized tensor and are pairs of nonnegative, symmetric tensors of order and , respectively, which satisfy constraints based on high order correctors, solutions of cell problems. Note that the correction of the right-hand side generalizes the one introduced in the case in [8] and discussed in [5]. For all effective solutions in the family, we prove an error estimate that ensures to be close to in the norm (see (1.5)). In contrast to the effective equations proposed in [9] and [13], the well-posedness of (1.4) does not rely on regularization but is naturally ensured by the non-negativity of the tensors. The unregularized versions of the effective equations from [9] and [13] do not belong to the family (1.4) but are closely related: they have the form (1.4) with , and these pairs of tensors satisfy the correct constraints. The issue is however that the sign of happens to be negative for some (this is proved for [18]) which results in the ill-posedness of the unregularized version of these effective equations.
The second main result of the paper is an explicit procedure for the computation of the high order effective tensors in (1.4), for which we provide a new relation between the high order correctors. In particular, while the natural formula to compute requires to solve the cell problems of order to , this relation ensures that only the cell problems of order to are in fact necessary. The consequence is a significant reduction of the computational cost needed to compute the effective tensors of arbitrary order. We emphasize that this result can also directly be used to reduce the computational cost for the tensors of the effective equations from [9] and [13].
The paper is organized as follows. In Section 2, we present our first main result: we derive the family of effective equations and state the error estimate. We then compare the obtained effective equations with the ones from [9] and [13]. In Section 3, we construct a numerical procedure to compute the tensors of effective equations. We then present our second main result: a relation between the correctors which allows to reduce the computational cost of the effective tensors. In Section 4, we illustrate our theoretical findings in various numerical experiments. Finally, in Section 5 we provide the proofs of the main results.
Definitions and notation
Let us start by introducing some definitions and notations used in the paper. Let be the closure of the space for the norm. We denote the quotient spaces and . The space (resp. ) is composed of the zero mean representatives of the equivalence classes in (resp. ). The dual space of (resp. ) is denoted (resp. ). The integral mean of is denoted and denotes the standard inner product in . We define the following norm on
[TABLE]
Using the Poincaré–Wirtinger inequality, we verify that is equivalent to the norm: where is the Poincaré constant.
We denote the vector space of tensors of order . In the whole text, we drop the notation of the sum symbol for the dot product between two tensors and use the convention that repeated indices are summed. The subspace of of symmetric tensors is denoted , i.e., iff for any permutation of order . We define the symmetrization operator as
[TABLE]
The coordinate \big{(}S^{n}(q)\big{)}_{i_{1}\cdots i_{n}} is denoted . We denote an equality holding up to symmetries, i.e., for we have
[TABLE]
A colon is used to denote the inner product of two tensors in , . We say that a tensor is major symmetric if it satisfies
[TABLE]
We say that a tensor is positive semidefinite if
[TABLE]
and it is positive definite if the equality in (1.9) holds only for . The tensor product of and is the tensor of defined as . Note that up to symmetries the tensor product is commutative, i.e., . We use the shorthand notation
[TABLE]
The derivative with respect to the -th space variable is denoted and the derivation with respect to any other variable is specified. For , we denote the differential operator
[TABLE]
Settings of the problem
Recall assumption (1.3): a^{\varepsilon}(x)=a\big{(}\tfrac{x}{\varepsilon}\big{)}, where is a symmetric, -periodic tensor. In addition, we assume that is uniformly elliptic and bounded, i.e., there exists such that
[TABLE]
Without loss of generality, let the reference cell be . We assume that the hypercube satisfies
[TABLE]
In particular, (1.12) ensures that for a -periodic function , the map x\mapsto\gamma\big{(}\tfrac{x}{\varepsilon}\big{)} is -periodic ( is extended to by periodicity). Note that the integers in (1.12) can be arbitrarily large. In particular can be of order .
Given an integer , we consider the wave equation: such that
[TABLE]
where are given initial conditions and is a source. The well-posedness of (1.13) is proved in [31, 24]: if , , and , then there exists a unique weak solution with and .
2 First main result: family of effective equations and a priori error estimate
In this section, we present the family of effective equations and provide the corresponding a priori error estimate. In 2.1, we derive the family in three steps: (i) we discuss the ansatz on the form of the effective equations; (ii) using asymptotic expansion we derive the high order cell problems; (iii) we obtain the constraints on the effective tensors by investigating the well-posedness of the cell problems. In 2.2, we define rigorously the family of effective equations and state the a priori error estimate. Finally, in 2.3 we compare the obtained equations with the other effective equations available in the literature. For the sake of readability we postpone the technical proofs to Section 5.
2.1 Derivation of the family of effective equations
In the whole derivation, we assume that the data are as regular as necessary. The specific requirements are stated in Theorem 2.8. Note that we consider here timescales with . For timescales with it can be shown following similar techniques that the standard homogenized equation is a valid effective model (see [35, section 5.1.1]).
Ansatz on the form of the effective equations
We first discuss the ansatz on the form of the effective equations, which has a major importance in the derivation. We assume that the effective equations have the form
[TABLE]
where is the homogenized tensor (2.13), , are tensors to be defined and is a differential operator to be defined (the construction of is discussed in Remark 5.2). As discussed in [5], if the set of considered equations is too small, we end up with ill-posed equations. In particular, without the operators in (2.1), our derivation would lead to the same ill-posed effective equations obtained in [9] and [13] (the unregularized versions).
Following the classical Faedo–Galerkin method (see [24, Chap. 7]), we prove the following well-posedness result for (2.1). We define the bilinear forms
[TABLE]
and the associated Banach spaces
[TABLE]
We call a function , with , a weak solution of (2.1) if for all test functions , with , satisfies
[TABLE]
Theorem 2.1**.**
Assume that the tensors , are positive semidefinite (1.9) and satisfy the major symmetries (1.8). Furthermore, assume that the data satisfy the regularity
[TABLE]
Then there exists a unique weak solution of (2.1).
Let us provide a short sketch of the proof. We look for successive approximations of a weak solution in the form , where is a smooth basis of . For each , is obtained as the solution of a well-posed ordinary differential equation. We then prove that the sequence is bounded in . In particular, note that the sign assumptions on the tensors ensure that for any and and for all . We thus obtain the existence of a subsequence that weakly∗ converges in . We can then prove that the weak∗ limit is the unique weak solution.
Asymptotic expansion, inductive Boussinesq tricks
We make the ansatz that can be approximated by an adaptation of of the form
[TABLE]
where are to be defined and the map is -periodic. We split the error as
[TABLE]
and follow the argument presented in [5] based on the error estimate of Lemma 5.8 (see also [35, Section 4.2.2]): for to be of order , we need the terms involving in the remainder
[TABLE]
to be of order in the norm (it is sufficient that this holds in the stronger norm). We now expand : using the equation for (1.13) and the form of the adaptation (2.3), we obtain
[TABLE]
where the operators are defined as
[TABLE]
and the remainder is
[TABLE]
Classical two scale asymptotic expansion [14] advises to look for of the form
[TABLE]
where the components of the tensor are -periodic functions to be defined.
The next step is the main difficulty of the derivation: we must use the effective equation (2.1) to substitute all the time derivatives in the terms of order to in (2.5). Various versions of this process have been used in related works [5, 6, 8, 21, 25, 30] to obtain well-posed effective equations from ill-posed ones. To refer to this kind of manipulation the term Boussinesq trick was coined in [8] (see [16] where such tricks are used for several Boussinesq’s type of equations).
As these inductive Boussinesq tricks represent a technical challenge, let us explain here the case and and postpone the general case to Section 5.1.1 (Theorem 5.1 and Lemma 5.7). For and , the effective equation (2.1) can be written as
[TABLE]
We now use the equation to substitute in the last term and obtain
[TABLE]
Using (2.7) and the two last equalities, we find that the time derivatives in (2.5) can be written as
[TABLE]
where the remainder has order in the norm (for sufficiently regular). Using this expression in (2.5), we obtain the desired development in the case and .
This process is generalized in Theorem 5.1 and Lemma 5.7. With these results, we are able to rewrite in (2.5) without time derivative in the terms of order to : defining the tensors inductively and as
[TABLE]
we obtain
[TABLE]
Provided sufficient regularity of , the remainder has order in the norm. Furthermore, provided sufficient regularity of , the remainder has order in the norm (this is sufficient for and to be close, see Theorem 2.8). Using the definition of in (2.7) and of , we verify that (for use and )
[TABLE]
where denotes the -th vector of the canonical basis of . Hence, canceling successively the terms of order to in (2.9), we obtain the cell problems: the correctors are the functions in such that
[TABLE]
where the tensors are defined in (2.8) and the symmetrization operator is defined in (1.6). Note that the cell problems for and are the same as the cell problems obtained with two-scale asymptotic expansion [14].
Remark 2.2*.*
In (2.10), we have chosen symmetric right-hand sides. This is possible thanks to the symmetry of in (2.9), as a term of the form can be rewritten as . This choice ensures that the correctors are symmetric tensors functions. In particular, has only distinct entries instead of if it was not symmetric. When it comes to numerical approximation, each distinct entry of the corrector corresponds to a cell problem to solve and this symmetrization saves computational time. In addition, this choice ensures that the odd order cell problems are well-posed unconditionally (see below).
Constraints on the high order effective tensors
The last step in the derivation of the family of effective equations is to obtain the constraints on the effective tensors by imposing the well-posedness of the cell problems. In order to investigate the solvability of (2.10), let us state the following classical result (obtained with the Fredholm alternative or the Lax–Milgram theorem combined with the characterization of ).
Lemma 2.3**.**
For an elliptic and bounded tensor , consider the following variational problem: find such that
[TABLE]
where are given functions. Then (2.11) has a unique solution if and only if
[TABLE]
We now proceed to the two following tasks: first, we verify that the odd order cell problems satisfy unconditionally the solvability condition (2.12); second, we impose the solvability condition (2.12) on the right-hand sides of the even order cell problems to obtain the constraints on the effective tensors.
First note that (2.10a) is well-posed as its right-hand side unconditionally satisfies (2.12). Next, we verify that the cell problem for is well-posed as the homogenized tensor satisfies
[TABLE]
which ensures the solvability condition (2.12) to hold. We then continue this process to derive the constraints on the higher order effective tensors imposed by the well-posedness of the higher order cell problems.
We assume that the cell problems are well-posed up to order , . Consider the cell problem for . Recalling that and as the correctors have zero mean, we verify that the solvability condition (2.12) is equivalent to the following relation between the correctors.
Lemma 2.4**.**
For any , the correctors and satisfy the equality
[TABLE]
Remark 2.5*.*
A proof of Lemma 2.4 can be found in [35, Lemma 5.2.5]. A similar result is also known in the context of Bloch wave theory (see e.g. [20], [13] and the references therein). As discussed, Lemma 2.4 guarantees that the odd order cell problems are well-posed unconditionally. Pursuing the reasoning, this result ensures that no operator of odd order is needed in the effective equations. It is also the reason why no additional correction is required in the effective equation when increasing the timescale from an even integer to .
Finally, consider the cell problem for . Imposing the solvability condition (2.12) on the right-hand side, we obtain the following constraint on the tensor :
[TABLE]
This constraint can be rewritten in terms of the effective tensors using the definition of and in (2.8):
[TABLE]
The constraints (2.15) characterize the family of effective equations. Indeed, if the effective tensors satisfy (2.15), the cell problems for to are well-posed because their right-hand sides satisfy the solvability condition (2.12). Therefore, the adaptation given by (2.3) and (2.7) is well defined and can be used to prove an error estimate between . This result is presented in the next section and rigorously proved in Section 5.2.
2.2 A priori error estimate for the family of effective equations
In the previous section, we derived the constraints on the effective tensors for the effective equations to approximate . We present here an error estimate that ensures that the solutions of the derived effective equations are close to in the norm.
Let us first rigorously define the family of effective equations derived in Section 2.1.
Definition 2.6**.**
The family of effective equations is the set of equations (2.1), where is defined as
[TABLE]
and for the tensors satisfy the following requirements:
- (i)
, ; 2. (ii)
and are positive semidefinite (see (1.9)); 3. (iii)
and satisfy the major symmetries (1.8); 4. (iv)
and satisfy the constraints (2.15).
Remark 2.7*.*
In the case , the correction of the right-hand side in the effective equations was introduced in [8] and discussed in [5]. We verify that the definition of in (2.16) leads to a lower constant multiplying in estimate (2.17). More details on the origin of (2.16) are given in Remarks 5.2 and 5.10.
For the effective solutions in family , we prove in Section 5.2 the following error estimate.
Theorem 2.8**.**
Let , and let belong to the family of effective equations (Definition 2.6). Furthermore, assume that and that the data and satisfy the following regularity
[TABLE]
where . Then the following error estimate holds
[TABLE]
where depends only on , , , , and , and the norm is defined in (1.5).
Remark 2.9*.*
For , the result of Theorem 2.8 holds provided a higher regularity on the effective solution and are assumed. Specifically, assuming that is a sufficiently large integer for the embedding to hold, the statement of Theorem 2.8 is true for .
Remark 2.10*.*
From the derivation in Section 2.1, we may hope that is a better approximation of than . For example, in the elliptic case the error between and an adaptation can be estimated in the energy norm (see e.g. [28], note that under (1.12) there is no boundary layer). However, in the case of the wave equation, the answer is not as simple. In fact, an error estimate in the energy norm can be proved only in some specific settings: for example if and for well prepared initial position of the form for some . Note that this issue is related to the lack of convergence of the energy of the fine scale wave toward the energy of the homogenized wave (see [15]).
2.3 Comparison with other effective equations in the literature
In [13], effective equations for arbitrary timescales are derived. The settings are slightly different as the wave equation (1.13) is considered in the whole space and with a tensor that can be of a more general nature: periodic, almost periodic, quasiperiodic and random (we refer to [13] for the specific definitions). In these circumstances, [13] proposes effective equations that have the form
[TABLE]
The effective tensors in this equation are indeed verified to match the tensors defined in (2.14) (see [35, section 5.2.6]). Under some weak regularity assumption on the initial condition, an error estimate between and is proved in the norm. This estimate is a strong theoretical result as it holds in the norm we expect in the context of homogenization of the wave equation. However, the use of the effective equation (2.18) in practice is problematic as no procedure for the computation of the regularization parameter is available. In fact, numerical tests indicate that the range of acceptable values for is narrow: if is too small, the equation is ill-posed and if is too large, the solution of (2.18) does not describe accurately (see [35, section 5.4.3]).
In [9], another effective equation for arbitrary timescales is proposed. The settings of this result are the following: the wave equation (1.13) is considered in the whole space with a periodic tensor, it includes an oscillating density and admits nonzero source and trivial initial conditions. In the particular case of a constant density (as considered in the present paper), the effective equation proposed in [9] reads
[TABLE]
where , are filtering differential operators that ensure the equation to be well-posed. The main result is an error estimate in energy norm between and an adaptation of . In particular, the results enable the adaptation to approximate as accurately as one wants by increasing accordingly. Nevertheless, the filtering process used in (2.19) to obtain a well-posed equation has yet to be tested in practice.
Despite the inherent difference between (2.18) and (2.19) and effective equations (2.1) in family , their respective effective tensors are tied through the relation (see (2.15)):
[TABLE]
Hence, if we let for all in the effective equations in , relation (2.20) reads and we end up with the unregularized versions of (2.18) and (2.19) (i.e., and ). Similarly, equations (2.18) and (2.19) without their regularization devices satisfy requirement (iv) in Definition 2.6. However, while the well-posednesses of (2.18) and (2.19) rely on their respective regularization process, the well-posedness of the effective equations in is guaranteed by requirements (ii) and (iii). To fulfill these requirements, we have an explicit and constructive algorithm described in Section 3.1.
Finally, before approximating any of the effective equations (2.1), (2.18) or (2.19), the effective tensors must be computed. For this calculation, a substantial gain of computational time is obtained by using the formula provided by our second main result in Theorem 3.5, Section 3.2.
3 Second main result: computation of effective tensors and reduction of the computational cost
In this section, we provide a numerical procedure for the computation of the tensors of some effective equations in the family . In particular, in 3.2 we present a new relation between the correctors that allows to reduce significantly the computational cost for the effective tensors. We emphasize that this result is not limited to the family and can be used to compute the effective tensors of the alternative effective models from [9] and [13] discussed in 2.3. The final algorithm is provided in 3.4.
3.1 Construction of high order effective tensors
Recall that the tensors of an effective equation in family are characterized by the following properties (Definition 2.6): for
- (i)
, ; 2. (ii)
and are positive semidefinite, i.e., (see (1.9))
[TABLE] 3. (iii)
and satisfy the major symmetries, i.e.,
[TABLE] 4. (iv)
and satisfy the constraints
[TABLE]
with the tensors defined as
[TABLE]
where the tensor , defined in (2.8), are computed with , and the tensor , defined in (2.14), can be computed from the correctors and (a much cheaper alternative is to compute only with formula (3.8), see Section 3.2).
Our goal is now to construct tensors satisfying the requirements (i) to (iv). Note that if was positive semidefinite, the pair and would trivially satisfy (i) to (iv). However, although the sign of is unknown for , it is known that is negative definite (see [18, 8, 5]). Hence, the main challenge of the construction lies in the sign of the tensors and to build valid tensors, we need two basics from the tensor world. First, we use the following result, proved in Section 5.3.
Lemma 3.1**.**
For any , the tensor is positive definite.
Second, we use a “matricization” operator, which linearly maps a symmetric tensor to a symmetric matrix whose sign is the same as , i.e.,
[TABLE]
where is a simple tensor-to-vector transformation. One construction for such an operator is provided in Section 3.3.
With Lemma 3.1 and the operator , we are able to build tensors that satisfy (i) to (iv).
Lemma 3.2**.**
For , assume that and have already been computed and let be the tensor defined in (3.2). Define the tensor as
[TABLE]
where denotes the minimal eigenvalue of a symmetric matrix and . Then the tensors
[TABLE]
satisfy the requirements (i) to (iv) of Definition 2.6.
Proof.
First, note that the orders of the tensors in (i) are correct. Second, as are fully symmetric tensors, they trivially satisfy the major symmetries and (iii) is verified. Next, we verify (iv), i.e., satisfy (3.1) (recall the meaning of in (1.7)):
[TABLE]
We are left with (ii): verifying that are positive semidefinite. The positive semidefiniteness of follows directly from the non-negativity of and Lemma 3.1. Finally, let us verify that is positive semidefinite. Using (3.3) and the definitions in (3.4), we have
[TABLE]
where we denoted and the Euclidian norm. The definition of in (3.4) ensures that the right-hand side is nonnegative, proving that is positive semidefinite. That concludes the verification of (i) to (iv) and the proof of the lemma is complete. ∎
Lemma 3.2 allows to compute the tensors of one effective equations in the family . We emphasize that this is one possible construction among others. To obtain other effective equations, we have many options. For example, note that replacing in (3.4) with any provides other valid pairs of tensors. Alternatively, we can replace in the definition of with another positive definite tensor. Finally, let us note the following alternative (used in [5] in the case ).
Remark 3.3*.*
Assume that the tensor in (3.2) can be decomposed as , where is positive semidefinite. Then we verify that the pairs (3.5), where is defined as
[TABLE]
define effective equations in the family.
3.2 A new remarkable relation between the correctors to reduce the cost of computation of the effective tensors
Let us discuss the cost of the procedure described in the previous section. For an integer , assume that we want to construct the tensors of an effective equation for a timescale : , where . The main computational cost of this construction lies in the calculation of the tensors in (3.2), which involves the tensors , where
[TABLE]
Following this natural—but naive—formula, we thus need approximations of the correctors to . In this section, we present a new relation between the correctors ensuring that in fact the correctors to are sufficient (Theorem 3.5).
Let us quantify the computational gain achieved thanks to this result. As each is a symmetric tensor valued function, it has distinct components (see Remark 2.2). The number of cell problems to solve to have all the distinct components of to is thus
[TABLE]
Hence, to compute Theorem 3.5 allows to avoid the approximation of , i.e., we spare the approximation of
[TABLE]
cell problems. To fully appreciate this gain, assume that we want to compute the effective tensors of an effective equation for a timescale , i.e. : for , we spare cell problems ( cell problems to solve instead of ) and if , we spare cell problems ( cell problems to solve instead of ).
Remark 3.4*.*
It is important to note that this gain is not specific to the effective equations presented here. Indeed, formula (3.8) can directly be used to compute the (sufficient) symmetric part of the high order tensors in the effective models from [9] and [13] discussed in Section 2.3.
The new relation between the correctors is presented in the following result, proved in Section 5.4. Note that this result was obtained independently in [22, Remark 2.5] in the context of stochastic homogenization.
Theorem 3.5**.**
Let be the zero mean correctors defined in (2.10). Then, for , the tensor defined by (3.7) satisfies the decomposition
[TABLE]
where the tensors are defined as
[TABLE]
where the second double sum in the definition of vanishes for .
Observe that the tensor only depends on the correctors to so that decomposition (3.8) indeed guarantees that can be computed from to .
Remark 3.6*.*
It can be verified that the homogenized tensor (2.13) satisfies . Hence, decomposition (3.8) also holds in the case with (recall that ).
3.3 Matrix associated to a symmetric tensor of even order
In this section, we construct the “matricization” operator used in the construction of Section 3.1. This operator maps a given symmetric tensor of even order to a matrix whose sign is the same as .
We consider the bilinear map
[TABLE]
Denote the set of multiindices of the distinct entries of a tensor in , i.e.,
[TABLE]
We verify that the cardinality of is We denote and let be a bijection. We define then the bijective mapping
[TABLE]
For , let be the number of multiindices in that are equal to up to symmetries, i.e.,
[TABLE]
With these notations, we rewrite the map defined in (3.10) as
[TABLE]
Finally, we define the matrix associated to a tensor as
[TABLE]
We verify that for any , . Hence, is positive definite (resp. semidefinite) if and only if is positive definite (resp. semidefinite). In particular, property (3.3) holds.
3.4 Algorithm for the computation of the high order effective tensors
We present here the algorithm for the computation of the effective tensors of one equation in the family . The procedure relies on the construction explained in Lemma 3.2, the formula provided by Theorem 3.5, and the “matricization” operator defined in (3.12). The set of index is defined in (3.11).
Algorithm 7 Compute the tensors of an effective equation (2.1) in the family .
1:-periodic, symmetric tensor satisfying (1.11); timescale .
2:effective tensors .
3:for all solve the cell problem for in (2.10a) with \big{\langle}{\chi^{1}_{i}}\big{\rangle}_{Y}=0
4:for all c^{0}_{i_{1}i_{2}}=a^{0}_{i_{1}i_{2}}=-\big{\langle}{a\nabla_{\makebox[3.6831pt]{\scriptstyle y}}\kern-1.5pt\chi_{i_{2}}^{1}\cdot\nabla_{\makebox[3.6831pt]{\scriptstyle y}}\kern-1.5pt\chi_{i_{1}}^{1}}\big{\rangle}_{Y}+\big{\langle}{ae_{i_{2}}\cdot e_{i_{1}}}\big{\rangle}_{Y}
5:for do
6: for all solve the cell problems for in (2.10b) with \big{\langle}{\chi^{r+1}_{i_{1}\cdot\cdot i_{r+1}}}\big{\rangle}_{Y}=0
7: compute the tensor S^{2r+2}\big{(}g^{2r}\big{)} with formula (3.8)
8: compute the tensor with formula (3.2)
9: build the matrices , A^{r}=M\big{(}S^{2r+2}(\otimes^{r+1}a^{0})\big{)} and compute \delta^{*}=\bigg{\{}-\displaystyle\frac{\lambda_{\min}(M(\check{q}^{r}))}{\lambda_{\min}(A^{r})}\bigg{\}}_{+}
10: compute a^{2r}=\check{q}^{2r}+\delta^{*}S^{2r+2}\big{(}\otimes^{r+1}a^{0}\big{)}, b^{2r}=\delta^{*}S^{2r}\big{(}\otimes^{r}a^{0}\big{)},
11:end for
4 Numerical experiments
In this section, we present numerical experiments to illustrate the result of Theorem 2.8: the effective equations in the family capture the long-time behavior of . Note that reporting numerical error in the approximation of in a pseudo-infinite medium for very large timescales is not conceivable as computing a reference solution is out of reach even for one-dimensional problems. We can however consider a small periodic domain as this setting is covered by our theory. In addition, we will illustrate that high order effective models are also useful when we deal with high frequency regimes.
We consider the one-dimensional model problem (1.13) given by the data , , (we verify that ) with , and the periodic domain , . Let us give some insight on the macroscopic evolution of : the central pulse separates into left- and right-going waves packets with speed ; these packets meet at (equivalently ) for , , and at for , . As time increases, dispersion appears in each packet. As the domain has a periodic boundary, at some point in time the packets start to superpose. In our settings, is the larger timescale until the bulk of the dispersion spans approximately half of the domain . For , we compare with the corresponding effective solutions of order , denoted ( is the homogenized solution). We approximate using a spectral method grid of size and a leap frog scheme for the time integration with . The effective solutions are approximated with a Fourier method (the effective coefficients are computed using Algorithm 3.4) on a grid of size (no time integration). Details on the numerical methods can be found in [35, section 5.3].
The results are displayed in Figure 1. In the top-left plot, we compare , , at . We observe that does not capture the macroscopic dispersion developed by , while accurately describes it. In the top-right plot, we compare , , at (observe that right- and left- going wave packets are in fact superposed). At this timescale, the first order effective solution does not capture accurately the dispersion anymore, as expected, but the second order does. In the bottom plot, we compare the normalized errors for the effective solutions on the time interval (the -axis is in log scale). We observe that is accurate up to and then deteriorates. The first order is accurate up to , then deteriorates. Finally, the second order has a satisfying accuracy over the whole time interval . The observations of this experiment corroborate the result of Theorem 2.8: the effective solution accurately describe up to timescales.
In two dimensions, computing a reference solution for the previous experiment has a huge computational cost. However, we can illustrate an interesting fact: high order effective models are useful in high frequency regimes. Let us first give some insights on this fact. We consider the following specific settings: let a\big{(}\tfrac{x}{\varepsilon}\big{)} be a given tensor with fixed, be a Gaussian with and a scaling parameter. In (1.13), we let and the initial conditions and (we assume that is arbitrarily large). To specify the dependence of on the parameter , we denote it as . In the equation for , making the changes of variables and and introducing , we find
[TABLE]
and we conclude that . In other words, for (i.e., an increase in the frequencies of the initial wave) the long-time effects of can be observed at a shorter time in (modulo a contraction of space). However, for high values of we meet situations where Theorem 2.8 does not provide a satisfactory error estimate: on the one hand, in the estimate for , the increase of deteriorates the error constant in Theorem 2.8; one the other hand, in the estimate for , the constant is good, but the period of the tensor is to far from the asymptotic regime for homogenization to be meaningful. In practice, we observe that the increase of the frequencies of the initial wave (increase of ) leads to additional dispersive effects in (or ). Furthermore, the use of higher order effective models allows to capture these additional effects.
To illustrate this, we consider the two dimensional model problem given by the data and
[TABLE]
We compute the effective tensors using Algorithm 3.4 and approximate and at time . As above, is approximated with a spectral method on a grid of size and leap frog scheme with and are computed with a Fourier method on a grid of size (see [35, section 5.3]). In Figure 2, we compare the solution in the periodic medium (top-left) with the effective solutions of order , (top-right), and order , (bottom-left). We observe that captures more accurately the dispersion developed by than . This is even better seen in the 1d cut at in the bottom-right plot of Figure 2. Furthermore, even though distinguishing the higher order dispersion from the -scale oscillation is not easy in this regime, in the zoom we can guess that the model of order is better than the order .
5 Proofs of the main results
In this section, we provide the proofs of the main results of the paper. In 5.1, we prove the inductive Boussinesq tricks: Theorem 5.1 and Lemma 5.7. In 5.2, the a priori error estimate for the family of effective equations of Theorem 2.8 is proved. In 5.3, we prove the result on positive definite tensors from Lemma 3.1 and in 5.4, we prove the new relation between the correctors from Theorem 3.5.
5.1 Inductive Boussinesq tricks for the derivation of the family of effective equations
In this section, we present the technical task that was postponed in the derivation of the family of effective equations in Section 2.1. Specifically, we provide the result allowing to substitute the time derivatives in the terms of order to in (2.5). To that end, the main challenge is to proceed to inductive Boussinesq tricks (Theorem 5.1). This result is then used in Lemma 5.7, which provides the specific relation used in Section 2.1.
5.1.1 Inductive Boussinesq tricks
The following theorem is the key result of this section.
Theorem 5.1**.**
Let be the solution of (2.1) and let be an even integer such that . If the right-hand side of (2.1) is defined as
[TABLE]
then satisfies
[TABLE]
where is the tensor defined inductively as
[TABLE]
and the remainders and are defined in (5.22) and satisfy the following estimates: for any integer such that
[TABLE]
where and the constants depend only on the tensors .
Remark 5.2*.*
We verify that the definition (5.1) of ensures the remainder to have maximal order in terms of in the second estimate in (5.4). More specifically, among the right-hand side of the form , , (5.1) is the only one that ensures for all even such that . This affirmation is proved in Remark 5.6.
The result of Theorem 5.1 relies on inductive Boussinesq tricks. Let us summarize this process. We start from the expression of given by the effective equation (2.1), which we rewrite as
[TABLE]
where is defined in (5.1) (see Remark 5.2). The result for trivially follows (5.5) with and (defined in (5.10) below). Let us then assume that is an even number such that . In the right-hand side of (5.5), we inductively substitute (using (5.5) itself) in the terms of order to . To understand this technical process at best, let us define inductively some quantities and functions. Note that these definitions arise in the result of Lemma 5.3, which exhibits the decomposition process of one Boussinesq trick.
We define the tensors
[TABLE]
and
[TABLE]
Associated with the tensors and , we define for the given the functions
[TABLE]
With these notations, we verify that (5.5) reads (recall the definition of in (5.1))
[TABLE]
where the remainders are if and
[TABLE]
otherwise.
The proof is divided into three steps. In the first step (Lemma 5.3), we apply one Boussinesq trick: in , we use (5.5) to substitute and decompose the result into terms of interest plus remainders. In the second step (Lemma 5.4), the decomposition is used inductively to obtain a first version of Theorem 5.1, which involves the tensor instead of . The final step is to prove that and are equal (Lemma 5.5).
Lemma 5.3**.**
The functions defined in (5.8) satisfy the relations ((5.11a) and (5.11b) hold only if )
[TABLE]
where the remainders and are defined in (5.16), (5.17), (5.19), and (5.20).
Lemma 5.4**.**
The effective solution of (2.1) satisfies the equality
[TABLE]
where is the tensor defined as
[TABLE]
and the remainders and are defined in (5.22) and satisfy the estimates (5.4).
Lemma 5.5**.**
For , the tensor , defined in (5.13), equals the tensor , defined in (5.3).
Remark 5.6*.*
Let us explain how the definition of is obtained. Assuming that is unknown, (5.9) reads . Using inductively (5.11a) and (5.11c), which hold independently of , we obtain (5.12) with defined as
[TABLE]
We want to build so that has order for all even . Inserting the ansatz , where are unknown, we obtain (after some work)
[TABLE]
Canceling the terms of order to , we obtain and an inductive definition for , . We then verify by induction that for , i.e., is defined as (5.1).
*Proof of Lemma 5.3. * To slightly simplify the notation, Let us denote . We first prove (5.11a). Using (5.5), we substitute in and obtain
[TABLE]
where the remainder is if and
[TABLE]
otherwise. In order to decompose the terms in (5.14), we study the two index sets (denoting )
[TABLE]
where we recall that . We verify that these sets can be written as
[TABLE]
Hence, we rewrite (5.14) as
[TABLE]
where the remainder is
[TABLE]
Using the definitions of in (5.7) and in (5.6), we verify that the two sums in (5.15) match and , respectively. That proves (5.11a).
Next, let us prove (5.11b). Using the definition of in (5.1) and recalling (5.8c) and (5.8d), we have
[TABLE]
As done above, we decompose the sum and use the expression of to obtain
[TABLE]
where the remainder is
[TABLE]
Using the definitions of in (5.6) and in (5.8c), we obtain (5.11b).
Next, we prove (5.11c). From the definition of in (5.8b), we use (5.5) to get
[TABLE]
where the remainder is
[TABLE]
The first term of the right-hand side of (5.18) matches the definition of in (5.8a). That proves (5.11c).
Finally, let us prove (5.11d). From the definition of , we verify that (5.11d) holds with defined as
[TABLE]
That concludes the proof of Lemma 5.3.
*Proof of Lemma 5.4. * Starting from (5.9), we use inductively the decompositions in (5.11) and obtain
[TABLE]
We define the remainders as
[TABLE]
where and are defined in (5.10), (5.16), (5.17), (5.19), and (5.20). From the definitions of and , we verify that and satisfy the estimates in (5.4). Next, we have to develop in (5.21). Using the definition of in (5.8a) and exchanging the sums, we find that
[TABLE]
Using the definition of in (5.7), we verify that for , , and for ,
[TABLE]
Combining (5.21), (5.22), (5.23), and (5.24), we obtain (5.12) and the proof of Lemma 5.4 is complete.
*Proof of Lemma 5.5. * We prove by induction on that the tensor , defined in (5.13), equals the tensor , defined in (5.3). The base case is trivially verified as . Then, for , we assume that for and we have to verify that the tensor
[TABLE]
equals , defined in (5.13). Using the induction assumption and (5.13), we have
[TABLE]
Let us denote the triple sum and its summand . Applying the change of indices and exchange the sums twice to get
[TABLE]
Using the definition of in (5.6), we then have
[TABLE]
We change the index in this equality to obtain from (5.25) (recall that )
[TABLE]
This expression matches the definition of in (5.13). Hence, we have proved that for all and the proof of Lemma 5.5 is complete.
5.1.2 Use of the inductive Boussinesq tricks
In the asymptotic expansion in Section 2.1, we need to substitute the terms involving in the development of in (2.5). This task is performed in the following result, obtained thanks to Theorem 5.1.
Lemma 5.7**.**
Define tensors as
[TABLE]
where is defined in (5.3) and let and be the tensor functions in (2.7). Then the following equality holds
[TABLE]
where the remainders and are defined in (5.29), (5.30). In particular, provided sufficient regularity of , has order in the norm.
*Proof of Lemma 5.7. * Let us define . Using Theorem 5.1 and the definition of , we obtain for any choice of even integers :
[TABLE]
where and the remainders are defined as
[TABLE]
with and the remainders defined in (5.22). The first estimate in (5.4) implies that
[TABLE]
Hence, as our goal is for this quantity to have order (see the discussion in Section 2.1), we need to set such that
[TABLE]
Dealing with even and odd indices separately, we verify that the smallest even integer satisfying the above inequality is
[TABLE]
We now rewrite the double sum in the right-hand side of (5.28) separately for even and odd index . For the sum on even index \big{\{}k=2\ell\,:\,0\leq\ell\leq\lfloor\alpha/2\rfloor\big{\}}, we have
[TABLE]
where in the first equality we changed the index and in the second we exchanged the order of summation and used that for any . Similarly, for the sum on odd index \big{\{}k=2\ell-1\,:\,1\leq\ell\leq\lceil\alpha/2\rceil\big{\}}, we have
[TABLE]
Using the two last equalities in (5.28), we gather the sums to find
[TABLE]
Replacing by its definition in (5.29), we obtain (5.27) and that concludes the proof of Lemma 5.7.
5.2 Proof of the a priori error estimate for the family of effective equations (Theorem 2.8)
In this section, we prove Theorem 2.8. Note that the main ingredient of the proof is an adaptation operator based on the adaptation constructed in Section 2.1.
Let us first introduce some notations. We use a bracket \scalebox{2.1}[1.0]{[}{v}\scalebox{2.1}[1.0]{]} to denote the equivalence class of in , and a bold face letter to denote elements of . Note that the Hilbert space is equipped with the inner product \big{(}\scalebox{2.1}[1.0]{[}{v}\scalebox{2.1}[1.0]{]},\scalebox{2.1}[1.0]{[}{w}\scalebox{2.1}[1.0]{]}\big{)}_{{\mathcal{L}^{2}}(\Omega)}=\big{(}v-\langle{v}\rangle_{\Omega},w-\langle{w}\rangle_{\Omega}\big{)}_{{\mathrm{L}^{2}}(\Omega)}. We define the following norm on
[TABLE]
In particular, we verify that a function satisfies \|w\|_{W}=\|\scalebox{2.1}[1.0]{[}{w}\scalebox{2.1}[1.0]{]}\|_{\mathcal{W}}, where is defined in (1.5).
The proof of Theorem 2.8 is structured as follows. First, based on the adaptation defined by (2.3) and (2.7), we define the adaptation operator . Then, using the triangle inequality, we split the error as
[TABLE]
and estimate the two terms of the right-hand side separately.
Let us first discuss the consequences of the assumptions made in the theorem. The fact that the effective equation belongs to the family (Definition 2.6) has two major implications: first, the equation is well-posed; second, the tensors satisfy the constraints (2.15) and thus the cell problems (2.10) are well-posed. Hence, we have the existence and uniqueness of the effective solution and of the correctors . Inductively, we can show that the correctors satisfy the following bound
[TABLE]
where the constant depends only on the ellipticity constant and the reference cell . Let us then investigate the regularity of and . As we assume , the embedding is continuous and the regularity assumption ensures that
[TABLE]
where we recall that (as we have ).
We are now able to define the adaptation operator. Thanks to the regularity of and the correctors, defined in (5.29) belongs to . We can thus define as the unique solution in of
[TABLE]
where is defined in (2.4). The adaptation operator is then defined as
[TABLE]
where is the adaptation constructed in Section 2.1 (see (2.3) and (2.7)):
[TABLE]
Assumption (1.12) ensures that x\mapsto\chi^{k}\big{(}\tfrac{x}{\varepsilon}\big{)}\nabla^{k}_{x}\tilde{u}(t,x) is -periodic. Using the regularity of the correctors and , we verify that the adaptation
[TABLE]
(notice that the regularity of and its derivatives are weaker than that of ).
Define then \boldsymbol{\eta}^{\varepsilon}(t)=\boldsymbol{\mathcal{B}}^{\varepsilon}\tilde{u}(t)-\scalebox{2.1}[1.0]{[}{u^{\varepsilon}(t)}\scalebox{2.1}[1.0]{]} and recall that we developed in Section 2.1. The development in (2.9) together with the cell problems (2.10) ensure that
[TABLE]
where is defined in (2.6) and in (5.29). The following error estimate can then be used to quantify (see [5, Corollary 2.2] or [35, Corollary 4.2.2]).
Lemma 5.8**.**
Assume that , with , satisfies
[TABLE]
where , , and . Then the following estimate holds
[TABLE]
where depends only on the ellipticity constant . If in addition, , then
[TABLE]
In order to estimate the remainder terms in (5.32), we also need the following result.
Lemma 5.9**.**
Let and . Then the following estimate holds
[TABLE]
where the constant depends only on and .
Proof.
Recall that and . As satisfies (1.12), the numbers are integers and the cells constituting belongs to the set . Denoting , the domain satisfies
[TABLE]
Hence, almost every can be written as for some . For such triplet , the -periodic function satisfies \gamma\big{(}\tfrac{x}{\varepsilon}\big{)}=\gamma(\xi+y)=\gamma(y). Let be an open set with a boundary, that contains and is contained in its neighborhood, i.e.,
[TABLE]
As has a boundary and , Sobolev embedding theorem ensures that the embedding is continuous. Hence, there exists a constant , depending only on , such that
[TABLE]
We now prove (5.33). Using (5.34), we have
[TABLE]
where we made the change of variables . As , we have
[TABLE]
where is the function of defined by v_{\xi,\varepsilon}(y)=v\big{(}\varepsilon(\xi+y)\big{)}. Using (5.35) gives . Furthermore, we have
[TABLE]
As and , the change of variable leads to
[TABLE]
where we used that every cell belongs to the neighborhoods of cells (including itself). This proves (5.33) and the proof of the lemma is complete. ∎
With Lemma 5.9, we can estimate the remainders in (5.32). Using (5.29) and estimate (5.4), we obtain
[TABLE]
From (5.30), we verify that and thus
[TABLE]
Similarly, using (5.4) to estimate (2.6) and (5.29), we verify that
[TABLE]
Remark 5.10*.*
From (5.29), we verify that
[TABLE]
Referring to Remark 5.2, the definition of ensures that the second term has order . Hence, ensures a lower constant in the second estimate in (5.38).
With these estimates, we are able to prove Theorem 2.8.
*Proof of Theorem 2.8. * We have to estimate both error terms the right-hand side of (5.31). Using Lemma 5.8 and (5.38), we verify that satisfies the estimate
[TABLE]
where . Hence, from the definition of , we deduce that
[TABLE]
Next, applying Lemma 5.8 with \boldsymbol{\eta}^{\varepsilon}(t)=\boldsymbol{\mathcal{B}}^{\varepsilon}\tilde{u}(t)-\scalebox{2.1}[1.0]{[}{u^{\varepsilon}(t)}\scalebox{2.1}[1.0]{]} (see (5.38)), we obtain
[TABLE]
where we used that for , . Using (5.39) and (5.40) in (5.31) proves estimate (2.17) and the proof of Theorem 2.8 is complete.
5.3 A symmetrized tensor product of symmetric positive definite matrices is positive definite
(proof of Lemma 3.1)
Lemma 3.1 states that the tensor is positive definite, where is the homogenized tensor. We prove here that this property is true for any symmetric, positive definite matrix.
A first important result is the following.
Lemma 5.11**.**
Let be a positive definite tensor and let be a symmetric, positive definite matrix. Then the tensor of defined by is positive definite.
Proof.
As is symmetric positive definite, the Cholesky factorization provides an invertible matrix such that . For , we thus have
[TABLE]
As is positive definite, the equality holds if and only if for all . Let be arbitrarily fixed and denote . Hence, we have for all , which is equivalent to . As is regular, we obtain that . We have proved that the equality in (5.41) implies . Hence the tensor is positive definite and the proof of the lemma is complete. ∎
With Lemma 5.11 at hand, we are able to prove the following result, which implies Lemma 3.1.
Lemma 5.12**.**
If is a symmetric, positive definite matrix, then the tensor is positive definite.
Proof.
We proceed by induction on . The case is ensured by [5, Lemma 4.1] (it can also be deduced from Lemma 5.11). We assume that the result holds for and prove it for . Let . First, assume that is odd. Then, the product is composed of terms of the form
[TABLE]
i.e., one of the factor share on index with both entities of . The induction hypothesis combined with Lemma 5.11 ensure that all these terms are strictly positive and thus is positive definite. Second, we assume that is even. Then, the product is composed of terms of two forms. First, there are terms of the form (5.42). By the same induction argument as before, they are strictly positive. Second, terms of the form
[TABLE]
Altogether, we verify that and the proof of the lemma is complete. ∎
5.4 Proof of the new relation between the correctors (Theorem 3.5)
We prove the result for . Note that in the case , we adopt the convention that empty sums vanish, i.e., . For the sake of clarity, we assume that so that .
In Section 2.1, we explained that the cell problems (2.10) are well-posed if and only if . Let us then replace by in the expression of the cell problems (2.10). For , let be the first zero mean correctors. We define the tensors as
[TABLE]
Note that the symmetry of ensures the following symmetry relations for and :
[TABLE]
Furthermore, using the test function in the cell problem for in (2.10) and the symmetry of , we obtain the following relations
[TABLE]
Define then the tensor as
[TABLE]
Using the definition of and (5.43), we verify that
[TABLE]
where in the second equality we changed the index . Using (5.44), we decompose the tensor as
[TABLE]
where the tensors , and are
[TABLE]
The rest of the proof relies on the following result.
Lemma 5.13**.**
The tensors defined above satisfy the following relations:
[TABLE]
where is the tensor defined in (3.9).
While the proof of (i) and (ii) is direct, the proof of (iii) requires preliminary work, done in the two following lemmas.
Lemma 5.14**.**
The tensors satisfy
[TABLE]
where for the sum on the right-hand side vanishes.
Lemma 5.15**.**
The tensor defined in (5.48) satisfies , where is the tensor defined in (3.9).
*Proof of Lemma 5.14. * Let us denote z^{j,k}=\big{\langle}{g^{k-j}\otimes\chi^{j}\otimes\chi^{2r-k}}\big{\rangle}_{Y}. As and the correctors have zero mean, we verify that . Hence, can be written as . Splitting the sum and making the change of index , we write for
[TABLE]
As we verify that , we can write
[TABLE]
As is nonzero only for even index (see (5.26)), we have for all , . In particular, for all , we have which ensures that . Hence, changing the summation order, we find
[TABLE]
Furthermore, we verify that
[TABLE]
Summing the two last equalities we obtain (5.48) and the proof is complete.
*Proof of Lemma 5.15. * Lemma 2.4 implies that . Hence, the only nonvanishing terms in the double sum
[TABLE]
are . These terms are exactly given by
[TABLE]
We verify that the expression of in (3.9) corresponds precisely to the sum on these two sets of index, i.e., .
We now prove Lemma 5.13.
*Proof of Lemma 5.13. * Let us start by proving (i). Using the definition of , we have
[TABLE]
where in the second equality we changed the index . As , we obtain equality (i).
Next, we prove (ii). Using again the definition of , we find
[TABLE]
where we changed the index . The symmetry (5.43) implies that . Hence, noting that , we obtain (ii).
Finally, we prove (iii). With the definition of , we find
[TABLE]
where we made the changes of index and , respectively. As , using Lemma 5.14 we obtain
[TABLE]
As and the correctors have zero mean, we verify that . Using Lemma 5.15, we obtain and (iii) is proved.
With Lemma 5.13 at hand we can prove Theorem 3.5.
*Proof of Theorem 3.5. * Combining (5.46), (5.47) and Lemma 5.13 yields
[TABLE]
We verify that the tensors and , defined in (3.7) and (3.9), respectively, can be written as
[TABLE]
Hence, we deduce from (5.49) that
[TABLE]
This equality matches the decomposition (3.8) and the proof of Theorem 3.5 is complete.
6 Conclusion
In this paper, we presented a family of effective equations for wave propagation in periodic media for arbitrary timescales. In particular, for any given , our main result (Theorem 2.8) ensures the effective solutions to be close to in the norm. As emphasized, the effective equations are well-posed without requiring any regularization process. In addition, we described a numerical procedure to compute the effective tensors of equations in the family. We showed that the computational cost of this procedure can be significantly reduced by using a new relation between the correctors. This relation should also be used to compute the tensors of the alternative effective model available in the literature.
One question that is raised is how to find the best effective equation in the family? More precisely, can we find a criterion to find an optimal equation in the family and can we build such an equation explicitly? These interrogations also concern the effective models from [9] and [13]. Answers to these questions are exciting topics left for future research.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Abdulle, A., Grote, M.J.: Finite element heterogeneous multiscale method for the wave equation. Multiscale Model. Simul. 9 (2), 766–792 (2011)
- 2[2] Abdulle, A., Grote, M.J., Stohrer, C.: Finite element heterogeneous multiscale method for the wave equation: long-time effects. Multiscale Model. Simul. 12 (3), 1230–1257 (2014). DOI 10.1137/13094195 X . URL http://dx.doi.org/10.1137/13094195 X · doi ↗
- 3[3] Abdulle, A., Henning, P.: Chapter 20 - multiscale methods for wave problems in heterogeneous media 18 , 545–576 (2017). DOI https://doi.org/10.1016/bs.hna.2016.10.007 . URL http://www.sciencedirect.com/science/article/pii/S 1570865916300382
- 4[4] Abdulle, A., Henning, P.: Localized orthogonal decomposition method for the wave equation with a continuum of scales. Math. Comp. 86 (304), 549–587 (2017). DOI 10.1090/mcom/3114 . URL http://dx.doi.org/10.1090/mcom/3114 · doi ↗
- 5[5] Abdulle, A., Pouchon, T.: Effective models for the multidimensional wave equation in heterogeneous media over long time and numerical homogenization. Math. Models Methods Appl. Sci. 26 (14), 2651–2684 (2016). DOI 10.1142/S 0218202516500627 . URL http://www.worldscientific.com/doi/abs/10.1142/S 0218202516500627
- 6[6] Abdulle, A., Pouchon, T.: A priori error analysis of the finite element heterogeneous multiscale method for the wave equation over long time. SIAM J. Numer. Anal. 54 (3), 1507–1534 (2016)
- 7[7] Abdulle, A., Pouchon, T.: Effective models for long time wave propagation in locally periodic media. SIAM J. Numer. Anal. 56 (5), 2701–2730 (2018)
- 8[8] Allaire, G., Briane, M., Vanninathan, M.: A comparison between two-scale asymptotic expansions and Bloch wave expansions for the homogenization of periodic structures. Se MA J. 73 (3), 237–259 (2016)
