Performance of ILU factorization preconditioners based on multisplittings
Article
First Online:
Received:
Revised:
- 73 Downloads
- 13 Citations
Summary.
In this paper, we study the convergence of multisplitting methods associated with a multisplitting which is obtained from the ILU factorizations of a general H-matrix, and then we propose parallelizable ILU factorization preconditioners based on multisplittings for a block-tridiagonal H-matrix. We also describe a parallelization of preconditioned Krylov subspace methods with the ILU preconditioners based on multisplittings on distributed memory computers such as the Cray T3E. Lastly, parallel performance results of the preconditioned BiCGSTAB are provided to evaluate the efficiency of the ILU preconditioners based on multisplittings on the Cray T3E.
Keywords
Performance Result Parallel Performance Memory Computer Krylov Subspace Subspace Method
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Barrett et al, R.: Templates for the solution of linear systems: Building blocks for iterative methods, (SIAM, Philadelphia, 1994)Google Scholar
- 2.Berman, A., Plemmons, R.J.: Nonnegative matrices in the Mathematical sciences (Academic Press, New York, 1979)Google Scholar
- 3.Bru, R., Migallón, V., Penadés, J., Szyld, D.B.: Parallel, synchronous and asynchronous two-stage multisplitting methods. Electron. Trans. Numer. Anal. 3, 24–38 (1995)MathSciNetMATHGoogle Scholar
- 4.Frommer, A., Mayer, G.: Convergence of relaxed parallel multisplitting methods. Linear Algebra Appl. 119, 141–152 (1989)CrossRefMathSciNetMATHGoogle Scholar
- 5.Frommer, A., Szyld, D.B.: H-splittings and two-stage iterative methods. Numer. Math. 63, 345–356 (1992)MathSciNetMATHGoogle Scholar
- 6.Kim, S.W., Yun, J.H.: Block ILU factorization preconditioners for a block-tridiagonal H-matrix. Linear Algebra Appl. 317, 103–125 (2000)CrossRefMathSciNetMATHGoogle Scholar
- 7.Meijerink, J.A., van der Vorst, H.A.: An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comput. 31, 148–162 (1977)MATHGoogle Scholar
- 8.Messaoudi, A.: On the stability of the incomplete LU factorizations and characterizations of H-matrices. Numer. Math. 69, 321–331 (1995)CrossRefMathSciNetMATHGoogle Scholar
- 9.Neumann, M., Plemmons, R.J.: Convergence of parallel multisplitting methods for M-matrices. Linear Algebra Appl. 88–89, 559–574 (1987)Google Scholar
- 10.O’Leary, D.P., White, R.E.: Multisplittings of matrices and parallel solution of linear systems. SIAM J. Algebraic Discrete Meth. 6, 630–640 (1985)MathSciNetMATHGoogle Scholar
- 11.Saad, Y., Schultz, M.H.: GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7, 856–869 (1986)MathSciNetMATHGoogle Scholar
- 12.Sonneveld, P.: CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 10, 36–52 (1989)MathSciNetGoogle Scholar
- 13.Snir, M., Otto, S., Huss-Lederman, S., Walker, D., Dongarra, J.: MPI: The Complete Reference (MIT Press, London, 1996)Google Scholar
- 14.Szyld, D.B., Jones, M.T.: Two-stage and multisplitting methods for the parallel solution of linear systems. SIAM J. Matrix Anal. Appl. 13, 671–679 (1992)MathSciNetMATHGoogle Scholar
- 15.van der Vorst, H.A.: Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 13, 631–644 (1992)MATHGoogle Scholar
- 16.Varga, R.S.: Factorization and normalized iterative methods, Boundary problems in differential equations (R.E. Langer, ed.) (University of Wisconsin Press, Madison, 1960)Google Scholar
- 17.Varga, R.S.: Matrix iterative analysis (Prentice-Hall, Englewood Cliffs, 1962)Google Scholar
- 18.White, R.E.: Multisplitting of a symmetric positive definite matrix. SIAM J. Matrix Anal. Appl. 11, 69–82 (1990)MathSciNetMATHGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2003