Comparisons of Gaussian elimination algorithms on a Cray Y-MP
type: Item
instance of: scholarly article
title: Comparisons of Gaussian elimination algorithms on a Cray Y-MP
zbMATH Open document ID: 0756.65039
DOI: 10.1016/0024-3795(92)90018-6
author: Marcin Paprzycki
published in: Linear Algebra and its Applications
publication date: 1992-09-27T00:00:00Z
review text: Investigation of the Gauss elimination on a single processor Cray Y-MP, using three different algorithms DOT, GAXPY and SAXPY. Blocked versions with level 2 and 3 BLAS of Cray are investigated for different block sizes. Cray's matrix multiplied by Strassen's algorithm improves performance for sufficiently large matrices.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65Y10
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 64480
zbMATH Keywords: Gauss elimination
zbMATH Keywords: Cray Y-MP
zbMATH Keywords: DOT
zbMATH Keywords: GAXPY
zbMATH Keywords: SAXPY
zbMATH Keywords: Strassen's algorithm
zbMATH Keywords: performance
describes a project that uses: BLAS
MaRDI profile type: Publication
full work available at URL: 0024-3795(92)90018-6
OpenAlex ID: W2059419459
cites work: Q4382412
cites work: A set of level 3 basic linear algebra subprograms
cites work: An extended set of FORTRAN basic linear algebra subprograms
cites work: Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
cites work: Parallel Algorithms for Dense Linear Algebra Computations
cites work: Exploiting fast matrix multiplication within the level 3 BLAS
cites work: Basic Linear Algebra Subprograms for Fortran Usage
cites work: Gaussian elimination is not optimal
description: scientific article; zbMATH DE number 64480