Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix

02/06/2022
by   Eric Hallman, et al.
0

For real symmetric matrices that are accessible only through matrix vector products, we present Monte Carlo estimators for computing the diagonal elements. Our probabilistic bounds for normwise absolute and relative errors apply to Monte Carlo estimators based on random Rademacher, sparse Rademacher, normalized and unnormalized Gaussian vectors, and to vectors with bounded fourth moments. The novel use of matrix concentration inequalities in our proofs represents a systematic model for future analyses. Our bounds mostly do not depend on the matrix dimension, target different error measures than existing work, and imply that the accuracy of the estimators increases with the diagonal dominance of the matrix. An application to derivative-based global sensitivity metrics corroborates this, as do numerical experiments on synthetic test matrices. We recommend against the use in practice of sparse Rademacher vectors, which are the basis for many randomized sketching and sampling algorithms, because they tend to deliver barely a digit of accuracy even under large sampling amounts.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2020

Bounds on the Spectral Sparsification of Symmetric and Off-Diagonal Nonnegative Real Matrices

We say that a square real matrix M is off-diagonal nonnegative if and on...
research
09/13/2021

The Double-Constant Matrix, Centering Matrix and Equicorrelation Matrix: Theory and Applications

This paper examines the properties of real symmetric square matrices wit...
research
10/05/2013

Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds

Given a real matrix A with n columns, the problem is to approximate the ...
research
10/09/2018

Matrix-free construction of HSS representation using adaptive randomized sampling

We present new algorithms for the randomized construction of hierarchica...
research
02/29/2020

Randomized block Krylov space methods for trace and log-determinant estimators

We present randomized algorithms based on block Krylov space method for ...
research
05/20/2020

Monte Carlo Estimators for the Schatten p-norm of Symmetric Positive Semidefinite Matrices

We present numerical methods for computing the Schatten p-norm of positi...
research
07/05/2023

Suboptimal subspace construction for log-determinant approximation

Variance reduction is a crucial idea for Monte Carlo simulation and the ...

Please sign up or login with your details

Forgot password? Click here to reset