Residual Replacement in Mixed-Precision Iterative Refinement for Sparse Linear Systems
We investigate the solution of sparse linear systems via iterative methods based on Krylov subspaces. Concretely, we combine the use of extended precision in the outer iterative refinement with a reduced precision in the inner Conjugate Gradient solver. This method is additionally enhanced with different residual replacement strategies that aim to avoid the pitfalls due to the divergence between the actual residual and the recurrence formula for this parameter computed during the iteration. Our experiments using a significant part of the SuiteSparse Matrix Collection illustrate the potential benefits of this technique from the point of view, for example, of energy and performance.
KeywordsSparse linear systems Krylov solvers Iterative refinement Mixed precision Residual replacement Performance and energy modelling
This research was partially sponsored by the EU H2020 project 732631 OPRECOMP and the CICYT project TIN2017-82972-R of the MINECO and FEDER.
- 6.Shalf, J.: The evolution of programming models in response to energy efficiency constraints. Slides Presented at Oklahoma Supercomputing Symposium 2013, October 2013. http://www.oscer.ou.edu/Symposium2013/oksupercompsymp2013_talk_shalf_20131002.pdf