Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. A simple, combinatorial algorithm for solving SDD systems in nearly-linear time

A simple, combinatorial algorithm for solving SDD systems in nearly-linear time

Thumbnail Image
Download
Name

Kelner_A simple combinatorial.pdf

Size

1.88 MB

Format

Adobe PDF

Checksum (MD5)

c7475c35f2f40df76304aebc04631550

Author(s)
Orecchia, Lorenzo
•
Zhu, Zeyuan Allen
•
Kelner, Jonathan Adam
•
Sidford, Aaron D.
Date Issued
June 2013
Journal
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing (STOC '13)
Publisher
Association for Computing Machinery (ACM)
Citation
Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu. 2013. A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. In Proceedings of the 45th annual ACM symposium on Symposium on theory of computing (STOC '13). ACM, New York, NY, USA, 911-920.
Version
Original manuscript
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.
Description
Original manuscript January 28, 2013
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
http://creativecommons.org/licenses/by-nc-sa/3.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/80391
DOI of Published Version
https://doi.org/10.1145/2488608.2488724
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.