arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2404.05082cs.ITmath.IT
收藏

低比特宽度 Cholesky 分解中最小二乘误差的概率检验

Probabilistic Examination of Least Squares Error in Low-bitwidth Cholesky Decomposition

Alexander Osinsky, Roman Bychkov, Mikhail Trefilov, Vladimir Lyashev, Andrey Ivanov

AI总结:

针对低比特宽度 Cholesky 分解求解线性最小二乘时的舍入误差,本文提出更贴近实际误差的随机界,并经半精度与实际场景验证可准确预测误差。

摘要:

本文提出一种新方法,用于论证舍入误差对采用 Cholesky 分解的线性最小二乘(LS)解精度的影响。该分解被广泛用于多用户多天线接收机线性检测器中的矩阵求逆。所提出的随机界比其他数值界更接近实际误差。它在半精度格式下进行了测试,并在实际场景中得到验证。实验结果表明,我们的方法预测的误差与仿真所得误差非常接近。所提方法可用于分析许多其他应用中产生的舍入误差。

英文摘要:

In this paper, we propose a new approach to justify a round-off error impact on the accuracy of the linear least squares (LS) solution using Cholesky decomposition. This decomposition is widely employed to inverse a matrix in the linear detector of the Multi-User multi-antenna receiver. The proposed stochastic bound is much closer to actual errors than other numerical bounds. It was tested with a half-precision format and validated in realistic scenarios. Experimental results demonstrate our approach predicts errors very close to those achieved by simulations. The proposed approach can be employed to analyze the resulting round-off error in many other applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑