Abstract
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.
Research supported by the Commission of the European Community, under contract nr. 25009, within the ESPRIT IV project.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R.F. Barret, M. Berry, T.F. Chan, J. Demmel, J. Donato, J.J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods (SIAM, Philadelphia, 1994).
R. Beauwens, L. Dujacquier, S. Hitimana and M. Magolu monga Made: MILU factorizations for 2-processor orderings. In: I.T. Dimov, Bl. Sendov and P.S. Vassilevski (eds.), Advances in Numerical Methods and Applications \( \mathcal{O} \)(h 3) (World Scientific, Singapore, 1994) 26–34.
S. Doi and A. Lichnewsky: A graph-theory approach for analyzing the effects of ordering on ILU preconditioning. INRIA report 1452, INRIA-Rocquencourt, France, 1991.
S. Doi and T. Washio: Ordering strategies and related techniques to overcome the trade-off between parallelism and convergence in incomplete factorizations. Parallel Comput. 25, (1999) 1995–2014.
J.J. Dongarra, I.S. Duff, D.C. Sorensen and H.A. van der Vorst: Numerical Linear Algebra for High-Performance Computers (SIAM, Philadelphia, 1998).
I.S. Duff and G.A. Meurant: The effect of ordering on preconditioned conjugate gradients. BIT 29, (1989) 635–657.
I.S. Duff and H.A. van der Vorst: Developments and Trends in the Parallel Solution of Linear Systems. Parallel Comput. 25, (1999) 1931–1970.
G.H. Golub and C.F. van Loan: Matrix Computations (third ed.) (The John Hopkins University Press, Baltimore, Maryland, 1996).
G. Haase: Parallel incomplete Cholesky preconditioners based on the nonoverlapping data distribution. Parallel Comput. 24, (1998) 1685–1703.
M. Magolu monga Made: Implementation of parallel block preconditionings on a transputer-based multiprocessor. Future Generation Computer Systems 11, (1995) 167–173.
M. Magolu monga Made: Taking advantage of the potentialities of dynamically modified block incomplete factorizations. SIAM J. Sci. Comput. 19, (1998) 1083–1108.
M. Magolu monga Made and B. Polman: Efficient planewise like preconditioners to cope with 3D problems. Numer. Linear Algebra Appl. 6, (1999) 379–406.
M. Magolu monga Made and H.A. van der Vorst: Parallel incomplete factorizations with pseudo-overlapped subdomains. Technical Report, Service des Milieux Continus, Université Libre de Bruxelles, February 2000.
J.A. Meijerink and H.A. van der Vorst: An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comp. 31, (1977) 148–162.
J.A. Meijerink and H.A. van der Vorst: Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems. J. Comp. Physics 44, (1981) 134–155.
Y. Notay: An efficient Parallel Discrete PDE Solver. Parallel Comput. 21, (1995) 1725–1748.
Y. Notay and A. Van de Velde: Coarse grid acceleration of parallel incomplete preconditioners. In: S. Margenov and P. Vassilevski, (eds.), Iterative Methods in Linear Algebra II. IMACS series in Computational and Applied Mathematics 3, (1996) 106–130.
B.F. Smith, P.E. Bjorstad and D. Gropp: Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations (Cambridge University Press, Cambridge, 1996).
H.A. van der Vorst: High performance preconditioning. SIAM J. Sci. Statist. Comput. 10, (1989) 1174–1185.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Made, M.M.m., van der Vorst, H.A. (2000). ParIC: A Family of Parallel Incomplete Cholesky Preconditioners. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-45492-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67553-2
Online ISBN: 978-3-540-45492-2
eBook Packages: Springer Book Archive