Matrix Algorithms

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 - 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 computation and applications of the LU and QR decompositions. The series is aimed at the nonspecialist who needs more than black-box proficiency with matrix computations. A certain knowledge of elementary analysis and linear algebra is assumed, as well as a reasonable amount of programming experience. The guiding principle, that if something is worth explaining, it is worth explaining fully, has necessarily restricted the scope of the series, but the selection of topics should give the reader a sound basis for further study.

• Assumes a knowledge of elementary analysis and linear algebra and some programming experience, typically that of the beginning graduate engineer or the undergraduate in an honors program
• The individual volumes are not intended as textbooks, but are intended to teach, and although this restricts the scope of the series, the selection of topics gives the reader a sound basis for further study
• The present volume contains 65 algorithms formally presented in pseudocode