PARALLEL INCOMPLETE LU FACTORIZATION AS A PRECONDITIONER FOR KRYLOV SUBSPACE METHODS
Patricia González, Jose Carlos Cabaleiro, Tomás F. Pena · Parallel Processing Letters · 1999
In this paper we describe a new method for the ILU(0) factorization of sparse systems in distributed memory multiprocessor architectures. This method uses a symbolic reordering technique, so the final system can be grouped in blocks where the rows are independent and the factorization of these entries can be carried out in parallel. The parallel ILU(0) factorization has been tested on the Cray T3E multicomputer using the MPI communication library. The performance was analysed using matrices from the Harwell–Boeing collection.