Fetching the paper…
Reading the bibliography…
We introduce the sparsified Cholesky and sparsified multigrid algorithms for solving systems of linear equations.
On the difference between two neighbouring prime numbers
Nikolai Tchudakoff · 1936
Earlier work this paper cites.
An iterative solution method for linear systems of which the coefficient matrix is a symmetric m m -matrix
J. A. Meijerink and H. A. van der Vorst · 1977
Earlier work this paper cites.
Ramanujan graphs
A. Lubotzky, R. Phillips, and P. Sarnak · 1988
Earlier work this paper cites.
Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
G. A. Margulis · 1988
Earlier work this paper cites.
Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners
Pravin M. Vaidya · 1990
Earlier work this paper cites.
Multigrid
Ulrich Trottenberg, Cornelius W Oosterlee, and Anton Schuller · 2000
Earlier work this paper cites.
Strong converse for identification via quantum channels
Rudolf Ahlswede and Andreas Winter · 2002
Earlier work this paper cites.
Support-graph preconditioners
M. Bern, J. Gilbert, B. Hendrickson, N. Nguyen, and S. Toledo · 2006
Earlier work this paper cites.
Approaching optimality for solving SDD linear systems
I. Koutis, G.L. Miller, and R. Peng · 2010
Earlier work this paper cites.
Effective stiffness: Generalizing effective resistance sampling to finite element matrices
Haim Avron and Sivan Toledo · 2011
Earlier work this paper cites.
Sparse sums of positive semidefinite matrices
Marcel K. de Carli Silva, Nicholas J. A. Harvey, and Cristiane M. Sato · 2011
Earlier work this paper cites.
A nearly- m log n m\log n time solver for SDD linear systems
I. Koutis, G.L. Miller, and R. Peng · 2011
Earlier work this paper cites.
Three-dimensional structure determination from common lines in cryo-em by eigenvectors and semidefinite programming
Amit Singer and Yoel Shkolnisky · 2011
Cited alongside, same era.
Graph sparsification by effective resistances
D. Spielman and N. Srivastava · 2011
Cited alongside, same era.
Graph sparsification by effective resistances
Daniel A Spielman and Nikhil Srivastava · 2011
Cited alongside, same era.
Global motion estimation from point matches
Mica Arie-Nachimson, Shahar Z Kovalsky, Ira Kemelmacher-Shlizerman, Amit Singer, and Ronen Basri · 2012
Cited alongside, same era.
Viewing direction estimation in cryo-em using synchronization
Yoel Shkolnisky and Amit Singer · 2012
Cited alongside, same era.
Vector diffusion maps and the connection laplacian
Amit Singer and H-T Wu · 2012
Cited alongside, same era.
Approximate maximum flow on separable undirected graphs
Gary L. Miller and Richard Peng · 2013
Later among the works it cites.
Phase retrieval with polarization
Boris Alexeev, Afonso S Bandeira, Matthew Fickus, and Dustin G Mixon · 2014
Later among the works it cites.
Solving sdd linear systems in nearly mlog1/2n time
Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, and Shen Chen Xu · 2014
Later among the works it cites.
Uniform sampling for matrix approximation
Michael B Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2014
Later among the works it cites.
Alternating projection, ptychographic imaging and phase synchronization
Stefano Marchesini, Yu-Chao Tu, and Hau-tieng Wu · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Cited alongside, same era.
A cheeger inequality for the graph connection laplacian
Afonso S Bandeira, Amit Singer, and Daniel A Spielman · 2013
Cited alongside, same era.
Efficient preconditioning of laplacian matrices for computer graphics
Dilip Krishnan, Raanan Fattal, and Richard Szeliski · 2013
Cited alongside, same era.
A simple, combinatorial algorithm for solving sdd systems in nearly-linear time
Jonathan A Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu · 2013
Cited alongside, same era.
Iterative row sampling
Mu Li, Gary L Miller, and Rongkun Peng · 2013
Cited alongside, same era.
An efficient parallel solver for SDD linear systems
Richard Peng and Daniel A. Spielman · 2014
Later among the works it cites.
Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
Daniel A. Spielman and Shang-Hua Teng · 2014
Later among the works it cites.
Rotationally invariant image representation for viewing direction classification in cryo-em
Zhizhen Zhao and Amit Singer · 2014
Later among the works it cites.
Sparsified cholesky solvers for SDD linear systems
Yin Tat Lee, Richard Peng, and Daniel A. Spielman · 2015
Closest in time.
Interlacing families IV: Bipartite Ramanujan graphs of all sizes
Adam W Marcus, Nikhil Srivastava, and Daniel A Spielman · 2015
Closest in time.
Stable camera motion estimation using convex programming
Onur Özyeşil, Amit Singer, and Ronen Basri · 2015
Closest in time.