DeepRead
Cover of Fundamentals of matrix computations

Fundamentals of matrix computations

David S. Watkins · 1991

Mathematics and physics › Numerical and matrix computation

#10,642 most recommended

About the book

Numerical linear algebra as used in scientific computing: how matrix problems such as linear systems, least squares, and eigenvalue and singular value problems are solved on a computer. It covers direct methods (Gaussian elimination, QR and the SVD), iterative methods including preconditioned conjugate gradients, and methods for large sparse eigenvalue problems, with applications such as electrical circuits and mass-spring systems. Its central position is that a matrix algorithm must be judged by its finite-precision behaviour as well as its exact-arithmetic correctness, so stability, roundoff error, and computational cost are treated as core concerns. It presents structure-exploiting factorizations and orthogonal transformations as the reasons certain methods are preferred over alternatives. Its main claims are pedagogical: that the theory and the numerical practice need to be understood together for anyone who relies on large-scale matrix computation.

Written by Claude from what it knows of this book.

What Hacker News says 67% recommend · 0% critical

00.5120112015202020222011 peak · 1
This bookAverage book in Numerical and matrix computation

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1991
ISBN
9780470528334
Editions known
8 at Open Library
Open Library
OL4480821W

EngineeringMathematicsMathematics, data processingMatricesMatrix groupsNonfiction

Explore in the mosaic

Read next: its neighbours on the mosaic