Tutte colloquium-Luke Schaeffer

Title:Faster linear algebra using treewidth

Abstract: We look at the complexity of solving sparse linear systems as a function of the treewidth of the instance. That is, the sparse matrix is associated with a sparse graph, and solutions can be found faster when that graph has low treewidth. We give a parameterized algorithm in system size and treewidth achieving the conjectured optimal performance.

This is joint work with Daniel Grier.