Padma Raghavan (University of Tennessee, Knoxville)
Abstract:
This talk concerns the design of robust linear system solvers which can utilize the ``sparsity'' of the coefficient matrix to realize orders of magnitude reductions in computational costs. The focus will be on algorithms and efficient implementations suitable for both serial and parallel computers. The presentation includes aspects of both direct and iterative solvers as well as their hybrids.