Parallel, synchronous and asynchronous two-stage multisplitting methods (Q1920170)
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: Publication:1920170 |
scientific article; zbMATH DE number 918308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel, synchronous and asynchronous two-stage multisplitting methods |
scientific article; zbMATH DE number 918308 |
Statements
Parallel, synchronous and asynchronous two-stage multisplitting methods (English)
0 references
11 February 1997
0 references
Different types of synchronous and asynchronous two-stage multisplitting algorithms for the solution of linear systems are analyzed. The different algorithms which appeared in the literature are reviewed, and new ones are presented. Convergence properties of these algorithms are studied when the matrix in question is either monotone or an \(H\)-matrix. Relaxed versions of these algorithms are also studied. Computational experiments on a shared memory multiprocessor vector computer are presented.
0 references
asynchronous methods
0 references
two-stage iterative methods
0 references
parallel algorithms
0 references
convergence
0 references
\(H\)-matrix
0 references
multisplitting algorithms
0 references
multiprocessor vector computer
0 references
0.9268985390663148
0 references
0.8899242281913757
0 references
0.8788917064666748
0 references
