Solving linear systems on a vector computer

DOI10.1016/0377-0427(87)90008-2MaRDI QIDQ579836zbMATH OpenOpenAlexFDO

Authors Walter Hoffmann

Publication date 1987

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(87)90008-2

zbMATH Keywords

Comparative experimentsGauss-Jordan algorithmGaussian eliminationLU-decompositionpivoting strategyvector computer

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

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.

Recommendations

• Solving linear equation systems on vector computers with maximum efficiency
• scientific article; zbMATH DE number 48972
• Solving large systems of linear ordinary differential equations on a vector computer
• scientific article; zbMATH DE number 1323248
• scientific article; zbMATH DE number 4147433
• scientific article; zbMATH DE number 3990740
• On the vector \(\varepsilon\)-algorithm for solving linear systems of equations
• scientific article; zbMATH DE number 4147453
• Linear algebra software on a vector computer

Cites work

• scientific article; zbMATH DE number 3829220 (Why is no real title available?)
• scientific article; zbMATH DE number 3716659 (Why is no real title available?)
• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• Monitoring the numerical stability of Gaussian elimination

Cited in

(17)

• Solving linear equation systems on vector computers with maximum efficiency
• Rehabilitation of the Gauss-Jordan algorithm
• Performance of hyperplane ordering on vector computers
• Solving large dense systems of linear equations on systems with virtual memory and with cache
• Parallel algorithms for solving large linear systems
• Stability of the Gauss-Huard algorithm with partial pivoting
• Which pivot to solve linear systems?
• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• scientific article; zbMATH DE number 4147453 (Why is no real title available?)
• scientific article; zbMATH DE number 3956316 (Why is no real title available?)
• scientific article; zbMATH DE number 48972 (Why is no real title available?)
• The arithmetic mean method for solving essentially positive systems on a vector computer^∗
• scientific article; zbMATH DE number 1505545 (Why is no real title available?)
• Solving systems of large dense linear equations
• On the vector \(\varepsilon\)-algorithm for solving linear systems of equations
• Implementing stochastic control software on supercomputing machines
• Clustered Gauss-Huard algorithm for the solution of Ax = b

Describes a project that uses

Uses Software

• LINPACK
• NUMAL
• ALGOL 60
• NUMVEC

This page was built for publication: Solving linear systems on a vector computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579836)