Počet záznamů: 1
HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code
- 1.
SYSNO ASEP 0422618 Druh ASEP J - Článek v odborném periodiku Zařazení RIV J - Článek v odborném periodiku Poddruh J Článek ve WOS Název HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code Tvůrce(i) Scott, J. (GB)
Tůma, Miroslav (UIVT-O) SAI, RID, ORCIDZdroj.dok. ACM Transactions on Mathematical Software. - : Association for Computing Machinery - ISSN 0098-3500
Roč. 40, č. 4 (2014), Article number 24Poč.str. 19 s. Jazyk dok. eng - angličtina Země vyd. US - Spojené státy americké Klíč. slova preconditioning ; sparse linear systems ; incomplete decompositions ; preconditioned iterative methods Vědní obor RIV IN - Informatika CEP GA13-06684S GA ČR - Grantová agentura ČR Institucionální podpora UIVT-O - RVO:67985807 UT WOS 000339622700001 EID SCOPUS 84904109881 DOI 10.1145/2617555 Anotace This paper focuses on the design and development of a new robust and efficient general-purpose incomplete Cholesky factorization package HSL MI28, which is available within the HSL mathematical software library. It implements a limited memory approach that exploits ideas from the positive semidefinite Tismenetsky-Kaporin modification scheme and, through the incorporation of intermediate memory, is a generalization of the widely-used ICFS algorithm of Lin and Moré. Both the density of the incomplete factor and the amount of memory used in its computation are under the user’s control. The performance of HSL MI28 is demonstrated using extensive numerical experiments involving a large set of test problems arising from a wide range of real-world applications. The numerical experiments are used to isolate the effects of scaling, ordering and dropping strategies so as to assess their usefulness in the development of robust algebraic incomplete factorization preconditioners and to select default settings for HSL MI28. They also illustrate the significant advantage of employing a modest amount of intermediate memory. Furthermore, the results demonstrate that, with limited memory, high quality yet sparse general-purpose preconditioners are obtained. Comparisons are made with ICFS, with a level-based incomplete factorization code and, finally, with a state-of-the-art direct solver. Pracoviště Ústav informatiky Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2015
Počet záznamů: 1