Number of the records: 1  

An Adaptive Multilevel Factorized Sparse Approximate Inverse Preconditioning

  1. 1.
    SYSNO ASEP0473670
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleAn Adaptive Multilevel Factorized Sparse Approximate Inverse Preconditioning
    Author(s) Kopal, Jiří (UIVT-O) RID, SAI
    Rozložník, Miroslav (UIVT-O) SAI, RID, ORCID
    Tůma, Miroslav (UIVT-O) SAI, RID, ORCID
    Source TitleAdvances in Engineering Software. - : Elsevier - ISSN 0965-9978
    Roč. 113, November (2017), s. 19-24
    Number of pages6 s.
    Languageeng - English
    CountryNL - Netherlands
    Keywordsapproximate inverse ; Gram–Schmidt orthogonalization ; incomplete factorization ; multilevel methods ; preconditioned conjugate gradient method
    Subject RIVBA - General Mathematics
    OECD categoryApplied mathematics
    R&D ProjectsGA13-06684S GA ČR - Czech Science Foundation (CSF)
    Institutional supportUIVT-O - RVO:67985807
    UT WOS000413675600004
    EID SCOPUS85002488023
    DOI10.1016/j.advengsoft.2016.10.005
    AnnotationThis paper deals with adaptively preconditioned iterative methods for solving large and sparse systems of linear equations. In particular, the paper discusses preconditioning where adaptive dropping reflects the quality of preserving the relation UZ=I, where U and Z are the triangular factors of A and its inverse, respectively. The proposed strategy significantly extends and refines the previously developed approach, by using a specific multilevel framework. Numerical experiments with two levels demonstrate that the new preconditioning strategy is very promising. Namely, we show a surprising fact that in our approach the Schur complement is better to form in a more sophisticated way than by a standard sparse matrix-matrix multiplication.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2018
Number of the records: 1  

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