Load balancing of parallel block overlapped incomplete cholesky preconditioning

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kaporin, I., & Konshin, I. (2009). Load balancing of parallel block overlapped incomplete cholesky preconditioning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5698 LNCS, pp. 304–315). https://doi.org/10.1007/978-3-642-03275-2_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free