Skip to main content
Log in

Performance comparison of various parallel incomplete LU factorization preconditioners for domain decomposition method

  • Published:
Journal of Mechanical Science and Technology Aims and scope Submit manuscript

Abstract

A finite element code is parallelized by vertex-oriented domain decomposition method which utilizes one- or multi-dimensional partitioning in structured mesh and METIS Library in unstructured mesh. For obtaining the domain-decomposed solution, iterative solvers like conjugate gradient method are used. To accelerate the convergence of iterative solvers, parallel incomplete LU factorization preconditioners are employed, and their performances are compared. For the communication between processors, Message Passing Interface Library is used. The speedups of parallel preconditioned iterative solvers are estimated through computing 2- and 3-dimensional Laplace equations. The effects of mesh and partitioning method on the speedup of parallel preconditioners are also examined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Basermann, B. Reichel and C. Schelthoff, Preconditioned CG methods for sparse matrices on massively parallel machines, Parallel Computing, 23 (3) (1997) 381–398.

    Article  MathSciNet  MATH  Google Scholar 

  2. M. Magolu monga Made and H. A. van der Vorst, A generalized domain decomposition paradigm for parallel incomplete LU factorization preconditionings, Future Generation Computer Systems, 17 (8) (2001) 925–932.

    Article  MATH  Google Scholar 

  3. M. Magolu monga Made and H. A. van der Vorst, Parallel incomplete factorizations with pseudo–overlapped subdo–mains, Parallel Computing, 27 (8) (2001) 989–1008.

    Article  MathSciNet  MATH  Google Scholar 

  4. Y. Saad and M. Sosonkina, Distributed Schur complement techniques for general sparse linear systems, SIAM Journal on Scientific Computing, 21 (4) (1999) 1337–1356.

    Article  MathSciNet  MATH  Google Scholar 

  5. M. Manguoglu, A domain–decomposing parallel sparse linear system solver, Journal of Computational and Applied Mathematics, 236 (3) (2011) 319–325.

    Article  MathSciNet  MATH  Google Scholar 

  6. A. Lemmer and R. Hilfer, Parallel domain decomposition method with non–blocking communication for flow through porous media, Journal of Computational Physics, 281 (2015) 970–981.

    Article  MathSciNet  MATH  Google Scholar 

  7. S. Loisel and H. Nguyen, An optimal Schwarz preconditioner for a class of parallel adaptive finite elements, Journal of Computational and Applied Mathematics, 321 (2017) 90–107.

    Article  MathSciNet  MATH  Google Scholar 

  8. G. Radicati di Brozolo and Y. Robert, Parallel conjugate gradient–like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor, Parallel Computing, 11 (2) (1989) 223–239.

    Article  MathSciNet  MATH  Google Scholar 

  9. Y. Saad, Iterative methods for sparse linear systems, PWS Publishing Company: Boston (1996).

    MATH  Google Scholar 

  10. H. A. Van der Vorst, Bi–CGSTAB: A fast and smoothly converging variant of Bi–CG for the solution of nonsymmetric linear systems, SIAM Journal on Scientific and Statistical Computing, 13 (2) (1992) 631–644.

    Article  MathSciNet  MATH  Google Scholar 

  11. M. Snir, S. W. Otto, S. Huss–Lederman, D. Walker and J. Dongarra, MPI: The complete reference, The MIT Press: London, England (1996).

    Google Scholar 

  12. http://www–users.cs.umn.edu/~karypis/metis.

  13. G. F. Carey, Y. Shen and R. T. McLay, Parallel conjugate gradient performance for least–squares finite elements and transport problems, International Journal for Numerical Methods in Fluids, 28 (10) (1998) 1421–1440.

    Article  MATH  Google Scholar 

  14. D. S. Kershaw, The incomplete Cholesky–conjugate gradient method for the iterative solution of systems of linear equations, Journal of Computational Physics, 26 (1) (1978) 43–65.

    Article  MathSciNet  MATH  Google Scholar 

  15. K. A. Hoffmann and S. T. Chiang, Computational fluid dynamics for engineers, A Publication of Engineering Education System: Wichita, Kansas, USA, 1 (1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hyounggwon Choi.

Additional information

Recommended by Associate Editor Simon Song

Hyoung Gwon Choi obtained a Ph.D., major in the development of CFD algorithms of finite element method, from Seoul National University, Korea. He is currently a Professor in the Department of Mechanical/Automotive Engineering, Seoul National University of Science and Technology.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kang, S., Choi, H., Chung, W. et al. Performance comparison of various parallel incomplete LU factorization preconditioners for domain decomposition method. J Mech Sci Technol 32, 5315–5323 (2018). https://doi.org/10.1007/s12206-018-1030-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12206-018-1030-y

Keywords

Navigation