NOTE: This repository and in particular this description is work in progress, not all scripts have been finished and tested. Use at your own risk! However, we will succesively update the repository correcting bugs, and adding additional functionality.
This repository contains
Adapting
The Jacobian of a data and parameter set is defined as
Transformig the parameter vector by
the data by
leads to the further transformation
From this we havethe simplified objective function
The Jacobian used within
For this reason, some minor changes in the
The changes made in the souce code will only be relevant to the parts used by the calculation and storage of the Jacobian. In addition to the
binary file
Preprocessing the Jacobian
The generated Jacobians for realistic models can be large (several tens of Gb). For this reason the first step in working with the Jacobians is
to put them into a format easier to handle by
Sensitivities
The use of sensitivities (in a variety of flavours) is comparatively easy, but needs some clarification, as it does not really conform to the everyday use of the word. Sensitivities are derived from the final model Jacobian matrix, which often is available from the inversion algorithm itself. It needs to be kept in mind that this implies any conclusions drawn are valid in the domain of validity for the Taylor expansion involved only. This may be a grave disadvantage in highly non-linear settings, but we believe that it still can be usefull for fast characterization of uncertainty.
Here, the parameter vector
-
"Raw" sensitivities, defined as
$S_j = \sum_{i=1,n_d} \tilde{J}_{ij}$ . No absolute values are involved, hence there may be both, positive and negative, elements. This does not conform to what we expect of sensitivity (positivity), but carries the most direct information on the role of parameter$j$ in the inversion. -
"Euclidean" sensitivities, which are the most commonly used form. They are is defined as:
$S^2_j = \sum_{i=1,n_d} \left||\tilde{J}_{ij}\right||^2=diag\left(\mathbf{\tilde{J}}^T\mathbf{\tilde{J}}\right)$ . This solves the positivity issue of raw sensitivities. The square root of this sensitivity is often preferred, and implemented in many popular inversion codes. -
Coverage. For this form, the absolute values of the Jacobian are used:
$\sum_{i=1,n_d} \left||\tilde{J}_{ij}\right||$
For a definition of a depth of investigation (DoI), or model blanking/shading, forms (2) and (3) can be used. This, however, requires the choice of a threshold/scale is required, depending on the form applied.
When moving from the error-normalised Jacobian,
[1] M. Deal and G. Nolet (1996) “Nullspace shuttles", Geophysical Journal International, 124, 372–380
[2] G. Muñoz and V. Rath (2006) “Beyond smooth inversion: the use of nullspace projection for the exploration of non-uniqueness in MT", Geophysical Journal International, 164, 301–311, 2006, doi:10.1111/j.1365-246X.2005.02825.x
[3] G. D. Egbert and A. Kelbert (2012) “Computational recipes for electromagnetic inverse problems”, Geophysical Journal International, 189, 251–267, doi:10.1111/j.1365-246X.2011.05347.x
[4] A. Kelbert, N. Meqbel, G. D. Egbert, and K. Tandon (2014) “ModEM: A Modular System for Inversion of Electromagnetic Geophysical Data”, Computers & Geosciences, 66, 440–53, doi:10.1016/j.cageo.2014.01.010
[5] A. Tarantola (2005) "Inverse Problem Theory and Methods for Model Parameter Estimation", SIAM, Philadelphia PA, USA
[6] K. Schwalenberg, V. Rath, and V. Haak (2002) “Sensitivity studies applied to a two-dimensional resistivity model from the Central Andes”, Geophysical Journal International, 150, doi:10.1046/j.1365-246X.2002.01734.x