Inexact sparse matrix vector multiplication in Krylov subspace methods: An application-oriented reduction method

Abstract

Iterative solvers based on Krylov subspace method proved to be robust in the presence of well monitored inexact matrix vector products. In this paper, we show that the iterative solver performs well while gradually reducing the number of nonzero elements of the matrix throughout the iterations. We benefit from this robustness in reducing the computational effort and the communication volume when implementing sparse matrix vector multiplication (SMVM) on a Network-on-Chip (NoC). © 2014 Springer-Verlag.