ACM Transactions on Mathematical Software (TOMS): Volume 34 Issue 4, July 2008
Citation Count: 16
Downloads (6 Weeks): 5, Downloads (12 Months): 38, Downloads (Overall): 621
Full text available:
By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. These ideas can be applied to sparse multifrontal and supernodal direct techniques and sparse iterative techniques such as ...
iterative refinement, floating point, Linear systems, precision