Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning

Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for constructing and applying preconditioners on multiprocessors using incomplete factorizations with selective inversion for improved latency-tolerance. We provide empirical results on the efficiency, scalability and quality of our preconditioners for sparse matrices from model grids and some problems from practical applications. Our results indicate that our preconditioners enable more robust sparse linear system solution.

• Type: Conference
• Year: 2004
• Where: PARA
• Authors: Keita Teranishi, Padma Raghavan
• Keywords: Applied Computing, Linear System Solution, PARA 2004, Robust Sparse Linear, Sparse Linear