Non-stationary parallel multisplitting algorithms for almost linear systems (Q2760342)
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 1684501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-stationary parallel multisplitting algorithms for almost linear systems |
scientific article; zbMATH DE number 1684501 |
Statements
19 December 2001
0 references
almost linear systems
0 references
multisplitting methods
0 references
parallel computation
0 references
nonlinear algorithm
0 references
accelerated overrelaxation methods
0 references
asynchronous algorithm
0 references
convergence
0 references
M-matrices
0 references
H-matrices
0 references
numerical experiments
0 references
performance
0 references
Non-stationary parallel multisplitting algorithms for almost linear systems (English)
0 references
Non-stationary parallel multisplitting iterative methods for the solution of almost linear systems are introduced. The methods are extensions of non-stationary methods for the solution of such systems. A non-stationary parallel nonlinear algorithm based on the accelerated overrelaxation-type methods is introduced. Its extension to asynchronous algorithm is also considered. Convergence properties of synchronous and asynchronous versions of these methods are studied for M-matrices and H-matrices. In the last section some numerical experiments on a distributed memory multiprocessor illustrating the performance of these algorithms are discussed.
0 references
0.9228480458259584
0 references
0.8829616904258728
0 references
0.8829613924026489
0 references
0.8777948021888733
0 references
0.8672283887863159
0 references
