Iterative Methods for Solving Linear Systems

  • Alfio Quarteroni
  • Riccardo Sacco
  • Fausto Saleri
Part of the Texts in Applied Mathematics book series (TAM, volume 37)


Iterative methods formally yield the solution x of a linear system after an infinite number of steps. At each step they require the computation of the residual of the system. In the case of a full matrix, their computational cost is therefore of the order of n2 operations for each iteration, to be compared with an overall cost of the order of n3 operations needed by direct methods. Iterative methods can therefore become competitive with direct methods provided the number of iterations that are required to converge (within a prescribed tolerance) is either independent of n or scales sublinearly with respect to n.


Iterative Method Conjugate Gradient Method Descent Direction Iteration Matrix Jacobi Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2007

Authors and Affiliations

  • Alfio Quarteroni
    • 1
  • Riccardo Sacco
    • 2
  • Fausto Saleri
    • 3
  1. 1.Department of MathematicsEcole Polytechnique, Fédérale de LausanneLausanneSwitzerland
  2. 2.Dipartimento di MatematicaPolitecnico di MilanoMilanItaly
  3. 3.Dipartimento di Matematica, “F. Enriques”Università degli Studi di MilanoMilanItaly

Personalised recommendations