DeepRead
Cover of Numerical linear algebra

Numerical linear algebra

Lloyd N. Trefethen · 1997

Mathematics and physics › Numerical and matrix computation

#1,378 most recommended

About the book

A graduate-level introduction to numerical linear algebra, the study of algorithms for computing with matrices. It covers solving linear systems and least-squares problems, and computing eigenvalues and singular values, with iterative methods for large systems alongside the standard direct methods. The book's central claim is that the performance of a matrix algorithm should be judged through two separate ideas: the conditioning of the problem, which measures how sensitive the answer is to input changes, and the stability of the algorithm, which asks whether it gives the exact answer to a slightly perturbed problem. It presents factorizations such as LU, QR, and the SVD as the main tools, and explains why Gaussian elimination with pivoting works well in practice despite poor worst-case bounds. It also argues that eigenvalues must be found iteratively, through reduction to Hessenberg form followed by QR iteration, and that Krylov subspace methods such as conjugate gradients and GMRES approximate solutions through polynomial fitting.

Written by Claude from what it knows of this book.

What Hacker News says 90% recommend · 0% critical

051020102015202020262019 peak · 9
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.

  • 6 want to read
  • 2 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

The threads it came up in

Details

First published
1997
ISBN
9780898713619
Editions known
6 at Open Library
Open Library
OL3357483W

512/.5Algebras, LinearLinear AlgebrasNumerical calculationsQa184 .t74 1997

Explore in the mosaic

Read next: its neighbours on the mosaic