Search

We develop a theoretical framework for framing and solving probabilistic linear(ized) inverse problems in function spaces. This is built on the statistical theory of Gaussian Processes, and allows results to be obtained independent of any basis, avoiding any difficulties associated with the fidelity of representation that can be achieved. We show that the results of Backus–Gilbert theory can be fully understood within our framework, although there is not an exact equivalence due to fundamental differences of philosophy between the two approaches. Nevertheless, our work can be seen to unify several strands of linear inverse theory, and connects it to a large body of work in machine learning. We illustrate the application of our theory using a simple example, involving determination of Earth's radial density structure. [ABSTRACT FROM AUTHOR]

By starting from a general framework for probabilistic continuous inversion (developed in Part I) and introducing discrete basis functions, we obtain the well-known algorithms for probabilistic least-squares inversion set out by Tarantola & Valette. In doing so, we establish a direct equivalence between the spatial covariance function that must be specified in continuous inversion, and the combination of basis functions and prior covariance matrix that must be chosen for discretized inversion. We show that the common choice of Tikhonov regularization (⁠|$\mathbf {C_m^{-1}} = \sigma ^2\mathbf {I}$|⁠) arises from a delta-function spatial covariance, and that this lies behind many of the artefacts commonly associated with discretized inversion. We show that other choices of spatial covariance function can be used to generate regularization matrices yielding substantially better results, and permitting localization of features even if global basis functions are used. We are also able to offer a straightforward explanation for the spectral leakage problem identified by Trampert & Snieder. [ABSTRACT FROM AUTHOR]