Hierarchical probing for estimating the trace of the matrix inverse on toroidal lattices

From MaRDI portal
Publication:2870692

DOI10.1137/120881452zbMATH Open1281.65072arXiv1302.4018OpenAlexW2964321151WikidataQ60153249 ScholiaQ60153249MaRDI QIDQ2870692FDOQ2870692


Authors: Andreas Stathopoulos, Jesse Laeuchli, Kostas Orginos Edit this on Wikidata


Publication date: 21 January 2014

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: The standard approach for computing the trace of the inverse of a very large, sparse matrix A is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in our motivating application of Lattice QCD. Often, the elements of A1 display certain decay properties away from the non zero structure of A, but random vectors cannot exploit this induced structure of A1. Probing is a technique that, given a sparsity pattern of A, discovers elements of A through matrix-vector multiplications with specially designed vectors. In the case of A1, the pattern is obtained by distance-k coloring of the graph of A. For sufficiently large k, the method produces accurate trace estimates but the cost of producing the colorings becomes prohibitively expensive. More importantly, it is difficult to search for an optimal k value, since none of the work for prior choices of k can be reused.


Full work available at URL: https://arxiv.org/abs/1302.4018




Recommendations





Cited In (18)

Uses Software





This page was built for publication: Hierarchical probing for estimating the trace of the matrix inverse on toroidal lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870692)