An iterative solver benchmark

Authors:
Jack Dongarra;Victor Eijkhout;Henk van der Vorst
Affiliations:
-;-;-
Venue:
Scientific Programming
Year:
2001

Citing 6
Cited 0

GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
Predicting the behavior of finite precision Lanczos and conjugate gradient computations

SIAM Journal on Matrix Analysis and Applications
BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
A parallel graph coloring heuristic

SIAM Journal on Scientific Computing
Iterative methods for solving linear systems

Iterative methods for solving linear systems
A Portable Programming Interface for Performance Evaluation on Modern Processors

International Journal of High Performance Computing Applications

Quantified Score

Hi-index	0.00

Visualization

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.