Iterative linear system solvers with approximate matrix-vector products


There are classes of linear problems for which a matrix-vector product is a time consuming operation because an expensive approximation method is required to compute it to a given accuracy. One important example is simulations in lattice QCD with Neuberger fermions where a matrix multiply requires the product of the matrix sign function of a large sparse… (More)


2 Figures and Tables

Slides referencing similar topics