1997
DOI: 10.1007/978-1-5041-2940-4_8
|View full text |Cite
|
Sign up to set email alerts
|

Testing linear algebra software

Abstract: How can we test the correctness of a computer implementation of an algorithm such as Gaussian elimination, or the QR algorithm for the eigenproblem? This is an important question for program libraries such as LAPACK, that are designed to run on a wide range of systems. We discuss testing based on verifying known backward or forward error properties of the algorithms, with particular reference to the test software in LAPACK. Issues considered include the choice of bound to verify, computation of the backward er… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1999
1999
2002
2002

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…Intuitively, w measures the minimum variation that the matrix of the system and the right hand side vector should sustain to obtain the approximatedx solution. There is evidence in the literature that the component-wise backward error is more sensitive to instability than other metrics [12].…”
Section: Evaluating Numerical Stabilitymentioning
confidence: 98%
“…Intuitively, w measures the minimum variation that the matrix of the system and the right hand side vector should sustain to obtain the approximatedx solution. There is evidence in the literature that the component-wise backward error is more sensitive to instability than other metrics [12].…”
Section: Evaluating Numerical Stabilitymentioning
confidence: 98%