Parallel solution of linear systems with striped sparse matrices
type: Item
instance of: scholarly article
title: Parallel solution of linear systems with striped sparse matrices
zbMATH Open document ID: 0643.65016
DOI: 10.1016/0167-8191(88)90082-8
published in: Parallel Computing
publication date: 1988-01-01T00:00:00Z
review text: The multiplication of a vector by a matrix and the solution of triangular linear systems are the two basic ingredients in most iterative solvers. In order to avoid computations that involve zero operands, the non-zero elements in a sparse matrix are organized in the form of non-overlapping stripes, and only the elements within the stripe structure of the matrix are manipulated. This paper contains (i) the definition of the stripe structure of a general sparse matrix, (ii) a description of a VLSI network which uses the stripe structure in the parallel multiplication of a vector by a matrix, (iii) some results concerning the property of non-overlapping stripes, (iv) an extension of (ii) to a network for the solution of triangular linear systems.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4048913
zbMATH Keywords: triangular linear systems
zbMATH Keywords: stripe structure
zbMATH Keywords: VLSI network
zbMATH Keywords: parallel multiplication
author: Rami Melhem
reviewed by: Michel Bernadou
describes a project that uses: ELLPACK
MaRDI profile type: Publication
full work available at URL: 0167-8191(88)90082-8
OpenAlex ID: W2058516542
description: scientific article; zbMATH DE number 4048913