The computational complexity of the quadrant interlocking (QI) iterative methods on shared memory parallel computers (Q4392335)
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 1160119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of the quadrant interlocking (QI) iterative methods on shared memory parallel computers |
scientific article; zbMATH DE number 1160119 |
Statements
The computational complexity of the quadrant interlocking (QI) iterative methods on shared memory parallel computers (English)
0 references
26 November 1998
0 references
shared memory parallel computers
0 references
splitting
0 references
quadrant interlocking iterative methods
0 references
performances
0 references
computational complexity
0 references
0.7599858045578003
0 references
0.7449944019317627
0 references
0.7389249205589294
0 references
0.7383884787559509
0 references
