DECAY BOUNDS AND ( ) ALGORITHMS FOR APPROXIMATING FUNCTIONS OF SPARSE MATRICES

117 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Decay properties for functions of matrices over $C^*$-algebras (2013, background): “Decay properties of inverses, exponentials and other functions of band or sparse matrices over R or C have been investigated by several authors in recent years [3, 4, 13, 18, 19, 22].”
Vertex-Frequency Analysis on Graphs (2013, background): “In particular, it is related to the off-diagonal decay of entries of a matrix function g(L), as studied in [35, 36].”
The extended Krylov subspace method and orthogonal Laurent polynomials (2009, background): “An early discussion on the approximation of large-scale expressions of the form (1.1) is presented by van der Vorst [26]; see also [27, Chapter 11].”
The Matrix Exponential (2015, unknown): “The lack of a clear notion for a residual for many matrix functions has been a known problem in the iterative computation of matrix functions [3, 14, 44].”
The Physics of Communicability in Complex Networks (2011, methodology): “In this section we apply general results on exponential decay in matrix functions (Benzi et al., 2010; Benzi and Golub, 2009; Benzi and Razouk, 2007) to the study of a type of locality in complex networks.”
A probing method for computing the diagonal of a matrix inverse (2012, background): “The actual decay property of the entries of B is often better observed with respect to d ( j , k ), see, e.g. [31].”