Convergence of parallel multisplitting methods using ILU factorizations. (Q1880469)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convergence of parallel multisplitting methods using ILU factorizations. |
scientific article; zbMATH DE number 2103972
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of parallel multisplitting methods using ILU factorizations. |
scientific article; zbMATH DE number 2103972 |
Statements
Convergence of parallel multisplitting methods using ILU factorizations. (English)
0 references
28 September 2004
0 references
The paper is devoted to the iterative solution of linear systems whereby the coefficient matrix represents a large sparse \(H\)-matrix. At first, theoretical convergence results are presented for both relaxed multisplitting methods and nonstationary two-stage multisplitting methods using ILU factorization. The statements are afterwards confirmed by numerical experiments.
0 references
ILU factorization
0 references
multisplitting methods
0 references
\(H\)-matrix
0 references
parallel computation
0 references
iterative solution
0 references
linear systems
0 references
convergence
0 references
numerical experiments
0 references
0 references
0 references
0.9342153
0 references
0.9096024
0 references
0.90867865
0 references
0.9060949
0 references
0 references
0.90294003
0 references
0.9026832
0 references
0.90103775
0 references
