Summary
Revised and updated, the third edition of Golub and Van Loan's classic text in computer science provides essential information about the mathematical background and algorithmic skills required for the production of numerical software. This new edition includes thoroughly revised chapters on matrix multiplication problems and parallel matrix computations, expanded treatment of CS decomposition, an updated overview of floating point arithmetic, a more accurate rendition of the modified Gram-Schmidt process, and new material devoted to GMRES, QMR, and other methods designed to handle the sparse unsymmetric linear system problem.
Reviews
"A wealth of material, some old and classical, some new and still subject to debate. It will be a valuable reference source for workers in numerical linear algebra as well as a challenge to students."--SIAM Review, reviewing a previous edition or volume
"In purely academic terms the reader with an interest in matrix computations will find this book to be a mine of insight and information, and a provocation to thought; the annotated bibliographies are helpful to those wishing to explore further. One could not ask for more, and the book should be considered a resounding success."--Bulletin of the Institute of Mathematics and its Applications, reviewing a previous edition or volume
"The authors have rewritten and clarified many of the proofs and derivations from the first edition. They have also added new topics such as Arnoldi iteration, domain decomposition methods, and hyperbolic downdating. Clearly the second edition is an invaluable reference book that should be in every university library. With the new proofs and derivations, it should remain the text of choice for graduate courses in matrix computations"--Image: Bulletin of the International Linear Algebra Society, reviewing a previous edition or volume.
Author Information
Gene H. Golub is professor of computer science at Stanford University. Charles F. Van Loan is professor of computer science at Cornell University. |
