A linear algebraic model of algorithm-based fault tolerance

DOI10.1109/12.9736zbMath0661.94021OpenAlexW2150679822MaRDI QIDQ3812171

Franklin T. Luk, Cynthia J. Anfinson

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.9736

zbMATH Keywords

Vandermonde matrixlinear algebracoding theorychecksums

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (6)

A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers ⋮ Numerical Analysis of Fixed Point Algorithms in the Presence of Hardware Faults ⋮ Numerical recovery strategies for parallel resilient Krylov linear solvers ⋮ Interpolation-Restart Strategies for Resilient Eigensolvers ⋮ Resilience for Massively Parallel Multigrid Solvers ⋮ Hard Faults and Soft-Errors: Possible Numerical Remedies in Linear Algebra Solvers

This page was built for publication: A linear algebraic model of algorithm-based fault tolerance