An iterative solver benchmark
Abstract
We present a benchmark of iterative solvers for sparse matrices. The benchmark contains several common methods and data structures, chosen to be representative of the performance of a large class of methods in current use. We give results on some high performance processors that show that performance is largely determined by memory bandwidthSimilar works
Full text
Last time updated on 01/02/2017
This paper was published in The University of Manchester - Institutional Repository.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.