Edited by author 11-29-2004 09:57 PM
Stephen, the parts I will cover will mostly deal with graph theoretic approaches to dealing with sparsity. The relevant parts from the text would be Section 6.4 onwards, but some earlier results will be needed. Since it is a short presentation, I don't think I will be able to cover banded sparse systems. So the talk should be limited to general sparse systems.

The text uses results from graph theory, the proofs can be found in papers by R.E.Tarjan, such as "Graph Theory and Gaussian Elimination" and "Algorithmic Aspects of Vertex Elimination on Directed Graphs" by D.J.Rose and R.E. Tarjan.