Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms (Q5317893)
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 2206744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms |
scientific article; zbMATH DE number 2206744 |
Statements
Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms (English)
0 references
21 September 2005
0 references
parallel algorithms
0 references
graph partitioning
0 references
problem decomposition
0 references
rate of convergence
0 references
0.7570104002952576
0 references
0.7539442777633667
0 references
0.7342432141304016
0 references
0.7319039702415466
0 references
