Algorithmic Fault Tolerance Using the Lanczos Method

DOI10.1137/0613023zbMATH Open0760.65048OpenAlexW2157243803WikidataQ56939138 ScholiaQ56939138MaRDI QIDQ3988992FDOQ3988992

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cited In (9)

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

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)