Lawrence Berkeley National Laboratory
Thursday, September 23, 2010 12:00PM
Location: Math Tower, Room S-240
Factorization-Based Sparse Solvers and Preconditioners
Efficient solution of large-scale, ill-conditioned and highly-
indefinite algebraic equations often relies on high quality
preconditioners together with iterative solvers. Because of their
robustness, factorization-based algorithms often play a significant
role in developing scalable solvers.
We present our recent work of using state-of-the-art sparse
factorization techniques to build domain-decomposition type direct/
iterative hybrid solvers and efficient incomplete factorization
preconditioners. In addition to algorithmic principles, we also
address many practical aspects that need to be taken under
consideration in order to deliver high speed and robustness to the
users of today's sophisticated high performance computers.