Abstract
The paper considers the problem of constructing a basic iterative scheme for solving systems of linear algebraic equations with unsymmetric and indefinite coefficient matrices. A new GMRES-type algorithm with explicit restarts is suggested. When restarting, this algorithm takes into account the spectral/singular data transferred using orthogonal matrix relations in the so-called QR form, which arise when performing inner iterations of Arnoldi type. The main idea of the algorithm developed is to organize inner iterations and the filtering of directions before restarting in such a way that, from one restart to another, matrix relations effectively accumulate information concerning the current approximate solution and, simultaneously, spectral/singular data, which allow the algorithm to converge with a rate comparable with that of the GMRES algorithm without restarts. Convergence theory is provided for the case of nonsingular, unsymmetric, and indefinite matrices. A bound for the rate of decrease of the residual in the course of inner Arnoldi-type iterations is obtained. This bound depends on the spectral/singular characterization of the subspace spanned by the directions retained upon filtering and is used in developing efficient filtering procedures. Numerical results are provided. Bibliography: 9 titles.
Similar content being viewed by others
REFERENCES
J. Baglama, D. Calvetti, G. H. Golub, and L. Reichel, “Adaptively preconditioned GMRES algorithms," SIAM J. Sci. Comput., 20, 243–269 (1998).
A. Chapman, Y. Saad, and L. Wigton, “High order ILU preconditioners for CFD problems," Technical Report of Minnesota Supercomputer Institute (1996).
R. W. Freund and N. M. Nachtigal, “QMR: a quasi-minimum residual method for non-Hermitian linear systems," Numer. Math., 60, 315–339 (1991).
R. B. Morgan, “A restarted GMRES method augmented with eigenvectors," SIAM J. Matrix Anal. Appl., 16(4), 1154–1171 (1995).
R. B. Morgan, “Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations," Technical Report (1997).
Y. Saad and M. H. Schultz, “GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems," SIAM J. Sci. Stat. Comput., 7, 856–869 (1986).
Y. Saad and J. Zhang, “BILUTM: A domain-based multi-level block ILUT preconditioner for general sparse matrices," Technical Report of the Minnesota Supercomputer Institute (1998).
D. C. Sorensen, “Implicit applications of polynomial filters in a k-step Arnoldi method," SIAM J. Math. Anal. Appl., 13, 357–385 (1992).
H.A. van der Vorst, “Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems," SIAM J. Sci. Stat. Comput., 13, 631–644 (1992).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kharchenko, S.A., Yeremin, A.Y. New GMRES(k)-Type Algorithms with Explicit Restarts and the Analysis of Their Convergence Properties Based on Matrix Relations in QR Form. Journal of Mathematical Sciences 114, 1863–1889 (2003). https://doi.org/10.1023/A:1022470922964
Issue Date:
DOI: https://doi.org/10.1023/A:1022470922964