A Tool for Analysing Depth Resolution in Potential-field Inversion - Application to the Neapolitan Volcanic Area

Author(s):  
V. Paoletti ◽  
P.C. Hansen ◽  
M.F. Hansen ◽  
M. Fedi
Geophysics ◽  
2014 ◽  
Vol 79 (4) ◽  
pp. A33-A38 ◽  
Author(s):  
Valeria Paoletti ◽  
Per Christian Hansen ◽  
Mads Friis Hansen ◽  
Maurizio Fedi

In potential-field inversion, careful management of singular value decomposition components is crucial for obtaining information about the source distribution with respect to depth. In principle, the depth-resolution plot provides a convenient visual tool for this analysis, but its computational complexity has hitherto prevented application to large-scale problems. To analyze depth resolution in such problems, we developed a variant ApproxDRP, which is based on an iterative algorithm and therefore suited for large-scale problems because we avoid matrix factorizations and the associated demands on memory and computing time. We used the ApproxDRP to study retrievable depth resolution in inversion of the gravity field of the Neapolitan Volcanic Area. Our main contribution is the combined use of the Lanczos bidiagonalization algorithm, established in the scientific computing community, and the depth-resolution plot defined in the geoscience community.


Geophysics ◽  
2005 ◽  
Vol 70 (6) ◽  
pp. A1-A11 ◽  
Author(s):  
Maurizio Fedi ◽  
Per Christian Hansen ◽  
Valeria Paoletti

We study the inversion of potential fields and evaluate the degree of depth resolution achievable for a given problem. To this end, we introduce a powerful new tool: the depth-resolution plot (DRP). The DRP allows a theoretical study of how much the depth resolution in a potential-field inversion is influenced by the way the problem is discretized and regularized. The DRP also allows a careful study of the influence of various kinds of ambiguities, such as those from data errors or of a purely algebraic nature. The achievable depth resolution is related to the given discretization, regularization, and data noise level. We compute DRP by means of singular-value decomposition (SVD) or its generalization (GSVD), depending on the particular regularization method chosen. To illustrate the use of the DRP, we assume a source volume of specified depth and horizontal extent in which the solution is piecewise constant within a 3D grid of blocks. We consider various linear regularization terms in a Tikhonov (damped least-squares) formulation, some based on using higher-order derivatives in the objective function. DRPs are illustrated for both synthetic and real data. Our analysis shows that if the algebraic ambiguity is not too large and a suitable smoothing norm is used, some depth resolution can be obtained without resorting to any subjective choice of depth weighting.


2014 ◽  
Author(s):  
Denis Marcotte ◽  
Michel Chouteau ◽  
Pejman Shamsipour

Sign in / Sign up

Export Citation Format

Share Document