Towards local-failure local-recovery in PDE frameworks: the case of linear solvers

DOI10.1007/978-3-030-67077-1_2zbMATH Open1482.65003OpenAlexW3119421048MaRDI QIDQ2233545FDOQ2233545

Authors: Mirco Altenbernd, Nils-Arne Dreier, Christian Engwer, Dominik Göddeke 

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-67077-1_2

Recommendations

• Finite element recovery techniques for local quantities of linear problems using fundamental solutions
• Failures of local approximation in finite-element methods
• Fault resilient domain decomposition preconditioner for PDEs
• Numerical recovery strategies for parallel resilient Krylov linear solvers.
• Local Piecewise Hyperbolic Reconstruction of Numerical Fluxes for Nonlinear Scalar Conservation Laws
• A massively-parallel, fault-tolerant solver for high-dimensional PDEs
• Local structure-preserving algorithms for partial differential equations
• Local convergence of an inexact-restoration method and numerical experiments
• Solver composition across the PDE/linear algebra barrier

zbMATH Keywords

parallel computationfault tolerancelossy compressionPDE frameworks

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Cites Work

• A generic grid interface for parallel and adaptive scientific computing. I: Abstract framework
• A generic grid interface for parallel and adaptive scientific computing. II: Implementation and tests in DUNE
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Methods of conjugate gradients for solving linear systems
• Algorithm-Based Fault Tolerance for Matrix Operations
• Recovery Patterns for Iterative Methods in a Parallel Unstable Environment
• Exaflop/s: the why and the how
• Fault-tolerance techniques for high-performance computing
• Resilience for massively parallel multigrid solvers
• A minimally intrusive low-memory approach to resilience for existing transient solvers
• Numerical recovery strategies for parallel resilient Krylov linear solvers.
• Interpolation-restart strategies for resilient eigensolvers

Cited In (2)

• Scalable failure masking for stencil computations using ghost region expansion and cell to rank remapping
• Fault-tolerant parallel multigrid method on unstructured adaptive mesh

Uses Software

• DUNE
• ISTL

This page was built for publication: Towards local-failure local-recovery in PDE frameworks: the case of linear solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233545)