PARALLEL INCOMPLETE LU FACTORIZATION AS A PRECONDITIONER FOR KRYLOV SUBSPACE METHODS
1999 ◽
Vol 09
(04)
◽
pp. 467-474
◽
Keyword(s):
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.
Keyword(s):
Keyword(s):
2016 ◽
Vol 15
(1)
◽
pp. 9-20
2008 ◽
Vol 17
(03)
◽
pp. 439-446
Keyword(s):
2015 ◽
Vol 56
(3)
◽
pp. 893-918
◽