Number of the records: 1  

How to make Simpler GMRES and GCR more Stable

  1. 1.
    SYSNO ASEP0310698
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleHow to make Simpler GMRES and GCR more Stable
    TitleJak stabilizovat metody Simpler GMRES and GCR?
    Author(s) Jiránek, P. (CZ)
    Rozložník, Miroslav (UIVT-O) SAI, RID, ORCID
    Gutknecht, M. H. (CH)
    Source TitleSIAM Journal on Matrix Analysis and Applications. - : SIAM Society for Industrial and Applied Mathematics - ISSN 0895-4798
    Roč. 30, č. 4 (2008), s. 1483-1499
    Number of pages17 s.
    Languageeng - English
    CountryUS - United States
    Keywordslarge-scale nonsymmetric linear systems ; Krylov subspace methods ; minimum residual methods ; numerical stability ; rounding errors
    Subject RIVBA - General Mathematics
    R&D Projects1M0554 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    IAA100300802 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    IAA1030405 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    UT WOS000263103700013
    EID SCOPUS70449371819
    DOI10.1137/070707373
    AnnotationIn this paper we analyze the numerical behavior of several minimum residual methods, which are mathematically equivalent to the GMRES method. Two main approaches are compared: the one that computes the approximate solution in terms of a Krylov space basis from an upper triangular linear system for the coordinates, and the one where the approximate solutions are updated with a simple recursion formula. We show that a different choice of the basis can significantly influence the numerical behavior of the resulting implementation. While Simpler GMRES and ORTHODIR are less stable due to the ill-conditioning of the basis used, the residual basis is well-conditioned as long as we have a reasonable residual norm decrease. These results lead to a new implementation, which is conditionally backward stable, and they explain the experimentally observed fact that the GCR method delivers very accurate approximate solutions when it converges fast enough without stagnation.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2010
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.