Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.13426v1

Help | Advanced Search

Computer Science > Programming Languages

arXiv:2510.13426v1 (cs)
[Submitted on 15 Oct 2025 ]

Title: Fast Trigonometric Functions using the RLIBM Approach

Title: 使用RLIBM方法的快速三角函数

Authors:Sehyeok Park (Rutgers University), Santosh Nagarakatte (Rutgers University)
Abstract: This paper describes our experience developing polynomial approximations for trigonometric functions that produce correctly rounded results for multiple representations and rounding modes using the RLIBM approach. A key challenge with trigonometric functions concerns range reduction with "pi", which reduces a given input in the domain of a 32-bit float to a small domain. Any rounding error in the value of "pi" is amplified during range reduction, which can result in wrong results. We describe our experience implementing fast range reduction techniques that maintain a large number of bits of "pi" both with floating-point and integer computations. The resulting implementations for trigonometric functions are fast and produce correctly rounded results for all inputs for multiple representations up to 32-bits with a single implementation.
Abstract: 本文描述了我们使用RLIBM方法开发三角函数的多项式近似的经验,这些近似对于多种表示和舍入模式都能产生正确舍入的结果。 与三角函数相关的一个关键挑战是使用"pi"进行范围缩减,这会将32位浮点数域中的给定输入缩减到一个小域。 "pi"值中的任何舍入误差都会在范围缩减过程中被放大,这可能导致错误的结果。 我们描述了我们在实现快速范围缩减技术方面的经验,这些技术在浮点数和整数计算中都能保持"pi"的大量位数。 对于三角函数的最终实现,在单个实现中能够对多达32位的多种表示的所有输入快速产生正确舍入的结果。
Comments: In Proceedings VSS 2025, arXiv:2510.12314
Subjects: Programming Languages (cs.PL)
Cite as: arXiv:2510.13426 [cs.PL]
  (or arXiv:2510.13426v1 [cs.PL] for this version)
  https://doi.org/10.48550/arXiv.2510.13426
arXiv-issued DOI via DataCite
Journal reference: EPTCS 432, 2025, pp. 76-89
Related DOI: https://doi.org/10.4204/EPTCS.432.9
DOI(s) linking to related resources

Submission history

From: EPTCS [view email]
[v1] Wed, 15 Oct 2025 11:24:14 UTC (1,290 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
cs.PL
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号