Interpolation-Restart Strategies for Resilient Eigensolvers
DOI10.1137/15M1042115zbMath1351.65025OpenAlexW2504412359MaRDI QIDQ2827052
Pablo Salas, Emmanuel Agullo, Luc Giraud, Mawussi Zounon
Publication date: 12 October 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1042115
numerical methodsparallel computationfault toleranceeigenvalue problemsnumerical experimentJacobi-DavidsonArnoldisubspace iterationhard faultlarge-sparse problemnumerical resiliency
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Matrix Algorithms
- Interpolation-Restart Strategies for Resilient Eigensolvers
- Numerical recovery strategies for parallel resilient Krylov linear solvers
- The university of Florida sparse matrix collection
- Algorithm-Based Fault Tolerance for Matrix Operations
- Recovery Patterns for Iterative Methods in a Parallel Unstable Environment
- A linear algebraic model of algorithm-based fault tolerance
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Spectral recycling strategies for the solution of nonlinear eigenproblems in thermoacoustics
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: Interpolation-Restart Strategies for Resilient Eigensolvers