Analysis of probing techniques for sparse approximation and trace estimation of decaying matrix functions

09/03/2020
by   Andreas Frommer, et al.
0

The computation of matrix functions f(A), or related quantities like their trace, is an important but challenging task, in particular for large and sparse matrices A. In recent years, probing methods have become an often considered f(A) or tr(f(A)) by the evaluation of (a small number of) quantities of the form f(A)v or v^Tf(A)v, respectively. These tasks can then efficiently be solved by standard techniques like, e.g., Krylov subspace methods. It is well-known that probing methods are particularly efficient when f(A) is approximately sparse, e.g., when the entries of f(A) show a strong off-diagonal decay, but a rigorous error analysis is lacking so far. In this paper we develop new theoretical results on the existence of sparse approximations for f(A) and error bounds for probing methods based on graph colorings. As a by-product, by carefully inspecting the proofs of these error bounds, we also gain new insights into when to stop the Krylov iteration used for approximating f(A)v or v^Tf(A)v, thus allowing for a practically efficient implementation of the probing methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/19/2022

Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods

We consider the problem of approximating the von Neumann entropy of a la...
research
08/15/2023

Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices

We consider the problem of estimating the trace of a matrix function f(A...
research
07/09/2021

Divide and conquer methods for functions of matrices with banded or hierarchical low-rank structure

This work is concerned with approximating matrix functions for banded ma...
research
10/01/2021

Randomized block Krylov methods for approximating extreme eigenvalues

Randomized block Krylov subspace methods form a powerful class of algori...
research
09/22/2022

Randomized low-rank approximation of monotone matrix functions

This work is concerned with computing low-rank approximations of a matri...
research
10/22/2021

Refined decay bounds on the entries of spectral projectors associated with sparse Hermitian matrices

Spectral projectors of Hermitian matrices play a key role in many applic...
research
05/06/2019

Estimating the inverse trace using random forests on graphs

Some data analysis problems require the computation of (regularised) inv...

Please sign up or login with your details

Forgot password? Click here to reset