Efficient multigrid algorithms for locally constrained parallel systems (Q580927)
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 4018301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient multigrid algorithms for locally constrained parallel systems |
scientific article; zbMATH DE number 4018301 |
Statements
Efficient multigrid algorithms for locally constrained parallel systems (English)
0 references
1986
0 references
A theoretical study of the organization of computer structures, consisting of independent processors coupled via common local memories, is used to investigate the speed up and efficiency of a parallelization of multigrid methods.
0 references
parallelization
0 references
tree and nearest-neighbour systems
0 references
organization of computer structures
0 references
speed up
0 references
efficiency
0 references
multigrid methods
0 references
0.8482196927070618
0 references
0.8391752243041992
0 references
0.8261242508888245
0 references
