Linear Systems of Equations

  • Günther Hämmerlin
  • Karl-Heinz Hoffman
Part of the Undergraduate Texts in Mathematics book series (UTM)


Many problems in mathematics lead to linear systems of equations. In fact, in using computers to solve such problems, we frequently encounter very large linear systems. Thus, the development of efficient algorithms to solve such systems is of central importance in numerical analysis. We differentiate between two types of methods. Direct methods solve the problem in a finite number of steps, and so are not subject to method error, although, of course, the results can be very badly affected by roundoff error. Indirect methods seek to find the solution by iteration, and thus usually lead only to approximate solutions since the iteration has to be stopped at some point. Although in this case we have both method and roundoff errors, iterative methods have their advantages. In this chapter we will primarily discuss direct methods. Iterative methods for linear system of equations will be discussed in Chapter 8.


Linear System Gauss Elimination Nonsingular Matrix Cholesky Decomposition Roundoff Error 
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-Verlag New York Inc. 1991

Authors and Affiliations

  • Günther Hämmerlin
    • 1
  • Karl-Heinz Hoffman
    • 2
  1. 1.Mathematisches InstitutLudwig-Maximilians-UniversitätMünchen 2Germany
  2. 2.Mathematisches InstitutUniversität AugsburgAugsburgGermany

Personalised recommendations