Fast parallel algorithms for solving triangular systems of linear equations on the hypercube (Q1325983): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Q589360 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Walter Gander / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jpdc.1994.1029 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981309038 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast parallel algorithms for solving triangular systems of linear equations on the hypercube |
scientific article |
Statements
Fast parallel algorithms for solving triangular systems of linear equations on the hypercube (English)
0 references
2 January 1995
0 references
The main objective of this paper is to develop better data partitioning and mapping schemes for the solution of triangular linear systems. The authors present four algorithms with increasing complexity in data partitioning and mapping to processor elements. They show that by doing so they can achieve a significantly better efficiency on the NCUBE.
0 references
fast parallel algorithms
0 references
parallel computing
0 references
direct methods
0 references
hypercube
0 references
triangular linear systems
0 references
complexity
0 references
data partitioning
0 references
efficiency
0 references
