Faster Stochastic Trace Estimation with a Chebyshev Product Identity

01/01/2021
by   Eric Hallman, et al.
0

Methods for stochastic trace estimation often require the repeated evaluation of expressions of the form z^T p_n(A)z, where A is a symmetric matrix and p_n is a degree n polynomial written in the standard or Chebyshev basis. We show how to evaluate these expressions using only ⌈ n/2⌉ matrix-vector products, thus substantially reducing the cost of existing trace estimation algorithms that use Chebyshev interpolation or Taylor series.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2022

Krylov-aware stochastic trace estimation

We introduce an algorithm for estimating the trace of a matrix function ...
research
09/22/2021

Improved variants of the Hutch++ algorithm for trace estimation

This paper is concerned with two improved variants of the Hutch++ algori...
research
01/19/2023

XTrace: Making the most of every sample in stochastic trace estimation

The implicit trace estimation problem asks for an approximation of the t...
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
03/23/2023

On Generalizing Trace Minimization Principles, II

This paper is concerned with establishing a trace minimization principle...
research
03/18/2021

A Multilevel Approach to Stochastic Trace Estimation

This article presents a randomized matrix-free method for approximating ...
research
10/26/2021

Dynamic Trace Estimation

We study a dynamic version of the implicit trace estimation problem. Giv...

Please sign up or login with your details

Forgot password? Click here to reset