Bayesian inversion of log-normal eikonal equations

Abstract

We study the Bayesian inverse problem for inferring the log-normal slowness function of the eikonal equation, given noisy observation data on its solution at a set of spatial points. We contribute rigorous proofs on the existence and well-posedness of the problem. We then study approximation of the posterior probability measure by solving the truncated eikonal equation, which contains only a finite number of terms in the Karhunen–Loeve expansion of the slowness function, by the fast marching method (FMM). The error of this approximation in the Hellinger metric is deduced in terms of the truncation level of the slowness and the grid size in the FMM resolution. It is well known that the plain Markov chain Monte Carlo (MCMC) procedure for sampling the posterior probability is highly expensive. We develop and justify the convergence of a multilevel MCMC method. Using the heap sort procedure in solving the forward eikonal equation by the FMM, our multilevel MCMC method achieves a prescribed level of accuracy for approximating the posterior expectation of quantities of interest, requiring only an essentially optimal level of complexity. Numerical examples confirm the theoretical results.