Algorithmic Fault Tolerance Using the Lanczos Method

DOI10.1137/0613023MaRDI QIDQ3988992zbMATH OpenOpenAlexWikidataFDO

Authors Richard P. Brent, Gene H. Golub, Franklin T. Luk, Daniel Boley

Publication date 28 June 1992

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL http://digitalcollections.anu.edu.au/handle/1885/40807

zbMATH Keywords

numerical exampleserror correctionLanczos algorithmchecksumserror locationalgorithm-based fault tolerancebasic matrix operationschecksum matrix productlow-cost error protectionnumerical overflows

Mathematics Subject Classification ID

Recommendations

• Algorithm-based fault location and recovery for matrix computations on multiprocessor systems
• Algorithm-based error-detection schemes for iterative solution of partial differential equations
• Mantissa-preserving operations and robust algorithm based fault tolerance for matrix computations
• Fault tolerant Faddeeva algorithm
• Algorithmic fault tolerance for matrix operations on triangular arrays

Cited in

(9)

• Algorithm-based error-detection schemes for iterative solution of partial differential equations
• The Fault Tolerance of NP-Hard Problems
• A new error analysis based method for tolerance computation for algorithm-based checks
• Resilience for massively parallel multigrid solvers
• An error-resilient redundant subspace correction method
• Krylov space methods on state-space control models
• The Lanczos algorithm and Hankel matrix factorization
• A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers
• On the problem of increasing efficiency of Reed-Solomon-code-based algorithms for creating checkpoints for calculation applications

This page was built for publication: Algorithmic Fault Tolerance Using the Lanczos Method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988992)