A fast implementtion for GMRES method

E.H. Ayachour

doi:10.1016/S0377-0427(03)00534-X

A fast implementtion for GMRES method

E.H. Ayachour

Research output: Contribution to journal › Article › Academic › peer-review

19 Citations (Scopus)

3616 Downloads (Pure)

Abstract

For the popular iterative method GMRES, we present a new and simple implementation which has the property of not using Givens rotations. This implementation does not modify the Arnoldi process and has an advantage in both the computational effort and the storage requirements. The corresponding restarted GMRES method is also considered.

Original language	English
Pages (from-to)	269-283
Journal	Journal of computational and applied mathematics
Volume	159
Issue number	2
DOIs	https://doi.org/10.1016/S0377-0427(03)00534-X
Publication status	Published - 2003
Externally published	Yes

Access to Document

10.1016/S0377-0427(03)00534-XLicence: Other

fastFinal published version, 194 KBLicence: Other

Cite this

@article{eff83d50691f49f58ec3799dae997970,

title = "A fast implementtion for GMRES method",

abstract = "For the popular iterative method GMRES, we present a new and simple implementation which has the property of not using Givens rotations. This implementation does not modify the Arnoldi process and has an advantage in both the computational effort and the storage requirements. The corresponding restarted GMRES method is also considered.",

author = "E.H. Ayachour",

year = "2003",

doi = "10.1016/S0377-0427(03)00534-X",

language = "English",

volume = "159",

pages = "269--283",

journal = "Journal of computational and applied mathematics",

issn = "0377-0427",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - A fast implementtion for GMRES method

AU - Ayachour, E.H.

PY - 2003

Y1 - 2003

N2 - For the popular iterative method GMRES, we present a new and simple implementation which has the property of not using Givens rotations. This implementation does not modify the Arnoldi process and has an advantage in both the computational effort and the storage requirements. The corresponding restarted GMRES method is also considered.

AB - For the popular iterative method GMRES, we present a new and simple implementation which has the property of not using Givens rotations. This implementation does not modify the Arnoldi process and has an advantage in both the computational effort and the storage requirements. The corresponding restarted GMRES method is also considered.

U2 - 10.1016/S0377-0427(03)00534-X

DO - 10.1016/S0377-0427(03)00534-X

M3 - Article

SN - 0377-0427

VL - 159

SP - 269

EP - 283

JO - Journal of computational and applied mathematics

JF - Journal of computational and applied mathematics

IS - 2

ER -

A fast implementtion for GMRES method

Abstract

Access to Document

Fingerprint

Cite this