<p>In numerical computation, the inherent rounding errors of floating-point operations often affect the precision of mathematical functions. The use of high-precision achieved through software-dependent simulation for precision compensation may result in significant performance overhead. Error-free transformations (EFT) technology, based on hardware-supported precision to approximate high-precision implementation, can effectively balance accuracy and performance. However, enhancing the precision of mathematical functions is a very complex and challenging issue. There is a lack of relevant research on when EFT technology can be used to improve the precision of mathematical functions, what effects can be achieved, and what impact it may have on program performance. In this work, we present an empirical study on the applicability and effectiveness of using error-free transformations (EFT) in floating-point computation to assess their potential and limitations in improving precision over mathematical functions. We select 42 mathematical functions from the GNU Scientific Library (GSL), known for significant rounding errors. We evaluate the EFT techniques from three aspects: the applicability of EFT for different mathematical functions (especially at the maximum error point and its vicinity), the precision improvement of EFT in input domains near the error-triggering input, and the performance of EFT compared with the high-precision versions. Experimental results show that EFT has advantages in reducing floating-point errors across 27 functions. Furthermore, while improving the accuracy of mathematical functions within specific input ranges near the maximum error input, EFT achieves a 10.92<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="42514_2025_214_Article_IEq1.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(\times\)</EquationSource> <EquationSource Format="MATHML"><math> <mo>×</mo> </math></EquationSource> </InlineEquation> speedup compared to long double precision and a 2426.3<InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="42514_2025_214_Article_IEq1.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(\times\)</EquationSource> <EquationSource Format="MATHML"><math> <mo>×</mo> </math></EquationSource> </InlineEquation> speedup compared to mpmath. These findings suggest that EFT achieves computational accuracy to the real results with much lower overhead than conventional high-precision calculations, which makes EFT a promising technology for balancing accuracy and performance in high performance computing.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

An empirical study of error-free transformations for enhancing mathematical function precision

  • Dongting Chen,
  • Jie Shen,
  • Chun Huang,
  • Xin Yi

摘要

In numerical computation, the inherent rounding errors of floating-point operations often affect the precision of mathematical functions. The use of high-precision achieved through software-dependent simulation for precision compensation may result in significant performance overhead. Error-free transformations (EFT) technology, based on hardware-supported precision to approximate high-precision implementation, can effectively balance accuracy and performance. However, enhancing the precision of mathematical functions is a very complex and challenging issue. There is a lack of relevant research on when EFT technology can be used to improve the precision of mathematical functions, what effects can be achieved, and what impact it may have on program performance. In this work, we present an empirical study on the applicability and effectiveness of using error-free transformations (EFT) in floating-point computation to assess their potential and limitations in improving precision over mathematical functions. We select 42 mathematical functions from the GNU Scientific Library (GSL), known for significant rounding errors. We evaluate the EFT techniques from three aspects: the applicability of EFT for different mathematical functions (especially at the maximum error point and its vicinity), the precision improvement of EFT in input domains near the error-triggering input, and the performance of EFT compared with the high-precision versions. Experimental results show that EFT has advantages in reducing floating-point errors across 27 functions. Furthermore, while improving the accuracy of mathematical functions within specific input ranges near the maximum error input, EFT achieves a 10.92 \(\times\) × speedup compared to long double precision and a 2426.3 \(\times\) × speedup compared to mpmath. These findings suggest that EFT achieves computational accuracy to the real results with much lower overhead than conventional high-precision calculations, which makes EFT a promising technology for balancing accuracy and performance in high performance computing.