93 citations · 537 across the 73 of their papers we have counts for
4 papers · 1 filter
Sparsified Cholesky and Multigrid Solvers for Connection Laplacians
Rasmus Kyng, Yin Tat Lee, Richard Peng +2
We introduce the sparsified Cholesky and sparsified multigrid algorithms for solving systems of linear equations. These algorithms accelerate Gaussian elimination by sparsifying th…
Sparsified Cholesky Solvers for SDD linear systems
Yin Tat Lee, Richard Peng, Daniel A. Spielman
We show that Laplacian and symmetric diagonally dominant (SDD) matrices can be well approximated by linear-sized sparse Cholesky factorizations. We show that these matrices have co…
Scalable Constrained Clustering: A Generalized Spectral Method
Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla
We present a principled spectral approach to the well-studied constrained clustering problem. It reduces clustering to a generalized eigenvalue problem on Laplacians. The method wo…
Spectral Sparsification of Random-Walk Matrix Polynomials
Dehua Cheng, Yu Cheng, Yan Liu +2
We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of random-walk matrix-polynomial whe…