Corpus ID: 17165019

# Preconditioning in Expectation

@article{Cohen2014PreconditioningIE,
title={Preconditioning in Expectation},
author={Michael B. Cohen and Rasmus Kyng and Jakub W. Pachocki and Richard Peng and Anup B. Rao},
journal={ArXiv},
year={2014},
volume={abs/1401.6236}
}
We show that preconditioners constructed by random sampling can perform well without meeting the standard requirements of iterative methods. When applied to graph Laplacians, this leads to ultra-sparsifiers that in expectation behave as the nearly-optimal ones given by [Kolla-Makarychev-Saberi-Teng STOC10]. Combining this with the recursive preconditioning framework by [Spielman-Teng STOC04] and improved embedding algorithms, this leads to algorithms that solve symmetric diagonally dominant… Expand
8 Citations

#### References

SHOWING 1-10 OF 36 REFERENCES
A Note on Preconditioning by Low-Stretch Spanning Trees
• Computer Science, Mathematics
• ArXiv
• 2009
Spectral Sparsification of Graphs
• Mathematics, Computer Science
• SIAM J. Comput.
• 2011
Subgraph sparsification and nearly optimal ultrasparsifiers
• Mathematics, Computer Science
• STOC '10
• 2010
A Nearly-m log n Time Solver for SDD Linear Systems
• Mathematics, Computer Science
• 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
• 2011