A fast implementation for GMRES method
type: Item
instance of: scholarly article
title: A fast implementation for GMRES method
zbMATH Open document ID: 1032.65026
DOI: 10.1016/S0377-0427(03)00534-X
author: E. H. Ayachour
published in: Journal of Computational and Applied Mathematics
publication date: 2003-11-20T00:00:00Z
review text: For the popular generalized minimal residual (GMRES) iteration method a new and simple implementation is presented, which has the property of not using Givens rotations. By this modification the Arnoldi process is not modified and this new method has advantages in both computation cost and storage reqirements. The corresponding restarted version of the GMRES method is also considered.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 2006398
zbMATH Keywords: generalized minimal residual method
zbMATH Keywords: Arnoldi process
zbMATH Keywords: Krylov subspace method
zbMATH Keywords: GMRES method
reviewed by: F. Szidarovszky
MaRDI profile type: Publication
cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem
cites work: Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
cites work: Expanded systems and the ILU preconditioner for solving non-Hermitian linear systems
cites work: Q4868585
cites work: A Theoretical Comparison of the Arnoldi and GMRES Algorithms
cites work: GMRES On (Nearly) Singular Systems
cites work: Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
cites work: Q4091368
cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems
cites work: Least Squares Computations by Givens Transformations Without Square Roots
cites work: Complex conjugate gradient methods
cites work: A Restarted GMRES Method Augmented with Eigenvectors
cites work: Solution of Sparse Indefinite Systems of Linear Equations
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
cites work: Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
cites work: A Flexible Inner-Outer Preconditioned GMRES Algorithm
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
cites work: Solution of sparse rectangular systems using LSQR and Craig
cites work: Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: GMRESR: a family of nested GMRES methods
cites work: New insights in GMRES-like methods with variable preconditioners
cites work: Implementation of the GMRES Method Using Householder Transformations
cites work: A simpler GMRES
cites work: Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
full work available at URL: s0377-0427(03)00534-x
OpenAlex ID: W2148804877
description: scientific article; zbMATH DE number 2006398