Solving linear systems on a vector computer (Q579836)
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 4016030
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving linear systems on a vector computer |
scientific article; zbMATH DE number 4016030 |
Statements
Solving linear systems on a vector computer (English)
0 references
1987
0 references
This paper considers some variants of the well-known Gaussian elimination algorithm for solving linear systems of equations on a vector computer. The author emphasizes three essential choices: normalization of the diagonals, ordering of the calculation and pivoting strategy. Then it is proposed an algorithm which is considered as optimal for the Cyber 205. Comparative experiments in FORTRAN 77 with FORTRAN 200 extensions for the Cyber 205 are reported. Several algorithms are carefully described in the appendix. Similar analysis can be helpful in selecting the optimal algorithm for other supercomputers, depending on machine architecture and programming language used.
0 references
LU-decomposition
0 references
Gauss-Jordan algorithm
0 references
Gaussian elimination
0 references
vector computer
0 references
pivoting strategy
0 references
Comparative experiments
0 references
0.9469573
0 references
0.93754375
0 references
0.8995721
0 references
0.8971929
0 references
