|
Numerical Linear Algebra | 
enlarge | Authors: Lloyd N. Trefethen, David Bau Iii Publisher: SIAM: Society for Industrial and Applied Mathematics Category: Book
List Price: $57.50 Buy New: $52.53 You Save: $4.97 (9%)
New (14) Used (3) from $49.95
Rating: 14 reviews Sales Rank: 14701
Media: Paperback Pages: 373 Number Of Items: 1 Shipping Weight (lbs): 1.4 Dimensions (in): 9.9 x 6.9 x 0.8
ISBN: 0898713617 Dewey Decimal Number: 512.5 EAN: 9780898713619
Publication Date: June 1, 1997 Availability: Usually ships in 1-2 business days Shipping: International shipping available Condition: Delivery in 10-14 days.
| |
| Similar Items:
|
| Editorial Reviews:
Product Description 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.
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.
|
| Customer Reviews: Read 9 more reviews...
Excellent: the best book I have seen on the subject. February 25, 1999 Tia (USA) 36 out of 39 found this review helpful
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.
Fantastic book, with great insight September 5, 2006 Jonathan Birge (Cambridge, MA) 8 out of 8 found this review helpful
I can't speak to the entire book, as I've only made significant use of the section of matrix solvers. Having said that, his explanation of Krylov methods was the most clear and well organized I've ever seen. His book is the first I've seen that so nicely ties together all such methods. It's true that his book is probably not going to be enough if you are planning to focus on this as your research topic. But for those of us who simply need to apply the field to their research, it is the best book I've found, and he goes out of his way to be helpful to the practitioner, a rare thing in a math book. (For example, he has a wonderful flowchart in Chapter 6 providing a rough guideline for selecting a linear system solver based on the properties of one's problem.)
A must for computational mathematicians June 25, 2002 Hart Wilson (Chicago, IL USA) 7 out of 7 found this review helpful
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.
Excellent April 9, 2003 Fernando G. del C (Houston, TX United States) 4 out of 5 found this review helpful
The book is very well written, and explains the concepts very carefully.A very important characteristic is that the authors strive not only for rigor, but also for interpretation. Most topics are very well connected with a very clear style. Excellent book on the subject. A must have.
Excellent...with a few caveats May 14, 2005 calvinnme (Fredericksburg, Va) 12 out of 14 found this review helpful
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.
|
|
| | |