A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Approaching Optimality for Solving SDD Linear Systems
2014
SIAM journal on computing (Print)
We present an algorithm that on input of an n-vertex m-edge weighted graph G and a value k, produces an incremental sparsifierĜ with n−1+m/k edges, such that the condition number of G withĜ is bounded above byÕ(k log 2 n), with probability 1 − p. The algorithm runs in timẽ O((m log n + n log 2 n) log(1/p)). As a result, we obtain an algorithm that on input of an n × n symmetric diagonally dominant matrix A with m non-zero entries and a vector b, computes a vector x satisfying ||x − A + b||A <
doi:10.1137/110845914
fatcat:onrjx7drjzcjnbfmvtahmjvziy