Abstract
A modification of the second order Incomplete Cholesky (IC) factorization with controllable amount of fill-in is described and analyzed. This algorithm is applied to the construction of well balanced coarse-grain parallel preconditioning for the Conjugate Gradient (CG) iterative solution of linear systems with symmetric positive definite matrix. The efficiency of the resulting parallel algorithm is illustrated by a series of numerical experiments using large-scale ill-conditioned test matrices taken from the collection of the University of Florida.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kaporin, I.E.: New convergence results and preconditioning strategies for the conjugate gradient method. Numer. Linear Algebra Appls. 1, 179–210 (1994)
Kaporin, I.E.: High quality preconditionings of a general symmetric positive definite matrix based on its U T U + U T R + R T U-decomposition. Numer. Lin. Alg. Appl. 5, 483–509 (1998)
Kaporin, I.E., Konshin, I.N.: A parallel block overlap preconditioning with inexact submatrix inversion for linear elasticity problems. Numer. Lin. Algebra Appl. 9, 141–162 (2002)
Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning, Technical Report 98-036, Dept. Comp. Sci. Engrg. Army HPC Research Center, Univ. of Minnesota, MN (1998)
Jennings, A., Malik, G.M.: Partial elimination. J. Inst. Math. Appl. 20, 307–316 (1977)
Manteuffel, T.A.: An incomplete factorization technique for positive definite linear systems. Math. Comput. 34, 473–497 (1980)
Notay, Y.: On the convergence rate of the conjugate gradients in presence of rounding errors. Numer. Math. 65, 301–317 (1993)
University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/research/sparse/matrices
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaporin, I., Konshin, I. (2009). Load Balancing of Parallel Block Overlapped Incomplete Cholesky Preconditioning. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2009. Lecture Notes in Computer Science, vol 5698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03275-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-03275-2_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03274-5
Online ISBN: 978-3-642-03275-2
eBook Packages: Computer ScienceComputer Science (R0)