A vectorized version of a sparse matrix‐vector multiply
Linda J. Hayes, Phillippe Devloo · International Journal for Numerical Methods in Engineering · 1986
Abstract 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 = ∑Ae. In particular, it can be applied to a matrix‐vector multiply arising in finite element techniques where the matrices Ae 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 Ae 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.