Introduction to Matrix Computations book cover

Introduction to Matrix Computations

Numerical linear algebra is far too broad a subject to treat in a single introductory volume. Stewart has chosen to treat algorithms for solving linear systems, linear least squares problems, and eigenvalue problems involving matrices whose elements can all be contained in the high-speed storage of a computer. By way of theory, the author has chosen to discuss the theory of norms and perturbation theory for linear systems and for the algebraic eigenvalue problem. These choices exclude, among other things, the solution of large sparse linear systems by direct and iterative methods, linear programming, and the useful Perron-Frobenious theory and its extensions. However, a person who has fully mastered the material in this book should be well prepared for independent study in other areas of numerical linear algebra.

Undergraduate and graduate students studying mathematics.

Hardbound, 441 Pages

Published: May 1973

Imprint: Academic Press

ISBN: 978-0-12-670350-4


  • "The material presented here bridges the gap between the usual treatment of abstract vector spaces and the matrix theory with which a modern numerical analyst must be familiar in a way that should meet with widespread approval. Few books on numerical analysis have given me as much satisfaction as did this. It has perfect balance in an age where this quality is becoming increasingly rare."
    --James H. Wilkinson


  • Preliminaries. Practicalities. The Direct Solution of Linear Systems. Norms, Limits, and Condition Numbers. The Linear Least Squares Problem. Eigenvalues and Eigenvectors. The QR Algorithm. The Greek Alphabet and Latin Notational Correspondents. Determinants. Rounding-Error Analysis of Solution of Triangular Systems and of Gaussian Elimination. Of Things Not Treated. Bibliography. Index.


advert image