Randomized matrix-free quadrature for spectrum and spectral sum approximation

Authors Tyler Chen, Thomas Trogdon, Shashanka Ubaru

Publication date 4 April 2022

Abstract: We study randomized matrix-free quadrature algorithms for spectrum and spectral sum approximation. The algorithms studied are characterized by the use of a Krylov subspace method to approximate independent and identically distributed samples of

m a t h b f v^{m a t h s f H} f (m a t h b f A) m a t h b f v

, where

m a t h b f v

is an isotropic random vector,

m a t h b f A

is a Hermitian matrix, and

f (m a t h b f A)

is a matrix function. This class of algorithms includes the kernel polynomial method and stochastic Lanczos quadrature, two widely used methods for approximating spectra and spectral sums. Our analysis, discussion, and numerical examples provide a unified framework for understanding randomized matrix-free quadrature algorithms and sheds light on the commonalities and tradeoffs between them. Moreover, this framework provides new insights into the practical implementation and use of these algorithms, particularly with regards to parameter selection in the kernel polynomial method.

This page was built for publication: Randomized matrix-free quadrature for spectrum and spectral sum approximation

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