Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs

We present the design and analysis of a nearly-linear work parallel algorithm for solving symmetric diagonally dominant (SDD) linear systems. On input an SDD n -by- n matrix A with m nonzero entries and a vector b , our algorithm computes a vector such that in work and depth for any θ >0, where A...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theory of computing systems Jg. 55; H. 3; S. 521 - 554
Hauptverfasser:	Blelloch, Guy E., Gupta, Anupam, Koutis, Ioannis, Miller, Gary L., Peng, Richard, Tangwongsan, Kanat
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.10.2014 Springer Nature B.V
Schlagworte:	Algorithms Approximation Computer architecture Computer Science Decomposition Graph theory Linear programming Linear systems Mathematical analysis Solvers Studies Theory of Computation Vectors (mathematics) United States > US Linear systems Low-stretch spanning trees Low-diameter decomposition Low-stretch subgraphs Parallel algorithms
ISSN:	1432-4350, 1433-0490
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!