Skip to main content
Article thumbnail
Location of Repository

Iteratively Constructing Preconditionersvia the Conjugate Gradient Method

By Nicholas J. A. Harveymit

Abstract

ABSTRACT 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 G.1.3 [Numerical Analysis]: Numerical Linear Algebra-- Linear systems (direct and iterative methods

Topics: General Terms Algorithms, Theory Keywords Conjugate Gradient Method, Preconditioning
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.9938
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://theory.csail.mit.edu/~n... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.