An evaluation of speedup in conjugate gradient routines with a mathematical vector library

The experience in vectorizing finite element and finite difference electromagnetic analysis codes is reported. Techniques to efficiently use vector machines in problems involving sparse, unstructured matrices are discussed. In this context a sparse matrix storage scheme particularly suited to vector architectures is introduced. The results of experience in the use of a library of conjugate-gradient-type solvers suited to vector architectures implemented according to this matrix structure are reported and discussed.<>