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 bandwidth.
| Original language | English |
|---|---|
| Pages (from-to) | 223-231 |
| Number of pages | 9 |
| Journal | Scientific Programming |
| Volume | 9 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2001 |