A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid
2014 IEEE 28th International Parallel and Distributed Processing Symposium
Geometric multigrid solvers within adaptive mesh refinement (AMR) applications often reach a point where further coarsening of the grid becomes impractical as individual subdomain sizes approach unity. At this point the most common solution is to use a bottom solver, such as BiCGStab, to reduce the residual by a fixed factor at the coarsest level. Each iteration of BiCGStab requires multiple global reductions (MPI collectives). As the number of BiCGStab iterations required for convergence growsdoi:10.1109/ipdps.2014.119 dblp:conf/ipps/WilliamsLASCKD14 fatcat:3pyism2wsjfkxfbxfhsxydcqee