93 citations · 537 across the 73 of their papers we have counts for
Showing 2015 · cs.DSShow all
3 papers · 2 filters
cs.DS2015★ 2 cited
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…
cs.DS2015★ 22 cited
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…
cs.DS2015★ 10 cited
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…