Wavelet-based Edge Multiscale Finite Element Method for Helmholtz problems in perforated domains
Shubin Fu, Guanglian Li, Richard Craster, Sebastien Guenneau

TL;DR
This paper presents a wavelet-based multiscale finite element method for efficiently solving high-frequency Helmholtz problems in perforated domains, demonstrating convergence and effectiveness through numerical tests.
Contribution
It introduces a novel wavelet-based edge multiscale finite element method tailored for Helmholtz problems in perforated domains, allowing for large wavenumbers and providing proven convergence.
Findings
O(H) convergence under certain conditions
Effective for high wavenumbers in perforated domains
Validated by extensive 2D numerical experiments
Abstract
We introduce a new efficient algorithm for Helmholtz problems in perforated domains with the design of the scheme allowing for possibly large wavenumbers. Our method is based upon the Wavelet-based Edge Multiscale Finite Element Method (WEMsFEM) as proposed recently in [14]. For a regular coarse mesh with mesh size H, we establish O(H) convergence of this algorithm under the resolution assumption, and with the level parameter being sufficiently large. The performance of the algorithm is demonstrated by extensive 2-dimensional numerical tests including those motivated by photonic crystals.
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.
Wavelet-based Edge Multiscale Finite Element Method for Helmholtz problems in perforated domains
Shubin Fu Department of Mathematics, The Chinese University of Hong Kong, Hong Kong Special Administrative Region. ([email protected])
Guanglian Li Corresponding author. Department of Mathematics, Imperial College London, London SW7 2AZ, UK. ([email protected], [email protected]). GL acknowledges the support from the Royal Society through a Newton international fellowship. GL also acknowledges a Research Impulse grant awarded by Department of Mathematics, Imperial College London.
Richard Craster Department of Mathematics, Imperial College London, London SW7 2AZ, UK. ([email protected])
Sebastien Guenneau Aix Marseille Univ, CNRS, Centrale Marseille, Institut Fresnel, Marseille, France.
Abstract
We introduce a new efficient algorithm for Helmholtz problems in perforated domains with the design of the scheme allowing for possibly large wavenumbers. Our method is based upon the Wavelet-based Edge Multiscale Finite Element Method (WEMsFEM) as proposed recently in [14]. For a regular coarse mesh with mesh size , we establish convergence of this algorithm under the resolution assumption, and with the level parameter being sufficiently large. The performance of the algorithm is demonstrated by extensive 2-dimensional numerical tests including those motivated by photonic crystals.
1 Introduction
The wave propagation through, and scattering from, complex multiscale structures is an important area of modern wave physics. The wave manipulation and control achievable by photonic crystals [18, 37], and more recent metamaterial devices [6, 8, 25, 35], underlie a host of wave devices in electromagnetism, optics and acoustics such as optical fibres, interferometers, mode converters, biosensors, thin-film optics for reflection control, optical switching and filtering and much more.
The canonical model problem is posed in terms of the Helmholtz equation in a perforated domain (see Figure 1):
[TABLE]
Here, we assume , the wavenumber is real and positive, is the imaginary unit, is the perforated domain (the potentially complex structure as a model of a photonic crystal) to be defined in detail later, denotes the interface between the perforations and the perforated domain , and refers to the outer boundary. Complications arise in resolving the fine structure in the solution when is large, at high frequencies, and this is the regime often of interest in applications.
A key ingredient in any device design, or investigation of a physical effect, is the accurate, and fast, numerical simulation of the multiscale structures of interest. This has been the subject of intense and concentrated research over many years with a variety of techniques employed, the plane wave expansion methods [18, 19] are popular, as are multipole, Rayleigh, methods [37], finite difference time domain (FDTD) [20] and of course finite elements [37] figure strongly due to their versatility. Commercial finite element codes such as COMSOL [5] and FDTD such as Lumerical [24], dominate industry in terms of practicality, but there is a clear need for more modern implementations of finite-element based numerical methods in this field; many of the most interesting effects of topical interest are in three dimensions, such as flat lensing [9], antennas, or involve delicate changes in geometry, as in topological photonics [23], and may involve many tens, hundreds or even thousands of cells, each on the micro-scale, forming a macro-scale object where the wavelengths may be commensurate with the micro-scale; standard long-wave homogenisation is inappropriate and standard finite element approaches struggle to cope with the sheer size of memory required.
Separate from this area of physics, there has been extremely active research in the modern theory of finite elements and, in particular, on the development of efficient multiscale methods for practical applications with heterogeneous inseparable multiple scales. Due to this disparity of scales, classical numerical treatments become prohibitively expensive, and even intractable, for many multiscale applications. Nonetheless, motivated by the broad spectrum of practical applications, a large number of multiscale model reduction techniques, e.g., multiscale finite element methods (MsFEMs), heterogeneous multiscale methods (HMMs), variational multiscale methods, flux norm approach, generalized multiscale finite element methods (GMsFEMs) and localized orthogonal decomposition (LOD), have been proposed in the literature [2, 11, 10, 16, 17, 22, 27] over the last few decades. They have achieved great success in the efficient and accurate simulation of heterogeneous problems; we extend GMsFEMs using wavelets and furthermore investigate their application to the class of wave problems that encompass photonic crystals.
Designing efficient numerical solvers for Helmholtz equations with large wavenumbers has also attracted considerable attention over the past few decades; one of the main challenges is to reduce the so-called wavenumber dependent pollution effect [15, 30]. Mitigating the pollution effect, even for wave propagation through regular structures with homogeneous physical properties, requires an extremely fine mesh with grid size depending on the wavenumber , or a very high polynomial degree within the basis. Consequently this results in an extremely expensive numerical scheme when the computational domain, or the wavenumber, is large. Numerical routes based even just around MsFEMs have not been explored in this context, and one would anticipate that they might result in efficient numerical solvers for wave propagation through complex multiscale structures; the WEMsFEM we develop fits broadly into the MsFEM framework but with generalisations and extensions. It is worthwhile noting that, for multiscale problems, the LOD approach has been investigated with [32, 33] having proposed numerical homogenization to eliminate the pollution effect for Helmholtz problems in heterogeneous media, however this is different from perforated domains and so their analysis does not carry over directly.
In this article we introduce a Wavelet-based Edge Multiscale Finite Element method (WEMsFEM) for Helmholtz equations in perforated domains, our Algorithm 1, inspired by the new multiscale algorithm proposed in [14, 21] for elliptic equations with heterogeneous coefficients. WEMsFEM takes advantage of the framework of GMsFEM [11], and utilizes the Partition of Unity Method (PUM) [36] as the essential component, and extends these approaches with additional novel ingredients that include a rather cheap local solver and provable convergence rate [14].
The main challenges in Problem (1.1) lie in accurately describing the interfaces, possibly a large number of perforations, and a large computational domain. The main idea of WEMsFEM is to utilize wavelets to approximate the solution restricted on the coarse edges, and then transfer this approximation property to the interior error estimate. Note that the coarse mesh cannot resolve the interfaces, nonetheless under the Scale Resolution Assumption (3.1) that the coarse mesh grid , with being the wavenumber, we will prove in Proposition 4.1 that the error of our proposed multiscale algorithm in the energy norm is of given the wavelet parameter with being a stability constant defined as in (2.5).
The remainder of this paper is constructed as follows: We first present, in Section 2, the detailed problem and its basic properties. The Wavelet-based Edge Multiscale Finite Element Method (WEMsFEM) is introduced in Section 3 to solve this problem, and its convergence is analyzed in Section 4. Furthermore, we present in Section 5 extensive numerical tests to demonstrate the performance of our proposed algorithm. Finally, we draw together our results for discussion in Section 6.
2 General setting
In this section we present the general setting of the Helmholtz problem in a perforated domain; we also provide basic properties and results pertinent to the problem, and an outline of the construction of an ansatz space based on GMsFEM.
We start with the geometric setting of the domain for Problem (1.1). Let be the reference periodicity cell in with and we take with infinite smooth boundary . Denoting as one unit cell with size , then the contracted set is one cell of the crystal with size ; , and its -periodic cloning, , are defined as
[TABLE]
Let be a bounded Lipschitz domain, and also let and denote by , then the computational domain is
[TABLE]
We introduce the complex-valued space , equipped with the -weighted norm
[TABLE]
and similarly define the complex-valued space also equipped with the -weighted norm for all . Throughout this paper, we denote as the inner product for any Lipschitz domain , , and the real part, the imaginary part and the conjugate of a complex value.
The numerical approach we advance uses the weak formulation for problem (1.1) which is to find such that
[TABLE]
Here, the sesquilinear form has the form
[TABLE]
The following properties of the sesquilinear form play a critical role, these can be found, e.g., in [31, Theorem 3.2 and Corollary 3.3]:
Theorem 2.1** (Properties of the sesquilinear form ).**
The following properties hold:
The sesquilinear form is bounded: There exists a wavenumber independent constant, , satisfying:
[TABLE]
- 2.
The following Gårding’s inequality holds:
[TABLE]
The well-posedness of Problem (2.2) can be found, e.g., in [29, Proposition 8.1.3]. Furthermore, there exists some constant, , that may depend on the wavenumber and also on the perforated domain , such that the unique solution to Problem (2.2) fulfills
[TABLE]
Next, we introduce the dual problem to Problem (2.2). For any , let be
[TABLE]
then
[TABLE]
2.1 Ansatz space
Since the Gårding’s inequality in Theorem 2.1, combined with the approximation properties of an ansatz space, implies the quasi-optimality of the conforming Galerkin formulation, we now introduce the basic construction of the ansatz space.
Let be a regular partition of the domain into finite elements with a mesh size . We refer to this partition as coarse grids, and the produced elements as the coarse elements. For each coarse element , is further partitioned into a union of connected fine grid blocks. The fine-grid partition is denoted by with being its mesh size. Over the fine mesh , let be the conforming piecewise linear finite element space:
[TABLE]
where denotes the space of linear polynomials on the fine element . Then the fine-scale solution satisfies
[TABLE]
The GMsFEM, with which our WEMsFEM shares features and builds from, aims at solving Problem (2.6) on the coarse mesh cheaply, whilst simultaneously maintaining a certain accuracy as compared to the fine-scale solution . To describe the GMsFEM, we need some notation: The vertices of are denoted by , with being the total number of coarse nodes. The coarse neighborhood associated with the node is denoted by
[TABLE]
The overlap constant is defined by
[TABLE]
We refer to Figure 2 for an illustration of neighborhoods and elements subordinated to the coarse discretization . Throughout, we use to denote a coarse neighborhood.
Next, we outline the GMsFEM with a conforming Galerkin (CG) formulation. We denote by the support of the multiscale basis functions. These basis functions are denoted by for for some , which is the number of local basis functions associated with . Throughout, the superscript denotes the -th coarse node or coarse neighborhood . Generally, the GMsFEM utilizes multiple basis functions per coarse neighborhood , and the index represents the numbering of these basis functions. In turn, the CG multiscale solution is sought as . Once the basis functions are identified, the CG global coupling is given through the variational form
[TABLE]
Here, denotes the ansatz space.
3 WEMsFEM
We now present our main multiscale method to efficiently solve Problem (1.1) and note that we are especially interested in the cases where the size of the cell is very small and the wavenumber is large. Our method is based on the edge multiscale method proposed in [14]. The main idea is to utilize the wavelets to approximate and then transfer this approximation property into the error over the global domain . For the completeness of the presentation, we introduce the wavelets in the following section, the details of which are also found, e.g., in [14].
3.1 Haar wavelet
Let the level parameter and the mesh size be and with , respectively, then the grid points on level are
[TABLE]
Let the scaling function and the mother wavelet be given by
[TABLE]
By means of dilation and translation, the mother wavelet can result in an orthogonal decomposition of the space with . To this end, we can define the basis functions on level by
[TABLE]
The subspace of level is
[TABLE]
and we note that subspace is orthogonal to in for any two different levels . We denote the subspace in , up to level , by defined by
[TABLE]
The orthogonality of the subspaces on different levels leads to the relation
[TABLE]
and, consequently, yields the hierarchical structure of the subspace , namely,
[TABLE]
Furthermore, the following orthogonal decomposition of the space holds
[TABLE]
Note that one can derive the hierarchical decomposition of the space for by means of the tensor product. The following approximation property holds [14, Proposition 3.1]:
Proposition 3.1** (Approximation properties of the hierarchical space in [14]).**
Let be -orthogonal projection onto for each level and let . Then there holds
[TABLE]
3.2 The method
We propose our main multiscale algorithm in this section, specifically the corresponding multiscale basis functions are defined locally on each coarse neighborhood independently, and thereby are calculated in parallel. Essentially, we apply wavelets to approximate the solution restricted on each coarse edge. To obtain conforming global basis functions, we utilize the Partition of Unity finite element method [12, 28]; the main idea is to seek local multiscale basis functions in each coarse neighborhood, having certain approximation properties to the exact solution restricted on each coarse neighborhood, and use the fact that the global multiscale basis functions, obtained from those local multiscale basis functions by the partition of unity functions, inherit these approximation properties.
To this end, we begin with an initial coarse space , with the as the standard multiscale basis functions on each coarse element defined via
[TABLE]
Here is affine over with for all and we recall that are the set of coarse nodes on .
Algorithm 1 proceeds as follows: We first construct the local multiscale basis functions on each coarse neighborhood . Given level parameter , and the four coarse edges with , i.e., , we let be the Haar wavelet up to level on the coarse edge . Introducing to be the edge basis functions on , then becomes a good approximation space of dimension to the trace of the solution over , i.e., .
Subsequently, we calculate the local multicale basis functions on each coarse neighborhood with all possible Dirichlet boundary conditions in , and denote the resulting local multiscale space as in Step 2. We can then define the global multiscale space as and obtain the multiscale solution in Steps 3 and 4.
Note that all the global multiscale basis functions in fulfill the interface condition, i.e. they satisfy the Neumman boundary condition on every interface of every inclusion, as in the second equation in (1.1). This is due to the construction of the partition of unity functions in (3.1).
3.3 Local projection
An important element of our algorithm is the knowledge of the approximation properties to the edge basis functions on each coarse neighborhood .
Let the -orthogonal projection onto the local multiscale space up to level : be defined by
[TABLE]
Here, we denote for as the Haar wavelet defined on the four edges of of level and the local operator is defined in Algorithm 1.
Let be the diameter of the bounded domain . Define
[TABLE]
Then the positive constants and are independent of the wavenumber and the coarse mesh . Note that we will utilize the same constant to denote the constant from the Poincaré inequality.
Assumption 3.1** (Scale Resolution Assumption).**
We assume that the coarse mesh size is sufficiently small to satisfy the following inequality
[TABLE]
To simplify the notation, we denote
[TABLE]
Remark 3.1**.**
Similar resolution assumption as Assumption 3.1 is commonly seen in the literature, e.g., [31]. If we take the coarse scale mesh grid , then .
4 Convergence rate of Algorithm 1
The convergence rate of this algorithm is clearly an important detail and, perhaps remarkably, this can be obtained. The proof is inspired by the techniques developed in [14, 21], where a local decomposition of the solution restricted on each coarse neighborhood for , namely, , is introduced. We also analyze the local approximation properties of the multiscale basis functions constructed in Step 2, Algorithm 1 to each component of the decomposition of in Section 4.1. Subsequently, the global approximation properties of the ansatz space and the convergence of Algorithm 1 are investigated in Section 4.2.
4.1 Local decomposition of the solution
The solution satisfies the following equation
[TABLE]
which can be split into three parts, namely
[TABLE]
Here, the three components , and are respectively given by
[TABLE]
[TABLE]
and
[TABLE]
Here, \mathchoice{{\vbox{\hbox{\textstyle- }}\kern-7.83337pt}}{{\vbox{\hbox{\scriptstyle- }}\kern-5.90005pt}}{{\vbox{\hbox{\scriptscriptstyle- }}\kern-4.75003pt}}{{\vbox{\hbox{\scriptscriptstyle- }}\kern-4.25003pt}}\!\int_{\omega_{i}}v:=|\omega_{i}|^{-1}\int_{\omega_{i}}v\,\mathrm{d}x denotes the average of the function over each coarse neighborhood . Recall that is defined in Step 2 of Algorithm 1.
We first show that is negligible thanks to the local basis function :
Lemma 4.1**.**
Let the Scale Resolution Assumption 3.1 be valid. Let be defined in (4.2) and let . Then there holds
[TABLE]
Proof.
Multiplying (4.2) by , and taking its integral over , leads to
[TABLE]
wherein an application of Hölder’s inequality and the Poincaré inequality proves
[TABLE]
After moving the first term on the right of the previous estimate to the left, and noting the Scale Resolution Assumption 3.1, we obtain
[TABLE]
Finally, an application of the Poincaré inequality and the Scale Resolution Assumption 3.1 shows the desired assertion. ∎
Recalling that is the solution to Problem (2.4) for given , analogously to Decomposition (4.1), the following decomposition is valid:
[TABLE]
Then a similar argument as in Lemma 4.1 leads to the following estimate:
Lemma 4.2**.**
Let the Scale Resolution Assumption 3.1 hold. Let be defined in (4.3) and let . Then it holds that
[TABLE]
Remark 4.1** (On the decomposition (4.1) and (4.3)).**
Following from Lemmas 4.1 and 4.2, only one multiscale interial basis function in Step 2 of Algorithm 1 is sufficient if convergence rate is desired or sufficient. Otherwise, one can construct extra local multiscale basis functions to approximate the first component .
Since is of rank-one, which can be represented with one multiscale basis function in Decomposition (4.1). Lemma 4.1 indicates that we need only construct a proper ansatz space for the second part to ensure a good ansatz space for . We now prove that the multiscale basis functions, constructed in Step 2 of Algorithm 1, span an appropriate ansatz space with good approximation properties:
Theorem 4.1** (Approximation properties of the projection ).**
Let Assumption 3.1 hold and let satisfy
[TABLE]
Then it holds that
[TABLE]
Proof.
We can obtain from Theorem A.1:
[TABLE]
Whereas an application of [14, Eqn. (5.6)] leads to
[TABLE]
We only need to estimate . Note that satisfies
[TABLE]
A similar estimate as used in the proof to Lemma 4.1 shows that
[TABLE]
Finally, an application of the triangle inequality proves
[TABLE]
and this, together with (4.5), proves the desired assertion. ∎
4.2 Approximation properties of the ansatz space
The approximation properties of the ansatz space follow from the theorem below:
Theorem 4.2** (Approximation properties of the multiscale space ).**
Let Assumption 3.1 hold and assume that . Let and be the solution to Problem (1.1). There then holds
[TABLE]
Furthermore, let and let be the solution to Problem (2.4). Then it holds
[TABLE]
Here, is a positive constant independent of the wavenumber or coarse mesh size .
Proof.
We will only prove the first assertion (4.6) since the second assertion (4.7) can be derived in a similar manner.
Recall the local decomposition in (4.1) on each coarse neighborhood for . Let
[TABLE]
We prove that is a good approximation to .
Denote . Then the property of the partition of unity of leads to
[TABLE]
Taking its squared energy norm, and using the overlap condition (2.8), we arrive at
[TABLE]
Then Young’s inequality implies
[TABLE]
Using the product rule, and the Poincaré inequality, we obtain
[TABLE]
Then Lemma 4.1 yields
[TABLE]
Analogously, we can derive the following upper bound for the second term by Theorem 4.1:
[TABLE]
Inserting these two estimates into (4.2), and utilizing the overlapping condition (2.8), leads to
[TABLE]
Furthermore, inserting (2.3) into (4.10) shows (4.6). This completes the proof. ∎
Finally, we are ready to present the main result of this section:
Proposition 4.1** (Error estimate for Algorithm 1).**
Assume that and let the coarse mesh size and the level parameter satisfy
[TABLE]
Let and be the solution to Problem (1.1), and from Algorithm 1, respectively. There holds
[TABLE]
Proof.
Since , Gårding’s inequality in Theorem 2.1 implies
[TABLE]
for all .
Next we estimate : Let be the solution to
[TABLE]
then for all we obtain that
[TABLE]
Furthermore, an application of Theorem 2.1 leads to
[TABLE]
By (4.7), and condition (4.11), we arrive at
[TABLE]
This, together with (4.13), leads to
[TABLE]
Consequently, we obtain
[TABLE]
Finally, an application of the boundedness of the sesquilinear form Theorem 2.1 and the approximation property (4.12) prove the desired assertion. ∎
5 Numerical experiments
We present numerical experiments to show the performance of Algorithm 1 with locally periodic perforations in Sections 5.1 and 5.2, and with random perforations in Section 5.3. We consider two different source excitations placed at and for each model, and take the wavenumber .
The coarse mesh is a regular partition of the domain into finite elements with a mesh size . Then each coarse element is further partitioned into a union of connected fine grid blocks. The fine-grid partition is denoted by , which provides a sufficiently fine mesh for standard finite element solvers to get a reference solution; for sufficient accuracy we take . In addition, the Perfectly Matched Layer (PML) is utilized to absorb the outgoing wave, see Appendix B for more details.
As is usual in the finite element literature we use the and -relative errors to assess the accuracy of the scheme, which are defined by
[TABLE]
5.1 Performance of Algorithm 1: level
parameter
We consider in this section the two perforated models as shown in Figure 1. To describe the computational domain , we use Eq.(2.1). Let , and the size of the cell . The perforations in a unit cell are and in models 1 and 2. Note that there are perforations in both models, this strong heterogeneity in the computational domain makes Problem (1.1) even harder.
Figure 3 demonstrates dynamic anisotropy, also known as self-collimation, [3, 34] which is a striking, frequency sensitive and dependent, effect. Naively, one might assume that wave excitation of the crystal, at its centre, would lead to isotropic wavefronts within the crystal; this is indeed the case in the standard homogenisation, low-frequency long-wave, limit where the wavelength is much larger than the cell-to-cell spacing. However, as the frequency increases and wavelength decreases, Bragg scattering occurs with constructive or destructive interference leading to well-defined frequency windows (band-gaps) within which wave propagation is disallowed. Interference also occurs that acts to create anisotropic wavefronts with the most severe example being that where all the wave energy is channeled in specific directions; in terms of homogenisation there are variants that are developed for high-frequencies [7] that show the effective medium PDE changing its character from elliptic to hyperbolic with these directions of self-collimation being the characteristics of the hyperbolic system [26]. Figure 4 shows lensing, another effect created by the crystal whereby a partial image of the source (on the right) forms to the left of the crystal.
As we can see from Figures 3 and 4, even with , one can observe the wave scattering phenomenon resulting from the perforated structure with clear agreement between the multiscale solution and the reference solution with full capture of the microscale feature of the wavefield; we now quantify this agreement. We test the convergence of Algorithm 1 with respect to the level parameter for both of the perforated domains shown in Figure 1. To this end, we fix the coarse scale mesh size . Recall that the level parameter determines the number of multiscale basis functions in each coarse neighborhood for with as the number of coarse grids; specifically this number is and the level parameter shows the complexity of Algorithm 1.
Figure 5 shows the and -relative errors versus , and both the and -relative errors decay rapidly as more wavelet basis functions are added. For example, for the case that the source lies at the center shown in Figure 5(a), the errors decrease from to as the level parameter increases from [math] to . Figure 5 suggests that Algorithm 1 with level parameter yields an accurate solver with little gain from going to higher .
Similar performance for the perforated domain depicted in model 2 is obtained, see Figures 6 and 7. The second model as compared with the perforated domain in model 1 has the gap between perforations much narrower, we expect stronger singularities and finer structure in the solution, and this provides insight on method robustness. In terms of the physics, the frequency has remained fixed and altering the perforation size alters the dynamic anisotropy slightly, we observe strong directionality and concentration of the highly oscillatory wave field in the narrow gaps.
The relative error decay history is shown in Figure 8 and we find similar relative error decay behavior as in Figure 5 and Algorithm 1 is both efficient and accurate. For instance, for the case that the source lies in the center, the -relative error reaches below even with the level parameter .
5.2 Performance of Algorithm 1:
coarse-scale mesh size
Earlier we established theoretically that the error induced by Algorithm 1 can attain in Proposition 4.1, upon the condition on the coarse mesh size and the level parameter , cf. (4.11). We now test how the algorithm performs with respect to a different, finer, coarse-scale mesh, we take its size , so that the coarse mesh will cross the perforations.
The error decay history for the two different perforated domains, depicted in Figure 1 with centered and right sources, are plotted in Figures 9 and 10, respectively. There is error decay as the level parameter with very rapid decay and we conclude that multiscale solutions with sufficient accuracy are achieved with the level parameter . Comparing with the mesh of , Figures 5 and 8, we conclude that as the coarse-scale mesh size decreases, the performance of Algorithm 1 significantly improves; this agrees with the predictions of Proposition 4.1.
5.3 Performance of Algorithm 1: random
perforations
The motivation for the development of the multiscale WEMsFEM was to emerging problems in finite periodic crystals, but the methodology is not reliant on any periodicity and we investigate the algorithm’s performance in more general situations. A natural case to consider is that of random perforated domains as in Figure 11. The size of the perforation for model 3 is 0.08, and for model 4 is 0.24 and we consider for model 3 and for model 4.
Firstly, we present the reference solution and multiscale solution from Algorithm 1 with model 3 as the perforated domain, a centered source term, a coarse mesh size and level parameter in Figure 12. The -relative error is 3.70%; further decreasing the coarse mesh size or increasing the level parameter improves the accuracy as shown in Figure 13.
Next, we study the performance of Algorithm 1 in the perforated domain of model 4. The perforations in model 4 cross the neighborhood boundary and we depict the resulting four coarse neighborhood in Figure 14. The local solvers in Algorithm 1 are now defined in some L-shaped domains and consequently, the perforated domain of model 4 is much more challenging numerically.
Nonetheless, we observe similar performance as for model 3, with a centered source, and we show the results in in Figure 15; the corresponding -relative error is 3.82%. Analogously to model 3, further increases in the level parameter , or decrease in the coarse grid size , further improve the performance of our algorithm, see Figure 16 for more details.
6 Conclusion
We demonstrate that the Wavelet-based Edge Multiscale Finite Element Method (WEMsFEM) for Helmholtz problems in perforated domains, with possibly large wavenumbers, are an effective alternative to standard Finite Element methods with advantages for multiscale problems. Such problems have many applications in photonic and phononic crystals and having efficient, faster, alternatives to the existing finite element approaches is much needed particularly for crystals created from many cells and operating at high frequencies.
We have created both the required theory, and error estimates, and then tested the convergence analysis and numerical performance of the algorithm against examples of physical interest. Under the usual resolution assumption that the product of the coarse-scale mesh size and the wavenumber is bounded above by a certain constant and the level parameter is sufficiently large, we prove convergence of our methods. Our theoretical results are supported by extensive 2-d numerical simulations. The success of this two-dimensional study has motivated further practical tests of this algorithm for 3-d Helmholtz problems in perforated domains and these are currently under investigation.
Appendix A Very-weak solutions to the Helmholtz problem
We establish in this section an a priori estimate, cf. Theorem A.1, which is utilized in the proof to Theorem 4.1. Throughout this section, is one coarse neighborhood as defined in (2.7) for all .
Let , and be the solution to the following problem:
[TABLE]
[TABLE]
This test space is endowed with the norm :
[TABLE]
Then we propose the following weak formulation corresponding to Problem (A.1): seeking such that
[TABLE]
Theorem A.1**.**
Let the Scale Resolution Assumption 3.1 be valid. Given . Let be the solution to (A.1). Then there holds
[TABLE]
To prove Theorem A.1, one has to first derive the -estimate of the normal trace for any . This is established in the following theorem:
Theorem A.2**.**
Let the Resolution Assumption 3.1 be valid. Let and let satisfy
[TABLE]
Then there holds
[TABLE]
Here, is a positive constant independent of the wavenumber and the mesh size , which can change values among equations.
Proof.
An application of the Poincaré inequality implies
[TABLE]
Testing (A.4) with and applying the Poincaré inequality, together with the former result, we obtain
[TABLE]
Thanks to the Resolution Assumption (3.1), this yields
[TABLE]
Furthermore, by (A.5), we arrive at
[TABLE]
One the other hand, a direct calculation results in
[TABLE]
This, together with (A.7) and the Resolution Assumption (3.1), yields
[TABLE]
Note that the interface has sufficient smoothness, we have the following a priori estimate
[TABLE]
This, together with (A.6) and applying interpolation between and yields the regularity estimate
[TABLE]
Since differentiation is continuous from to , by the trace theorem, we have
[TABLE]
which, together with (A.8) and the Resolution Assumption 3.1, proves the desired assertion. ∎
Proof to Theorem A.1.
The first result can be proved in a similar manner as [21, Theorem A.1], with the help of Theorem A.2.
To prove the second assertion, recall that is the bilinear function supported in and on . Multiplying (A.1) by and applying integration by parts, we arrive at
[TABLE]
Then an application of the Young’s inequality implies
[TABLE]
After taking the square root over the previous estimate, utilizing the first assertion and the Scale Resolution Assumption 3.1, the second assertion is proved. ∎
Appendix B PML for the Helmholtz equation
To effectively absorb the outgoing wave, we adopt the Perfectly Matched Layer (PML) [1, 4] in our implementation. Without loss of generality, let the computation domain including the PML areas be . We follow the notations in [13], we define
[TABLE]
and
[TABLE]
and
[TABLE]
where and are the space variables. is the thickness of the PML. The PML method is to replace with and with , respectively. Then then Equation (1.1) becomes
[TABLE]
In our implementation, we take and the thickness of the PML equals to one wavelength.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J.-P. Berenger. A perfectly matched layer for the absorption of electromagnetic waves. Journal of computational physics , 114(2):185–200, 1994.
- 2[2] L. Berlyand and H. Owhadi. Flux norm approach to finite dimensional homogenization approximations with non-separated scales and high contrast. Arch. Ration. Mech. Anal. , 198(2):677–721, 2010.
- 3[3] D. N. Chigrin, S. Enoch, C. M. S. Torres, and G. Tayeb. Self-guiding in two-dimensional photonic crystals. Optics Express , 11:1203–1211, 2003.
- 4[4] F. Collino and C. Tsogka. Application of the perfectly matched absorbing layer model to the linear elastodynamic problem in anisotropic heterogeneous media. Geophysics , 66(1):294–307, 2001.
- 5[5] COMSOL. www.comsol.com , 2012.
- 6[6] R. V. Craster and S. Guenneau, editors. Acoustic Metamaterials . Springer-Verlag, 2012.
- 7[7] R. V. Craster, J. Kaplunov, and A. V. Pichugin. High frequency homogenization for periodic media. Proc R Soc Lond A , 466:2341–2362, 2010.
- 8[8] T. J. Cui, D. Smith, and R. Liu, editors. Metamaterials . Springer, Boston MA, 2010.
