Algorithms are derived in a mathematically illuminating way, including condition numbers and error bounds. Direct and iterative algorithms, suitable for dense and sparse matrices, are discussed. There are many numerical examples throughout the text and in the problems at the ends of chapters, most of which are written in Matlab and are freely available on the Web. Demmel discusses several current research topics, making students aware of both the lively research taking place and connections to other parts of numerical analysis, mathematics, and computer science. Some of this material is developed in questions at the end of each chapter, which are marked Easy, Medium, or Hard according to their difficulty.
Some questions are straightforward, supplying proofs of lemmas used in the text.
Others are more difficult theoretical or computing problems. Questions involving significant amounts of programming are marked Programming. About the Author James Demmel is a Professor in the Computer Science Division and Mathematics Department at the University of California, Berkeley.