An Empirical Analysis of the Performance of Preconditioners for SPD Systems

Preconditioned iterative solvers have the potential to solve very large sparse linear systems with a fraction of the memory used by direct methods. However, the effectiveness and performance of most preconditioners is not only problem dependent, but also fairly sensitive to the choice of their tunable parameters. As a result, a typical practitioner is faced with an overwhelming number of choices of solvers, preconditioners, and their parameters. The diversity of preconditioners makes it difficult to analyze them in a unified theoretical model. A systematic empirical evaluation of existing preconditioned iterative solvers can help in identifying the relative advantages of various implementations. We present the results of a comprehensive experimental study of the most popular preconditioner and iterative solver combinations for symmetric positive-definite systems. We introduce a methodology for a rigorous comparative evaluation of various preconditioners, including the use of some simple but powerful metrics. The detailed comparison of various preconditioner implementations and a state-of-the-art direct solver gives interesting insights into their relative strengths and weaknesses. We believe that these results would be useful to researchers developing preconditioners and iterative solvers as well as practitioners looking for appropriate sparse solvers for their applications.

[1]  Miroslav Tuma,et al.  Balanced Incomplete Factorization , 2008, SIAM J. Sci. Comput..

[2]  Barry Smith,et al.  PETSc (Portable, Extensible Toolkit for Scientific Computation) , 2011, Encyclopedia of Parallel Computing.

[3]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[4]  Mark T. Jones,et al.  An improved incomplete Cholesky factorization , 1995, TOMS.

[5]  Edmond Chow,et al.  Parallel Implementation and Practical Use of Sparse Approximate Inverse Preconditioners with a Priori Sparsity Patterns , 2001, Int. J. High Perform. Comput. Appl..

[6]  T. Manteuffel.  An incomplete factorization technique for positive definite linear systems , 1980 .

[7]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[8]  Alex Pothen,et al.  A Scalable Parallel Algorithm for Incomplete Factor Preconditioning , 2000, SIAM J. Sci. Comput..

[9]  Vipin Kumar,et al.  A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering , 1998, J. Parallel Distributed Comput..

[10]  Y. Saad,et al.  Iterative solution of linear systems in the 20th century , 2000 .

[11]  J. H. Wilkinson,et al.  AN ESTIMATE FOR THE CONDITION NUMBER OF A MATRIX , 1979 .

[12]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[13]  Tamara G. Kolda,et al.  An overview of the Trilinos project , 2005, TOMS.

[14]  V. Kumar,et al.  Parallel Threshold-based ILU Factorization , 1997, ACM/IEEE SC 1997 Conference (SC'97).

[15]  M. Benzi.  Preconditioning techniques for large linear systems: a survey , 2002 .

[16]  Saltelli Andrea,et al.  Global Sensitivity Analysis: The Primer , 2008 .

[17]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .

[18]  Olof B. Widlund,et al.  Domain Decomposition Algorithms with Small Overlap , 1992, SIAM J. Sci. Comput..

[19]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[20]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[21]  V. E. Henson,et al.  BoomerAMG: a parallel algebraic multigrid solver and preconditioner , 2002 .

[22]  M. Benzi,et al.  A comparative study of sparse approximate inverse preconditioners , 1999 .

[23]  Anshul Gupta,et al.  Adaptive Techniques for Improving the Performance of Incomplete Factorization Preconditioning , 2010, SIAM J. Sci. Comput..

[24]  Vivek Sarin,et al.  An Empirical Analysis of Iterative Solver Performance for SPD Systems , 2011 .

[25]  Edmond Chow,et al.  Approximate Inverse Preconditioners via Sparse-Sparse Iterations , 1998, SIAM J. Sci. Comput..

[26]  Anshul Gupta,et al.  Fast and effective algorithms for graph partitioning and sparse-matrix ordering , 1997, IBM J. Res. Dev..

[27]  Murat Manguoglu,et al.  PSPIKE: A Parallel Hybrid Sparse Linear System Solver , 2009, Euro-Par.

[28]  A. Saltelli,et al.  On the Relative Importance of Input Factors in Mathematical Models , 2002 .

[29]  Y. Saad,et al.  Experimental study of ILU preconditioners for indefinite matrices , 1997 .

[30]  Sivan Toledo,et al.  An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems , 2000, Informatica.

[31]  Jonathan J. Hu,et al.  ML 5.0 Smoothed Aggregation Users's Guide , 2006 .

[32]  Shuangzhe Liu,et al.  Global Sensitivity Analysis: The Primer by Andrea Saltelli, Marco Ratto, Terry Andres, Francesca Campolongo, Jessica Cariboni, Debora Gatelli, Michaela Saisana, Stefano Tarantola , 2008 .

[33]  José MarÍn José Mas Rafael Bru,et al.  Balanced Incomplete Factorization , 2008 .