An iterative solver benchmark

Jack Dongarra; Victor Eijkhout; H. Van der Vorst

doi:10.1155/2001/527931

An iterative solver benchmark

Jack Dongarra, Victor Eijkhout, H. Van der Vorst

Computer Science and Mathematics Div

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

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	https://doi.org/10.1155/2001/527931
State	Published - 2001

Access to Document

10.1155/2001/527931

Cite this

@article{8850c2c4d2054fcdbce95f03cb7a9f7a,

title = "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 bandwidth.",

author = "Jack Dongarra and Victor Eijkhout and {Van der Vorst}, H.",

year = "2001",

doi = "10.1155/2001/527931",

language = "English",

volume = "9",

pages = "223--231",

journal = "Scientific Programming",

issn = "1058-9244",

publisher = "Hindawi",

number = "4",

}

TY - JOUR

T1 - An iterative solver benchmark

AU - Dongarra, Jack

AU - Eijkhout, Victor

AU - Van der Vorst, H.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0035739814&partnerID=8YFLogxK

U2 - 10.1155/2001/527931

DO - 10.1155/2001/527931

M3 - Article

AN - SCOPUS:0035739814

SN - 1058-9244

VL - 9

SP - 223

EP - 231

JO - Scientific Programming

JF - Scientific Programming

IS - 4

ER -

An iterative solver benchmark

Abstract

Access to Document

Other files and links

Fingerprint

Cite this