A variant of the biconjugate gradient method suitable for massively parallel computing
Starting from a specific implementation of the Lanczos biorthogonalization algorithm, an iterative process for the solution of systems of linear equations with general non-Hermitian coefficient matrix is derived. Due to the orthogonalization of the underlying Lanczos process the resulting iterative scheme involves inner products leading to global communication and synchronization on parallel processors. For massively parallel computers, these effects cause considerable delays often preventing the scalability of the implementation. In the process proposed, all inner product-like operations of an iteration step are independent such that the implementation consists of only a single global synchronization point per iteration. In exact arithmetic, the process is shown to be mathematically equivalent to the biconjugate gradient method. The efficiency of this new variant is demonstrated by numerical experiments on a PARAGON system using up to 121 processors.
Unable to display preview. Download preview PDF.
- 1.H. M. Bücker and M. Sauren. A Parallel Version of the Quasi-Minimal Residual Method Based on Coupled Two-Term Recurrences. In J. Waśniewski, J. Dongarra, K. Madsen, and D. Olesen, editors, Applied Parallel Computing: Industrial Computation and Optimization, Proceedings of the Third International Workshop, PARA '96, Lyngby, Denmark, August 18–21, 1996, Volume 1184 of Lecture Notes in Computer Science, pages 157–165, Berlin, 1996. Springer.Google Scholar
- 2.H. M. Bücker and M. Sauren. A Parallel Version of the Unsymmetric Lanczos Algorithm and its Application to QMR. Internal Report KFA-ZAM-IB-9605, Research Centre Jülich, Jülich, Germany, March 1996.Google Scholar
- 3.H. M. Bücker and M. Sauren. A Variant of the Biconjugate Gradient Method Suitable for Massively Parallel Computing. Internal Report KFA-ZAM-IB-9702, Research Centre Jülich, Jülich, Germany, 1997.Google Scholar
- 4.J. K. Cullum and A. Greenbaum. Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems. SIAM Journal on Matrix Analysis and Applications, 17(2):223–247, 1996.Google Scholar
- 5.R. Fletcher. Conjugate Gradient Methods for Indefinite Systems. In G. A. Watson, editor, Numerical Analysis Dundee 1975, volume 506 of Lecture Notes in Mathematics, pages 73–89, Berlin, 1976. Springer.Google Scholar
- 6.R. W. Freund. The Look-Ahead Lanczos Process for Large Nonsymmetric Matrices and Related Algorithms. In M. S. Moonen, G. H. Golub, and B. L. R. De Moor, editors, Linear Algebra for Large Scale and Real-Time Applications, volume 232 of NATO ASI Series E: Applied Sciences, pages 137–163. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1993. Proceedings of the NATO Advanced Study Institute on Linear Algebra for Large Scale and Real-Time Applications, Leuven, Belgium, August 1992.Google Scholar
- 7.R. W. Freund, G. H. Golub, and N. M. Nachtigal. Iterative Solution of Linear Systems. In Acta Numerica 1992, pages 1–44. Cambridge University Press, Cambridge, 1992.Google Scholar
- 8.R. W. Freund, M. H. Gutknecht, and N. M. Nachtigal. An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices. SIAM Journal on Scientific Computing, 14(1):137–158, 1993.Google Scholar
- 9.R. W. Freund and N. M. Nachtigal. An Implementation of the QMR Method Based on Coupled Two-Term Recurrences. SIAM Journal on Scientific Computing, 15(2):313–337, 1994.Google Scholar
- 10.C. Lanczos. An Iteration Method for the Solution of the Eigenvalue Problem of Linear Differential and Integral Operators. Journal of Research of the National Bureau of Standards, 45(4):255–282, 1950.Google Scholar
- 11.C. Lanczos. Solutions of Systems of Linear Equations by Minimized Iterations. Journal of Research of the National Bureau of Standards, 49(1):33–53, 1952.Google Scholar
- 12.Y. Saad. Iterative Methods for Sparse Linear Systems. PWS Publishing Company, Boston, 1996.Google Scholar