Premium
Parallelization of the ILU(0) preconditioner for CFD problems on shared‐memory computers
Author(s) -
Dutto Laura C.,
Habashi Wagdi G.
Publication year - 1999
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/(sici)1097-0363(19990830)30:8<995::aid-fld874>3.0.co;2-k
Subject(s) - preconditioner , parallel computing , computer science , factorization , computational fluid dynamics , scalability , incomplete lu factorization , computation , supercomputer , block (permutation group theory) , navier–stokes equations , computational science , algorithm , mathematics , matrix decomposition , compressibility , iterative method , database , physics , geometry , engineering , aerospace engineering , eigenvalues and eigenvectors , quantum mechanics , mechanics
Abstract The use of ILU(0) factorization as a preconditioner is quite frequent when solving linear systems of CFD computations. This is because of its efficiency and moderate memory requirements. For a small number of processors, this preconditioner, parallelized through coloring methods, shows little savings when compared with a sequential one using adequate reordering of the unknowns. Level scheduling techniques are applied to obtain the same preconditioning efficiency as in a sequential case, while taking advantage of parallelism through block algorithms. Numerical results obtained from the parallel solution of the compressible Navier–Stokes equations show that this technique gives interesting savings in computational times on a small number of processors of shared‐memory computers. In addition, it does this while keeping all the benefits of an ILU(0) factorization with an adequate reordering of the unknowns, and without the loss of efficiency of factorization associated with a more scalable coloring strategy. Copyright © 1999 John Wiley & Sons, Ltd.