Matrix Computations (Johns Hopkins Studies in Mathematical Sciences)(3rd Edition)
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.
Rating: 
(out of 30 reviews)
List Price: $ 50.00
Price: $ 26.50
CHINA (P111) 1911 £100 5% Tientsin - Pukow Supplementary Loan | US $113.50 (7 Bids) End Date: Wednesday Feb-08-2012 11:42:49 PST Bid now | Add to watch list |
 | US $74.99 (0 Bid) End Date: Wednesday Feb-08-2012 11:43:01 PST Bid now | Add to watch list |
Find More Loan Products
Related posts:
- 2010 Guide to Federal Grants and Government Assistance to Organizations, Small Business, and Individuals – Grants, Loans, Aid, Applications, ARRA Stimulus Act (Two CD-ROM Set) 2010 Guide to Federal Grants and Government Assistance to Organizations,...
- Bad Credit – Absolute Truth the Credit Industry Doesn’t Want You to Know Reviews Bad Credit – Absolute Truth the Credit Industry Doesn’t Want...
Related posts brought to you by Yet Another Related Posts Plugin.
Tags: Computations, Edition, Hopkins, Johns, Mathematical, Matrix, Reviews, Sciences3rd, Studies
5 Responses to “Matrix Computations (Johns Hopkins Studies in Mathematical Sciences)(3rd Edition) Reviews”
Leave a Reply
You must be logged in to post a comment.
June 28th, 2010 at 10:35 am
Review for Matrix Computations (Johns Hopkins Studies in Mathematical Sciences)(3rd Edition)
Rating:
This is not a complete review. I just wanted to say something important about the book. I’m a second year computer science PhD student, comfortable with linear algebra. I have been using this book for a couple of months to implement SVD (singular value decomposition) and unfortunately the book turned out to introduce some difficulties.
First of all, it’s annoyingly terse! You must be quite comfortable with matrices and all the manipulations etc. to “grasp” the main idea behind an algorithm. I’m talking about truly understanding, not implementing line by line. Most of the times, you will need a paper and pencil to understand what’s going on during the execution of an algorithm.
Yet, there’s one more important thing: There are typos, and worse: there are mistakes. A specific example:
page 456, Algorithm 8.6.2 The SVD Algorithm
It doesn’t talk about how to extract U and V in the decomposition A = U^T*D*V and the last line is incorrect.
diag(I_p, U, I_{q+m-n}) is not an n*n matrix, so you cannot multiply B with this matrix from left. Maybe, there’s something I couldn’t catch, but this is book’s deficiency again.
page 252 Example 5.4.2 about Householder Bidiagonalization
The given matrices do not constitute a correct bidiagonalization, I checked them with Matlab.
and a typo: page 216 5.1.9 Applying Givens rotations, the 4th and 5th line of the algorithm is incorrectly written.
A(1, j) = …
A(2, j) = …
should be
A(i, j) = …
A(k, j) = …
So, these are the ones I encountered. This book is unmatched in its category in terms of depth and coverage, but it definitely needs a new edition with a more careful treatment.
June 28th, 2010 at 10:36 am
Review for Matrix Computations (Johns Hopkins Studies in Mathematical Sciences)(3rd Edition)
Rating:
This is one of the definitive texts on computational linear algebra, or more specifically, on matrix computations. The term “matrix computations” is actually the more apt name because the book focuses on computational issues involving matrices,the currency of linear algebra, rather than on linear algebra in the abstract. As an example of this distinction, the authors develop both “saxpy” (scalar “a” times vector “x” plus vector “y”) based algorithms and “gaxpy” (generalized saxpy, where “a” is a matrix) based algorithms, which are organized to exploit very efficient low-level matrix computations. This is an important organizing concept that can lead to more efficient matrix algorithms.For each important algorithm discussed, the authors provide a concise and rigorous mathematical development followed by crystal clear pseudo-code. The pseudo-code has a Pascal-like syntax, but with embedded Matlab abbreviations that make common low-level matrix operations extremely easy to express. The authors also use indentation rather than tedious BEGIN-END notation, another convention that makes the pseudo-code crisp and easy to understand. I have found it quite easy to code up various algorithms from the pseudo-code descriptions given in this book. The authors cover most of the traditional topics such as Gaussian elimination, matrix factorizations (LU, QR, and SVD), eigenvalue problems (symmetric and unsymmetric), iterative methods, Lanczos method, othogonalization and least squares (both constrained and unconstrained), as well as basic linear algebra and error analysis.I’ve use this book extensively during the past ten years. It’s an invaluable resource for teaching numerical analysis (which invariably includes matrix computations), and for virtually any research that involves computational linear algebra. If you’ve got matrices, chances are you will appreciate having this book around.
June 28th, 2010 at 10:48 am
Review for Matrix Computations (Johns Hopkins Studies in Mathematical Sciences)(3rd Edition)
Rating:
First, this isn’t Numerical Recipes. If you’re looking for cut&paste code, you’re just looking in the wrong place. This is for people who need a deep understanding of the computational issues, and are going to put a lot of time into an implementation. It’s for people who are completely at ease with linear algebra, standard matrix-oriented problems, and dense mathematical notation.
Despite its demand for a reader well versed in theory, this really is about practice. It’s about the nasty effects of finite-precision arithmetic, about specific ways of minimizing the harm they cause. These techniques take full advantage of any special features in the problem, including banding and symmetry. This also deals briefly with caching issues, which are even more important now than when this book was written. Cache data can get to the processor in 1-10 cycles, in a modern workstation processor, but main memory access costs 100-1000 cycles. TLB misses can cost many thousands of cycles, even when data is already in memory. Clearly, good data structures and well-orgnized access patterns can make a huge difference, but one that is mentioned only briefly. The section on parallel computation is brief and helpful, but overdue for review. The authors could never have foreseen today’s multi-(thread, core, processor) systems, Blue Gene, or clusters.
Still, this is an indispensable reference for someone in the thick of numerical computation. Most programmers would do better, in lots of ways, usingn the GNU Scientific Library or one of the other production-quality packages out there. They don’t always do the job, though. Emerging architectures, include hardware threading and reconfigurable computing, need new implementations of even well-known algorithms. If you have big mathematical problems and machines too exotic for the standard tools, you’re on your own. Numerical computing is such a large topic that no one book can possibly cover it all. In the end, though, many other problems reduce to linear systems, and that’s where this comes in. It may not be theonly book you’ll need, but you’ll need it.
//wiredweird
June 28th, 2010 at 10:57 am
Review for Matrix Computations (Johns Hopkins Studies in Mathematical Sciences)(3rd Edition)
Naturally, Prof. Golub also taught pretty much exclusively from this book, by the way, he is a gifted mathematician and wonderful instructor, and a real gentleman. Between these experiences, I’d say I became extremely familar with the contents of this book.
Rating:
In certain ways, this book has been both a bane and a boon to my career as a computational mathematician. Way back in 1989, I had the mixed experience of taking a course in Numerical Analysis from Brian Smith at the University of New Mexico. Prof. Smith taught that course exclusively from this book (actually, from the 2nd edition). As a college sophomore, I was terribly out of my depth, but I managed to do okay. Later, I had the opportunity to study under Gene Golub at Stanford, although I was certainly not one of his better students
Okay, back to the actual book. If you’ve got a numerical linear algebra problem to solve, and you don’t know which NAG or Matlab routine to use, or simiarly can’t figure out why your Numerical Recipes ripped-off code is blowing up on a certain matrix, well, you’ll find the reason in this book. The main issue is that you’ve got to know what you’re looking for in order to find it, and that’s kind of the kernel of the problem. Some reviewers have stated that the writing is terse, that it is too rigorous, etc. I don’t really agree with these reviews, but I agree that it is not for the casual reader who wants a quick answer to the question of “how do I invert this thing”. The book spends a lot of time with subtle details such as convergence and stability, and in my experience, these excellent treatments are wasted on most would-be users who are really just looking for a numerical silver bullet, which, of course, just doesn’t exist. I find that the book is an invaluable reference, when I have a problem like this “okay, I’ve got a small Vandermonde matrix that may or may not be singular. What’s the quickest algorithm to get a stable result?” Usually what happens is I read this book to understand the method, and then go looking for an existing implementation, usually in Matlab or NAG. I guess the bottom line is that if you’re looking for a “recipe” you won’t find them here. If you’re looking for insight and understanding into a numerical method, you will find it here, but you’ll have to work to eek out an implementation if you really feel that you need to write one.
June 28th, 2010 at 11:07 am
Review for Matrix Computations (Johns Hopkins Studies in Mathematical Sciences)(3rd Edition)
Rating:
Great book on the computational aspects of matrix computations. Has much more detail than NRiC for matrix computations — of course, NRiC covers more topics. One the few places you can actually find out how to code SVD. A steal at $30. Highly recommended!