2000•Unpublished venueRequires access

MGMRES(m):A MODIFIED GMRES(m) ALGORITHM FOR SOLVING NONSYMMETRIC LINEAR SYSTEMS

Ming Xu

Open publisher page 0 citations

Abstract

GMRES(m),the restarted GMRES method,is popular for solving large sparse nonsymmetric linear systems.However,it is possible to show that the restarted GMRES method may not converge,i.e.be stationary.To remedy this difficulty,a modified restarted minimum residual algorithm,MGMRES(m),is discussed in this paper.

About this research paper

What this paper is about

GMRES(m),the restarted GMRES method,is popular for solving large sparse nonsymmetric linear systems.However,it is possible to show that the restarted GMRES method may not converge,i.e.be stationary.To remedy this difficulty,a modified restarted minimum residual algorithm,MGMRES(m),is discussed in this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

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

GMRES(m),the restarted GMRES method,is popular for solving large sparse nonsymmetric linear systems.However,it is possible to show that the restarted GMRES method may not converge,i.e.be stationary.To remedy this difficulty,a modified restarted minimum residual algorithm,MGMRES(m),is discussed in this paper.

Key concepts: Generalized minimal residual method, Linear system, Mathematics, Residual, Algorithm, Computer science, Mathematical analysis

Related papers

Back to paper searchBrowse research topicsOriginal source
MGMRES(m):A MODIFIED GMRES(m) ALGORITHM FOR SOLVING NONSYMMETRIC LINEAR SYSTEMS — Research Paper | ScholarLens