Abstract
For the solutions of linear systems of equations with unsymmetric coefficient matrices, we have proposed an improved version of the quasi-minimal residual (IQMR) method [14] by using the Lanczos process as a major component combining elements of numerical stability and parallel algorithm design. The algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time. In this paper, we mainly present the qualitative analysis of the parallel performance with Store-and-Forward routing and Cut-Through routing schemes and topologies such as ring, mesh,hypercube and balanced binary tree. Theoretically it is shown that the hypercube topology can give us the best parallel performance with regards to parallel efficiency, speed-up, and runtime, respectively. We also study theoretical aspects of the overlapping effect in the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. M. Bücker and M. Sauren. A parallel version of the quasi-minimal residual method based on coupled two-term recurrences. In Proceedings of Workshop on Applied Parallel Computing in Industrial Problems and Optimization (Para96). Technical University of Denmark, Lyngby, Denmark, Springer-Verlag, August 1996.
H. M. Bücker and M. Sauren. A parallel version of the unsymmetric Lanczos algorithm and its application to QMR. Technical Report KFA-ZAM-IB-9606, Central Institute for Applied Mathematics, Research Centre Julich, Germany, March 1996.
E. de Sturler. A parallel variant of the GMRES(m). In Proceedings of the 13th IMACS World Congress on Computational and Applied Mathematics. IMACS, Criterion Press, 1991.
E. de Sturler. Performance model for Krylov subspace methods on mesh-based parallel computers. Technical Report CSCS-TR-94–05, Swiss Scientific Computing Center, La Galleria, CH-6928 Manno, Switzerland, May 1994.
E. de Sturler and H. A. van der Vorst. Reducing the effect of the global communication in GMRES(m) and CG on parallel distributed memory computers. Technical Report 832, Mathematical Institute, University of Utrecht, Utrecht, The Netheland, 1994.
J. J. Dongarra, I. S. Duff, D. C. Sorensen, and H. A. van der Vorst. Solving Linear Systems on Vector and Shared Memory Computers. SIAM, Philadelphia, PA, 1991
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 and Statistical Computing, 14:137–158, 1993.
R. W. Freund and N. M. Nachtigal. QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numerische Mathematik, 60:315–339, 1991.
R. W. Freund and N. M. Nachtigal. An implementation of the QMR method based on coupled two-term recurrences. SIAM Journal on Scientific and Statistical Computing, 15(2):313–337,1994.
S. K. Kim and A. T. Chronopoulos. An efficient nonsymmetric Lanczos method on parallel vector computers. Journal of Computational and Applied Mathematics, pages 357–374, 1992.
V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin/Cummings, Redwood City, 1994.
C. Lanczos. An iteration method for the solution of the eigenvalues problem of linear differential and integral operators. Journal of Research of National Bureau of Standards, 45:255–282, 1950.
T. Yang. Solving sparse least squares problems on massively parallel distributed memory computers. In Proceedings of International Conference on Advances in Parallel and Distributed Computing (APDC-97), March 1997. Shanghai, P.R.China.
T. Yang and H. X. Lin. The improved quasi-minimal residual method on massively distributed memory computers. In Proceedings of The International Conference on High Performance Computing and Networking (HPCN-97), April 1997.
T. Yang and H. X. Lin. Performance analysis of the IQMR method on bulk synchronous parallel architectures. In Proceedings of The International Workshop on Computational Science and Engineering (IWCSE’97), May 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Yang, T., Lin, HX. (1999). Theoretical Performance Analysis of the IQMR Method on Distributed Memory Computers. In: Yang, T. (eds) Parallel Numerical Computation with Applications. The Springer International Series in Engineering and Computer Science, vol 515. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5205-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5205-5_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7371-1
Online ISBN: 978-1-4615-5205-5
eBook Packages: Springer Book Archive