ParIC: A Family of Parallel Incomplete Cholesky Preconditioners

Authors:
Mardochée Magolu monga Made;Henk A. van der Vorst
Affiliations:
-;-
Venue:
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Year:
2000

Citing 11
Cited 0

High performance preconditioning

SIAM Journal on Scientific and Statistical Computing
The effect of ordering on preconditioned conjugate gradients

BIT
Implementation of parallel block preconditionings on a transputer-based multiprocessor

Future Generation Computer Systems - Special issue: massive parallel computing
An efficient parallel discrete PDE solver

Parallel Computing
Domain decomposition: parallel multilevel methods for elliptic partial differential equations

Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Taking Advantage of the Potentialities of Dynamically Modified Block Incomplete Factorizations

SIAM Journal on Scientific Computing
Parallel incomplete Cholesky preconditioners based on the non-overlapping data distribution

Parallel Computing
Developments and trends in the parallel solution of linear systems

Parallel Computing - Special Anniversary issue
Ordering strategies and related techniques to overcome the trade-off between parallelism and convergence in incomplete factorizations

Parallel Computing - Special Anniversary issue
Numerical Linear Algebra for High Performance Computers

Numerical Linear Algebra for High Performance Computers

Quantified Score

Hi-index	0.00

Visualization

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.