Programming Books C Java PHP Python Learn more Browse Programming Books
Buy New
$63.59
Qty:1
  • List Price: $82.50
  • Save: $18.91 (23%)
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Add to Cart
Trade in your item
Get a $30.13
Gift Card.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Accuracy and Stability of Numerical Algorithms Hardcover – August 1, 2002

ISBN-13: 978-0898715217 ISBN-10: 0898715210 Edition: 2nd

Buy New
Price: $63.59
20 New from $63.59 9 Used from $59.60
Amazon Price New from Used from
Hardcover
"Please retry"
$63.59
$63.59 $59.60

Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student



Frequently Bought Together

Accuracy and Stability of Numerical Algorithms + Matrix Computations (Johns Hopkins Studies in the Mathematical Sciences) + Numerical Linear Algebra
Price for all three: $189.04

Some of these items ship sooner than the others.

Buy the selected items together

Customers Who Bought This Item Also Bought

NO_CONTENT_IN_FEATURE

Save up to 90% on Textbooks
Rent textbooks, buy textbooks, or get up to 80% back when you sell us your books. Shop Now

Product Details

  • Hardcover: 680 pages
  • Publisher: SIAM: Society for Industrial and Applied Mathematics; 2nd edition (August 2002)
  • Language: English
  • ISBN-10: 0898715210
  • ISBN-13: 978-0898715217
  • Product Dimensions: 1.5 x 6 x 9 inches
  • Shipping Weight: 3 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #740,932 in Books (See Top 100 in Books)

Editorial Reviews

Review

'This book is a monumental work on the analysis of rounding error and will serve as a new standard textbook on this subject, especially for linear computation.' S. Hitotumatu, Mathematical Reviews

'...This definitive source on the accuracy and stability of numerical algorithms is quite a bargain and a worthwhile addition to the library of any statistician heavily involved in computing.' Robert L. Strawderman, Journal of the American Statistical Association

'...A monumental book that should be on the bookshelf of anyone engaged in numerics, be it as a specialist or as a user.' A. van der Sluis, ITW Nieuws

'This text may become the new 'Bible' about accuracy and stability for the solution of systems of linear equations. It covers 688 pages carefully collected, investigated, and written ... One will find that this book is a very suitable and comprehensive reference for research in numerical linear algebra, software usage and development, and for numerical linear algebra courses.' N. Köckler, Zentrallblatt für Mathematik

'... Nick Higham has assembled an enormous amount of important and useful material in a coherent, readable form. His book belongs on the shelf of anyone who has more than a casual interest in rounding error and matrix computations. I hope the author will give us the 600-odd page sequel. But if not, he has more than earned his respite - and our gratitude.' G. W. Stewart, SIAM Review

Book Description

This book provides a thorough, up-to-date treatment of the behaviour of numerical algorithms in finite precision arithmetic. The coverage of the first edition has been expanded and updated, including numerous improvements to the original material. Its thorough indexes and extensive, up-to-date bibliography are in a readily accessible form.

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

5.0 out of 5 stars
5 star
1
4 star
0
3 star
0
2 star
0
1 star
0
See the customer review
Share your thoughts with other customers

Most Helpful Customer Reviews

4 of 4 people found the following review helpful By Ben Sunshine-Hill on October 5, 2013
Format: Hardcover
This is an incredibly useful book for anyone who does a significant amount of programming with floating-point math and cares about its accuracy. There's this idea that floating point is not only imprecise -- which it is -- but also inherently opaque and unreliable, which it is NOT. This book will show you how to determine guaranteed, dependable bounds on the precision of your algorithms, and how to keep those bounds as tight as possible.

The early chapters build up a set of tools for analyzing and bounding error. Rather than settle on a single method of analysis, the book provides an array of them, ranging from the simple and conservative to the elaborate and exact. Later chapters focus on specific algorithms and use cases, mostly in the context of linear algebra; it assumes basic knowledge of most of these algorithms. This would not be a good book for learning about LU decomposition. But it is a great book for learning how to depend on LU decomposition.

It's dense in places, and has an unfortunate historical bent at times. Much ink is spent on the vagaries of the Cray FPU and the HP-48 calculator. Chapter 2, in particular, would have been considerably more readable if the author had stuck to base-2 representations, rather than complicating the math to encompass the rare and ultimately inconsequential base-10 and base-16 systems out there. There's also a certain amount of spaghetti writing... some of the material in the earlier chapters uses results from later chapters, which is particularly unfortunate in a book that's trying to build up a foundation of analysis methods in an ordered manner.
Read more ›
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Customer Images

Search

What Other Items Do Customers Buy After Viewing This Item?