Skip to main content
Log in

Parallel Performance of Block ILU Preconditioners for a Block-tridiagonal Matrix

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The parallelizable block ILU (incomplete LU) factorization preconditioners for a block-tridiagonal matrix have been recently proposed by the author. In this paper, we describe a parallelization of Krylov subspace methods with the block ILU factorization preconditioners on distributed-memory computers such as the Cray T3E, and then parallel performance results of a preconditioned Krylov subspace method are provided to evaluate the effectiveness and efficiency of the block ILU preconditioners on the Cray T3E.

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. O. Axelsson. Incomplete block matrix factorization preconditioning methods. The ultimate answer? Journal of Computational and Applied Mathematics, 12 and 13:3–18, 1985.

    Google Scholar 

  2. O. Axelsson. A general incomplete block-matrix factorization method. Linear Algebra and its Applications, 74:179–190, 1986.

    Google Scholar 

  3. O. Axelsson. Iterative Solution Methods. Cambridge University Press, New York, 1994.

    Google Scholar 

  4. R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, PA, 1994.

    Google Scholar 

  5. A. Berman and R. J. Plemmons. Nonnegative Matrices in the Mathematical Science. Academic Press, New York, 1979.

    Google Scholar 

  6. N. I. Buleev. A numerical method for the solution of two-dimensional and three-dimensional equations of diffusion. Math. Sb., 51:227–238, 1960 (in Russian).

    Google Scholar 

  7. P. Concus, G. H. Golub and G. Meurant. Block preconditioning for the CG method. SIAM Journal on Scientific and Statistical Computing, 6:220–252, 1985.

    Google Scholar 

  8. R. Fletcher. Conjugate gradient methods for indefinite systems, In: Lecture Notes in Mathematics, 506:73–89, Springer-Verlag, Berlin, 1976.

    Google Scholar 

  9. A. Frommer, D. B. Szyld. H-splittings and two-stage iterative methods. Numerishe Mathematik, 63:345–356, 1992.

    Google Scholar 

  10. Sang W. Kim and Jae H. Yun. Block ILU factorization preconditioners for a block-tridiagonal H-matrix. Linear Algebra and its Applications, 317:103–125, 2000.

    Google Scholar 

  11. T. A. Manteuffel. An incomplete factorization technique for positive definite linear systems. Mathematics of Computation, 34:473–497, 1980.

    Google Scholar 

  12. J. A. Meijerink and H. A. van der Vorst. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Mathematics of Computation, 31:148–162, 1977.

    Google Scholar 

  13. A. Messaoudi. On the stability of the incomplete LU-factorizations and characterizations of H-matrices. Numerishe Mathematik, 69:321–331, 1995.

    Google Scholar 

  14. G. Meurant. The block preconditioned conjugate gradient method on vector computers. BIT Numerical Mathematics, 24:623–633, 1984.

    Google Scholar 

  15. G. Meurant. Multitasking the conjugate gradient method on the Cray X-MP/48. Parallel Computing, 5:267–280, 1987.

    Google Scholar 

  16. A. Neumaier. New techniques for the analysis of linear interval equations. Linear Algebra and its Applications, 58:273–325, 1984.

    Google Scholar 

  17. G. Radicati di Brozolo and Y. Robert. Parallel conjugate gradient-like algorithms for solving sparse non-symmetric systems on a vector multiprocessor. Parallel Computing, 11:223–239, 1989.

    Google Scholar 

  18. Y. Saad. Iterative Methods for Sparse Linear Systems. PWS Publishing Company, Boston, MA, 1996.

    Google Scholar 

  19. Y. Saad and M. H. Schultz. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 7:856–869, 1986.

    Google Scholar 

  20. M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra. MPI: The Complete Reference. MIT Press, London, England, 1996.

    Google Scholar 

  21. P. Sonneveld. CGS: a fast Lanczos-type solver for nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 10:36–52, 1989.

    Google Scholar 

  22. 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:631–644, 1992.

    Google Scholar 

  23. R. S. Varga. Factorization and normalized iterative methods, In: Boundary problems in differential equations, 121-142, University of Wisconsin Press, Madison, 1960.

    Google Scholar 

  24. R. S. Varga. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, New Jersey, 1962.

    Google Scholar 

  25. T. Washio and K. Hayami. Parallel block preconditioning based on SSOR and MILU. Numerical Linear Algebra with Applications, 1:533–553, 1994.

    Google Scholar 

  26. Jae H. Yun. Block ILU preconditioners for a nonsymmetric block-tridiagonal M-matrix. BIT Numerical Mathematics, 40:583–605, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heon Yun, J. Parallel Performance of Block ILU Preconditioners for a Block-tridiagonal Matrix. The Journal of Supercomputing 24, 69–89 (2003). https://doi.org/10.1023/A:1020941526869

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020941526869

Navigation