Approximate Inverse Preconditioners with Adaptive Dropping

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F15%3A00438752" target="_blank" >RIV/67985807:_____/15:00438752 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/46747885:24220/15:#0003395

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.advengsoft.2015.01.006" target="_blank" >http://dx.doi.org/10.1016/j.advengsoft.2015.01.006</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.advengsoft.2015.01.006" target="_blank" >10.1016/j.advengsoft.2015.01.006</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Approximate Inverse Preconditioners with Adaptive Dropping

Popis výsledku v původním jazyce

It is well-known that analysis of incomplete Cholesky and LU decompositions with a general dropping is very difficult and of limited applicability, see, for example, the results on modified decompositions (Dupont et al., 1968; Gustafsson, 1978; Bern et al., 2006) and later results based on similar concepts. This is true not only for the dropping based on magnitude of entries but it also applies to algorithms that use a prescribed sparsity pattern. This paper deals with dropping strategies for a class ofAINV-type incomplete decompositions (Benzi et al., 1996) that are based on the generalized Gram?Schmidt process. Its behavior in finite precision arithmetic has been discussed in Rozložník et al. (2012). This analysis enables better understanding of theincomplete process, and the main goal of the paper is to propose a new adaptive dropping strategy and to illustrate its efficiency for problems in structural mechanics. In addition, we add a brief comparison with another approximate inve

Název v anglickém jazyce

Approximate Inverse Preconditioners with Adaptive Dropping

Popis výsledku anglicky

It is well-known that analysis of incomplete Cholesky and LU decompositions with a general dropping is very difficult and of limited applicability, see, for example, the results on modified decompositions (Dupont et al., 1968; Gustafsson, 1978; Bern et al., 2006) and later results based on similar concepts. This is true not only for the dropping based on magnitude of entries but it also applies to algorithms that use a prescribed sparsity pattern. This paper deals with dropping strategies for a class ofAINV-type incomplete decompositions (Benzi et al., 1996) that are based on the generalized Gram?Schmidt process. Its behavior in finite precision arithmetic has been discussed in Rozložník et al. (2012). This analysis enables better understanding of theincomplete process, and the main goal of the paper is to propose a new adaptive dropping strategy and to illustrate its efficiency for problems in structural mechanics. In addition, we add a brief comparison with another approximate inve

Druh

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

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

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

Advances in Engineering Software

ISSN

0965-9978

e-ISSN

—

Svazek periodika

84

Číslo periodika v rámci svazku

June

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

8

Strana od-do

13-20

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—