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 language | English |
---|---|
Pages (from-to) | 457-466 |
Number of pages | 10 |
Journal | International Journal of High Performance Computing Applications |
Volume | 21 |
Issue number | 4 |
DOIs | |
State | Published - Dec 2007 |
Keywords
- Cholesky factorization
- Iterative
- LU
- Mixed-precision
- Refinement