04.08.2013 Views

P. Schmoldt, PhD - MTNet - DIAS

P. Schmoldt, PhD - MTNet - DIAS

P. Schmoldt, PhD - MTNet - DIAS

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

6. Using magnetotellurics to gain information about the Earth<br />

sion, whereas the objective functional (Eq. 6.32) is used by most of the other approaches.<br />

The Gauss-Newton (GN) method is based on Newton’s method, which uses<br />

mk+1 = mk − H −1<br />

k ∇T mk, (6.35)<br />

with the Hessian H = ∂ 2 W/∂m 2 and the gradient ∇ T m to derive the model for the (k+1)-th<br />

iteration step. In contrast to Newton’s method the GN method keeps only the first derivative<br />

of H and uses the first order Taylor’s series expansion to linearise the forward response<br />

in the forward model approach f (mk) (cf. Eq. 6.20). The forward response of the<br />

(k+1)-th iteration step can then be expressed in terms of f (m) at the previous step, the<br />

N × M Jacobian Jk = ∂ f /∂mk, and the difference between the models of the two steps:<br />

f (mk+1) = f (mk) + Jk · (mk+1 − mk). (6.36)<br />

Using Equation 6.34 with the objective functional (Eq. 6.33) yields the iteration scheme<br />

mk+1 − mk = τR −1<br />

mm + J T<br />

k R−1<br />

dd Jk + λkI −1 J T<br />

k R−1<br />

dd (d − f (mk)) + τR −1<br />

mm(mk − m0) , (6.37)<br />

where I is the identity matrix and λk is a damping factor introduced for numerical stability<br />

[Marquardt, 1963]. Accordingly, GN methods need to invert the M × M matrix<br />

−1<br />

τRmm + J T<br />

k R−1 ddJk + λkI to calculate the N × M Jacobian Jk, making it computational<br />

very expensive.<br />

Occam’s inversion [e.g. Siripunvaraporn, 2010] is a variation of the classical GN method<br />

and can be divided into two phases: first the RMS misfit is reduced to the specified level<br />

of misfit Υ 2 through varying the smoothing parameter τ, thereafter τ is minimised as<br />

much as possible without increasing the RMS misfit. In the first phase, the first term on<br />

the right hand side in Equation 6.33 is reduced to a minimum specified by Υ, followed<br />

by minimising the second term on the right hand side, which then defines the value of<br />

the error function (together with the covariance matrix Rdd). Derivation of the optimal τ<br />

can be carried out through simple search schemes, e.g. bisection search [Siripunvaraporn<br />

and Egbert, 2000; Press et al., 2007]. A common choice of Υ 2 is 1 RMS, but the value<br />

may vary for certain problems [Siripunvaraporn, 2010]. Occam’s inversion can be further<br />

subdivided into data and model space inversion. The model space algorithm, like the GN<br />

method, uses the first order Taylor’s series expansion to linearise the forward response<br />

(cf. Eq. 6.36). In that case the solution to Equation 6.34 with the error function as defined<br />

in Equation 6.33 yields the iterative sequence<br />

mk+1 − m0 = τR −1<br />

mm + J T<br />

k R−1 ddJk −1 JkR −1<br />

dd d ′ k, (6.38)<br />

where d ′ k = d − f (mk) + Jk · (mk+1 − m0). Equation 6.38 can be solved for a number of<br />

different τ at each iteration step, and the model with the smallest misfit and norm at the<br />

target level (determined in phase I and phase II, respectively) is kept for the next iteration<br />

124

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!