New adaptive GMRES(m) method with choosing suitable restart cycle m

Kentaro Moriya, Takashi Nodera

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

GMRES method is one of the major iterative algorithms for solving large and sparse linear systems of equations. However, it is difficult to implement GMRES algorithm because its storatege and computation cost are so exceeded. Therefore, GMRES(m) algorithm is often used. In this paper, we propose a new variant of GMRES(m) algorithm. Our algorithm chooses the restart cycle m based both on the convergence test of residual norm and on the distribution of zeros of residual polynomial of GMRES(m) algorithm. From the numerical examples on Compaq Beowulf, we also show the effectiveness of our proposed algorithm.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsRoman Wyrzykowski, Jack Dongarra, Marcin Paprzycki, Jerzy Wasniewski
PublisherSpringer Verlag
Pages1105-1113
Number of pages9
ISBN (Print)3540219463, 9783540219460
DOIs
Publication statusPublished - 2004 Jan 1
Event5th International Conference on Parallel Processing and Applied Mathematics, PPAM 2003 - Czestochowa, Poland
Duration: 2003 Sep 72003 Sep 10

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3019
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Conference on Parallel Processing and Applied Mathematics, PPAM 2003
CountryPoland
CityCzestochowa
Period03/9/703/9/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'New adaptive GMRES(m) method with choosing suitable restart cycle m'. Together they form a unique fingerprint.

Cite this