SIAM Homepage | Search Catalog | New Books | Author Index | Series Index | Title Index | View My Shopping Cart

The catalog and shopping cart are hosted for SIAM by EasyCart. Your transaction is secure. If you have any questions about your order, contact

Purchase Now!

Matrix Algorithms: Basic DecompositionsMatrix Algorithms: Basic Decompositions

G. W. Stewart

This thorough, concise, and superbly written volume is the first in a self-contained five-volume series devoted to matrix algorithms. It focuses on the computation of matrix decompositions--that is, the factorization of matrices into products of similar ones.

The first two chapters provide the required background from mathematics and computer science needed to work effectively in matrix computations. The remaining chapters are devoted to the LU and QR decompositions--their computation and applications. The singular value decomposition is also treated, although algorithms for its computation will appear in the second volume of the series. The present volume contains 65 algorithms formally presented in pseudocode.

Other volumes in the series will treat eigensystems, iterative methods, sparse matrices, and structured problems. The series is aimed at the nonspecialist who needs more than black-box proficiency with matrix computations. To give the series focus, the emphasis is on algorithms, their derivation, and their analysis.

The reader is assumed to have a knowledge of elementary analysis and linear algebra and a reasonable amount of programming experience, typically that of the beginning graduate engineer or the undergraduate in an honors program. Strictly speaking, the individual volumes are not textbooks, although they are intended to teach, the guiding principle being that if something is worth explaining, it is worth explaining fully. This has necessarily restricted the scope of the series, but the selection of topics should give the reader a sound basis for further study.


Algorithms; Notation; Preface; Chapter 1: Matrices, Algebra, and Analysis. Vectors; Matrices; Linear Algebra; Analysis; Addenda; Chapter 2: Matrices and Machines. Pseudocode; Triangular Systems; Matrices in Memory; Rounding Error; Chapter 3: Gaussian Elimination. Gaussian Elimination; A Most Versatile Algorithm; The Sensitivity of Linear Systems; The Effects of Rounding Error; Chapter 4: The QR Decomposition and Least Squares. The QR Decomposition; Linear Least Squares; Updating; Chapter 5: Rank-Reducing Decompositions. Fundamental Subspaces and Rank Estimation; Pivoted Orthogonal Triangularization; Norm and Condition Estimation; UTV Decompositions; References; Index.

1998 / xx + 458 pages / Softcover / ISBN-13: 978-0-898714-14-2 / ISBN-10: 0-89871-414-1 /
List Price $67.00 / SIAM Member Price $46.90 / Order Code OT60
Quantity desired

Search our catalog for:

Shopping cart provided by:
Select quantity and list or member price and then click the "Click to Order" button to add books to your shopping cart.
Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Auckland, NZ.)