Open AccessData space conjugate gradient inversion for 2‐D magnetotelluric data
Author(s) -
Siripunvaraporn Weerachai,
Egbert Gary
Publication year - 2007
Publication title -
geophysical journal international
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.302
H-Index - 168
eISSN - 1365-246X
pISSN - 0956-540X
DOI - 10.1111/j.1365-246x.2007.03478.x
Subject(s) - conjugate gradient method , magnetotellurics , occam , inversion (geology) , algorithm , computation , data space , nonlinear conjugate gradient method , computer science , mathematics , gradient descent , physics , geology , artificial intelligence , paleontology , quantum mechanics , structural basin , artificial neural network , programming language , electrical resistivity and conductivity
SUMMARY A data space approach to magnetotelluric (MT) inversion reduces the size of the system of equations that must be solved from M × M , as required for a model space approach, to only N × N , where M is the number of model parameter and N is the number of data. This reduction makes 3‐D MT inversion on a personal computer possible for modest values of M and N . However, the need to store the N × M sensitivity matrix J remains a serious limitation. Here, we consider application of conjugate gradient (CG) methods to solve the system of data space Gauss–Newton equations. With this approach J is not explicitly formed and stored, but instead the product of J with an arbitrary vector is computed by solving one forward problem. As a test of this data space conjugate gradient (DCG) algorithm, we consider the 2‐D MT inverse problem. Computational efficiency is assessed and compared to the data space Occam's (DASOCC) inversion by counting the number of forward modelling calls. Experiments with synthetic data show that although DCG requires significantly less memory, it generally requires more forward problem solutions than a scheme such as DASOCC, which is based on a full computation of J .