A study of implementation schemes for vectorized sparse EBE matrix-vector multiplication

Abstract

A study of implementation schemes for vectorized sparse element-by-element (EBE) matrix-vector multiplication used in the iterative equation solving of finite element problems is presented. The Hughes, Ferencz and Hallquist scheme and a variation are compared with Torigaki's approach. Computer timing and required memory for each scheme on the IBM 3090/VF vector computer regarding the analysis of large scale three-dimensional solid mechanics problems are presented and results compared.