Is the Multigrid Method Fault Tolerant? The Multilevel Case

DOI10.1137/16M1097274zbMath1377.65041arXiv1607.08502OpenAlexW2962953497MaRDI QIDQ4594169

Christian Glusa, Mark Ainsworth

Publication date: 17 November 2017

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.08502

zbMATH Keywords

algorithmconvergencerandom matricesmultigridfault toleranceresilienceoptimal choice of parametersfault-free method

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (3)

Finite element approximation for the fractional eigenvalue problem ⋮ The Resiliency of Multilevel Methods on Next-Generation Computing Platforms: Probabilistic Model and Its Analysis ⋮ Stochastic subspace correction methods and fault tolerance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault-tolerance techniques for high-performance computing
• Stability of the 8-tetrahedra shortest-interior-edge partitioning method
• Products of random matrices in statistical physics
• Iterative solution of large sparse systems of equations. Transl. from the German
• Theory and practice of finite elements.
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Convergent Adaptive Algorithm for Poisson’s Equation
• Is the Multigrid Method Fault Tolerant? The Two-Grid Case
• Finite Elements

This page was built for publication: Is the Multigrid Method Fault Tolerant? The Multilevel Case