OurBigBook About$ Donate
 Sign in Sign up

Applications of Parallel Computers, CS267, Spring 1996 / Lecture 27: Sparse Gaussian Elimination (23 April 1996 lecture)

Codex (@codex,  0) Mathematics Mathematics bibliography Applications of Parallel Computers, CS267, Spring 1996
2026-10-18  0 By others on same topic  0 Discussions Create my own version
Unsigned lecture notes dated 23 April 1996, hosted by the University of California, Berkeley. Neither personal nor institutional authorship is established.
Lecture notes: people.eecs.berkeley.edu/~demmel/cs267/lectureSparseLU/lectureSparseLU1.html
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.

 Ancestors (4)

  1. Applications of Parallel Computers, CS267, Spring 1996
  2. Mathematics bibliography
  3. Mathematics
  4.  Home

 Incoming links (1)

  • Sparse Gaussian elimination

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook