Počet záznamů: 1
A Robust Incomplete Factorization Preconditioner for Positive Definite Matrices
- 1.
SYSNO ASEP 0404726 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 A Robust Incomplete Factorization Preconditioner for Positive Definite Matrices Tvůrce(i) Benzi, M. (US)
Tůma, Miroslav (UIVT-O) SAI, RID, ORCIDZdroj.dok. Numerical Linear Algebra with Applications. - : Wiley - ISSN 1070-5325
Roč. 10, - (2003), s. 385-400Poč.str. 16 s. Jazyk dok. eng - angličtina Země vyd. GB - Velká Británie Klíč. slova sparse linear systems ; positive definite matrices ; preconditioned conjugate gradients ; incomplete factorization ; A-orthogonalization ; SAINV Vědní obor RIV BA - Obecná matematika CEP IAA2030801 GA AV ČR - Akademie věd IAA1030103 GA AV ČR - Akademie věd CEZ 1030915 UT WOS 000184543600002 EID SCOPUS 0142087843 DOI 10.1002/nla.320 Anotace We describe a novel technique for computing a sparse incomplete factorization of a general symmetric positive definite matrix A. The factorization is not based on the Cholesky algorithm 9or Gaussian elimination0, but on A-orthogonalization. Thus, the incomplete factorization always exists and can be computed without any diagonal modification. When used in conjunction with the conjugate gradient algorithin, the new preconditioner results in a reliable solver for highly ill-conditioned linear systems. Comparisons with other incomplete factorization techniques using challenging linear systems from structural analysis and solid mechanics problems are presented. Pracoviště Ústav informatiky Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2004
Počet záznamů: 1