Parallelism and robustness in GMRES with a Newton basis and deflated restarting

zbMath1288.65042MaRDI QIDQ2450058

Desire Nuentsa Wakam, Jocelyne Erhel

Publication date: 14 May 2014

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/ETNA/volumes/2011-2020/vol40/abstract_vol40_pp381-406.html

zbMATH Keywords

convergence accelerationparallel computationdeflationnumerical experimentArnoldi processNewton basishybrid linear solversadaptive deflated GMRESaugmented Krylov subspacesgeneralized minimal residual (GMRES) iterative method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (4)

The GBS code for the self-consistent simulation of plasma turbulence and kinetic neutral dynamics in the tokamak boundary ⋮ GMRES algorithms over 35 years ⋮ A dynamically deflated GMRES adjoint solver for aerodynamic shape optimization ⋮ Varying the \(s\) in your \(s\)-step GMRES

Uses Software

• PETSc
• MUMPS
• SparseMatrix

This page was built for publication: Parallelism and robustness in GMRES with a Newton basis and deflated restarting