Programming Books C Java PHP Python Learn more Browse Programming Books

Sorry, this item is not available in
Image not available for
Color:
Image not available

To view this video download Flash Player

 


or
Sign in to turn on 1-Click ordering
Sell Us Your Item
For a $28.37 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Accuracy and Stability of Numerical Algorithms [Hardcover]

Nicholas J. Higham
5.0 out of 5 stars  See all reviews (1 customer review)

List Price: $82.50
Price: $63.59 & FREE Shipping. Details
You Save: $18.91 (23%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Usually ships within 1 to 3 weeks.
Ships from and sold by Amazon.com. Gift-wrap available.
Free Two-Day Shipping for College Students with Amazon Student

Formats

Amazon Price New from Used from
Hardcover $63.59  
Paperback --  
Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Book Description

August 2002 0898715210 978-0898715217 2nd
This book gives a thorough, up-to-date treatment of the behaviour of numerical algorithms in finite precision arithmetic. It combines algorithmic derivations, perturbation theory, and rounding error analysis, all enlivened by historical perspective and informative quotations. The coverage of the first edition has been expanded and updated, involving numerous improvements. Two new chapters treat symmetric indefinite systems and skew-symmetric systems, and nonlinear systems and Newton's method. Twelve new sections include coverage of additional error bounds for Gaussian elimination, rank revealing LU factorizations, weighted and constrained least squares problems, and the fused multiply-add operation found on some modern computer architectures. This new edition is a suitable reference for an advanced course and can also be used at all levels as a supplementary text from which to draw examples, historical perspective, statements of results, and exercises. In addition the thorough indexes and extensive, up-to-date bibliography are in a readily accessible form.

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: $188.41

Some of these items ship sooner than the others.

Buy the selected items together

Customers Who Bought This Item Also Bought


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.

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: #497,374 in Books (See Top 100 in Books)

More About the Author

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

Customer Reviews

5.0 out of 5 stars
(1)
5.0 out of 5 stars
4 star
0
3 star
0
2 star
0
1 star
0
Share your thoughts with other customers
Most Helpful Customer Reviews
3 of 3 people found the following review helpful
5.0 out of 5 stars A little dense, but incredibly useful 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?
Search Customer Reviews
Search these reviews only



Books on Related Topics (learn more)

What Other Items Do Customers Buy After Viewing This Item?


Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Forums

There are no discussions about this product yet.
Be the first to discuss this product with the community.
Start a new discussion
Topic:
First post:
Prompts for sign-in
 



Look for Similar Items by Category