Algorithmic Fault Tolerance Using the Lanczos Method
From MaRDI portal
(Redirected from Publication:3988992)
algorithm-based fault tolerancebasic matrix operationschecksum matrix productchecksumserror correctionerror locationLanczos algorithmlow-cost error protectionnumerical examplesnumerical overflows
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
(11)- The Lanczos algorithm and Hankel matrix factorization
- Fault tolerant Faddeeva algorithm
- A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers
- Krylov space methods on state-space control models
- Low redundancy polynomial checks for numerical computation
- An error-resilient redundant subspace correction method
- Resilience for massively parallel multigrid solvers
- The Fault Tolerance of NP-Hard Problems
- A new error analysis based method for tolerance computation for algorithm-based checks
- Algorithm-based error-detection schemes for iterative solution of partial differential equations
- 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)
