Abstract
A modification is proposed for the second order incomplete Cholesky decomposition (IC2). It makes possible to design a preconditioning procedure for the conjugate gradient method (CGM) with a controllable fill-in in the preconditioner. The modified algorithm is used to develop a load-balancing parallel preconditioning for CGM as applied to linear systems with symmetric positive definite matrices. Numerical results obtained using a multiprocessor computer system are presented.
Similar content being viewed by others
References
I. E. Kaporin, “New Convergence Results and Preconditioning Strategies for the Conjugate Gradient Method,” Numer. Linear Algebra Appl. 1, 179–210 (1994).
I. E. Kaporin and I. N. Kon’shin, “Parallel Solution of Symmetric Positive Definite Systems Based on Decomposition into Overlapping Blocks,” Zh. Vychisl. Mat. Mat. Fiz. 41, 515–528 (2001) [Comput. Math. Math. Phys. 41, 481–493 (2001)].
I. E. Kaporin and I. N. Konshin, “A Parallel Block Overlap Preconditioning with Inexact Submatrix Inversion for Linear Elasticity Problems,” Numer. Lin. Algebra Appl. 9, 141–162 (2002).
I. E. Kaporin and I. N. Kon’shin, “Parallel Solution of Linear Systems with the Use of Approximate Factorization of Overlapping Blocks,” in Mathematical Modeling: Problems and Results (Nauka, Moscow, 2003), pp. 315–326 [in Russian].
I. E. Kaporin and I. N. Konshin, “Post-Filtering of IC Factors for Load Balancing in Parallel Preconditioned CG Solvers,” Numerical Geometry, Grid Generation, and High Performance Computing (Computing Center, Russ. Acad. Sci., Moscow, 2008), pp. 158–164.
I. E. Kaporin, “High Quality Preconditionings of a General Symmetric Positive Definite Matrix Based on Its UTU + UTR + RTU-Decomposition,” Numer. Liner. Algebra. Appl. 5, 483–509 (1998).
A. Jennings and G. M. Malik, “Partial Elimination,” J. Inst. Math. Appl. 20, 307–316 (1977).
Y. Notay, “On the Convergence Rate of the Conjugate Gradients in Presence of Rounding Errors,” Numer. Math. 65, 301–317 (1993).
T. A. Manteuffel, “An Incomplete Factorization Technique for Positive Definite Linear Systems,” Math. Comput. 34, 473–497 (1980).
I. E. Kaporin, “Optimizing the UU + UR + RU-Decomposition Based Conjugate Gradient Preconditionings,” Rep. 0030, November 2000 (Dept. Math., Catholic Univ. Nijmegen, Nijmegen, 2000).
M. Benzi and T. Tuma, “A Robust Incomplete Factorization Preconditioner for Positive Definite Matrices,” Numer. Linear Algebra Appl. 10, 385–400 (2003).
G. Karypis and V. Kumar, “Multilevel k-Way Hypergraph Partitioning” Tech. Rep. 98-036 (Dept. Comput. Sci. Eng. Army HPC Res. Center, Univ. Minnesota, Minnesota 1998).
T. A. Davis, University of Florida Sparse Matrix Collection http://www.cise.ufl.edu/research/sparse/matrices
S. Maclahlan and Y. Saad, “A Greedy Strategy for Coarse-Grid Selection,” SIAM J. Sci. Comput. 29, 1825–1853 (2007).
Y. Saad and B. Suchomel, “ARMS: An Algebraic Recursive Multilevel Solver for General Sparse Linear Systems,” Numer. Linear Algebra Appl. 9, 359–378 (2002).
J. W. Ruge and K. Stuben, Algebraic Multigrid (AMG), Multigrid Methods, Frontiers Appl. Math. (SIAM, Philadelphia, 1987), Vol. 3, pp. 73–130.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © I.E. Kaporin, I.N. Kon’shin, 2009, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2009, Vol. 49, No. 6, pp. 940–957.
Rights and permissions
About this article
Cite this article
Kaporin, I.E., Kon’shin, I.N. Post-filtering of IC2-factors for load balancing in parallel preconditioning. Comput. Math. and Math. Phys. 49, 901–918 (2009). https://doi.org/10.1134/S0965542509060025
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542509060025