Mixed precision iterative refinement techniques for the solution of dense linear systems

Alfredo Buttari, Jack Dongarra, Julie Langou, Julien Langou, Piotr Luszczek, Jakub Kurzak

Research output: Contribution to journalArticlepeer-review

100 Scopus citations

Abstract

By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. The approach presented here can apply not only to conventional processors but also to exotic technologies such as Field Programmable Gate Arrays (FPGA), Graphical Processing Units (GPU), and the Cell BE processor. Results on modern processor architectures and the Cell BE are presented.

Original languageEnglish
Pages (from-to)457-466
Number of pages10
JournalInternational Journal of High Performance Computing Applications
Volume21
Issue number4
DOIs
StatePublished - Dec 2007

Keywords

  • Cholesky factorization
  • Iterative
  • LU
  • Mixed-precision
  • Refinement

Fingerprint

Dive into the research topics of 'Mixed precision iterative refinement techniques for the solution of dense linear systems'. Together they form a unique fingerprint.

Cite this