HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F14%3A00422618" target="_blank" >RIV/67985807:_____/14:00422618 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1145/2617555" target="_blank" >http://dx.doi.org/10.1145/2617555</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2617555" target="_blank" >10.1145/2617555</a>

Jazyk výsledku

angličtina

Název v původním jazyce

HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code

Popis výsledku v původním jazyce

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 defau

Název v anglickém jazyce

HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code

Popis výsledku anglicky

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 defau

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-06684S" target="_blank" >GA13-06684S: Iterační metody ve výpočetní matematice: Analýza, předpodmínění a aplikace</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

ACM Transactions on Mathematical Software

ISSN

0098-3500

e-ISSN

—

Svazek periodika

40

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

19

Strana od-do

—

Kód UT WoS článku

000339622700001

EID výsledku v databázi Scopus

—