Fetching the paper…
Reading the bibliography…
We show how to perform sparse approximate Gaussian elimination for Laplacian matrices.
Convex trace functions and the wigner-yanase-dyson conjecture
Elliott H Lieb · 1973
Earlier work this paper cites.
An efficient method for generating discrete random variables with general distributions
Alastair J. Walker · 1977
Earlier work this paper cites.
A class of first order factorization methods
Ivar Gustafsson · 1978
Earlier work this paper cites.
Generalized nested dissection
Robert Endre Tarjan Richard J. Lipton, Donald J. Rose · 1979
Earlier work this paper cites.
Introduction to Applied Mathematics
G. Strang · 1986
Earlier work this paper cites.
Resistance distance
Douglas J Klein and Milan Randic · 1993
Earlier work this paper cites.
Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems
Keith Gremban · 1996
Earlier work this paper cites.
Graph embedding techniques for bounding condition numbers of incomplete factor preconditioning
Stephen Guattery · 1997
Earlier work this paper cites.
Strong converse for identification via quantum channels
Rudolf Ahlswede and Andreas Winter · 2002
Earlier work this paper cites.
Accuracy and Stability of Numerical Algorithms
N. Higham · 2002
Earlier work this paper cites.
Semi-supervised learning using gaussian fields and harmonic functions
X. Zhu, Z. Ghahramani, and J. D. Lafferty · 2003
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A. Spielman and Shang-Hua Teng · 2004
Earlier work this paper cites.
Learning with local and global consistency
Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal, Jason Weston, and Bernhard Schölkopf · 2004
Earlier work this paper cites.
A regularization framework for learning from graph data
Dengyong Zhou and Bernhard Schölkopf · 2004
Cited alongside, same era.
Support-graph preconditioners
Marshall Bern, John R. Gilbert, Bruce Hendrickson, Nhat Nguyen, and Sivan Toledo · 2006
Cited alongside, same era.
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson and Roman Vershynin · 2007
Cited alongside, same era.
Solving elliptic finite element systems in near-linear time with support preconditioners
Erik G. Boman, Bruce Hendrickson, and Stephen A. Vavasis · 2008
Cited alongside, same era.
Faster approximate lossy generalized flow via interior point algorithms
Samuel I Daitch and Daniel A Spielman · 2008
Cited alongside, same era.
Faster generation of random spanning trees
J.A. Kelner and A. Madry · 2009
Cited alongside, same era.
Approximating the exponential, the lanczos method and an O ~ ( m ) \tilde{O}(m) -time spectral algorithm for balanced separator
Lorenzo Orecchia, Sushant Sachdeva, and Nisheeth K. Vishnoi · 2012
Later among the works it cites.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Later among the works it cites.
Multiplying matrices faster than coppersmith-winograd
Virginia Vassilevska Williams · 2012
Later among the works it cites.
A simple, combinatorial algorithm for solving sdd systems in nearly-linear time
Jonathan A Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu · 2013
Later among the works it cites.
Navigating central path with electrical flows: From flows to matchings, and back
Aleksander Madry · 2013
Later among the works it cites.
Solving sdd linear systems in nearly mlog1/2n time
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Approaching optimality for solving SDD linear systems
I. Koutis, G.L. Miller, and R. Peng · 2010
Cited alongside, same era.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng · 2011
Cited alongside, same era.
A nearly- m log n m\log n time solver for SDD linear systems
I. Koutis, G.L. Miller, and R. Peng · 2011
Cited alongside, same era.
Efficient sampling methods for discrete distributions
Karl Bringmann and Konstantinos Panagiotou · 2012
Cited alongside, same era.
Faster approximate multicommodity flow using quadratically coupled flows
Jonathan A. Kelner, Gary L. Miller, and Richard Peng · 2012
Cited alongside, same era.
Improved spectral sparsification and numerical algorithms for sdd matrices
Alex Levin, Ioannis Koutis, and Richard Peng · 2012
Cited alongside, same era.
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.
Path finding methods for linear programming: Solving linear programs in O ~ ( vrank ) \tilde{O}(\textrm{vrank}) iterations and faster algorithms for maximum flow
Y. T. Lee and A. Sidford · 2014
Later among the works it cites.
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.
Uniform sampling for matrix approximation
Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2015
Later among the works it cites.
Fast, provable algorithms for isotonic regression in all l_p-norms
Rasmus Kyng, Anup Rao, and Sushant Sachdeva · 2015
Later among the works it cites.
Sparsified cholesky and multigrid solvers for connection laplacians
Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Daniel A. Spielman · 2016
Closest in time.