Numerical Linear Algebra [Paperback]

Lloyd N. Trefethen (Author), David Bau III (Author)

Book Description

Publication Date: June 1, 1997 | ISBN-10: 0898713617 | ISBN-13: 978-0898713619

This is a concise, insightful introduction to the field of numerical linear algebra. The clarity and eloquence of the presentation make it popular with teachers and students alike. The text aims to expand the reader's view of the field and to present standard material in a novel way. All of the most important topics in the field are covered with a fresh perspective, including iterative methods for systems of equations and eigenvalue problems and the underlying principles of conditioning and stability. Presentation is in the form of 40 lectures, which each focus on one or two central ideas. The unity between topics is emphasized throughout, with no risk of getting lost in details and technicalities. The book breaks with tradition by beginning with the QR factorization - an important and fresh idea for students, and the thread that connects most of the algorithms of numerical linear algebra.

Contents: Preface; Acknowledgments; Part I: Fundamentals. Lecture 1: Matrix-Vector Multiplication; Lecture 2: Orthogonal Vectors and Matrices; Lecture 3: Norms; Lecture 4: The Singular Value Decomposition; Lecture 5: More on the SVD; Part II: QR Factorization and Least Squares. Lecture 6: Projectors; Lecture 7: QR Factorization; Lecture 8: Gram-Schmidt Orthogonalization; Lecture 9: MATLAB; Lecture 10: Householder Triangularization; Lecture 11: Least Squares Problems; Part III: Conditioning and Stability. Lecture 12: Conditioning and Condition Numbers; Lecture 13: Floating Point Arithmetic; Lecture 14: Stability; Lecture 15: More on Stability; Lecture 16: Stability of Householder Triangularization; Lecture 17: Stability of Back Substitution; Lecture 18: Conditioning of Least Squares Problems; Lecture 19: Stability of Least Squares Algorithms; Part IV: Systems of Equations. Lecture 20: Gaussian Elimination; Lecture 21: Pivoting; Lecture 22: Stability of Gaussian Elimination; Lecture 23: Cholesky Factorization; Part V: Eigenvalues. Lecture 24: Eigenvalue Problems; Lecture 25: Overview of Eigenvalue Algorithms; Lecture 26: Reduction to Hessenberg or Tridiagonal Form; Lecture 27: Rayleigh Quotient, Inverse Iteration; Lecture 28: QR Algorithm without Shifts; Lecture 29: QR Algorithm with Shifts; Lecture 30: Other Eigenvalue Algorithms; Lecture 31: Computing the SVD; Part VI: Iterative Methods. Lecture 32: Overview of Iterative Methods; Lecture 33: The Arnoldi Iteration; Lecture 34: How Arnoldi Locates Eigenvalues; Lecture 35: GMRES; Lecture 36: The Lanczos Iteration; Lecture 37: From Lanczos to Gauss Quadrature; Lecture 38: Conjugate Gradients; Lecture 39: Biorthogonalization Methods; Lecture 40: Preconditioning; Appendix: The Definition of Numerical Analysis; Notes; Bibliography; Index.

Audience: Written on the graduate or advanced undergraduate level, this book can be used widely for teaching. Professors looking for an elegant presentation of the topic will find it an excellent teaching tool for a one-semester graduate or advanced undergraduate course. A major contribution to the applied mathematics literature, most researchers in the field will consider it a necessary addition to their personal collections.

Editorial Reviews

Review

I have used Numerical Linear Algebra in my introductory graduate course and I have found it to be almost the perfect text to introduce mathematics graduate students to the subject. I like the choice of topics and the format: a sequence of lectures. Each chapter (or lecture) carefully builds upon the material presented in previous chapters, providing new concepts in a very clear manner. Exercises at the end of each chapter reinforce the concepts, and in some cases introduce new ones. …The emphasis is on the mathematics behind the algorithms, in the understanding of why the algorithms work. …The text is sprinkled with examples and explanations, which keep the student focused. --Daniel B. Szyld, Department of Mathematics, Temple University.

Just exactly what I might have expected--an absorbing look at the familiar topics through the eyes of a master expositor. I have been reading it and learning a lot. --Paul Saylor, University of Illinois at Urbana-Champaign

This is a beautifully written book which carefully brings to the reader the important issues connected with the computational issues in matrix computations. The authors show a broad knowledge of this vital area and make wonderful connections to a variety of problems of current interest. The book is like a delicate soufflé --- tasteful and very light. --Gene Golub, Stanford University.

Book Description

This is a concise, insightful introduction to the field of numerical linear algebra. The authors' clear, inviting style and evident love of the field, along with their eloquent presentation of the most fundamental ideas in numerical linear algebra, make it popular with teachers and students alike.

See all Editorial Reviews

Product Details

• Paperback: 373 pages
• Publisher: SIAM: Society for Industrial and Applied Mathematics (June 1, 1997)
• Language: English
• ISBN-10: 0898713617
• ISBN-13: 978-0898713619
• Product Dimensions: 7.4 x 9.9 inches
• Shipping Weight: 1.4 pounds (View shipping rates and policies)
• Average Customer Review: 4.5 out of 5 stars  See all reviews (15 customer reviews)
• Amazon Best Sellers Rank: #217,306 in Books (See Top 100 in Books)

Most Helpful Customer Reviews

45 of 50 people found the following review helpful

5.0 out of 5 stars Excellent: the best book I have seen on the subject. February 24, 1999

By Tia

Format:Paperback

This book should be required reading for anyone interested in computational numerics, especially those who are starting in the field. The authors concentrate on the few fundamental topics that underlie and unite the subject. The presentation, while rigorous, is simple, clear and friendly. The authors follow a logical thread and eliminate unnecessary and disorienting aspects that plague other books on the subject. It is easy to pick up the book, read several chapters at a stretch without looking up, and come away with new insights. Unquestionably the most valuable book I have read to date on the subject.

17 of 18 people found the following review helpful

5.0 out of 5 stars Excellent...with a few caveats May 13, 2005

By calvinnme HALL OF FAMETOP 500 REVIEWERVINE™ VOICE

Format:Paperback

This book on Linear Algebra is excellent. In particular chapters seven through thirty (as far as I have read) are great for self-directed study. However, I found chapters one through six ( through Projectors) a bit terse. Therefore I would highly recommend this book for self-study ONLY IF you already have a good idea of the concept of basic linear algebra including matrix norms, the singular value decomposition, and projectors, and also the correct way to perform a proof...and by a "good idea" I mean you already know how to use these ideas in a practical way. Otherwise, you should only use this book if you have a truly good instructor to guide you through the early material. I started out taking a class using this book four years ago from a poor instructor, and I and the entire class, as far as I could tell from casual conversation, were completely lost. I dropped the class and retook it just recently with an excellent instructor. Her help and insight made a world of difference. It will also help to have a copy of "Matrix Computations" by Golub and Van Loan for reference, especially when you get to the later chapters and eigenproblems.

9 of 9 people found the following review helpful

5.0 out of 5 stars A must for computational mathematicians June 24, 2002

By Hart Wilson

Format:Hardcover

The chapters on numerical stability of algorithms and conditioning of numerical problems are excellent. While the focus is of course linear algebra, these principles can be readily extended to all computational mathematics. If you regularly use computational methods and have not yet studied elementary error analysis, this book may revolutionize how you perceive numerical problems.