A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Open Access
- 1 June 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 911-920
Abstract
In this paper, we present a simple combinatorial algorithm that solves symmetric diagonally dominant (SDD) linear systems in nearly-linear time. It uses little of the machinery that previously appeared to be necessary for a such an algorithm. It does not require recursive preconditioning, spectral sparsification, or even the Chebyshev Method or Conjugate Gradient. After constructing a "nice" spanning tree of a graph associated with the linear system, the entire algorithm consists of the repeated application of a simple update rule, which it implements using a lightweight data structure. The algorithm is numerically stable and can be implemented without the increased bit-precision required by previous solvers. As such, the algorithm has the fastest known running time under the standard unit-cost RAM model. We hope the simplicity of the algorithm and the insights yielded by its analysis will be useful in both theory and practice.Original manuscript January 28, 2013National Science Foundation (U.S.) (Award 0843915)National Science Foundation (U.S.) (Award 1111109)Alfred P. Sloan Foundation (Research Fellowship)National Science Foundation (U.S.). Graduate Research Fellowship Program (Grant 1122374Keywords
All Related Versions
This publication has 32 references indexed in Scilit:
- Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processingComputer Vision and Image Understanding, 2011
- Electric routing and concurrent flow cuttingTheoretical Computer Science, 2011
- Graph Sparsification by Effective ResistancesSIAM Journal on Computing, 2011
- Finding local communities in protein networksBMC Bioinformatics, 2009
- IsoRankN: spectral methods for global alignment of multiple protein networksBioinformatics, 2009
- Solving Elliptic Finite Element Systems in Near-Linear Time with Support PreconditionersSIAM Journal on Numerical Analysis, 2008
- Support Theory for PreconditioningSIAM Journal on Matrix Analysis and Applications, 2003
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- Sur les assemblages de lignes.Journal für die reine und angewandte Mathematik (Crelles Journal), 1869