On Improving Linear Solver Performance: A Block Variant of GMRES

From MaRDI portal
Publication:5470382

DOI10.1137/040608088zbMath1099.65029OpenAlexW2066349733MaRDI QIDQ5470382

John M. Dennis, E. R. Jessup, A. H. Baker

Publication date: 30 May 2006

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

Full work available at URL: https://doi.org/10.1137/040608088




Related Items (18)

Increasing the Performance of the Jacobi--Davidson Method by BlockingNumerical algorithms for water waves with background flow over obstacles and topographyTotal and selective reuse of Krylov subspaces for the resolution of sequences of nonlinear structural problemsRandomized Block Adaptive Linear System SolversAdaptively restarted block Krylov subspace methods with low-synchronization skeletonsA shifted block FOM algorithm with deflated restarting for matrix exponential computationsGMRES algorithms over 35 yearsFull Waveform Inversion Guided by Travel Time TomographyLow-Rank Updates of Matrix FunctionsA block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sidesEmbedded Ensemble Propagation for Improving Performance, Portability, and Scalability of Uncertainty Quantification on Emerging Computational ArchitecturesNumerical investigation of ensemble methods with block iterative solvers for evolution problemsEfficient solution of block Toeplitz systems with multiple right-hand sides arising from a periodic boundary element formulationBlock s-step Krylov iterative methodsAn efficient iterative method for solving parameter-dependent and random convection-diffusion problemsA distributed and parallel unite and conquer method to solve sequences of non-Hermitian linear systemsBlock Gram-Schmidt algorithms and their stability propertiesA block MINRES algorithm based on the band Lanczos method


Uses Software



This page was built for publication: On Improving Linear Solver Performance: A Block Variant of GMRES