A-optimal encoding weights for nonlinear inverse problems, with application to the Helmholtz inverse problem
- 21 June 2017
- journal article
- research article
- Published by IOP Publishing in Inverse Problems
- Vol. 33 (7) , 074008
Abstract
The computational cost of solving an inverse problem governed by PDEs, using multiple experiments, increases linearly with the number of experiments. A recently proposed method to decrease this cost uses only a small number of random linear combinations of all experiments for solving the inverse problem. This approach applies to inverse problems where the PDE solution depends linearly on the right-hand side function that models the experiment. As this method is stochastic in essence, the quality of the obtained reconstructions can vary, in particular when only a small number of combinations are used. We develop a Bayesian formulation for the definition and computation of encoding weights that lead to a parameter reconstruction with the least uncertainty. We call these weights A-optimal encoding weights. Our framework applies to inverse problems where the governing PDE is nonlinear with respect to the inversion parameter field. We formulate the problem in infinite dimensions and follow the optimize-then-discretize approach, devoting special attention to the discretization and the choice of numerical methods in order to achieve a computational cost that is independent of the parameter discretization. We elaborate our method for a Helmholtz inverse problem, and derive the adjoint-based expressions for the gradient of the objective function of the optimization problem for finding the A-optimal encoding weights. The proposed method is potentially attractive for real-time monitoring applications, where one can invest the effort to compute optimal weights offline, to later solve an inverse problem repeatedly, over time, at a fraction of the initial cost.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- A Stochastic Newton MCMC Method for Large-Scale Statistical Inverse Problems with Application to Seismic InversionSIAM Journal on Scientific Computing, 2012
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrixJournal of the ACM, 2011
- Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian ApproximationsSIAM Journal on Scientific Computing, 2011
- Inverse problems: A Bayesian perspectiveActa Numerica, 2010
- Numerical methods for the design of large-scale nonlinear discrete ill-posed inverse problemsInverse Problems, 2009
- Fast full-wavefield seismic inversion using encoded sourcesGeophysics, 2009
- Numerical methods for experimental design of large-scale linear ill-posed inverse problemsInverse Problems, 2008
- Bayesian Experimental Design: A ReviewStatistical Science, 1995
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splinesCommunications in Statistics - Simulation and Computation, 1990
- Tests for randomness of directions against equatorial and bimodal alternativesBiometrika, 1972