Introduction
Computational electromagnetism problems require a good mesh quality for an accurate and efficient solution. In general, the mesh density leads to a higher accuracy of the numerical solution, but the increase of unknowns requires high computational resources. A tradeoff between accuracy and computational cost is usually faced in large multiscale problems. One would like good accuracy in the whole object, independent of its smoothness or dimension while saving computational resources.
Several techniques, such as the multilevel fast multipole algorithm (MLFMA) [1], [2], the fast Fourier coupling matrix compression for MLFMA (MLFMA-FFT) [3], or the domain decomposition method (DDM) [4], [5], [6], [7], have been proposed as efficient ways to face the multiscale, large problems. These powerful techniques are usually applied to general-purpose meshes, which could have a high number of unknowns, maybe keeping a fine mesh in regions of the object where it is not needed. The regions where a fine mesh is needed depend on both the geometrical details and the behavior of induced currents, determined by the excitation. These dependencies lead the computational community to look for adaptive techniques that find an optimal mesh for a specific situation, reducing the number of degrees of freedom. These techniques should also be automatic to give optimal discretization without user intervention.
Some methods focus mainly on the refinement due to the geometry, as in the case of scatterers with sharp edges [8], [9]. Other techniques try to find indicators of the discretization quality in two different ways. The first approach is to check the accuracy of the solution via an error estimation residual: Bibby and Peterson [10] and Saeed and Peterson [11] used overdetermined systems via the electric field integral equation (EFIE) for h- and p-refinements, while, in [12] and [13], the jump of the charge and current at cell boundaries is evaluated. A second approach, known as goal-oriented adaptivity, checks the accuracy and efficiency of a quantity of interest [14], [15].
Tobon Vasquez et al. [16] proposed a local mesh refinement technique, for triangular meshes, in the method of moments (MoM) applied to surface integral equations (SIEs). The main goal was to obtain an automatic technique to discretize with a fine mesh only the regions that needed to be refined, after estimating the error of an initial coarse solution. The local refinement led to mesh nonconformity that was faced through half Rao–Wilton–Glisson (RWG) basis functions and discontinuous Galerkin (DG) [17], [18], [19]. The complete problem was first solved for the initial coarse mesh, then a local refinement was implemented to improve the solution accuracy via an error estimation procedure, and, finally, the new discretization was used to compute the solution. Although the error estimation step dealt with a projection on a reference fine mesh, with no need for system matrix inversion, it still involved the filling of a large MoM matrix, coupling far regions with fine meshes. Moreover, in the final problem, filling a large matrix, related to the h-refined mesh, and its inversion were needed. Hence, although the mesh refinement was a localized operation, both the error estimation and final solution were performed globally, due to the coupled nature of the problem, with an evident additional computational cost.
In this work, the numerical inefficiencies of [16] are overcome by a DDM based on Huygens’ equivalence principle to perform the proposed adaptive h-refinement procedure. The basic idea is to isolate the different parts of the structure under analysis and perform the error estimation, the mesh refinement, and the final solution, locally. To isolate each domain of the problem, we propose using Huygens’ equivalence theorem [20], where properly defined equivalent surfaces will act as an intermediary between each domain and all the rest of the object. This proxy, generated at the initial coarse mesh, is used in both the error estimation and the final problem solution, with its main advantage being in the latter. Moreover, the cell-based nature of the error estimation and refinement leads to a mesh nonconformity that, here, is faced with the div-conforming multibranch RWG (MB-RWG) basis function, recently proposed in [21], with no need for extra penalty conditions on the SIE kernel as in [16]. The analysis in this article is focused, without limiting the generality, on the combined field integral equation (CFIE) of perfect-electric-conductor (PEC) structures in a homogenous medium (i.e., air).
This article is organized as follows. Section II presents the used SIE formulation. Section III describes all the steps of the proposed approach using Huygens’ surfaces and the MB-RWG basis functions. Finally, Section IV shows and discusses some numerical results employing the proposed approach to 3-D geometrically complex structures. Preliminary numerical results have been presented in [22] and [23].
Background Formulation
An electromagnetic scattering problem is considered here for a PEC object in a homogeneous medium. We define \begin{align*} &\text {T-EFIE: } \eta \,\mathcal {L}\left \{{\mathbf {J}}\right \} _{\mathrm {tan}} = \mathbf {E}^{\mathrm {i}}_{\mathrm {tan}} \tag{1}\\ &\text {N-MFIE: } \hat {\textbf {n}} \times \mathcal {K}\left \{{\mathbf {J}}\right \} + \frac {\mathbf {J}}{2} = \hat {\textbf {n}} \times \mathbf {H}^{\mathrm {i}} \tag{2}\end{align*}
\begin{align*} \mathcal {L}\left \{{\mathbf {J}}\right \} &= jk \iint _{S} \mathbf {J} (\textbf {r}^{\prime}) g(\mathbf {r},\textbf {r}^{\prime}) dS^{\prime} \\ &\quad +-\frac {1}{j k} \nabla \iint _{S} \mathbf {J}(\textbf {r}^{\prime}) \nabla ^{\prime} g(\textbf {r},\textbf {r}^{\prime}) \,dS^{\prime} \tag{3}\\ \mathcal {K}\left \{{\mathbf {J}}\right \} &= PV \!\!\!\iint _{S} \mathbf {J}(\textbf {r}^{\prime}) \times \nabla ^{\prime} g(\textbf {r},\textbf {r}^{\prime}) \,dS^{\prime} \tag{4}\end{align*}
\begin{equation*} g(\textbf {r},\textbf {r}^{\prime})=\frac {e^{-j k |\textbf {r}-\textbf {r}^{\prime} |}}{4 \pi |\textbf {r}-\textbf {r}^{\prime} |}. \tag{5}\end{equation*}
Combining (1) and (2), we obtain the CFIE \begin{equation*} \mathcal {C^{J}}\{ \mathbf {J}\} = \frac {\alpha \, \mathbf {E}^{\mathrm {i}}_{\mathrm {tan}}}{\eta } + (1-\alpha) (\hat {\mathbf {n}} \times \mathbf {H}^{\mathrm {i}}) \tag{6}\end{equation*}
\begin{equation*} \mathcal {C^{J}}\{ \mathbf {J}\} = \alpha \,\mathcal {L}\left \{{\mathbf {J}}\right \}_{\mathrm {tan}} + (1-\alpha)\left [{ \hat {\mathbf {n}} \times \mathcal {K}\left \{{\mathbf {J}}\right \} + \frac {\mathbf {J}}{2}}\right] \tag{7}\end{equation*}
The MoM procedure is applied to (7), with the equivalent electric current densities approximated as a sum of \begin{equation*} \mathbf {J}\cong \sum _{n=1}^{N} I_{n} \,\mathbf {f}_{n} \tag{8}\end{equation*}
\begin{equation*} \left [{Z}\right] \left [{I}\right] = \left [{V}\right] \tag{9}\end{equation*}
\begin{equation*} \left [{Z}\right] = \left ({\alpha \left [{Z^{\text {EFIE}}}\right] + (1-\alpha)\left [{Z^{\text {MFIE}}}\right]}\right) \tag{10}\end{equation*}
Equation (7) refers to the radiation of the combined (electric and magnetic) fields from the electric current density, \begin{align*}&\hspace {-0.5pc}\mathcal {C^{M}}\{ \mathbf {M}\} = \alpha \left [{-\frac {1}{\eta }\,\mathcal {K}\left \{{\mathbf {M}}\right \}_{\mathrm {tan}} + \frac {1}{2}\, \hat {\mathbf {n}} \times \mathbf {M} }\right] \\& \qquad\qquad\qquad\qquad\qquad\qquad +\,(1-\alpha)\,\frac {1}{\eta } \,\hat {\mathbf {n}} \times \mathcal {L}\left \{{\mathbf {M}}\right \}. \tag{11}\end{align*}
Huygen’s-Based Domain Decomposition and Adaptive H-Refinement
This Section describes how to integrate a Huygens’ surface DDM (HS-DDM) into the adaptive h-refinement technique, going toward a localized approach. In this way, both the error estimation procedure and the h-refined problem solution are performed as local operations.
A. Initial Mesh Solution
We start from an initial coarse mesh that describes the geometry of our problem of interest, with an average discretization size of \begin{equation*} \left [{Z^{0}}\right]\left [{I^{0}}\right]=\left [{V^{0}}\right] \tag{12}\end{equation*}
The current density coefficients vector,
B. Domain Decomposition Through Huygens’ Surfaces
After the initial solution and the definition of the domains, an EHS is defined around each domain. The EHS is based on Huygens’ equivalence principle, where a radiation problem is substituted by an equivalent problem using an imaginary closed surface and fictitious electric and magnetic surface current densities on it, as graphically shown in Fig. 1. This surface acts as a proxy between the enclosed domain and the other regions of the object, isolating the domain and allowing its independent treatment.
Huygens’ equivalence principle scheme;
Each EHS is discretized with triangular flat patches with an average cell size around
Example of a discretized EHS and object under analysis, highlighting the considered domain, the buffer regions, and the far-field region associated with that domain.
The equivalent current densities are obtained on each EHS from the electric and magnetic fields, \begin{align*} \textbf {J}^{\mathrm {S}}_{p} &= \hat {\textbf {n}}_{p}\times \textbf {H}^{\mathrm {S}}_{p} \tag{13}\\ \textbf {M}^{\mathrm {S}}_{p} &= \textbf {E}^{\mathrm {S}}_{p} \times \hat {\textbf {n}}_{p} \tag{14}\end{align*}
\begin{align*} \textbf {J}^{\mathrm {S}}_{p} &\cong \sum _{i=1}^{K_{p}} C^{\mathrm {J}}_{p,i}\,\textbf {f}^{\mathrm {S}}_{p,i} \tag{15}\\ \textbf {M}^{\mathrm {S}}_{p} &\cong \sum _{i=1}^{K_{p}} C^{\mathrm {M}}_{p,i}\,\textbf {f}^{\mathrm {S}}_{p,i} \tag{16}\end{align*}
\begin{equation*} \left [{{I}^{\mathrm {S}}_{p}}\right] =\left [{C^{\mathrm {J}}_{p,1}, \ldots, C^{\mathrm {J}}_{p,K_{p}}, C^{\mathrm {M}}_{p,1}, \ldots, C^{\mathrm {M}}_{p,K_{p}} }\right]^{T} \tag{17}\end{equation*}
C. Error Estimation Using HS-DDM
The goal of the error estimation is to find a metric that indicates where the initial mesh and, from there, the basis functions defined on it cannot accurately describe the solution current variations of the object under analysis. As in [16], the error estimation used here is residual-based, as it compares the residual of the initial solution with that of a different basis function space, defined on a finer mesh. The Calderon identity [24] shows that the error in the approximate solution is bounded above and below by the residual error of the discretized SIE. Then, we can improve the accuracy of the solution by refining the mesh in the areas where the residual is higher.
The residual is defined as \begin{equation*} \mathbf {R}(\textbf {r}) = \mathcal {C^{J}} \{ \mathbf {J}^{0}(\textbf {r}) \} - \frac {\alpha \,\mathbf {E}^{\mathrm {i}}_{\mathrm {tan}}(\textbf {r})}{\eta } - (1-\alpha) \, \hat {\mathbf {n}} \times \mathbf {H}^{\mathrm {i}}(\textbf {r}) \tag{18}\end{equation*}
The testing of (18) on the same basis functions’ space used for obtaining
The norm of the residual, \begin{equation*} \left |{\left |{ \mathbf {R}^{L}_{m}}\right |}\right | \cong \max _{\mathbf {f}^{L}_{m(i)}} \frac {\left \langle{ \mathbf {f}^{L}_{m(i)}, \mathbf {R} }\right \rangle }{\sqrt {\left \langle{ \mathbf {f}^{L}_{m(i)},\mathbf {f}^{L}_{m(i)} }\right \rangle }}\qquad \tag{19}\end{equation*}
Substituting (18) into (19) and removing the index \begin{equation*} \left \langle{ \mathbf {f}^{L},\mathbf {R} }\right \rangle = \left \langle{ \mathbf {f}^{L}, \mathcal {C^{J}} \left \{{ \mathbf {J}^{0} }\right \} }\right \rangle - \left \langle{ \mathbf {f}^{L}, \frac {\alpha \,\mathbf {E}^{\mathrm {i}}_{\mathrm {tan}}}{\eta } + (1-\alpha) \, \hat {\mathbf {n}} \times \mathbf {H}^{\mathrm {i}}}\right \rangle.\qquad \tag{20}\end{equation*}
\begin{equation*} \textbf {J}^{0}(\textbf {r}) \cong \sum _{j=1}^{N_{L}} I_{j}^{0,L} \,\textbf {f}^{L}_{j}(\textbf {r}) \tag{21}\end{equation*}
\begin{equation*} \left [{ I^{0,L} }\right] = \left [{ I_{1}^{0,L}, \ldots, I_{N_{L}}^{0,L} }\right]^{T}. \tag{22}\end{equation*}
\begin{equation*} \left [{R^{L}}\right] = \left [{A^{L}}\right] \left [{I^{0,L}}\right] - \left [{B^{L}}\right] \tag{23}\end{equation*}
\begin{equation*} R^{L} = \left [{ \left \langle{ \mathbf {f}^{L}_{1},\mathbf {R}}\right \rangle, \ldots, \left \langle{ \mathbf {f}^{L}_{N_{L}},\mathbf {R}}\right \rangle }\right]^{T}. \tag{24}\end{equation*}
\begin{align*} A^{L}_{ij} &= \left \langle{ \mathbf {f}^{L}_{i},\mathcal {C^{J}} \left \{{ \mathbf {f}^{L}_{j}}\right \} }\right \rangle \tag{25}\\ B^{L}_{i} &= \left \langle{ \mathbf {f}^{L}_{i}, \frac {\alpha \,\mathbf {E}^{\mathrm {i}}_{\mathrm {tan}}}{\eta } + (1-\alpha) \,\hat {\mathbf {n}} \times \mathbf {H}^{\mathrm {i}}}\right \rangle \tag{26}\end{align*}
We remark that, if it is needed to compare the error maps obtained for different excitations and geometries, the residual in (24) should be normalized by, for example, the norm of the corresponding RHS (26)
The dimension
We consider the initial division into
The interaction within the domain and its buffer regions is obtained through the matrix \begin{equation*} \widetilde {A}^{L}_{p,i,j} = \left \langle{ \mathbf {f}^{L}_{p,i},\mathcal {C^{J}} \left \{{ \widetilde {\mathbf {f}}^{L}_{p,j}}\right \} }\right \rangle \tag{27}\end{equation*}
\begin{align*} Z^{\mathrm {S},L}_{p,i,j}\!=\! \begin{cases} \displaystyle \!\left \langle{ \mathbf {f}^{L}_{p,i},\mathcal {C^{J}} \left \{{ \mathbf {f}^{\mathrm {S}}_{p,j}}\right \} }\right \rangle, & \text {with } j=1,\ldots,K_{p} \\ \displaystyle \!\left \langle{ \mathbf {f}^{L}_{p,i},\mathcal {C^{M}} \left \{{ \mathbf {f}^{\mathrm {S}}_{p,j}}\right \} }\right \rangle, & \text {with } j=K_{p}+1,\ldots,2K_{p} \end{cases} \tag{28}\end{align*}
Finally, combining (27) and (28) with (23), we obtain \begin{equation*} \left [{R^{L}_{p}}\right] = \left [{\widetilde {A}^{L}_{p}}\right] \left [{\widetilde {I}^{0,L}_{p}}\right] + \left [{Z^{\mathrm {S},L}_{p}}\right]\left [{I^{\mathrm {S}}_{p}}\right] - \left [{B^{L}_{p}}\right] \tag{29}\end{equation*}
D. Adaptive H-Refinement
The error estimation (19) is associated with each of the cells in the reference mesh. Then, as in [16], the adaptive h-refinement starts from the initial mesh through a dyadic subdivision. If the considered cell contains at least one reference mesh cell with an associated error above the chosen threshold, it is divided by four. If, instead, it does not contain any reference cell above the threshold, it is kept unmodified in the adaptive process. The dyadic subdivision is applied where required, recursively, up to the level
Fig. 3(a) depicts an example of the initial mesh (thick lines), the corresponding reference mesh, and one triangle with an associated error above the threshold (highlighted in red). The adaptive h-refinement process will ensure the presence of that triangle above the threshold in the final h-refined mesh. It keeps the shared edges of the initial discretization, generating a nonconformal mesh due to the localized refinement, where one cell is divided but not its neighbor, as shown in Fig. 3(b).
H-refinement process. (a) Coarse triangle (thick lines), and reference mesh (
The MB-RWG basis functions [21] are defined on a triangle, called positive, and a group of smaller triangles, called negative, with an edge in common with the positive triangle, where the edges from the negative side form exactly the edge in the positive side. By definition, the MB-RWG basis functions guarantee normal current continuity across common edges, meaning that no line charges exist and the functions are div-conforming. The nature of the dyadic h-refinement in Fig. 3(b) makes the MB-RWG basis functions very suitable for their use in the proposed approach. Fig. 3(c) shows the vectorial behavior of an MB-RWG basis function, in a mesh resulting from the performed adaptive h-refinement. Hence, the MB-RWG basis functions are defined, together with the RWG basis functions, on the obtained h-refined mesh. This choice avoids DG, which would imply implementing an extra penalty condition in the kernel of the SIE, as done in the formulation proposed in, for example, [18] and [19].
E. Adaptive H-Refined Solution
Once each domain
The interaction between the basis functions inside the domain and its inner buffer is represented by the matrix \begin{equation*} \widetilde {A}^{\mathrm {H}}_{p,i,j} = \left \langle{ \, \widetilde {\mathbf {f}}^{\mathrm {H}}_{p,i},\mathcal {C^{J}} \left \{{\, \widetilde {\mathbf {f}}^{\mathrm {H}}_{p,j}}\right \} }\right \rangle \tag{30}\end{equation*}
The radiation from the outer buffer to the h-refined domain of interest is done through the matrix \begin{equation*} \check {A}^{\mathrm {H}}_{p,i,j} = \left \langle{ \,\widetilde {\mathbf {f}}^{\mathrm {H}}_{p,i},\mathcal {C^{J}} \left \{{ \, \check {\mathbf {f}}^{0}_{p,j} }\right \} }\right \rangle \tag{31}\end{equation*}
The last contribution is that from the far-field region and is made through the EHS. This is represented by the matrix \begin{align*} Z^{\mathrm {S,H}}_{p,i,j}= \begin{cases} \left \langle{ \mathbf {f}^{\mathrm {H}}_{p,i},\mathcal {C^{J}} \left \{{ \mathbf {f}^{\mathrm {S}}_{p,j}}\right \} }\right \rangle, & \text {with } j=1,\ldots,K_{p} \\[1.5mm] \left \langle{ \mathbf {f}^{\mathrm {H}}_{p,i},\mathcal {C^{M}} \left \{{ \mathbf {f}^{\mathrm {S}}_{p,j}}\right \} }\right \rangle, & \text {with } j=K_{p}+1,\ldots,2K_{p} \end{cases} \tag{32}\end{align*}
Collecting (30)–(32), we can set for each domain \begin{equation*} \left [{\widetilde {A}^{\mathrm {H}}_{p}}\right] \left [{\widetilde {I}^{\mathrm {H}}_{p}}\right]+ \left [{\check {A}^{\mathrm {H}}_{p}}\right] \left [{\check {I}^{0}_{p}}\right] + \left [{Z^{\mathrm {S,H}}_{p}}\right] \left [{I^{\mathrm {S}}_{p}}\right] = \left [{\widetilde {B}^{\mathrm {H}}_{p}}\right] \tag{33}\end{equation*}
\begin{equation*} \left [{\widetilde {A}^{\mathrm {H}}_{p}}\right] \left [{\widetilde {I}^{\mathrm {H}}_{p}}\right] = \left [{\widetilde {B}^{\mathrm {H}}_{p}}\right] - \left [{\check {A}^{\mathrm {H}}_{p}}\right] \left [{\check {I}^{0}_{p}}\right] - \left [{Z^{\mathrm {S,H}}_{p}}\right] \left [{I^{\mathrm {S}}_{p}}\right] \tag{34}\end{equation*}
F. Workflow Summary
A summary of the different steps needed to obtain an adaptive h-refined solution is summarized here, following Fig. 4.
Workflow of the HS-DDM procedure to generate an adaptive h-refined mesh and to find the corresponding current densities. (a) Initial mesh and domain decomposition. (b) Initial mesh domain and its equivalent Huygens’ surface (EHS). (c) Refined mesh for a domain. (d) Total refined mesh and domain decomposition. (e) Refined mesh domain and its equivalent Huygens’ surface (EHS). (f) Solution current.
We start from an initial coarse mesh, where we obtain an initial solution and define the domains that will be used in the following steps [see Fig. 4(a)] as detailed in Section III-A. For each domain, an EHS is defined [see Fig. 4(b)] and its equivalent current densities are obtained (see Section III-B), as well as the localized error estimation with the definition of the reference mesh (see Section III-C). Via the error estimation, the adaptive h-refined mesh is generated (see Section III-D), selecting the reference mesh cells above the chosen error threshold [see Fig. 4(c)].
Fig. 4(d) depicts the collection of all the domains after the adaptive h-refinement, where a solution will be obtained. In Fig. 4(e), the HS-DDM is applied to each domain to obtain the adaptive h-refined solution (see Section III-E), shown in Fig. 4(f).
Numerical Results
In this section, we illustrate the effectiveness of the proposed HS-DDM implementation in solving two different EM examples with real-life interest, considering both a scattering and a radiation problem.
All simulations shown in this article were performed in a cluster with
A. Scattering Problem: Rafale Aircraft
A first numerical example is introduced to examine the efficiency of the proposed method to obtain an accurate solution for an adaptive h-refined mesh. A morphed version of a Rafale aircraft, shown in Fig. 5, is considered as the structure to analyze. This example has small and thin regions around the wings and the nose and some sharp edges around all the fuselage. The excitation of the problem is an oblique (
We start obtaining the solution of an initial mesh of the problem through a fast MoM method, that was modeled using 7986 unknowns corresponding to RWG basis functions. For this example, since the geometry does not exhibit multiscale features, we use an MLFMA-FFT [3] method to obtain the initial solution. The domain decomposition of the geometry is then applied, splitting the Rafale aircraft into eight domains, shown with different colors in Fig. 5 together with the initial mesh. Next, each domain is encapsulated in an EHS, and we evaluate the error of the initial solution with respect to a reference one, obtained with a mesh that has two levels of cells dyadic subdivision (
Then, the automatic h-refinement procedure, described in Section III-D, is applied to the initial mesh, comparing the error map with an error threshold equal to −3.5 (in logarithmic scale) [16] and obtaining an adaptive h-refined mesh, shown in Fig. 7, that provides a total of
Adaptive h-refined mesh of the Rafale aircraft. In gray, the plane region where the near field is evaluated.
Finally, to find the solution in the adaptive h-refined mesh, we apply the proposed HS-DDM scheme, as described in Section III-E; in the following, we will refer to this approach as “adaptive h-refined (local).” To characterize and compare the performance of the HS-DDM method, also an MLFMA-FFT solver is applied to the whole structure to obtain the solution of the adaptive h-refined mesh; the results obtained with the MLFMA-FFT solver are marked in the following with “adaptive h-refined (global).”
Fig. 8(a) shows the convergence in terms of the iteration number under an iterative Krylov resolution of the matrix system (we are using GMRES [26]), comparing different solutions to better understand the improvement provided by the proposed approach. In Fig. 8, the green line corresponds to the solution with the initial mesh using the MLFMA-FFT, the black line shows the convergence of the MLFMA-FFT using the reference mesh, the red line represents the convergence of the adaptive h-refined mesh applying the MLFMA-FFT to the whole structure, while blue lines illustrate the convergence of the adaptive h-refined mesh problem using the HS-DDM method, where each blue line refers to the solution of one domain (obtained via a local MLFMA-FFT). We can observe that the convergence of all domains is faster than the rest of the solutions. Table I lists the times needed for the setup and solution of the initial problem (using the initial mesh), the time to generate the error estimation map and the currents on the EHSs, and the setup and solution times for the solution using the final refined meshes. The time for the local refinement is not reported because it is negligible. In columns two and three, Table I reports the required times using the adaptive h-refined global and local approaches, respectively; it is evident that the proposed local approach (i.e., the HS-DDM) outperforms the global one. The last column reports the setup and solution times using the reference mesh. In this case, the reference solution requires higher times than the adaptive h-refined solutions (both global and local).
Rafale aircraft: iterative convergence in terms of (a) number of iterations, and (b) solution time.
However, considering that the different convergences shown in Fig. 8(a) corresponds to problems with a different number of unknowns, the number of iterations cannot be reliable to compare the performance of the different results, such as the times per iteration are different. A better figure of merit is shown in Fig. 8(b), where the above iterative convergences are expressed in terms of the total time to solve each problem. In Fig. 8(b), comparing the convergence of the proposed HS-DDM scheme (blue lines) with the MLFMA-FFT in the case of the adaptive h-refined problem (red line), it can be observed a speedup factor greater than
To verify the solution accuracy of the different methods, first, we examine the radiated electric near-field on a plane at
(a) Reference radiated electric near field. (b) Difference between initial and reference electric near fields. (c) Difference between adaptive h-refined mesh (global solution) and reference electric near fields. (d) Difference between adaptive h-refined mesh (local solution) and reference electric near fields. All the reported data are in
These findings are coherent with the obtained electric current density over the aircraft surface, shown in Fig. 10, where there is a good agreement between the adaptive h-refined mesh solutions [see Fig. 10(c) and (d)], with respect to the reference one [see Fig. 10(b)], with maximum errors equal to −18.51 dB for the MLFMA-FFT solver and −16.82 dB for the DDM-HS one, while the initial mesh current density is quite different [see Fig. 10(a)], with a maximum error of −7.36 dB.
Rafale aircraft surface current density and differences (dB
B. Antenna Problem: Modern Vessel
As a second example, the radiation of a realistic and multiscale structure is considered to evaluate the accuracy and efficiency of the proposed method. The structure is a modern vessel with four integrated patch antennas embedded into the main mast (see Fig. 11). The approximate dimensions of the ship are 140 m in length, 20 m in width, and 40 m in height (
In this case, the geometry of the problem exhibits very deep multiscale features and a localized excitation, so, instead of the MLFMA-FFT solver (that has a slow convergence), the DDM of [6] is applied to obtain the solution of the initial mesh, the global solution of the adaptive h-refined mesh and the one of the reference mesh. For this structure, the initial mesh is composed of
After obtaining the electric current density on the surfaces of the initial mesh, the error estimator algorithm is applied using the proposed local scheme to generate the error map shown in Fig. 13. We can see that, in this case, the maxima of the error are concentrated in the proximity of the antennas and the illuminated parts of the structure. Then, after comparing that error map to an error threshold of −3.5 (in logarithmic scale), the h-refinement technique is applied, resulting in the adaptive h-refined mesh shown in Fig. 14, providing a total of
Similar to the previous example, we analyze the performance of the proposed HS-DDM scheme with respect to the global solutions, but in this case, the convergence of the different methods and stages are shown in terms of the total time to solve the problem only, such as the completely different time per iteration between the different solutions makes difficult to extract conclusions from the number of iterations. The results are shown in Fig. 15, where, for the HS-DDM method (blue line), the solution of the domain with the worse convergence in terms of time is represented only, to avoid the superposition of too many lines. The performance improvement in the solution of the adaptive h-refined problem via the HS-DDM (blue line) is also evident for this radiation case, with a speedup factor of
As in the previous example, we evaluate the radiated electric near-fields on a plane at
(a) Reference radiated electric near-field. (b) Difference between initial and reference electric near-fields. (c) Difference between adaptive h-refined mesh (global solution) and reference electric near-fields. (d) Difference between adaptive h-refined mesh (local solution) and reference electric near-fields. All the reported data are in
Vessel surface current density (
Detailed view of the vessel surface current density and differences (
Conclusion and Perspectives
In this work, we presented a new HS-DDM for obtaining an efficient and accurate adaptive h-refined problem solution for multiscale realistic PEC structures. The error estimation and solution of the adaptive h-refined problem are, in general, globally coupled, requiring the handling of large matrices. In this work, we proposed dividing the structure into domains and considering the effects of external (far-field) regions through equivalent surfaces at half-wavelength from those regions and based on Huygens’ equivalence principle, going toward a localized problem. The initial solution, obtained via an average
Two possible future developments of the approach presented here are the extension to objects composed of multiple materials, and the implementation of the multiresolution preconditioner [27], [28] for the solution of the local domains to further improve the overall solution time. Moreover, the number of levels in the reference mesh could be different for each region or triangle to better adapt the scheme to the initial mesh size and the problem excitation.
NOTE
Open Access funding provided by ‘Politecnico di Torino’ within the CRUI CARE Agreement