Renewed interest in mixed-precision algorithms has emerged due to growing data capacity and bandwidth concerns, as well as the advancement of GPUs, which enable significant speedup for low precision arithmetic. In light of this, we propose a mixed-precision algorithm to generate a double-precision accurate matrix interpolative decomposition approximation under a given set of criteria. Though low precision arithmetic suffers from quicker accumulation of round-off error, for many data-rich applications we nevertheless attain viable approximation accuracy, as the error incurred using low precision arithmetic is dominated by the error inherent to low-rank approximation. We then conduct several simulated numerical tests to demonstrate the efficacy of the algorithms and the corresponding error estimates. Finally, we present the application of our algorithms to a problem in model reduction for particle-laden turbulent flow.
翻译:由于数据能力和带宽问题不断增加,加之GPU的提升,使低精度算术的快速化变得相当快,因此对混合精度算法重新产生了兴趣。 有鉴于此,我们提议采用混合精度算法,以产生一套特定标准下的双精度精确矩阵跨集分解近似值。 虽然低精度算法由于圆差错的加速积累而受到影响,但许多数据丰富的应用都达到了可行的近似精确度,因为使用低精度算术的错误主要是低精度近似差错。我们随后进行若干模拟数字测试,以显示算法和相应的误差估计值的功效。最后,我们介绍了我们的算法在粒子拉动波动模型减少时遇到的问题。