Sciweavers

Share
STOC
2007
ACM

Iteratively constructing preconditioners via the conjugate gradient method

9 years 7 months ago
Iteratively constructing preconditioners via the conjugate gradient method
We consider the problem of solving a symmetric, positive definite system of linear equations. The most well-known and widely-used method for solving such systems is the preconditioned Conjugate Gradient method. The performance of this method depends crucially on knowing a good preconditioner matrix. We show that the Conjugate Gradient method itself can produce good preconditioners as a by-product. These preconditioners allow us to derive new asymptotic bounds on the time to solve multiple related linear systems. Categories and Subject Descriptors
John Dunagan, Nicholas J. A. Harvey
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2007
Where STOC
Authors John Dunagan, Nicholas J. A. Harvey
Comments (0)
books