Abstract
Authors have shown that “Localized” ILU(O) factorization is very effective preconditioning method for parallel iterative solvers. This method provides data locality and good parallelization effect because there are no inter-processor communications. But it's not as strong a method as the original ILU(O) preconditioner. Therefore, the convergence is getting slower if the processor number becomes larger.
In this paper, authors have developed a new method with faster and more stable convergence by considering the effects of interpartition communication during preconditioning. Thus, problem converges faster in many PE cases although slightly more calculations and communications are required.
Effect of partitioning, depth of external nodes and ordering have been investigated for various type of examples. Developed system performance has been also evaluated on workstation cluster with MPI.
References
J.J.Dongarra et. al. Templates for the Solution, of Linear Systems: Building Blocks for Iterative Methods, SIAM, 1994.
W.Gropp et. al. Using MPI, MIT Press, 1994.
V. Venkatakrishnan. Parallel Implicit Methods for Aerodynamic Applications on Unstructured Grids, SIAM, 1994.
K.Murata et. al. Large Scale Numerical Simulation (in Japanese), Iwanami-Books, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakajima, K., Nakamura, H., Okuda, H. (1998). Highly stable localized ILU preconditioning for unstructured grids. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037228
Download citation
DOI: https://doi.org/10.1007/BFb0037228
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64443-9
Online ISBN: 978-3-540-69783-1
eBook Packages: Springer Book Archive