Lecture 27: Sparse Gaussian Elimination

ID: applications-of-parallel-computers-cs267-spring-1996/lecture-27-sparse-gaussian-elimination

Unsigned lecture notes dated 23 April 1996, hosted by the University of California, Berkeley. Neither personal nor institutional authorship is established.
Cited passages: Cholesky versus LU Decomposition, four phases; Left looking versus Right looking Cholesky; The Elimination Tree and Sources of Parallelism. Several later sections are marked under construction.

New to topics? Read the docs here!