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

10/22/2021
by   Michele Benzi, et al.
0

Spectral projectors of Hermitian matrices play a key role in many applications, and especially in electronic structure computations. Linear scaling methods for gapped systems are based on the fact that these special matrix functions are localized, which means that the entries decay exponentially away from the main diagonal or with respect to more general sparsity patterns. The relation with the sign function together with an integral representation is used to obtain new decay bounds, which turn out to be optimal in an asymptotic sense. The influence of isolated eigenvalues in the spectrum on the decay properties is also investigated and a superexponential behaviour is predicted.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/11/2021

Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian

For many functions of matrices f(A), it is known that their entries exhi...
research
06/17/2020

A Berry-Esseen theorem for sample quantiles under association

In this paper, the uniformly asymptotic normality for sample quantiles o...
research
10/01/2021

Randomized block Krylov methods for approximating extreme eigenvalues

Randomized block Krylov subspace methods form a powerful class of algori...
research
11/28/2022

On the Rellich eigendecomposition of para-Hermitian matrices and the sign characteristics of *-palindromic matrix polynomials

We study the eigendecompositions of para-Hermitian matrices H(z), that i...
research
11/17/2020

The asymptotic spectrum of flipped multilevel Toeplitz matrices and of certain preconditionings

In this work, we perform a spectral analysis of flipped multilevel Toepl...
research
02/28/2020

Risk Bounds for Multi-layer Perceptrons through Spectra of Integral Operators

We characterize the behavior of integral operators associated with multi...
research
09/03/2020

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

The computation of matrix functions f(A), or related quantities like the...

Please sign up or login with your details

Forgot password? Click here to reset