Convergence of nonstationary multisplitting methods using ILU factorizations (Q556252)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2175277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of nonstationary multisplitting methods using ILU factorizations |
scientific article; zbMATH DE number 2175277 |
Statements
Convergence of nonstationary multisplitting methods using ILU factorizations (English)
0 references
13 June 2005
0 references
Incomplete LU factorization based nonstationary multisplitting methods are examined. First the convergence of the algorithm is studied. Then a parallel implementation of a relaxed two-stage procedure is examined and its application to a parallel preconditioner of Krylov subspace methods is studied. Performance results illustrate the effectiveness of the algorithms.
0 references
Nonstationary multisplitting method
0 references
ILU factorization
0 references
\(H\)-matrix
0 references
Krylov subspace method
0 references
parallel computation
0 references
preconditioning
0 references
numerical examples
0 references
Incomplete LU factorization
0 references
convergence
0 references
algorithm
0 references
Performance
0 references
0 references
0 references
0 references
0 references
0.9342153
0 references
0.90817153
0 references
0.9074788
0 references
0.8952063
0 references
0.8859255
0 references
0.88311833
0 references
0.88306344
0 references
