Encyclopedia of Parallel Computing

2011 Edition
| Editors: David Padua

Preconditioners for Sparse Iterative Methods

  • Anshul Gupta
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-09766-4_247

Synonyms

Definition

Iterative methods for solving sparse systems of linear equations are potentially less memory and computation intensive than direct methods, but often experience slow convergence or fail to converge at all. The robustness and the speed of Krylov subspace iterative methods is improved, often dramatically, by preconditioning. Preconditioning is a technique for transforming the original system of equations into one with an improved distribution (clustering) of eigenvalues so that the transformed system can be solved in fewer iterations. A key step in preconditioning a linear system Ax = b is to find a nonsingular preconditioner matrix M such that the inverse of M is as close to the inverse of A as possible and solving a system of the form Mz = r is significantly less expensive than solving Ax = b. The system is then solved by solving \(({M}^{-1}A)x = {M}^{-1}b\)

This is a preview of subscription content, log in to check access.

Bibliography

  1. 1.
    Benzi M (2002) Preconditioning techniques for large linear systems: a survey. J Computat Phys 182(2):418–477zbMATHMathSciNetGoogle Scholar
  2. 2.
    Bozdag D, Gebremedhin AH, Manne F, Boman EG, Catalyurek UV (2008) A framework for scalable greedy coloring on distributed memory parallel computers. J Parallel Distrib Comput 68(4):515–535Google Scholar
  3. 3.
    Chow E (2000) A priori sparsity patterns for parallel sparse approximate inverse preconditioners. SIAM J Sci Comput 21(5): 1804–1822zbMATHMathSciNetGoogle Scholar
  4. 4.
    Chow E (2001) Parallel implementation and practical use of sparse approximate inverse preconditioners with a priori sparsity patterns. Int J High Perform Comput appl 15(1):56–74Google Scholar
  5. 5.
    Chow E, Falgout RD, Hu JJ, Tuminaro RS, Yang UM (2006) A survey of parallelization techniques for multigrid solvers. In Heroux MA, Raghavan P, Simon HD (eds) Parallel processing for scientific computing. SIAM, PhiladelphiaGoogle Scholar
  6. 6.
    Grote MJ, Huckle T (1997) Parallel preconditioning with sparse approximate inverses. SIAM J Sci Comput 18(3): 838–853zbMATHMathSciNetGoogle Scholar
  7. 7.
    Hysom D, Pothen A (2000) A scalable parallel algorithm for incomplete factor preconditioning. SIAM J Sci Comput 22(6): 2194–2215MathSciNetGoogle Scholar
  8. 8.
    Karypis G, Kumar V (1996) Parallel threshold-based ILU factorization. Technical report TR 96-061, Department of Computer Science, University of Minnesota, MinnesotaGoogle Scholar
  9. 9.
    Karypis G, Kumar V (1997) ParMETIS: parallel graph partitioning and sparse matrix ordering library. Technical report TR 97-060, Department of Computer Science, University of Minnesota, MinnesotaGoogle Scholar
  10. 10.
    Karypis G, Kumar V (1998) Parallel algorithms for multilevel graph partitioning and sparse matrix ordering. J Parallel Distrib Comput 48:71–95Google Scholar
  11. 11.
    Saad Y (2003) Iterative methods for sparse linear systems, 2nd edn. SIAM, PhiladelphiazbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Anshul Gupta
    • 1
  1. 1.Business Analytics & Mathematical SciencesIBM T.J. Watson Research CenterYorktown HeightsUSA