No label defined (Q4946550)
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 1421671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1421671 |
Statements
10 October 2000
0 references
convergence
0 references
parallel computation
0 references
monotone matrices
0 references
\(H\)-matrices
0 references
asynchronous iterations
0 references
multisplitting
0 references
additive Schwarz method
0 references
numerical results
0 references
finite difference method
0 references
0.94215786
0 references
0.9279013
0 references
0.9263712
0 references
0.9198364
0 references
0.9168978
0 references
0.91260266
0 references
Systems of linear equations with monotone matrices or \(H\)-matrices are considered. Asynchronous iterations with multisplitting are discussed. Asynchronous processes are chosen on parallel computers for the same reason as one prefers there the additive Schwarz method to the multiplicative version. Monotonicity arguments assert that asynchronicity does not spoil the iteration. Numerical results are presented for the finite difference method with the standard five-point stencil. Reviewer's remark: The example is not very lucky since the solution by preconditioned conjugate gradients may bring more acceleration than a parallel computer.
0 references