Advantages for solving linear systems in an asynchronous environment (Q1064732)
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: Advantages for solving linear systems in an asynchronous environment |
scientific article; zbMATH DE number 3921814
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Advantages for solving linear systems in an asynchronous environment |
scientific article; zbMATH DE number 3921814 |
Statements
Advantages for solving linear systems in an asynchronous environment (English)
0 references
1985
0 references
Three algorithms for numerical solution of linear systems with parallel computers are considered; the Gauss algorithm, the Gauss-Jordan algorithm and the so-called WZ-algorithm, which is just a permuted version of the Gauss algorithm. The algorithms are altered so that they use only O(n) processors.
0 references
asynchronous multiprocessor computer
0 references
MIMD
0 references
parallel computers
0 references
Gauss algorithm
0 references
Gauss-Jordan algorithm
0 references
WZ-algorithm
0 references
0.7812551856040955
0 references