Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems

SIAM Journal on Matrix Analysis and Applications, Volume 35, Issue 3, 2014, Pages 835-885.

Cited by: 244|Bibtex|Views38
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

We present a randomized algorithm that, on input a symmetric, weakly diagonally dom- inant n-by-n matrix A with m non-zero entries and an n-vector b, produces anx such that k x − ˜ x k A ≤ ǫ k x k A, where Ax = b, in expected time

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments