By Topic

An enhanced Gauss-Newton inversion algorithm using a dual-optimal grid approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Abubakar, A. ; Schlumberger-Doll Res., Ridgefield, CT, USA ; Habashy, T.M. ; Druskin, V.L. ; Knizhnerman, L.

We developed two algorithms for solving the nonlinear electromagnetic inversion problem in the Earth. To achieve a balance between efficiency and robustness, both algorithms employ the Gauss-Newton inversion method. Moreover, to speed up the inversion's computational time, the so-called optimal grid technique is utilized. The first algorithm uses a forward solver with a very coarse optimal grid to calculate the Jacobian matrix. Hence, in this scheme we employ two different sets of optimal grids. One set is used to compute the data mismatch to be minimized and the other set is used to construct the Jacobian matrix. In the second approach we use a fixed-point iteration process where the inverse kernel is approximated on a coarse optimal grid that does not significantly compromise accuracy. The advantage of these optimal grids is that they considerably reduce the computation time without compromising accuracy. Numerical examples for two-dimensional axially symmetric and three-dimensional anisotropic configurations are used to demonstrate the advantage of using both algorithms over the standard Gauss-Newton inversion method.

Published in:

Geoscience and Remote Sensing, IEEE Transactions on  (Volume:44 ,  Issue: 6 )