-
PDF
- Split View
-
Views
-
Cite
Cite
Jian Li, Rongwen Guo, Jianxin Liu, Yongfei Wang, Xulong Wang, An efficient algebraic multi-resolution sampling approach to 3-D magnetotelluric modelling, Geophysical Journal International, Volume 235, Issue 1, October 2023, Pages 166–177, https://doi.org/10.1093/gji/ggad207
- Share Icon Share
SUMMARY
Since electromagnetic (EM) fields diffuse more smoothly to greater depth, it physically makes sense to apply fine discretization to model structure at near surface with an increasingly coarser grid both in horizontal and vertical directions as the depth increases for the numerical solution of EM fields. For finite-difference magnetotelluric (MT) forward modelling on regular staggered grids, this can lead to difficulties in discretizing the curl–curl equation governing the EM diffusion in the earth at regions, where the grid resolution changes. In this paper, we propose an efficient algebraic multi-resolution sampling (MRS) method for MT forward modelling. In this method, we do not require the generation of physical subgrids and merely subsample the field components. The coefficient matrix for the subsampled components can be obtained by matrix multiplication based on the initial linear system of equations and field interpolation. To guarantee divergence-free current during the iterative solution process at low frequencies, which is considered crucial for the development of efficient iterative solvers, our forward modelling is based a regularization equation obtained by augmenting the curl–curl equation with an equivalent scaled grad–div operator for electrical fields (explicitly enforcing the divergence-free condition). The correctness of our algebraic MRS algorithm is examined based on a layered model. Its stability and efficiency is exploited by comparing our results with the forward modelling on unsampled staggered grids for the Dublin Test Model 1 (DTM1) and a complex model with realistic topography, indicating a time reduction of about 42–82 per cent.
1 INTRODUCTION
3-D forward modelling of electromagnetic (EM) fields is considered as an important step for EM explorations, through which we can obtain the subsurface structure information from EM survey data (Avdeev 2005; Guo et al. 2020). Due to the complex underground structure, this is generally carried out numerically, by either integral equation methods (IEM, Zhdanov et al. 2006; Kruglyakov & Kuvshinov 2018; Chen et al. 2021), finite-element methods (FEM, Ren et al. 2013; Cai et al. 2014; Grayver & Kolev 2015; Yu et al. 2022), finite-volume methods (FVM, Haber & Ruthotto 2014; Han et al. 2018; Peng et al. 2021; Hu et al. 2022) or finite-difference methods (FDM; Streich 2009; Mittet 2010; Egbert & Kelbert 2012; Kelbert et al. 2014; Li et al. 2018). Due to the simplicity and efficiency, FDM on regular grids finds wide applications in EM forward modelling and inversion. Within this method, the fine discretization of shallow structures in the horizontal directions continues to the bottom of the computational domain (Cherevatova et al. 2018), leading to an unnecessary large linear system of equations.
The well-known fact is that as EM fields diffuse more deeply, they become increasingly smoother and can be represented accurately with coarser grids (Cherevatova et al. 2018). This can be utilized to design a more practical modelling grid, which should be finely discretized in shallow area with increasingly more coarse discretization in deeper regions. The implementation for this on unstructured grids is straightforward (Ren et al. 2013; Jahandari & Farquharson 2015; Tang et al. 2022). For structured grids, previous studies (Haber & Heldmann 2007; Grayver & Bürg 2014; Cherevatova et al. 2018; Gao et al. 2020, 2021; Han et al. 2022) develop multi-resolution (MR) algorithms based on discretizing the partial differential equation with non-conforming grids. Among them, Cherevatova et al. (2018) developed a simpler multi-resolution grid (MRG) scheme, in which they discretize the model into a sequence of subgrids and grid coarsening is only carried out in horizontal directions. For each subgrid, the discretization can be implemented modularly (Cherevatova et al. 2018). However, all the MR algorithms mentioned above have to handle the ‘hanging’ edges at the interfaces of subgrids with different resolutions, posing a challenge for the numerical implementation.
To avoid the difficulty of handling the ‘hanging’ edges during the discretization of the forward modelling operator, Wang et al. (2021) proposed a multilevel forward modelling algorithm to reduce the edge unknowns. Rather than coarsening the physical grid locally, they subsample the edge components sequentially to the pre-defined maximum level, with a increase in the subsampling level resulting in half reduction of the number of edge components (for convenience, we use the name of abstract subgrids to represent the retained components for each level of subsampling). All levels of subsampling are implemented in a pre-determined region where fewer edge components can accurately describe the EM diffusion. In this case, the reduced edge components can be gradually recovered by interpolating the retrained edge components starting from the coarsest abstract grid. A relatively smaller linear system of equation can be formed for the retained edges by the multiplication of interpolation matrices with the linear system of equations on the unsampled grid. However, continuously coarsening one specific local area to the coarsest abstract grid can be problematic due to the increasingly smoother EM diffusion property as penetration depth becomes larger.
Another critical factor affecting the EM forward modelling efficiency based on iterative solvers is that whether the divergence-free current is satisfied during the solution process, particularly at low frequencies (Dong & Egbert 2019). The explicit inclusion of this as a regularization term into the initial curl–curl equation guarantees the right field jumps and can significantly improve the numerical performance of an iterative forward modelling algorithm compared with the classic iterative divergence correction technique (Smith 1996; Farquharson & Miensopust 2011; Tang et al. 2021). It is expected that the combination of MRG into the regularization technique can further improve the forward modelling efficiency.
In this paper, we propose an algebraic MRS approach combined with the regularization technique (Dong & Egbert 2019) for efficient MT forward modelling, which can be considered as an extension of the multilevel algorithm (Wang et al. 2021) and the MRG technique (Cherevatova et al. 2018). A layered geoelectric model from Cherevatova et al. (2018) is used to validate the algebraic MRS algorithm. The numerical performance of the algebraic MRS is investigated by comparing it with the modelling algorithm on regular staggered grids (SG) based on a test model from Miensopust et al. (2013) and a complex model with realistic topography modified from (Ren et al. 2017). The modelling results indicate an impressive improvement against the SG algorithm while not sacrificing accuracy.
2 BASIC THEORY
2.1 Maxwell’s equations
eiωt time-dependent EM fields are assumed. At low frequencies around less than 105 Hz, relative to the conductive current, the displacement current can be negligible. In this case, EM fields (E and H) diffuse according to the simplified Maxwell’s equations, defined by
ω represents the angular frequency, μ represents the vacuum permeability, σ represents the conductivity and J represents the external source, which is zero for MT case. By applying the curl operation to eq. (2) and substituting it into eq. (1), the Maxwell’s equations can be reduced to the second partial differential equations for electric fields, given by
Similarly, the second partial differential equations for magnetic fields can be derived, which is not considered in this paper.
By applying the divergence operator on both sides of eq. (3), we can obtain the current conservation equation, written as
This indicates that eq. (3) implicitly enforces the conservation equation, which may fail to be satisfied during the numerical solution process of eq. (3) based on iterative solvers. A more discussion can be found in Li et al. (2022). In this case, a process to enforce eq. (4) iteratively is commonly applied with the requirement of solving an additional equation, referred to as the iterative divergence correction technique (Smith 1996; Liu & Yin 2013; Zhou et al. 2021).
2.2 Regularization technique
Alternatively, Dong & Egbert (2019) weight eq. (4) properly and includes it explicitly in eq. (3). We refer to this as the regularization technique since it is similar to the regularization term used in geophysical inversions. To make the solution space consistent, we take the gradient of the weighted version of eq. (4), then include it into eq. (3) to obtain
where λ is the scaling (weighting) factor. Please note that λ can also be moved before the gradient operator as far as eq. (4) is satisfied. For more complete discussion, please see the references (Dong & Egbert 2019; Li et al. 2020, 2022). The auxiliary magnetic fields are determined by
3 NUMERICAL IMPLEMENTATION
3.1 Finite-difference discretization
With proper boundary conditions, we can discretize eq. (5) on an SG (Yee 1966), shown in Fig. 1 with electric fields defined on cell edges and magnetic fields defined on cell faces. Then we can obtain the discrete linear system of equations in matrix form, written as
where e is the vector of partitioned electric fields, and b is the vector containing applied boundary conditions. A is the coefficient matrix, given by
the curl operator C maps cell edges to cell faces, while the adjoint of the curl operator C† maps cell faces back to cell edges, the gradient operator G maps from nodes to edges, the divergence operator D maps from edges to nodes, Λ is a diagonal matrix filled with values of scaling factor and |$\bar{\sigma }$| is the volume average conductivity of four cells surrounding each edge. For more details on the formulation of these operators, please refer to the work (Egbert & Kelbert 2012; Dong & Egbert 2019; Li et al. 2020).

3.2 Implementation of algebraic multi-resolution sampling technique
For the algebraic MRS technique developed in this paper, we don’t need to generate a series of physical subgrids as in the work (Cherevatova et al. 2018). Once we generate eq. (7) on the fine grid, we use matrix multiplication to carry out the subsampling, demonstrated subsequently. If we assume that the discrete e0 in eq. (7) on the fine grid with N0 edges, can be interpolated from a subensemble of edges e1 on the first-level abstract subgrid. Then we can define e0 as the multiplication of an interpolation matrix and the subensemble vector, giving
Similarly, if we have a consecutive sequence of subsampled edge sets e1, e2,..., eN for N levels of subsampling with respective sparse interpolation matrices S1, S2,..., SN, we can form the interpolation chain as
For convenience, l can be considered as the subsampling level.
If we assume the numbers of edges included in e1, e2,..., eN are N1, N2,..., NN, respectively. Using the chain rule, we can get
S represents the total interpolation matrix with a dimension of N0 × NN. Substituting eq. (11) into eq. (7), we obtain
where AS has a dimension of N0 × NN, which is not a square matrix. In this case, if we want to solve eq. (12) for eN, we need to delete the row corresponding to the edges deleted during the subsampling procedure. This can be trivially realized by multiplying eq. (12) on both sides by an NN × N0 matrix L with only one entry of 1 at the column corresponding to one retained edge and 0 at the rest columns for each row, resulting in the following equation
Solving eq. (13) for eN, the whole original edge components e0 can be obtained using eq. (11).
So far, we have not mentioned how to implement the sparse interpolation matrices S1, S2,..., SN, which will be addressed subsequently. For convenience, we will use x-edges to demonstrate this, as shown in Fig. 2. Unlike the work (Wang et al. 2021) using a uniform subsampling at one fixed region, the subsampling at different regions is applied differently, for instance, zero-level subsampling at the near-surface, followed by increasingly higher-level subsampling as the depth increases.

An example of the algebraic MRS algorithm for electric fields ex. Each plane represents a subsampling level. The red dashed lines represent the removed edges during the first-level subsampling, the blue dashed lines represent the removed edges during the second-level subsampling and solid lines denote the retained edges.
For easy demonstration, we use planes of single-row x-edges to show how Sl is calculated, as shown in Fig. 2 for a two-level subsampling scheme. As mentioned before, we form the abstract subgrids as in the figure just for demonstration purposes, which is not needed at all in the numerical implementation. For this purpose, we increase the level of subsampling by one as one additional layer is included. In the 0th subregion, no subsampling is applied. For the first-level subsampling, as indicated in Fig. 2, the deleted edges |$e_{x_{1,2i}}$| with i = 1,..., Ny/2 on plane 2 (assume the total x-edge number Ny along the y-direction on plane 2 is even) with the first number in the subscript for the level of sampling and the second number for the position of the electric field on the plane 2, can be interpolated from the retained edges |${e}_{x_{1,2i-1}}$| and |${e}_{x_{1,2i+1}}$| as
|${{d}_{y}}_{_{2i}}$| is the edge length for the 2ith cell on the initial grid along the y-direction. Thus, we can obtain the entries of c2i − 1 and c2i + 1 at the row corresponding to the position of |${{e}_{{{x}_{1,2i}}}}$| in e0 and at the columns corresponding to the position of |${{e}_{{{x}_{1,2i-1}}}}$| and |${{e}_{{{x}_{1,2i+1}}}}$| in e1 with the rest of the columns filled with zeros for S1. For rows related to the retained edges (including edges in the air-earth region), we fill them with zeros except for setting ones for the diagonals. However, in our implementation, we use the same trick as in Wang et al. (2021), within which we first generate a N0 × N0 identity matrix S0 as shown in Fig. 3(a), then we add c2i − 1 and c2i + 1 at the row and columns corresponding to the indices of |${{e}_{{{x}_{1,2i}}}}$|, |${{e}_{{{x}_{1,2i-1}}}}$| and |${{e}_{{{x}_{1,2i+1}}}}$| all in e0, respectively, with the rest entries of this row set to zeros, to generate the N0 × N0 version of S1 as shown in Fig. 3(b). Finally, we delete the zero columns to obtain N0 × N1S1.

The distribution of matrix elements based on a small-sized model (8 × 8 × 3). (a) represents of the identity matrix S0, and (b) represents the interpolation matrix S1 having the same size of S0 for the first-level subsampling. Red represents the interpolation coefficients and blue dotted lines represent ones with white for zeros.
Similarly, for the second-level subsampling, the deleted edges |${{e}_{{{x}_{2,4i\text{-}1}}}}$| on plane 3 can be interpolated from the retained edges |${{e}_{{{x}_{2,4i-3}}}}$| and |${{e}_{{{x}_{2,4i+1}}}}\, (i=1,2,...,\frac{{{N}_{y}}}{{{2}^{2}}}$|) as
We use a similar way as in the first-level subsampling to assemble S2. The only difference is that now the rows in S2 are decided by edge positions in e1, and its columns are decided by edge positions in e2. Repeat this process to form a series of Sl, until the preset highest level is reached. In implementation, we also use the similar way as used for the formulation of |${{N}_{0}}\times {{N}_{0}} \, {{\mathbf {S}}_{1}}$| to obtain |${{N}_{0}}\times {{N}_{0}} \, {{\mathbf {S}}_{2}}$|. Then, we delete the zero columns and the rows corresponding to the deleted components to generate |${{N}_{1}}\times {{N}_{2}} \, {{\mathbf {S_{2}}}}$|.
For the general Nth-level subsampling, we can interpolate the deleted edges |${{e}_{{{x}_{N,{{2}^{N-1}}\cdot (2i-1)+1}}}}$| from the retained edges |${{e}_{{{x}_{N,{{2}^{N}}\cdot (i-1)+1}}}}$| and |${{e}_{{{x}_{N,{{2}^{N}}\cdot i+1}}}}\, (i=1,2,...,\frac{{{N}_{y}}}{{{2}^{N}}})$| as
Similarly, we can repeat this interpolation process for y-edges.
For the z-edges ez, subsampling is implemented in both the x- and y-directions (Wang et al. 2021) to guarantee the accuracy. In this case, we use a general grid with 8 × 8 cells in the horizontal plane for demonstration purpose. For simplicity, we use one plane to show the first-level subsampling as shown in Fig. 4. As indicated in figure, one component deleted is surrounded and interpolated by four retained components. For instance, |${{e}_{{{z}_{1,11}}}}$| can be interpolated from |${{e}_{{{z}_{1,2}}}}\text{, }{{e}_{{{z}_{1,10}}}},\text{ }{{e}_{{{z}_{1,12}}}}\, \mathrm{ and}\,\text{ }{{e}_{{{z}_{1,20}}}}$| as
|${{d}_{x}}_{_{i}}$| is the edge length on the initial grid for the ith element along the x-direction. We can trivially generalize this procedure to the Nth-level subsampling for ez. In the Nth subregion, the deleted edge |${{e}_{{{z}_{N,{{2}^{N-1}}\left( 2i+{{N}_{y}} \right)+1}}}}$| during the Nth-level subsampling can be interpolated from |${{e}_{{{z}_{N,{{2}^{N-1}}\left( 2i-1 \right)+1}}}}$|, |${{e}_{{{z}_{N,{{2}^{N-1}}\left( 2i+{{N}_{y}}-1 \right)+1}}}}$|, |${{e}_{{{z}_{N,{{2}^{N-1}}\left( 2i+{{N}_{y}}+1 \right)+1}}}}\text{ and }{{e}_{{{z}_{N,{{2}^{N-1}}\left( 2i+2{{N}_{y}}+1 \right)+1}}}}$| as
The positions of the interpolation coefficients in Sl are determined similarly as for ex, mentioned previously.

An example of the algebraic MRS algorithm for electric fields ez. The blue triangles and grey polka dots are the reduced and retained vertical electric fields after the first-level subsampling on the plane, respectively.
All of these matrices of eq. (13) are combined into a single matrix LAS during the solution process. Since it is not mathematically obvious that LAS is also a sparse matrix, we examined this by plotting the sparsity pattern of LAS. Considering that the resulting matrix pattern is independent of the complexity of a model, based on a three-layered earth model (see Section 4.1) discretized with a 16 × 16 × 42 grid (plus 12 air layers), we plot the resulting matrix for the sampling scheme of [S,N] = [1; 8; 0; 16; 1; 10; 2; 20] in Fig. 5, indicating the sparsity of the resulting matrix.
![Matrix sparsity of LAS in the sampling scheme of [S,N] = [1; 8; 0; 16; 1; 10; 2; 20] for the three-layered earth model.](https://oup.silverchair-cdn.com/oup/backfile/Content_public/Journal/gji/235/1/10.1093_gji_ggad207/1/m_ggad207fig5.jpeg?Expires=1748061695&Signature=S8Fl2bT888Vn46s3rSngULLKDKyYl3CzC1ZwVNVCitsJzfM1sGuS~7bgUxLQ3xwiej6RCjsOLevMWXdDR8EjyBzX7lYmHLwvED~f65dQ2wkNs33ZsU2wZ1wOAcZ47Herph3Ve24RWtbJaH35qRUxuHsLvPMmskBMLPMdmgbfbFA1etmhTlWrBSKr4Tbkz7T0OMOGeRbhLk9IWlp6Bk59ePWUjiQgNQ1vl~VfEt25swUvp56v5327w8h68D9rNR1WU2-CK-g1j-6Jl6e~fzDDmdFfANInyH3UiH1EMUCGaLljrkRsG4iZNXsAtrUSA9ZFVpqm8IcxTQVy7rq0j--eDg__&Key-Pair-Id=APKAIE5G5CRDK6RD3PGA)
Matrix sparsity of LAS in the sampling scheme of [S,N] = [1; 8; 0; 16; 1; 10; 2; 20] for the three-layered earth model.
For convenience, we use a similar way as in work (Cherevatova et al. 2018) to represent the abstract subsampling scheme. For example, if we only consider a two-level multi-resolution subsampling in Fig. 2, then the subsampling scheme can be represented by the vector [S, Nz] = ⌊0, 1; 1, 1; 2, 1⌋, with S indicating the sampling level and Nz for the number of layers in the z-direction for this subsampling level. Each pair of numbers separated by a semicolon represent a particular choice of [S, Nz] for one abstract subregion, organized from the top to the bottom of the computational domain. As the subsampling level increases by one, the size of the resulting components in one plane is reduced by half. For this example, the computational domain in Fig. 2 is divided into three abstract subregions. The first abstract subregion [S, Nz] = [0, 1] includes one layer of 1 × 8 horizontal cells. The second abstract subregion [S, Nz] = [1, 1], indicating the first-level subsampling, includes one layer of 1 × 4 horizontal cells and the third abstract subregion [S, Nz] = [2, 1] sampled twice contains one layer of 1 × 2 horizontal cells. No subsampling is applied in the z-direction.
In general, any subsampling schemes can be used as far as the subsampling does not bring obvious accuracy deterioration. However, there are no rigorous ways to determine an optimal subsampling scheme. The physical fact is that the EM fields are generally not very sensitive to geoelectric structures deeper than one skin depth and coarser grids can be used to describe the diffusion of EM fields accurately, as the fields go deeper. In this paper, this has been utilized to design the subsampling scheme. The subsampling starts from one skin depth which physically makes sense, then increases the spacing of two neighbouring levels as the subsampling moves to deeper regions. This particular choice leads to different subsampling schemes for different periods and it is a natural choice to gradually increase the subsampling level as the subsampling goes deeper.
4 NUMERICAL EXAMPLES
The accuracy of the algebraic MRS technique is examined based on a layered geoelectric model. We then illustrate the effectiveness of the algebraic MRS technique based on DTM1 and a realistic terrain model. In this paper, BiCGstab with SSOR pre-conditioner is used to solve the linear system of equations for both SG and MRS. All tests coded in MATLAB are performed on an AMD Ryzen Threadripper 2.9 GHz computer in serial, with the preset relative residual tolerance of 10−10 and maximum iterations of 3000.
4.1 Three-layered earth model
In this section, the accuracy of the algebraic MRS technique developed in this paper is validated by a layered geoelectric model from Cherevatova et al. (2018), shown in Fig. 6. The computational domain is discretized into 16 × 16 × 42 cells (plus 12 air layers), with a uniform discretization of 500 m in the horizontal direction and non-uniform discretization in the vertical direction. This leads to a total of 45 526 discrete edge components. Periods 1, 10, 100, 1000 and 10000 s are considered for this model.

Vertical cross-section for the layered model from Cherevatova et al. (2018).
For this model, we use the same mutiresolution scheme in Cherevatova et al. (2018). In this scheme, the model is subsampled with [S, N] = [1, 8; 0, 16; 1, 10; 2, 20], which divides the computational domain into four subregions. No subsampling is applied in the region close to the earth surface, containing 4 air layers and 12 earth layers. We apply the one-level subsampling in the immediate neighbouring abstract subregions on both sides of the unsampled region. In the upper abstract subregion consisting of eight air layers, the subsampling leads to 8 × 8 cells in the horizontal planes. Similarly, below the unsampled region, 10 layers are subsampled horizontally. The two-level subsampling is applied in the bottom abstract subregions of 20 layers, resulting in 4 × 4 cells in the horizontal planes. Due to the use of the algebraic MRS scheme, a total of 14 784 edges are removed.
We also have calculated the condition number for A and LAS in eq. (13) for the three-layered earth model at the considered periods. As shown in Table 1, the resulting condition numbers for A and LAS are comparable for all considered periods.
The condition number of A and LAS of eq. (13) for the three-layered earth model.
Period . | |||||
---|---|---|---|---|---|
. | 1 s . | 10 s . | 100 s . | 1000 s . | 10000 s . |
A | 1.65 × 105 | 1.13 × 105 | 1.14 × 105 | 1.14 × 105 | 1.14 × 105 |
LAS | 1.61 × 105 | 1.01 × 105 | 1.02 × 105 | 1.02 × 105 | 1.02 × 105 |
Period . | |||||
---|---|---|---|---|---|
. | 1 s . | 10 s . | 100 s . | 1000 s . | 10000 s . |
A | 1.65 × 105 | 1.13 × 105 | 1.14 × 105 | 1.14 × 105 | 1.14 × 105 |
LAS | 1.61 × 105 | 1.01 × 105 | 1.02 × 105 | 1.02 × 105 | 1.02 × 105 |
The condition number of A and LAS of eq. (13) for the three-layered earth model.
Period . | |||||
---|---|---|---|---|---|
. | 1 s . | 10 s . | 100 s . | 1000 s . | 10000 s . |
A | 1.65 × 105 | 1.13 × 105 | 1.14 × 105 | 1.14 × 105 | 1.14 × 105 |
LAS | 1.61 × 105 | 1.01 × 105 | 1.02 × 105 | 1.02 × 105 | 1.02 × 105 |
Period . | |||||
---|---|---|---|---|---|
. | 1 s . | 10 s . | 100 s . | 1000 s . | 10000 s . |
A | 1.65 × 105 | 1.13 × 105 | 1.14 × 105 | 1.14 × 105 | 1.14 × 105 |
LAS | 1.61 × 105 | 1.01 × 105 | 1.02 × 105 | 1.02 × 105 | 1.02 × 105 |
The reference solution is calculated using the analytical method at logarithmically spaced periods from 1 to 10000 s, based on which the accuracy of our algorithm is examined. As shown in Fig. 7, the results from our algebraic MRS method and SG are both consistent with the analytical solution. MRS and SG algorithms have almost identical relative errors, indicating the subsampling does not deteriorate the modelling accuracy obviously for this case.

Comparison of (a) apparent resistivity and (b) phase based a layered model from the algebraic MRS technique and the SG scheme with the analytical solution over logarithmically distributed periods from 1 to 10000 s.
4.2 Dublin Test Model 1
DTM1 (Miensopust et al. 2013), is designed to investigate the performance of our algorithm. As indicated in Fig. 8, the test model includes three resistivity anomalies buried in a background of 100 Ω · m, whose details are listed in Table 2. To provide accurate EM modelling, we utilize a model-dependent discretization as in Miensopust et al. (2013). The computational domain is discretized into 160 × 160 × 80 cells (excluding 12 the air layer) with the smallest cell sizes of |$250\times 250\times 250\, {{\text{m}}^{3}}$| (≤40s) and |$2500\times 2500\times 2500\, {{\text{m}}^{3}}$| (>40s). This leads to a total of 7.18 million discrete edge components. Periods 0.1, 1, 10,100 and 1000 s are considered for this model.

. | x (km) . | y (km) . | z (km) . | Resistivity (|$\Omega \, \cdot$|m) . |
---|---|---|---|---|
Body1 | −20 to 20 | −2.5 to 2.5 | 5 to 20 | 10 |
Body2 | −15 to 0 | −2.5 to 22.5 | 20 to 25 | 1 |
Body3 | 0 to 15 | −22.5 to 2.5 | 20 to 50 | 10 000 |
. | x (km) . | y (km) . | z (km) . | Resistivity (|$\Omega \, \cdot$|m) . |
---|---|---|---|---|
Body1 | −20 to 20 | −2.5 to 2.5 | 5 to 20 | 10 |
Body2 | −15 to 0 | −2.5 to 22.5 | 20 to 25 | 1 |
Body3 | 0 to 15 | −22.5 to 2.5 | 20 to 50 | 10 000 |
. | x (km) . | y (km) . | z (km) . | Resistivity (|$\Omega \, \cdot$|m) . |
---|---|---|---|---|
Body1 | −20 to 20 | −2.5 to 2.5 | 5 to 20 | 10 |
Body2 | −15 to 0 | −2.5 to 22.5 | 20 to 25 | 1 |
Body3 | 0 to 15 | −22.5 to 2.5 | 20 to 50 | 10 000 |
. | x (km) . | y (km) . | z (km) . | Resistivity (|$\Omega \, \cdot$|m) . |
---|---|---|---|---|
Body1 | −20 to 20 | −2.5 to 2.5 | 5 to 20 | 10 |
Body2 | −15 to 0 | −2.5 to 22.5 | 20 to 25 | 1 |
Body3 | 0 to 15 | −22.5 to 2.5 | 20 to 50 | 10 000 |
The abstract subsampling for this model at 100 s is defined by |$[{S,N}]=[2,3;1,3;0,\, 19;1,6;\, 2,6;3,5;4,9;5,41]$| leading to eight abstract subregions with the highest subsampling level of 5. The first and second abstract subregions apply the two and one-level subsampling, respectively, each containing three air layers. Their sizes are 40 × 40 × 3 cells and 80 × 80 × 3 cells, respectively. The third subregion contains the earth surface with 6 air layers and 13 earth layers. No subsampling is applied in this region discretized with 160 × 160 × 19 cells. The sampling level for subsequent subregions is increased by one, as they move to each deeper region, which leads to respective abstract grid sizes of 80 × 80 × 6, 40 × 40 × 6, 20 × 20 × 5, 10 × 10 × 9 and 5 × 5 × 41 cells, respectively. Relative to SG, the algebraic MRS scheme reduces the edges by 3.82 million (almost half the original size) for this period. Similarly, we use [S, N] = [2, 3; 1, 3; 0, 13; 1, 3; 2, 3; 3, 2; 4, 5; 5, 60], [S, N] = [2, 3; 1, 3; 0, 21; 1, 6; 2, 4; 3, 4; 4, 5; 5, 46], [S, N] = [2, 3; 1, 3; 0, 35; 1, 7; 2, 8; 3, 6; 4, 10; 5, 20] and [S, N] = [2, 3; 1, 3; 0, 37; 1, 10; 2, 9; 3, 7; 4, 13; 5, 10] for 0.1, 1, 10 and 1000 s, respectively. Their respective abstract grid size for each subregion can be trivially obtained by repeating the procedure as used for 100 s.
Then, the numerical performance of the algebraic MRS technique is compared with that of the forward modelling on SG and MRG (Cherevatova et al. 2018) in terms of the total number of discrete edges and computation time. As shown in Table 3, the algebraic MRS technique significantly reduces the total number of discrete edges relative to SG, resulting in much less non-zero elements as indicated in Table 4. Consequently, this leads to less computation time for our method. For instance, at 1 s, the computation time for our algebraic MRS method is nearly 25 per cent of that for SG (156 s vs 613 s). Interestingly, for this period, the reduction in run time is much larger than that in edge components (75 per cent vs 52 per cent), possibly due to the nonlinear relationship between the degrees of freedom of the resulting linear system and the computation time (Carriere & Jeandel 1991). This nonlinearity accounts for the larger reduction in time for the MRS method than in DoFs. For MRG and our algebraic MRS technique, their accuracy is comparable and our algorithm performs better in terms of computation time at most periods, possibly due to the fact that the hanging edges in MRG result in worse conditioning for the resulting system of equations. In Fig. 9, we compare the convergence history for SG and MRS for the Dublin Test Model 1 (DTM1). As we noted, MRS generally takes fewer iterations than SG for all considered periods.

Convergence process of SG and MRS at periods from 0.1 to 1000 s for DTM1.
Numerical performance of SG scheme, MRG and algebraic MRS technique in terms of run time and the number of sampled edges for DTM1.
Period . | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|
. | 0.1 s . | 1 s . | 10 s . | 100 s . | 1000 s . | |||||
Method | Time (s) and no. sampled edges (million) | |||||||||
SG | 173 | 7.18 | 613 | 7.18 | 478 | 7.18 | 200 | 7.18 | 254 | 7.18 |
MRS | 65 | 2.88 | 156 | 3.43 | 276 | 4.34 | 88 | 3.35 | 144 | 4.55 |
MRG | 118 | 1.22 | 177 | 1.90 | 218 | 3.02 | 135 | 1.76 | 146 | 3.24 |
MRS/SG (per cent) | 38 | 40 | 25 | 48 | 58 | 60 | 44 | 47 | 57 | 63 |
MRG/SG (per cent) | 68 | 17 | 29 | 26 | 46 | 42 | 68 | 25 | 57 | 45 |
Period . | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|
. | 0.1 s . | 1 s . | 10 s . | 100 s . | 1000 s . | |||||
Method | Time (s) and no. sampled edges (million) | |||||||||
SG | 173 | 7.18 | 613 | 7.18 | 478 | 7.18 | 200 | 7.18 | 254 | 7.18 |
MRS | 65 | 2.88 | 156 | 3.43 | 276 | 4.34 | 88 | 3.35 | 144 | 4.55 |
MRG | 118 | 1.22 | 177 | 1.90 | 218 | 3.02 | 135 | 1.76 | 146 | 3.24 |
MRS/SG (per cent) | 38 | 40 | 25 | 48 | 58 | 60 | 44 | 47 | 57 | 63 |
MRG/SG (per cent) | 68 | 17 | 29 | 26 | 46 | 42 | 68 | 25 | 57 | 45 |
Numerical performance of SG scheme, MRG and algebraic MRS technique in terms of run time and the number of sampled edges for DTM1.
Period . | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|
. | 0.1 s . | 1 s . | 10 s . | 100 s . | 1000 s . | |||||
Method | Time (s) and no. sampled edges (million) | |||||||||
SG | 173 | 7.18 | 613 | 7.18 | 478 | 7.18 | 200 | 7.18 | 254 | 7.18 |
MRS | 65 | 2.88 | 156 | 3.43 | 276 | 4.34 | 88 | 3.35 | 144 | 4.55 |
MRG | 118 | 1.22 | 177 | 1.90 | 218 | 3.02 | 135 | 1.76 | 146 | 3.24 |
MRS/SG (per cent) | 38 | 40 | 25 | 48 | 58 | 60 | 44 | 47 | 57 | 63 |
MRG/SG (per cent) | 68 | 17 | 29 | 26 | 46 | 42 | 68 | 25 | 57 | 45 |
Period . | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|
. | 0.1 s . | 1 s . | 10 s . | 100 s . | 1000 s . | |||||
Method | Time (s) and no. sampled edges (million) | |||||||||
SG | 173 | 7.18 | 613 | 7.18 | 478 | 7.18 | 200 | 7.18 | 254 | 7.18 |
MRS | 65 | 2.88 | 156 | 3.43 | 276 | 4.34 | 88 | 3.35 | 144 | 4.55 |
MRG | 118 | 1.22 | 177 | 1.90 | 218 | 3.02 | 135 | 1.76 | 146 | 3.24 |
MRS/SG (per cent) | 38 | 40 | 25 | 48 | 58 | 60 | 44 | 47 | 57 | 63 |
MRG/SG (per cent) | 68 | 17 | 29 | 26 | 46 | 42 | 68 | 25 | 57 | 45 |
Period . | |||||
---|---|---|---|---|---|
. | 0.1 s . | 1 s . | 10 s . | 100 s . | 1000 s . |
A | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 |
LAS | 4.73 × 107 | 5.27 × 107 | 6.12 × 107 | 5.19 × 107 | 6.31 × 107 |
Period . | |||||
---|---|---|---|---|---|
. | 0.1 s . | 1 s . | 10 s . | 100 s . | 1000 s . |
A | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 |
LAS | 4.73 × 107 | 5.27 × 107 | 6.12 × 107 | 5.19 × 107 | 6.31 × 107 |
Period . | |||||
---|---|---|---|---|---|
. | 0.1 s . | 1 s . | 10 s . | 100 s . | 1000 s . |
A | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 |
LAS | 4.73 × 107 | 5.27 × 107 | 6.12 × 107 | 5.19 × 107 | 6.31 × 107 |
Period . | |||||
---|---|---|---|---|---|
. | 0.1 s . | 1 s . | 10 s . | 100 s . | 1000 s . |
A | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 | 8.47 × 107 |
LAS | 4.73 × 107 | 5.27 × 107 | 6.12 × 107 | 5.19 × 107 | 6.31 × 107 |
For the point that the reduction in time is more significant at high frequencies, this is mainly caused by the use of the subsampling scheme. As mentioned before, the subsampling starts at one skin depth, which leads to different start points for different frequencies. If the same initial discretization grids are used for different frequencies (the same initial grids for a range of frequencies is used in this paper), this results in different sampled edges for different frequencies with smaller sampled edges for higher frequencies, accounting for a more significant reduction in time at high frequencies.
Finally, we examine the accuracy of our algorithm again by comparing our solution with the public result from Nam et al. (2007) at 100 s along one survey line (x=0 km) in Fig. 10. For this purpose, we also calculate the solution for SG. As indicated in the figure, both the algebraic MRS method and SG produce results in good agreement with the reference solution. The relative difference for apparent resistivity is below 3.9 per cent, and the absolute phase difference is below 0.8°.

Comparison of solution from the algebraic MRS technique, MRG technique and the SG scheme with the reference solution from Nam et al. (2007) for DTM1. (a) Apparent resistivities for XY polarization, (b) apparent resistivities for YX polarization, (d) phases for XY polarization and (e) phases for YX polarization. (c) and (f) are the relative difference for apparent resistivity and the phase difference against the reference solution, respectively.
Since the choice of subsampling scheme used in this paper results in the dependence of the subsampling level, the number of abstract subregions and the number of layers contained in each abstract subregion, we examined the effect of different choices of the number of abstract subregions (the maximum of subregions is limited by the initial grid of the model) on numerical performance for the DTM1 at 1 and 100 s. For this purpose, we design two different subsamplings, the subsampling defined by [S, N] = [2, 3; 1, 3; 0, 21; 1, 19; 2, 46] (referred as MRS-1) for 1 s and [S, N] = [2, 3; 1, 3; 0, 19; 1, 26; 2, 41] for 100 s and the five-level subsampling (referred as MRS-2) as used in the previous tests. MRS-2 can be considered as a result of increasing the number of abstract subregions from MRS-1. As listed in Table 5, the result shows that while adding more subregions improves the modelling efficiency in proportion to the reduction of edges, it does not obviously affect the accuracy as shown in Fig. 11.

Comparison of solution from the different MRS schemes for DTM1. (a) Apparent resistivities for XY polarization, (b) apparent resistivities for YX polarization, (d) phases for XY polarization and (e) phases for YX polarization. (c) and (f) are the relative difference for apparent resistivity and the phase difference against the reference solution, respectively.
Numerical performance of different sampling schemes in terms of run time and the number of sampled edges for DTM1.
. | Period . | |||
---|---|---|---|---|
. | 1 s . | 100 s . | ||
Time (s) and no. sampled edges (million) | ||||
MRS-1 | 204 | 4.23 | 118 | 4.24 |
MRS-2 | 156 | 3.43 | 88 | 3.35 |
MRS-2/MRS-1 (per cent) | 76 | 81 | 75 | 79 |
. | Period . | |||
---|---|---|---|---|
. | 1 s . | 100 s . | ||
Time (s) and no. sampled edges (million) | ||||
MRS-1 | 204 | 4.23 | 118 | 4.24 |
MRS-2 | 156 | 3.43 | 88 | 3.35 |
MRS-2/MRS-1 (per cent) | 76 | 81 | 75 | 79 |
Numerical performance of different sampling schemes in terms of run time and the number of sampled edges for DTM1.
. | Period . | |||
---|---|---|---|---|
. | 1 s . | 100 s . | ||
Time (s) and no. sampled edges (million) | ||||
MRS-1 | 204 | 4.23 | 118 | 4.24 |
MRS-2 | 156 | 3.43 | 88 | 3.35 |
MRS-2/MRS-1 (per cent) | 76 | 81 | 75 | 79 |
. | Period . | |||
---|---|---|---|---|
. | 1 s . | 100 s . | ||
Time (s) and no. sampled edges (million) | ||||
MRS-1 | 204 | 4.23 | 118 | 4.24 |
MRS-2 | 156 | 3.43 | 88 | 3.35 |
MRS-2/MRS-1 (per cent) | 76 | 81 | 75 | 79 |
4.3 Realistic terrain model
In this part, we consider a realistic terrain model modified from Ren et al. (2017), called the realistic model for convenience. This model covers an area from −24 to 24 km in the horizontal directions with the highest altitude of 1163 m as shown in Fig. 12. The realistic model has an arbitrary resistivity variation below the surface, as shown in the Fig. 13. To guarantee the modelling accuracy, we extend the computation domain with an additional distance of 80 km in each direction. The computation domain is discretized into 224 × 224 × 112 cells (excluding the 12 air layers) with the smallest cell size of |$360\times 360\times 80\, {{\text{m}}^{3}}$| (≤1s) and |$360\times 360\times 200\, {{\text{m}}^{3}}\, (\gt 1\text{ s})$|. This discretization results in a total of 18.88 million discrete edge components.

Illustration of the terrain for the realistic model modified from Ren et al. (2017).

3-D resistivity distribution below the surface for the realistic model. (a) y–z slice view and (b) x–z slice view.
For the test at 2 s, the subsampling scheme is defined by the subsampling vector [S, N] = [2, 3; 1, 3;0, 30; 1, 6; 2, 6; 3, 5; 4, 7; 5, 64] with a total of eight abstract subregions and the highest subsampling level of five. The third subregion, a unsampled region, includes 6 air layers and 24 earth layers of 224 × 224 horizontal cells. The first and second abstract subregions above the third subregion have sizes of 56 × 56 × 3 and 112 × 112 × 3 cells, respectively. For subregions below the unsampled region, the sampling level increases by one at each time when the subregion goes deeper. The resulting cell sizes from the fourth abstract subregion to the bottom abstract subregion are 112 × 112 × 6, 56 × 56 × 6, 28 × 28 × 5, 14 × 14 × 7 and 7 × 7 × 64 cells, respectively. This results in a total of 9.90 million edge reduction. For 0.02, 0.2 and 20 s, the abstract subsampling schemes of [S, N] = [2, 3; 1, 3; 0, 25; 1, 2; 2, 2; 3, 2; 4, 4; 5, 83], [S, N] = [2, 3; 1, 3; 0, 31; 1, 5; 2, 5; 3, 5; 4, 12; 5, 60] and [S, N] = [2, 3; 1, 3; 0, 46; 1, 6; 2, 8; 3, 8; 4, 10; 5, 40] are used.
Again, the numerical performance is examined by comparing our algebraic MRS technique with the SG scheme for this realistic model at periods of 0.02, 0.2, 2 and 20 s, listed in Table 6. The table shows that the algebraic MRS technique exclusively outperforms the SG scheme. Especially at 0.02 s, the computation time of our algebraic MRS method is merely 18 per cent of that (1346 s vs 7334 s) for SG. Similar as in the previous case, the decrease in computation time is larger than the reduction in the edge number.
Numerical performance of SG scheme and algebraic MRS technique in terms of run time and the number of sampled edges for the terrain model.
Period . | ||||||||
---|---|---|---|---|---|---|---|---|
. | 0.02 s . | 0.2 s . | 2 s . | 20 s . | ||||
Method | Time (s) and no. sampled edges (million) | |||||||
SG | 7334 | 18.88 | 6,100 | 18.88 | 6,180 | 18.88 | 4,050 | 18.88 |
MRS | 1346 | 8.07 | 2,070 | 9.03 | 1,833 | 8.98 | 2,024 | 10.82 |
MRS/SG (per cent) | 18 | 43 | 34 | 48 | 30 | 48 | 50 | 57 |
Period . | ||||||||
---|---|---|---|---|---|---|---|---|
. | 0.02 s . | 0.2 s . | 2 s . | 20 s . | ||||
Method | Time (s) and no. sampled edges (million) | |||||||
SG | 7334 | 18.88 | 6,100 | 18.88 | 6,180 | 18.88 | 4,050 | 18.88 |
MRS | 1346 | 8.07 | 2,070 | 9.03 | 1,833 | 8.98 | 2,024 | 10.82 |
MRS/SG (per cent) | 18 | 43 | 34 | 48 | 30 | 48 | 50 | 57 |
Numerical performance of SG scheme and algebraic MRS technique in terms of run time and the number of sampled edges for the terrain model.
Period . | ||||||||
---|---|---|---|---|---|---|---|---|
. | 0.02 s . | 0.2 s . | 2 s . | 20 s . | ||||
Method | Time (s) and no. sampled edges (million) | |||||||
SG | 7334 | 18.88 | 6,100 | 18.88 | 6,180 | 18.88 | 4,050 | 18.88 |
MRS | 1346 | 8.07 | 2,070 | 9.03 | 1,833 | 8.98 | 2,024 | 10.82 |
MRS/SG (per cent) | 18 | 43 | 34 | 48 | 30 | 48 | 50 | 57 |
Period . | ||||||||
---|---|---|---|---|---|---|---|---|
. | 0.02 s . | 0.2 s . | 2 s . | 20 s . | ||||
Method | Time (s) and no. sampled edges (million) | |||||||
SG | 7334 | 18.88 | 6,100 | 18.88 | 6,180 | 18.88 | 4,050 | 18.88 |
MRS | 1346 | 8.07 | 2,070 | 9.03 | 1,833 | 8.98 | 2,024 | 10.82 |
MRS/SG (per cent) | 18 | 43 | 34 | 48 | 30 | 48 | 50 | 57 |
For this realistic model, the accuracy of our algorithm is once again checked against SG. Fig. 14 compares the numerical solutions from the algebraic MRS algorithm and the SG scheme at 2 s along one line (x=2 km). They are in good agreement, with the relative difference in apparent resistivity below 3.3 per cent and the absolute phase differences below 2.2°.

Comparison of the algebraic MRS technique and SG scheme for the realistic model. (a) Apparent resistivities for XY polarization, (b) apparent resistivities for YX polarization, (d) phases for XY polarization and (e) phases for YX polarization. (c) and (f) are the relative difference for apparent resistivity and the phase difference against the SG solution, respectively.
5 CONCLUSIONS
We have introduced an efficient algebraic MRS method for MT forward modelling on staggered FD grids based on the regularization equation, in which the traditional curl–curl equation is augmented with a scaled grad–div operator to enforce the divergence free current explicitly. The algebraic MRS scheme does not require the formation of subgrids as in Cherevatova et al. (2018). Once the abstract subsampling is defined, we can easily formulate the interpolation matrices based on the spatial relationship between retained and removed edges for each subsampling level. Then, we can subsample the grid based on matrix multiplication to generate linear systems of equations for different levels of subsampling. This avoids the discretization of the curl–curl equation on inconsistent subgrids as in Cherevatova et al. (2018).
The correctness of the algebraic MRS algorithm is verified by comparing our result with the reference solution based on a layered model. The accuracy and efficiency of the proposed algorithm are examined against the classic SG algorithm based on DTM1 and a realistic terrain model. In general, the algebraic MRS algorithm can reduce the degrees of freedom of the resulting linear system of equations by around half at an accuracy comparable to the SG solution, resulting in an efficiency gain of more than the reduction of the degrees of freedom.
For this algorithm, there are several obvious advantages against the MRG scheme proposed by Cherevatova et al. (2018). The most attractive one is that we do not need to discretize the curl–curl equation on different subgrids, which can be a challenge at interfaces of different subgrids. The bypass of the formation of subgrids can be considered as another benefit, simplifying the implementation of this algorithm for inversion. For the numerical performance in terms of efficiency and accuracy, no conclusion can be reached without a close examination on the two methods.
ACKNOWLEDGEMENTS
We would like to thank the associated editor Ute Weckmann, and two anonymous reviewers for their valuable comments and suggestions, which significantly improved the manuscript. We also would like to thank M. Cherevatova, G.D. Egbert and M. Yu. Smirnov for providing their code for comparison and M. J. Nam, H. J. Kim, Y. Song, T. J. Lee, J. S. Son and J. H. Suh for making valuable data publicly available. We are also grateful to the High Performance Computing Center of Central South University for partial support of this work. This work was financially supported by the National Natural Science Foundation of China (42130810, 72088101, 42074165 and 42174171), the Hunan Provincial Innovation Foundation for Postgraduate (CX20210271), the Department of Emergency Management of Hunan Province (2020-06), and the Open Research Fund Program of Key Laboratory of Metallogenic Prediction of Nonferrous Metals and Geological Environment Monitoring (2021YSJS21).
DATA AVAILABILITY STATEMENT
The data and plot code underlying this paper is available in the GitHub repository (https://github.com/Li205001046/algebraic-multi-resolution).