Everything is Vecchia: Unifying low-rank and sparse inverse approximations
Computational Mathematics, Linear Algebra and seminar by Robert Webber, UC San Diego
Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Thursday 15:00 New York (GMT-5)
Recording available
Abstract
Robert Webber connects partial pivoted Cholesky, effective for nearly low-rank matrices, with Vecchia approximation, effective when inverse Cholesky factors are nearly sparse. Combining a partial Cholesky approximation with a Vecchia approximation of its residual produces another Vecchia approximation of the original matrix with an enlarged sparsity pattern. This unifies several factored matrix-approximation approaches and explains the broader applicability of the Vecchia framework.