Performance of hyperplane ordering on vector computers (Q1184116)
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: Performance of hyperplane ordering on vector computers |
scientific article; zbMATH DE number 34133
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performance of hyperplane ordering on vector computers |
scientific article; zbMATH DE number 34133 |
Statements
Performance of hyperplane ordering on vector computers (English)
0 references
28 June 1992
0 references
The paper deals with the hyperplane ordering for parallel vector computers. Large systems of linear algebraic equations arising from discretization of partial differential equations are candidates to be solved on vector computers by conjugate gradient methods where the authors' approach can be implemented effectively. An analysis is made how to solve 2D and 3D problems with the minimal effect to memory bank conflict.
0 references
incomplete Cholesky conjugate gradient method
0 references
memory bank conflict
0 references
hyperplane ordering
0 references
parallel vector computers
0 references
Large systems of linear algebraic equations
0 references
conjugate gradient methods
0 references
