betaFeedback

WorksMathematics

Kronecker Approximations of Covariance Matrices for Solving Inverse Problems

Abstract

Inverse problems arise in many applications where the task is to recover unknown parameters from indirect or noisy observations. In contrast to forward problems, where outputs are directly computed from known inputs, inverse problems are designed to infer the underlying variables from the observed effect. Inverse problems are often ill-posed, so regularization is needed to compute reasonable solutions. One form of regularization incorporates prior knowledge about the unknown parameters in the form of prior distributions. However, in many settings, large prior covariance matrices pose computational bottlenecks for solving inverse problems. To address this, we study approximations of large covariance matrices via structured Kronecker-Toeplitz products and demonstrate how these approximations can be used to solve inverse problems. We exploit the Block-Toeplitz-Toeplitz-Block structure induced by the covariance kernel to construct compact approximations that are orders of magnitude cheaper to store and invert. These approximations are deployed as prior covariance surrogates in Bayesian inverse problems solved via generalized hybrid iterative methods. We demonstrate that the Kronecker-Toeplitz approximation attains lower relative approximation error than existing matrix approximations, exhibits rapid error decay with rank, and enables efficient matrix-vector products. Applications to 2D seismic tomography reconstruction problems illustrate the practical utility of these methods.

Paper details

vlnc:W_t9qafy43
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 2

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Claude

View statement
Looking for related papers…