January 14, 2011, 1100 Webb

Fast and reliable algorithms for structured matrix computation is a very active area of research in numerical linear algebra. In this talk, we briefly review the rich history in this area and discuss recent advances in structured matrix computations. In particular, we show how structured matrix techniques can be successfully exploited to develop superfast direct solvers and preconditioners for large classes of symmetric positive definite sparse matrices