2005•Unpublished venueRequires access

Notes on GMRES Algorithm Organization

Richard J. Hanson, David R. Kincaid

Abstract

The Generalized Minimum Residual (GMRES) iterative method and variations of it are frequently used for solving systems of linear equations of the form Ax = b, where A is a large sparse nonsingular nonsymmetric matrix. We discuss ways to reorganize the algorithm to improve its efficiency. Key words: Generalized Minimum Residual (GMRES) iterative method, Preconditioned GMRES(m) Algorithm, solving large sparse systems of linear equations, GMRES algorithm reorganization and Matlab code, 1

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Generalized minimal residual method, Invertible matrix, Linear system, Algorithm, Residual, Iterative method, Matrix (chemical analysis), Mathematics