Efficient generalized Golub-Kahan based methods for dynamic inverse problems

Abstract

We consider efficient methods for computing solutions to and estimating uncertainties in dynamic inverse problems, where the parameters of interest may change during the measurement procedure. Compared to static inverse problems, incorporating prior information in both space and time in a Bayesian framework can become computationally intensive, in part, due to the large number of unknown parameters. In these problems, explicit computation of the square root and/or inverse of the prior covariance matrix is not possible. In this work, we develop efficient, iterative, matrix-free methods based on the generalized Golub-Kahan bidiagonalization that allow automatic regularization parameter and variance estimation. We demonstrate that these methods can be more flexible than standard methods and develop efficient implementations that can exploit structure in the prior, as well as possible structure in the forward model. Numerical examples from photoacoustic tomography, deblurring, and passive seismic tomography demonstrate the range of applicability and effectiveness of the described approaches. Specifically, in passive seismic tomography, we demonstrate our approach on both synthetic and real data. To demonstrate the scalability of our algorithm, we solve a dynamic inverse problem with approximately $43,000$ measurements and $7.8$ million unknowns in under $40$ seconds on a standard desktop.

arXiv comment27 pages, 12 figures

References in corpus (5)

• Hybrid and iteratively reweighted regularization by unbiased predictive risk and weighted GCV for projected systems
• Fast computation of uncertainty quantification measures in the geostatistical approach to solve inverse problems
• A constrained variable projection reconstruction method for photoacoustic computed tomography without accurate knowledge of transducer responses
• Impact of non-stationary optical illumination on image reconstruction in optoacoustic tomography
• Fast Kalman Filter using Hierarchical-matrices and low-rank perturbative approach

Cited by in corpus (1)

• A Joint Bidiagonalization Based Algorithm for Large Scale Linear Discrete Ill-posed Problems in General-Form Regularization