Publication: An efficient modified hierarchical domain decomposition for two-dimensional magnetotelluric forward modelling
Issued Date
2010-11-01
Resource Type
ISSN
1365246X
0956540X
0956540X
Other identifier(s)
2-s2.0-77958592189
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
Geophysical Journal International. Vol.183, No.2 (2010), 634-644
Suggested Citation
Tawat Rung-Arunwan, Weerachai Siripunvaraporn An efficient modified hierarchical domain decomposition for two-dimensional magnetotelluric forward modelling. Geophysical Journal International. Vol.183, No.2 (2010), 634-644. doi:10.1111/j.1365-246X.2010.04768.x Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/29045
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
An efficient modified hierarchical domain decomposition for two-dimensional magnetotelluric forward modelling
Author(s)
Other Contributor(s)
Abstract
We use 2-D magnetotelluric (MT) problems as a feasibility study to demonstrate that 3-D MT problems can be solved with a direct solver, even on a standard single processor PC. The scheme used is a hierarchical domain decomposition (HDD) method in which a global computational domain is uniformly split into many smaller non-overlapping subdomains. To make it more efficient, two modifications are made to the standard HDD method. Instead of three levels as in the standard HDD method, we classify the unknowns into four classes: the interiors, the horizontal interfaces, the vertical interfaces and the intersections. Four sets of smaller systems of equations are successively solved with a direct method (an LU factorization). The separation significantly reduces the large memory requirements of a direct solver. It also reduces the CPU time to almost half that of the standard HDD method although it is still slower than the conventional finite difference (FD) method. To further enhance the speed of the code, a red-black ordering is applied to solve the horizontal and vertical interface reduced systems. Numerical experiments on a 2-D MT problem of a given size running on a single processor machine shows that CPU time and memory used are almost constant for any resistivity models, frequencies and modes. This is a clear advantage of our algorithm and is of particular importance if the method is applied to 3-D problems. We show that our new method results in reductions in both memory usage and CPU time for large enough domains when compared to the standard FD and HDD schemes. In addition, we also introduce a 'memory minimization map', a graphical tool we can use instead of trial-and-error to pre-select the optimal size of subdomains, which yield the best performance in both CPU time and memory even running on a serial machine. © 2010 The Authors Geophysical Journal International © 2010 RAS.