Number of the records: 1  

Preconditioner Updates for Solving Sequences of Linear Systems in Matrix-Free Environment

  1. 1.
    SYSNO ASEP0338823
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitlePreconditioner Updates for Solving Sequences of Linear Systems in Matrix-Free Environment
    Author(s) Duintjer Tebbens, Jurjen (UIVT-O) RID, SAI, ORCID
    Tůma, Miroslav (UIVT-O) SAI, RID, ORCID
    Source TitleNumerical Linear Algebra with Applications. - : Wiley - ISSN 1070-5325
    Roč. 17, č. 6 (2010), s. 997-1019
    Number of pages23 s.
    Languageeng - English
    CountryGB - United Kingdom
    Keywordspreconditioned iterative methods ; matrix-free environment ; factorization updates ; inexact Newton-Krylov methods ; incomplete factorizations
    Subject RIVBA - General Mathematics
    R&D ProjectsIAA100300802 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    KJB100300703 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    Next sourceI
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    UT WOS000285795400007
    EID SCOPUS78649654096
    DOI10.1002/nla.695
    AnnotationWe present two new ways of preconditioning sequences of nonsymmetric linear systems in the special case where the implementation is matrix free. Both approaches are based on the general updates of incomplete LU decompositions recently introduced in (SISC 2007; 29(5):1918–1941) and they may be directly embedded into nonlinear algebraic solvers. The first approach uses a new model of partial matrix estimation to compute the updates. The second approach exploits separability of function components to apply the updated preconditioner via function evaluations. Experiments with matrix-free implementations of test problems show that both techniques offer useful, robust and black-box solution strategies.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2011
Number of the records: 1  

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