Numerical analysis of fixed point algorithms in the presence of hardware faults
From MaRDI portal
Recommendations
- Is the multigrid method fault tolerant? the two-grid case
- The resiliency of multilevel methods on next-generation computing platforms: probabilistic model and its analysis
- Numerical recovery strategies for parallel resilient Krylov linear solvers.
- Is the multigrid method fault tolerant? The multilevel case
- Multigrid at Scale?
Cites work
Cited in
(12)- New tools for localization of limit cycles in recursive block floating point systems
- Randomized and fault-tolerant method of subspace corrections
- An error-resilient redundant subspace correction method
- Resilience for massively parallel multigrid solvers
- Multigrid at Scale?
- Uzawa-type and augmented Lagrangian methods for double saddle point systems
- Some results in fixed point error analysis of the Bruun-FTT algorithm
- The resiliency of multilevel methods on next-generation computing platforms: probabilistic model and its analysis
- Stochastic subspace correction methods and fault tolerance
- Is the multigrid method fault tolerant? the two-grid case
- Hard Faults and Soft-Errors: Possible Numerical Remedies in Linear Algebra Solvers
- Tight Error Analysis in Fixed-point Arithmetic
This page was built for publication: Numerical analysis of fixed point algorithms in the presence of hardware faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947048)