Title
Fault-Detection by Result-Checking for the Eigenproblem
Abstract
This paper proposes a new fault detection mechanism for the computation of eigenvalues and eigenvectors, the so called eigenproblem, for which no such scheme existed before, to the best of our knowledge. It consists of a number of assertions that can be executed on the results of the computation to determine their correctness. The proposed scheme follows the Result Checking principle, since it does not depend on the particular numerical algorithm used. It can handle both real and complex matrices, symmetric or not. Many practical issues are handled, like rounding errors and eigenvalue ordering, and a practical implementation was built on top of unmodified routines of the well-known LAPACK library. The proposed scheme is simultaneously very efficient, with less than 2% performance overhead for medium to large matrices, very effective, since it exhibited a fault coverage greater than 99.7% with a confidence level of 99%, when subjected to extensive fault-injection experiments, and very easy to adapt to other libraries of mathematical routines besides LAPACK.
Year
DOI
Venue
1999
10.1007/3-540-48254-7_28
EDCC
Keywords
Field
DocType
confidence level,new fault detection mechanism,complex matrix,practical issue,large matrix,practical implementation,extensive fault-injection experiment,proposed scheme,well-known lapack library,fault coverage,eigenvalues,eigenvalues and eigenvectors,fault detection
Fault coverage,Computer science,Fault detection and isolation,Correctness,Algorithm,Software fault tolerance,Rounding,Eigenvalues and eigenvectors,Fault injection,Distributed computing,Computation
Conference
Volume
ISSN
ISBN
1667
0302-9743
3-540-66483-1
Citations 
PageRank 
References 
0
0.34
16
Authors
2
Name
Order
Citations
PageRank
Paula Prata1266.58
João Gabriel Silva261863.55