Geometric Sparsification of Closeness Relations: Eigenvalue Clustering for Computing Matrix Functions

Nir Goren, Dan Halperin, Sivan Toledo

We show how to efficiently solve a clustering problem that arises in a method to evaluate functions of matrices. The problem requires finding the connected components of a graph wh…