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

RLIBM-PROG:用于快速正确舍入数学库的渐进多项式逼近

RLIBM-PROG: Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries

Mridul Aanjaneya, Jay P. Lim, Santosh Nagarakatte

摘要:

本文提出了一种新的方法,用于生成一个单一的多项式近似,产生正确的舍入结果的所有输入的一个初等函数的多个表示。生成的多项式近似具有很好的属性,即前几个较低次项为较小位宽的特定表示产生正确的舍入结果,我们称之为渐进性能。为了生成这样的渐进多项式近似,我们近似正确舍入的结果,并将正确舍入的多项式近似的计算公式化为类似于我们之前在RLibm项目上的工作的线性规划。为了能够在主流库中使用得到的多项式近似,我们希望避免使用具有大型查找表的分段多项式。我们观察到,计算初等函数的多项式近似的问题是低维的线性规划问题,即,还有一些未知数我们设计了一个快速的随机算法来计算多项式逼近,并具有渐进的性能。我们的方法产生正确和快速的多项式,需要少量的存储。我们原型中的一些多项式近似已经被纳入LLVM的数学库。

英文摘要:

This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has the nice property that the first few lower degree terms produce correctly rounded results for specific representations of smaller bitwidths, which we call progressive performance. To generate such progressive polynomial approximations, we approximate the correctly rounded result and formulate the computation of correctly rounded polynomial approximations as a linear program similar to our prior work on the RLibm project. To enable the use of resulting polynomial approximations in mainstream libraries, we want to avoid piecewise polynomials with large lookup tables. We observe that the problem of computing polynomial approximations for elementary functions is a linear programming problem in low dimensions, i.e., with a small number of unknowns. We design a fast randomized algorithm for computing polynomial approximations with progressive performance. Our method produces correct and fast polynomials that require a small amount of storage. A few polynomial approximations from our prototype have already been incorporated into LLVM's math library.

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

↑