Abstract
We describe the parallelisation of the GMRES(c) algorithm and its implementation on distributed-memory architectures, using both networks of transputers and networks of workstations under the PVM message-passing system. The test systems of linear equations considered are those derived from five-point finite-difference discretisations of partial differential equations. A theoretical model of the computation and communication phases is presented which allows us to decide for which values of the parameterc our implementation executes efficiently. The results show that for reasonably large discretisation grids the implementations are effective on a large number of processors.
Similar content being viewed by others
References
A. Beguelin, J. Dongarra, A. Geist, R. Manchek and V.S. Sunderam, A. user’s guide to PVM—Parallel Virtual Machine, Research Report ORNL/TM-11826, Oak Ridge National Laboratory (1992).
R.H. Bisseling and J.G.G. Van der Vorst, Parallel triangular solving on a mesh network of transputers, SIAM J. Sci. Statist. Comp. 12(1991)787–799.
D. Calvetti, J. Petersen and L. Reichel, A parallel implementation of the GMRES method, in:Numerical Linear Algebra, ed. L. Reichel, A. Ruttan and R.S. Varga, (de Cruyter, Berlin, 1993) pp. 31–46.
R.D. da Cunha, A study on iterative methods for the solution of systems of linear equations on transputer networks, PhD Thesis, Computing Laboratory, University of Kent at Canterbury (July, 1992).
R.D. da Cunha and T.R. Hoplins, The parallel solution of triangular systems of linear equations, in:High-Performance Computing II—Proc. 2nd Symp. on High Performance Computing, ed. M. Durand and F. El Dabagni (North-Holland, Amsterdam, 1991) pp. 245–256. Also as Report No. 86, Computing Laboratory, University of Kent at Canterbury, UK.
R.D. da Cunha and T.R. Hopkins, The parallel solution of partial differential equations on transputer networks, in:Transputing for Numerical and Neural Network Applications (IOS Press, Amsterdam, 1992) pp. 96–109. Also as Report No. 17/92, Computing Laboratory, University of Kent at Canterbury, UK.
R.D. da Cunha and T.R. Hoplins, The parallel solution of systems of linear equations using iterative methods on transputer networks, in:Transputing for Numerical and Neural Network Applications (IOS Press, Amsterdam, 1992) pp. 1–13. Also as Report No. 16/92, Computing Laboratory, University of Kent at Canterbury, UK.
R.D. da Cunha and T.R. Hopkins, Increasing the performance of occam using loop-unrolling, Report No. 4/93, Computing Laboratory, University of Kent at Canterbury (April 1993); to appear in Transputer Commun.
R.D. da Cunha and T.R. Hopkins, Parallel preconditioned Conjugate-Gradient methods on transputer networks, Report No. 5/93, Computing Laboratory, University of Kent at Canterbury (April 1993); to appear in Transputer Commun. 1(1993).
R.D. da Cunha and T.R. Hopkins, PIM 1.0—the Parallel Iterative Methods package for systems of linear equations User’s Guide—Fortran77 version, Internal Report, Computing Laboratory, University of Kent at Canterbury (November 1993).
P.F. Dubois, A. Greenbaum and G.H. Rodrigue, Approximating the inverse of a matrix for use in iterative algorithms on vector processors, Computing 22(1979)257–268.
S.C. Eisenstat, H.C. Elman and M.H. Schultz, Variational iterative methods for nonsymmetric systems of linear equations, SIAM J. Numer. Anal. 20(1983)345–357.
W.H. Holter, I.M. Navon and T.C. Oppe, Parallelizable preconditioned Conjugated Gradient methods for the Cray Y-MP and the TMC CM-2, Technical report, Supercomputer Computations Research Institute, Florida State University (December 1991).
Z. Johan, T.J.R. Hughes, K.K. Mathur and S.L. Johnsson, A data parallel finite-element method for computational fluid-dynamics on the Connection Machine system, Comp. Meth. Appl. Mech. Eng. 99(1992)113–134.
W.D. Joubert and G.F. Carey, Parallelizable restarted iterative methods for nonsymmetric linear systems I—theory, Int. J Comp. Math. 44(1992)243–267.
W.D. Joubert and G.F. Carey, Parallelizable restarted iterative methods for nonsymmetric linear systems 2—Parallel implementation, Int. J. Comp. Math. 44(1992)269–290.
N.M. Nachtigal, S.C. Reddy and L.N. Trefethen, How fast are nonsymmetric iterations? Numerical Analysis Report, 90-2. Department of Mathematics, Massachusetts Institute of Technology (March 1990).
Y. Saad, Krylov subspace methods for solving large unsymmetric systems, Math. Comp. 37(1981) 105–126.
Y. Saad and M.H. Schultz, GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comp. 7(1986)856–869.
X. Xu, N. Qin and B.E. Richards, Alpha-GMRES—a new parallelizable iterative solver for large sparse nonsymmetrical linear-systems arising from CFD. Int. J. Numer. Meth. Fluids 15(1992)613–623.
D.M. Young and K.C. Jea, Generalized Conjugate-Gradient acceleration of nonsymmetrizable iterative methods, Lin. Alg. Appl. 34(1980)159–194.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
da Cunha, R.D., Hopkins, T. A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations. Adv Comput Math 2, 261–277 (1994). https://doi.org/10.1007/BF02521112
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02521112