Stochastic subspace correction methods and fault tolerance
From MaRDI portal
Numerical solutions to stochastic differential and integral equations (65C30) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05) Randomized algorithms (68W20)
Abstract: We present convergence results in expectation for stochastic subspace correction schemes and their accelerated versions to solve symmetric positive-definite variational problems, and discuss their potential for achieving fault tolerance in an unreliable compute network. We employ the standard overlapping domain decomposition algorithm for PDE discretizations to discuss the latter aspect.
Recommendations
- Randomized and fault-tolerant method of subspace corrections
- Stochastic subspace correction in Hilbert space
- An error-resilient redundant subspace correction method
- ROBUST SUBSPACE CORRECTION METHODS FOR NEARLY SINGULAR SYSTEMS
- A Subspace Error Estimate for Linear Systems
- Parallel subspace correction methods for nearly singular systems
- Introduction to stochastic error correction methods
- Subspace algorithms for the stochastic identification problem
- Subspace-based fault detection robust to changes in the noise covariances
- scientific article; zbMATH DE number 17437
Cites work
- A Comparison of Domain Decomposition Techniques for Elliptic Partial Differential Equations and their Parallel Implementation
- A New Paradigm for Parallel Adaptive Meshing Algorithms
- A Parallel Implementation of an Iterative Substructuring Algorithm for Problems in Three Dimensions
- An accelerated randomized Kaczmarz algorithm
- An error-resilient redundant subspace correction method
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Fault resilient domain decomposition preconditioner for PDEs
- Greedy and randomized versions of the multiplicative Schwarz method
- scientific article; zbMATH DE number 440658 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- scientific article; zbMATH DE number 777426 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Is the multigrid method fault tolerant? The multilevel case
- Is the multigrid method fault tolerant? the two-grid case
- Iterative Methods by Space Decomposition and Subspace Correction
- Nonparametric stochastic approximation with large step-sizes
- Numerical analysis of fixed point algorithms in the presence of hardware faults
- Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent
- Parallel adaptive subspace correction schemes with applications to elasticity
- Resilience for massively parallel multigrid solvers
- Stochastic subspace correction in Hilbert space
Cited in
(7)- Stochastic subspace correction in Hilbert space
- Randomized and fault-tolerant method of subspace corrections
- An error-resilient redundant subspace correction method
- Greedy and randomized versions of the multiplicative Schwarz method
- ROBUST SUBSPACE CORRECTION METHODS FOR NEARLY SINGULAR SYSTEMS
- A Dimension-Oblivious Domain Decomposition Method Based on Space-Filling Curves
- Modifying the asynchronous Jacobi method for data corruption resilience
This page was built for publication: Stochastic subspace correction methods and fault tolerance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5235100)
