DeepRead
Cover of Matrix computations

Matrix computations

Gene H. Golub · 1983

Mathematics and physics › Numerical and matrix computation

#1,805 most recommended

About the book

A graduate-level reference on numerical linear algebra, covering how computers solve linear systems, least squares problems, and eigenvalue and singular value problems. It treats the matrix algorithms themselves, including factorizations such as LU, QR, Cholesky, and the SVD, along with iterative methods for large sparse systems. Its central emphasis is that matrix algorithms should be understood through how their computations are organized, including operation counts, rounding error, and memory access, rather than through their mathematical statements alone. It holds that numerical stability and efficiency depend on these choices, and it uses backward error analysis and block formulations built on matrix multiplication to explain why certain methods are preferred. The 2013 edition extends this to vector, shared-memory, and distributed-memory machines, arguing that the same organizing principles carry over to high-performance computing.

Written by Claude from what it knows of this book.

What Hacker News says 79% recommend · 0% critical

02.5520092015202020252019 peak · 5
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.

  • 12 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

The threads it came up in

Details

First published
1983
ISBN
9780801854149
Editions known
18 at Open Library
Open Library
OL3261782W

Data processingInformatiqueLiterary collectionsMathematicsMatricesMatrices--data processingMatrix groupsMatrix mechanicsQa188 .g65 2013Statistics

Explore in the mosaic

Read next: its neighbours on the mosaic