Solving linear systems on a vector computer
W Hoffmann - Journal of computational and applied mathematics, 1987 - Elsevier
W Hoffmann
Journal of computational and applied mathematics, 1987•ElsevierThis paper gives a classification for the triangular factorization of square matrices. These
factorizations are used for solving linear systems. Efficient algorithms for vector computers
are presented on basis of criteria for optimal algorithms. Moreover, the Gauss—Jordan
elimination algorithm in a version which admits efficient implementation on a vector
computer is described. Comparative experiments in FORTRAN 77 with FORTRAN 200
extensions for the Cyber 205 are reported.
factorizations are used for solving linear systems. Efficient algorithms for vector computers
are presented on basis of criteria for optimal algorithms. Moreover, the Gauss—Jordan
elimination algorithm in a version which admits efficient implementation on a vector
computer is described. Comparative experiments in FORTRAN 77 with FORTRAN 200
extensions for the Cyber 205 are reported.
Abstract
This paper gives a classification for the triangular factorization of square matrices. These factorizations are used for solving linear systems. Efficient algorithms for vector computers are presented on basis of criteria for optimal algorithms. Moreover, the Gauss—Jordan elimination algorithm in a version which admits efficient implementation on a vector computer is described. Comparative experiments in FORTRAN 77 with FORTRAN 200 extensions for the Cyber 205 are reported.
Elsevier