✦ LIBER ✦

A vectorized version of a sparse matrix-vector multiply

✍ Scribed by Linda J. Hayes; Phillippe Devloo

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 1006 KB
Volume: 23
Category: Article
ISSN: 0029-5981
DOI: 10.1002/nme.1620230605

No coin nor oath required. For personal study only.

✦ Synopsis

A fast vectorized algorithm is presented for a sparse matrix-vector multiply. It can be used when the matrix, A, can be represented as a multiplitting, A = ZA,, In particular, it can be applied to a matrix-vector multiply arising in finite element techniques where the matrices A, are associated with the individual element contributions to the global matrix A. The algorithm presented here uses a data structure which is based on the individual matrices A, and can be applied both to symmetric and to non-symmetric matrices. This algorithm would be attractive for vector architecture similar to either the CYBER 205 or the CRAY and has been implemented for both regular and irregular finite element grids on the CYBER 205. Execution times and storage requirements are compared to standard sparse and band matrix-vector multiply algorithms.

📜 SIMILAR VOLUMES

Parallel sparse matrix vector multiply s

Parallel sparse matrix vector multiply software for matrices with data locality

✍ TUMINARO, RAY S.; SHADID, JOHN N.; HUTCHINSON, SCOTT A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

In this paper we describe general software utilities for performing unstructured sparse matrixvector multiplications on distributed-memory message-passing computers. The matrix-vector multiply comprises an important kernel in the solution of large sparse linear systems by iterative methods. Our focu

A new approach for sparse matrix vector

A new approach for sparse matrix vector product on NVIDIA GPUs

✍ F. Vázquez; J. J. Fernández; E. M. Garzón 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB

Linear combination of Lanczos vectors: A

Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations

✍ T. Koslowski; W. Von Niessen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i

On the characteristic vectors of a matri

On the characteristic vectors of a matrix

✍ G.N. de Oliveira 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A New Matrix Vector Product Systolic Arr

A New Matrix Vector Product Systolic Array

✍ M. Gusev; D.J. Evans 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 337 KB

On storage, retrieval, and Gauss-Seidel

On storage, retrieval, and Gauss-Seidel iteration involving nonzero elements of a sparse stiffness matrix compacted as a vector

✍ Y.C. Pao; E.L. Ritman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 671 KB

This paper presents a storing and retrieving algorithm developed for the Gauss-Seidel iterative solution of a large system of simultaneous linear algebraic equations when the nonzero elements of its sparse coefficient matrix is to be compacted into a one-dimensional array for the sake of saving comp