One polynomial approximation to produce correctly rounded results of an elementary function for multiple representations and rounding modes

Author:

Lim Jay P.1ORCID,Nagarakatte Santosh1ORCID

Affiliation:

1. Rutgers University, USA

Abstract

Mainstream math libraries for floating point (FP) do not produce correctly rounded results for all inputs. In contrast, CR-LIBM and RLIBM provide correctly rounded implementations for a specific FP representation with one rounding mode. Using such libraries for a representation with a new rounding mode or with different precision will result in wrong results due to double rounding. This paper proposes a novel method to generate a single polynomial approximation that produces correctly rounded results for all inputs for multiple rounding modes and multiple precision configurations. To generate a correctly rounded library for n -bits, our key idea is to generate a polynomial approximation for a representation with n +2-bits using the round-to-odd mode. We prove that the resulting polynomial approximation will produce correctly rounded results for all five rounding modes in the standard and for multiple representations with k -bits such that | E | +1 < kn , where | E | is the number of exponent bits in the representation. Similar to our prior work in the RLIBM project, we approximate the correctly rounded result when we generate the library with n +2-bits using the round-to-odd mode. We also generate polynomial approximations by structuring it as a linear programming problem but propose enhancements to polynomial generation to handle the round-to-odd mode. Our prototype is the first 32-bit float library that produces correctly rounded results with all rounding modes in the IEEE standard for all inputs with a single polynomial approximation. It also produces correctly rounded results for any FP configuration ranging from 10-bits to 32-bits while also being faster than mainstream libraries.

Funder

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Reference50 articles.

1. Martin Aigner and Gnter M . Ziegler . 2009 . Proofs from THE BOOK (4th ed.). Springer Publishing Company , Incorporated. isbn:3642008550 Martin Aigner and Gnter M. Ziegler. 2009. Proofs from THE BOOK (4th ed.). Springer Publishing Company, Incorporated. isbn:3642008550

2. Exchange Algorithm for Evaluation and Approximation Error-Optimized Polynomials

3. Alan Baker . 1975. Transcendental Number Theory . Cambridge University Press . Alan Baker. 1975. Transcendental Number Theory. Cambridge University Press.

4. Formally Verified Argument Reduction with a Fused Multiply-Add

5. Sylvie Boldo and Guillaume Melquiond . 2005 . When double rounding is odd . In 17th IMACS World Congress . Paris, France. 11 pages. Sylvie Boldo and Guillaume Melquiond. 2005. When double rounding is odd. In 17th IMACS World Congress. Paris, France. 11 pages.

Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Parallel Optimization for Accelerating the Generation of Correctly Rounded Elementary Functions;Proceedings of the 53rd International Conference on Parallel Processing;2024-08-12

2. Numerical Fuzz: A Type System for Rounding Error Analysis;Proceedings of the ACM on Programming Languages;2024-06-20

3. Maximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear Programs with Convex Hull as the Intermediate Representation;Proceedings of the ACM on Programming Languages;2024-06-20

4. Floating-Point TVPI Abstract Domain;Proceedings of the ACM on Programming Languages;2024-06-20

5. Implementation and Synthesis of Math Library Functions;Proceedings of the ACM on Programming Languages;2024-01-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3