Speaker: Sivaram Ambikasaran, CIMS
Location: Warren Weaver Hall 1302
Date: April 11, 2014, 10 a.m.
The talk will discuss algorithms to construct almost linear complexity fast direct solvers for matrices arising out of elliptic partial differential equations. The algorithm relies on extended sparsification and hierarchical compression. This provides a unified framework to view and construct solvers for different classes of hierarchical and sparse matrices.