Application of Teng and Spielman's O(N log(N)) Equation
Solvers to Finite Element Systems.

Professsor Noel Walkington
Carnegie Mellon University

Abstract: Recently Teng and Spielman have developed O(N log(N))
algorithms to solve SPD diagonally dominant linear systems. Their
ideas are purely graph theoretical, so there are no restrictions on
element quality, regularity of coefficients of the underlying pde,
etc., which are cruical for classical multigrid schemes. This talk
will review this result, and application to systems of equations which
arise in classical finite element analysis.