Analysis shows improved performance and efficiency with randomized-SVD preconditioning in GPU–CPU contexts, highlighting convergence metrics.
The performance of three implementations of the restarted GMRES algorithm with randomized-SVD-based preconditioning has been analyzed. They have been tested with a wide population of matrices of varying properties and compared to the standard ILU(0) preconditioning. The implementations comprise two variants of the preconditioner, one of them implemented for CPU-only and hybrid GPU–CPU executions to better assess the benefits and pitfalls in both contexts. The trade-off between iteration-to-solution and time-to-solution metrics is discussed and it is shown that a competitive convergence rate is attained. In addition, the CPU off-loading to the GPU leads to a significant improvement of the second metric for the largest matrices analyzed. Such an in efficiency is promising considering the various codes and tools that employ the restarted GMRES algorithm.
No takes yet. Share an insight, caveat, or question.
Moríñigo et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: