The connection machine: PDE solution on 65536 processors (Q1118366)
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: The connection machine: PDE solution on 65536 processors |
scientific article; zbMATH DE number 4094724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The connection machine: PDE solution on 65536 processors |
scientific article; zbMATH DE number 4094724 |
Statements
The connection machine: PDE solution on 65536 processors (English)
0 references
1988
0 references
The paper gives a description of the connection machine (CM) computer, data about its hardware and programming language (COMMON LISP) and the difference from other parallel architectures. Further, implementations of the SOR relaxation algorithm, parallel multigrid and parallel preconditioned conjugated gradient algorithms are presented for solving partial differential equations of elliptical type. Results of numerical tests of the methods on CM are discussed.
0 references
connection machine computer
0 references
parallel computation
0 references
computational efficiency measurements
0 references
performance analysis
0 references
COMMON LISP
0 references
SOR relaxation
0 references
parallel multigrid
0 references
parallel preconditioned conjugated gradient algorithms
0 references
0.8455038
0 references
0.84238565
0 references
0.83705854
0 references
0.8302046
0 references
0.82846904
0 references
0.8281768
0 references
0.82476205
0 references
