ParIC: A Family of Parallel Incomplete Cholesky Preconditioners

A class of parallel incomplete factorization preconditionings for the solution of large linear systems is investigated. The approach may be regarded as a generalized domain decomposition method. Adjacent subdomains have to communicate during the setting up of the preconditioner, and during the application of the preconditioner. Overlap is not necessary to achieve high performance. Fill-in levels are considered in a global way. If necessary, the technique may be implemented as a global re-ordering of the unknowns. Experimental results are reported for two-dimensional problems.

[1]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[2]  Magolu Monga-Made.  Implementation of parallel block preconditionings on a transputer-based multiprocessor , 1995 .

[3]  S. Doi,et al.  A Graph-theory approach for analyzing the effects of ordering on ILU preconditionning , 1991 .

[4]  J. Meijerink,et al.  An iterative solution method for linear systems of which the coefficient matrix is a symmetric -matrix , 1977 .

[5]  I. Duff,et al.  The effect of ordering on preconditioned conjugate gradients , 1989 .

[6]  Mardochée Magolu monga Made.  Taking Advantage of the Potentialities of Dynamically Modified Block Incomplete Factorizations , 1998, SIAM J. Sci. Comput..

[7]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[8]  Mardochée Magolu monga Made.  Implementation of parallel block preconditionings on a transputer-based multiprocessor , 1995, Future Gener. Comput. Syst..

[9]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[10]  Barry F. Smith,et al.  Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations , 1996 .

[11]  B. Polman,et al.  Efficient planewise‐like preconditioners for solving 3D problems , 1999 .

[12]  James J. Duderstadt,et al.  Computational Methods in Engineering and Science , 1978 .

[13]  Yvan Notay,et al.  An Efficient Parallel Discrete PDE Solver , 1995, Parallel Comput..

[14]  Magolu Monga-Made.  Taking Advantage of the Potentialities of Dynamically Modified Block Incomplete Factorizations , 1998 .

[15]  Shoichiro Nakamura.  Computational methods in engineering and science , 1977 .

[16]  H. V. D. Vorst,et al.  High Performance Preconditioning , 1989 .

[17]  Gene H. Golub,et al.  Matrix computations , 1983 .

[18]  Yvan Notay,et al.  Coarse-grid acceleration of parallel incomplete factorization preconditioners , 1996 .

[19]  Raf Van Driessche,et al.  Algorithms for static and dynamic load balancing on parallel computers , 1995 .

[20]  Henk A. van der Vorst,et al.  Developments and trends in the parallel solution of linear systems , 1999, Parallel Comput..

[21]  Gundolf Haase.  Parallel Incomplete Cholesky Preconditioners Based on the Non-Overlapping Data Distribution , 1998, Parallel Comput..

[22]  Jack Dongarra,et al.  Numerical Linear Algebra for High-Performance Computers , 1998 .

[23]  Henk A. van der Vorst,et al.  Parallel incomplete factorizations with pseudo-overlapped subdomains , 2001, Parallel Comput..

[24]  Henk A. van der Vorst,et al.  Large tridiagonal and block tridiagonal linear systems on vector and parallel computers , 1987, Parallel Comput..

[25]  Tobias J. Hagge,et al.  Physics , 1929, Nature.

[26]  Takumi Washio,et al.  Ordering strategies and related techniques to overcome the trade-off between parallelism and convergence in incomplete factorizations , 1999, Parallel Comput..

[27]  J. Meijerink,et al.  Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems , 1981 .

[28]  O. Axelsson.  Iterative solution methods , 1995 .