Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 44 (1-4), 243-267
- https://doi.org/10.1080/00207169208804107
Abstract
Large sparse nonsymmetric problems of the form A u = b are frequently solved using restarted conjugate gradient-type algorithms such as the popular GCR and GMRES algorithms. In this study we define a new class of algorithms which generate the same iterates as the standard GMRES algorithm but require as little as half of the computational expense. This performance improvement is obtained by using short economical three-term recurrences to replace the long recurrence used by GMRES. The new algorithms are shown to have good numerical properties in typical cases, and the new algorithms may be easily modified to be as numerically safe as standard GMRES. Numerical experiments with these algorithms are given in Part II, in which we demonstrate the improved performance of the new schemes on different computer architectures.Keywords
This publication has 20 references indexed in Scilit:
- A Taxonomy for Conjugate Gradient MethodsSIAM Journal on Numerical Analysis, 1990
- Basis function selection and preconditioning high degree finite element and spectral methodsBIT Numerical Mathematics, 1989
- A parallel element‐by‐element solution schemeInternational Journal for Numerical Methods in Engineering, 1988
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithmsLinear Algebra and its Applications, 1987
- Orthogonal Error MethodsSIAM Journal on Numerical Analysis, 1987
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient MethodSIAM Journal on Numerical Analysis, 1984
- Variational Iterative Methods for Nonsymmetric Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1983
- The condition of polynomials in power formMathematics of Computation, 1979
- The Tchebychev iteration for nonsymmetric linear systemsNumerische Mathematik, 1977
- The condition of orthogonal polynomialsMathematics of Computation, 1972