Solving linear systems on a vector computer (Q579836): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Michel Bernadou / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65Y05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A23 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4016030 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
LU-decomposition | |||
Property / zbMATH Keywords: LU-decomposition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Gauss-Jordan algorithm | |||
Property / zbMATH Keywords: Gauss-Jordan algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Gaussian elimination | |||
Property / zbMATH Keywords: Gaussian elimination / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
vector computer | |||
Property / zbMATH Keywords: vector computer / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pivoting strategy | |||
Property / zbMATH Keywords: pivoting strategy / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Comparative experiments | |||
Property / zbMATH Keywords: Comparative experiments / rank | |||
Normal rank |
Revision as of 18:31, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving linear systems on a vector computer |
scientific article |
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