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

精确实数算术与扰动分析及正确性证明

Exact Real Arithmetic with Perturbation Analysis and Proof of Correctness

Eindhoven University of Technology(埃因霍温理工大学)

Sarmen Keshishzadeh, Jan Friso Groote

AI总结:

本文提出了一种实数表示方法,并通过自上而下的过程实现任意精度的代数和超越运算近似,通过详细算法和证明保证正确性,并利用扰动分析证明近似过程仅在必要时重新计算表达式。

摘要:

本文考虑了一种简单的实数表示方法,并提出了自上而下的过程来以任意精度近似各种代数和超越运算。提供了详细的算法和证明以保证近似的正确性。此外,我们开发并应用了扰动分析方法,以证明我们的近似过程仅在不可避免时重新计算表达式。在过去的十年中,已经发展和实现了多种理论来实现任意精度的实数计算。现有方法的正确性证明通常仅考虑基本代数运算,而对超越运算的详细论证则不可用。另一个重要观察是,在每种方法中,某些表达式可能需要迭代计算以保证所需的精度。然而,没有正式的推理来证明此类迭代计算在近似过程中是必要的。在我们的实函数近似中,我们明确将输入的精度与输出的保证精度联系起来,并提供完整的证明和对迭代必要性的精确分析。

英文摘要:

In this article, we consider a simple representation for real numbers and propose top-down procedures to approximate various algebraic and transcendental operations with arbitrary precision. Detailed algorithms and proofs are provided to guarantee the correctness of the approximations. Moreover, we develop and apply a perturbation analysis method to show that our approximation procedures only recompute expressions when unavoidable. In the last decade, various theories have been developed and implemented to realize real computations with arbitrary precision. Proof of correctness for existing approaches typically consider basic algebraic operations, whereas detailed arguments about transcendental operations are not available. Another important observation is that in each approach some expressions might require iterative computations to guarantee the desired precision. However, no formal reasoning is provided to prove that such iterative calculations are essential in the approximation procedures. In our approximations of real functions, we explicitly relate the precision of the inputs to the guaranteed precision of the output, provide full proofs and a precise analysis of the necessity of iterations.

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

↑