Fast Matrix Algebra For Bayesian Model Calibration

In Bayesian model calibration, evaluation of the likelihood function usually involves finding the inverse and determinant of a covariance matrix. When Markov Chain Monte Carlo (MCMC) methods are used to sample from the posterior, hundreds of thousands of likelihood evaluations may be required. In this paper, we demonstrate that the structure of the covariance matrix can be exploited, leading to substantial time savings in practice. We also derive two simple equations for approximating the inverse of the covariance matrix in this setting, which can be computed in near-quadratic time. The practical implications of these strategies are demonstrated using a simple numerical case study and the "quack" R package. For a covariance matrix with 1000 rows, application of these strategies for a million likelihood evaluations leads to a speedup of roughly 4000 compared to the naive implementation