Temporarily out of stock.
Order now and we'll deliver when available. We'll e-mail you with an estimated delivery date as soon as we have more information. Your account will only be charged when we ship the item.
Ships from and sold by Amazon.ca. Gift-wrap available.
Quantity:1
Matrix Computations has been added to your Cart
+ CDN$ 6.49 shipping
Used: Good | Details
Sold by momox ca
Condition: Used: Good
Comment: Please allow 1-2 weeks for delivery. For DVDs please check region code before ordering.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Matrix Computations Paperback – Oct 15 1996

4.5 out of 5 stars 13 customer reviews

See all 2 formats and editions Hide other formats and editions
Amazon Price
New from Used from
Paperback
"Please retry"
CDN$ 57.50
CDN$ 50.00 CDN$ 22.68

Harry Potter and the Cursed Child
click to open popover

No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.




Product Details

  • Paperback: 728 pages
  • Publisher: Hopkins Fulfillment Service; 3 edition (Oct. 15 1996)
  • Language: English
  • ISBN-10: 0801854148
  • ISBN-13: 978-0801854149
  • Product Dimensions: 15.6 x 3.3 x 23.5 cm
  • Shipping Weight: 1.4 Kg
  • Average Customer Review: 4.5 out of 5 stars 13 customer reviews
  • Amazon Bestsellers Rank: #551,741 in Books (See Top 100 in Books)
  •  Would you like to update product info, give feedback on images, or tell us about a lower price?

  • See Complete Table of Contents

Product Description

Review

'Praise for previous editions:' "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' "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'

About the Author

Gene H. Golub is professor of computer science at Stanford University. Charles F. Van Loan is professor of computer science at Cornell University.

Customer Reviews

4.5 out of 5 stars
Share your thoughts with other customers

Top Customer Reviews

Format: Paperback
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.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse
Format: Paperback
This book should be placed alongside "Principles of Mathematical Analysis" by Walter Rudin and "Finite Dimensional Vector Spaces" by Paul Halmos as a classic text, one which students/professionals of mathematics will use for years to come. A solid book covering computational matrix theory. I myself used it as a tool to bridge the gap between my formal training in Mathematics and my serious interest in computers. Reader should have some knowledge of basic linear algebra(ie understanding of vector spaces, L2 norms, etc..) before attempting this book. Excercises could be better. A good purchase for those with a more than passing interest.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse
By A Customer on March 26 2002
Format: Paperback
It is now 6 years ago when the last version of this once
superb book was released. Meanwhile, bunches of books
aiming a similiar audience were published. Some of them,
in particular G.W. Stewarts, are nowadays more seasonable.
Notably, the "iterative" sections ask for light
refreshments. The lack of references to appropriate
software routines in these parts is another disadvantage
which could be easily overcome in a new edition.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse
Format: Paperback
Once you have a grounding in matrix analysis and linear algebra this book makes a good reference. His explanations tend to be terse (even exceptionally so)- more suited for reminding someone who already knows how the algorithm works or was derived and simply can't remember the details. It lost a star as I've found some annoying typos (for example, in the pseudocode for the GMRES algorithm).
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse
Format: Paperback
A few years ago this book permitted me to go reliably from
theoretical linear algebra to practical large-scale numerical
computations, using also LAPACK. I think this is its place:
from the university course level to the practical side.
On the other hand, one cannot really say it is as readable
as, say, Numerical Recipes: it has a quite terse style.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse
Format: Paperback
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!
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse
Format: Paperback
I recently bought this book and am amazed at how detailed the information is presented. This a great book for anyone doing numerical analysis on the computer. The details on how to work around ill-conditioned matrices is great.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse


Feedback