BIT Numerical Mathematics

, Volume 37, Issue 2, pp 377–403

Breakdowns and stagnation in iterative methods

Authors

  • Zbigniew Leyk
    • Institute for Scientific ComputationTexas A&M University
Article

DOI: 10.1007/BF02510219

Cite this article as:
Leyk, Z. Bit Numer Math (1997) 37: 377. doi:10.1007/BF02510219
  • 120 Views

Abstract

One of the disadvantages of Krylov subspace iterative methods is the possibility of breakdown. This occurs when it is impossible to get the next approximation of the solution to the linear system of equationsAu=f. There are two different situations: lucky breakdown, when we have found the solution and hard breakdown, when the next Krylov subspace cannot be generated and/or the next approximate solution (iterate) cannot be computed. We show that some breakdowns depend on the chosen method of generating the basis vectors. Another undesirable feature of the iterative methods is stagnation. This occurs when the error does not change for several iterative steps. We investigate when iterative methods can stagnate and describe conditions which characterize stagnation. We show that in some cases stagnation can imply breakdown.

AMS subject classification

65F10

Key words

Iterative methodsKrylov subspacebiconjugate gradientconjugate gradientGMRESgeneralized conjugate residual

Copyright information

© BIT Foundaton 1997