Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Barrachina, S., Castillo, M., Igual, F.D., Mayo, R., Quintana-Ortí, E.S., Quintana-Ortí, G.: Exploiting the capabilities of modern GPUs for dense matrix computations. Conc. Comput. Pract. Experience 21(18), 2457–2477 (2009). https://doi.org/10.1002/cpe.1472
Buttari, A., Dongarra, J.J., Langou, J., Langou, J., Luszcek, P., Kurzak, J.: Mixed precision iterative refinement techniques for the solution of dense linear systems. Int. J. High Perform. Comput. Appl. 21(4), 457–486 (2007). https://doi.org/10.1177/1094342007084026
Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1–25 (2011). https://doi.org/10.1145/2049662.2049663
Golub, G.H., Loan, C.F.V.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)
Saad, Y.: Iterative Methods for Sparse Linear Systems, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia (2003)
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
van der Vorst, H.A., Ye, Q.: Residual replacement strategies for Krylov subspace iterative methods for the convergence of true residuals. SIAM J. Sci. Comput. 22(3), 835–852 (2000). https://doi.org/10.1137/S1064827599353865
Acknowledgements
This research was partially sponsored by the EU H2020 project 732631 OPRECOMP and the CICYT project TIN2017-82972-R of the MINECO and FEDER.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Anzt, H., Flegar, G., Novaković, V., Quintana-Ortí, E.S., Tomás, A.E. (2018). Residual Replacement in Mixed-Precision Iterative Refinement for Sparse Linear Systems. In: Yokota, R., Weiland, M., Shalf, J., Alam, S. (eds) High Performance Computing. ISC High Performance 2018. Lecture Notes in Computer Science(), vol 11203. Springer, Cham. https://doi.org/10.1007/978-3-030-02465-9_39
Download citation
DOI: https://doi.org/10.1007/978-3-030-02465-9_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-02464-2
Online ISBN: 978-3-030-02465-9
eBook Packages: Computer ScienceComputer Science (R0)