Erasure Coding for Fault-Oblivious Linear System Solvers
From MaRDI portal
Publication:2964445
DOI10.1137/15M1041511zbMath1382.68039arXiv1412.7364OpenAlexW2963280095MaRDI QIDQ2964445
Yao Zhu, David F. Gleich, Ananth Grama
Publication date: 27 February 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.7364
Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Uses Software
Cites Work
- A mathematical introduction to compressive sensing
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Application of the implicitly updated Arnoldi method with a complex shift-and-invert strategy in MHD
- Flexible Conjugate Gradients
- The Idea behind Krylov Methods
- The Fast Cauchy Transform and Faster Robust Linear Regression
- The university of Florida sparse matrix collection
- Algorithm-Based Fault Tolerance for Matrix Operations
- Sparse matrix test problems
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Flexible Inner-Outer Krylov Subspace Methods
- Inexact Krylov Subspace Methods for Linear Systems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Scalable Failure Masking for Stencil Computations using Ghost Region Expansion and Cell to Rank Remapping
- The Lanczos and Conjugate Gradient Algorithms
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Computational Science – ICCS 2005
This page was built for publication: Erasure Coding for Fault-Oblivious Linear System Solvers
