the Creative Commons Attribution 4.0 License.
the Creative Commons Attribution 4.0 License.
Accelerating 3D Magnetotelluric Forward Modelling with Domain Decomposition and Order-Reduction Methods
Abstract. Three-dimensional (3D) magnetotelluric (MT) forward modelling is computationally demanding, limiting its use in global uncertainty quantification and sampling-based probabilistic inversion. Here, we introduce a novel forward-modelling framework that combines an iterative domain decomposition (DD) formulation with proper orthogonal decomposition (POD) reduced-order modelling to enable scalable and efficient 3D MT simulations. The DD component partitions the computational domain into subdomains, avoiding the factorization of a single global system, accelerating simulations by over 60 % compared to global solvers, and alleviating memory bottlenecks in large problems. The POD component leverages the local DD solutions to construct a reduced-order version of the problem that can deliver accurate and fast solutions to the 3D forward problem during subsequent evaluations. Using the DTM1 benchmark and a real-world conductivity model, we quantify runtime, memory, and accuracy in terms of MT quantities of interest (apparent resistivity and phase). DD–POD achieves speed-ups exceeding 90 % relative to full-order solvers and up to 70 % relative to existing ROM techniques, while maintaining acceptable accuracy. These results suggest that DD–POD can make higher-resolution 3D MT forward modelling practical within sampling-based workflows by substantially reducing both runtime and memory demands.
- Preprint
(16790 KB) - Metadata XML
- BibTeX
- EndNote
Status: open (until 08 Jul 2026)
-
RC1: 'Comment on egusphere-2026-700', Rob L. Evans, 28 May 2026
reply
-
AC1: 'Reply on RC1', Luis Tao, 02 Jun 2026
reply
We appreciate the time taken to read the MS and for the constructive feedback. We also agree that diving into this questions would benefit the MS.
Aside from the changes made in the MS (in the supplement) we also post here the answers for the questions:
- 1) Thank you for this question. In our current implementation, which is based on structured meshes, the horizontal resolution remains constant with depth. We can, however, control the height of each layer. This allows us to increase the vertical resolution near the surface to better account for topography, while using larger vertical elements at greater depths. While we acknowledge this does not entirely resolve the issue you raised, it is important to note that the Domain Decomposition formulation we employ is highly general. It can accommodate the use of subdomains with varying Nx and Ny dimensions, including subdomains with less elements at depth, which could potentially lead to an even more efficient solver.
We have updated the manuscript in Section 4 (Implementation Aspects), Subsection 4.1 (Domain Discretization), to include a comment noting that the formulation allows for more flexible partitions.
- 2) This is a very fair point. The error is essentially controlled by four factors: the convergence threshold in the domain decomposition (δ), the penalty factor (β) applied to the electric field mismatch at the interfaces, the snapshots generated to create the basis, and the number of modes retained in that basis (nPOD). As shown in the manuscript, the error stabilizes at around 5% with increasing nPOD. If we use a tighter δ and a larger β penalty, we believe this approach will further decrease the error, though it introduces a slight trade-off in execution time. Additionally, the snapshots used to create the basis were generated via a grid search without optimizing the information they provided. We could likely improve this by employing more adaptive basis-enrichment strategies, a path we might have have to explore as we progress toward the inversion phase. Therefore, for the scope of this methodological paper, we considered our current error margin acceptable. For future inversions, we can enforce stricter hyperparameters to further decrease the error.
This discussion can be found in the manuscript in Section 6 (Results)-Subsection 6.2 (Real-world model results)-SubsubSection 6.2.2 "Validation and accuracy", and in Subsection 6.3 (Implications for probabilistic inversion).
- 3) Regarding mesh generation and model editing, our solver currently operates with parallelepipedal structured meshes. Consequently, the inputs for the mesh consist primarily of the dimensions of each element, and conductivity is assigned element-by-element, making it a largely manual process at this stage. Because the primary focus of this work is on advancing the numerical methodology rather than optimizing meshing capabilities, we have maintained this straightforward approach.
We have added a comment to the manuscript in Section 4 (Implementation Aspects), Subsection 4.1 (Domain Discretization), to clarify this.
-
AC1: 'Reply on RC1', Luis Tao, 02 Jun 2026
reply
Data sets
DTM1 input files for 20×20×18 (includes snapshots), 40×40×36, and 80×80×72 mesh Luis Tao https://zenodo.org/records/19567027
Model code and software
Code for (DD) and DD-POD + Code Guide Luis Tao and Fabio Zyserman https://zenodo.org/records/19567027
Viewed
| HTML | XML | Total | BibTeX | EndNote | |
|---|---|---|---|---|---|
| 261 | 118 | 24 | 403 | 18 | 17 |
- HTML: 261
- PDF: 118
- XML: 24
- Total: 403
- BibTeX: 18
- EndNote: 17
Viewed (geographical distribution)
| Country | # | Views | % |
|---|
| Total: | 0 |
| HTML: | 0 |
| PDF: | 0 |
| XML: | 0 |
- 1
This paper presents a new approach to modeling three-dimensional electrical resistivity models with the application to the magnetotelluric method.
By dividing the model into subdomains, and connecting fields across the horizontal boundaries of these layered domains, the code is able to parallelize the computation working on the smaller domains individually.
The paper demonstrates how this approach achieves reliable results in much faster computation times, something that is essential for the kinds of Bayesian approaches that develop an ensemble of models that satisfy a data set, important to providing some estimates of parameter uncertainty.
The paper is well written and convincing and should be published more or less as is. Rather than specific critiques, I do have a couple of questions that would be worth diving into a bit more, should the authors so choose.