Estimates of convergence rate of parallel multisplitting iterative methods (Q2732207)
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: Estimates of convergence rate of parallel multisplitting iterative methods |
scientific article; zbMATH DE number 1623390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimates of convergence rate of parallel multisplitting iterative methods |
scientific article; zbMATH DE number 1623390 |
Statements
18 July 2002
0 references
parallel multisplittings
0 references
convergence
0 references
strongly diagonally dominant matrices
0 references
parallel computation
0 references
Estimates of convergence rate of parallel multisplitting iterative methods (English)
0 references
The author estimates from above the convergence rate of parallel multisplitting methods for large linear systems (assuming that diagonally dominant matrices are involved) by referring to the well-known upper bound for the maximum norm of the inverse of such matrices. Errors and misprints make the paper unpleasant to read.
0 references
0.8315742015838623
0 references
0.8275129795074463
0 references
0.822352409362793
0 references
0.8216477632522583
0 references
