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

利用半定规划的认证舍入误差界

Certified Roundoff Error Bounds Using Semidefinite Programming

CNRS Verimag(法国国家科学研究中心维拉格实验室);Imperial College London(伦敦帝国理工学院)

Victor Magron, George Constantinides, Alastair Donaldson

AI总结:

本文提出基于半定规划和求和平方证书的框架,用于提供浮点非线性程序的绝对舍入误差上界,通过Coq证明助手验证,提升精度和性能。

摘要:

在有限精度下实现数值程序时,舍入误差无法避免。在探索潜在表示(如FPGA或定制硬件)时,对舍入误差的推理尤为重要。当程序不只包含线性操作时,问题变得复杂,因为许多实际应用中的计算问题固有非线性。现有解决方案在非线性变量相关性下可能导致不准确的界限或分析时间长。虽然区间算术易于实现,但正式环境中的复杂技术较难实施。因此,需要能提供可在证明助手内正式验证的证书方法。本文提出一个框架,用于提供浮点非线性程序的绝对舍入误差上界。该框架基于利用半定规划和求和平方证书的优化技术,可在Coq定理证明器中检查,为多项式程序提供正式的舍入误差界。我们的工具覆盖广泛非线性程序,包括多项式和超越运算以及条件语句。我们在生物学、优化和航天控制中的非平凡程序上展示了该工具的效率和精度。该工具对23%的所有程序产生更准确的误差界,并在66%的所有程序中表现更佳。

英文摘要:

Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ability to reason about rounding is especially important if one wants to explore a range of potential representations, for instance for FPGAs or custom hardware implementations. This problem becomes challenging when the program does not employ solely linear operations, and non-linearities are inherent to many interesting computational problems in real-world applications. Existing solutions to reasoning possibly lead to either inaccurate bounds or high analysis time in the presence of nonlinear correlations between variables. Furthermore, while it is easy to implement a straightforward method such as interval arithmetic, sophisticated techniques are less straightforward to implement in a formal setting. Thus there is a need for methods which output certificates that can be formally validated inside a proof assistant. We present a framework to provide upper bounds on absolute roundoff errors of floating-point nonlinear programs. This framework is based on optimization techniques employing semidefinite programming and sums of squares certificates, which can be checked inside the Coq theorem prover to provide formal roundoff error bounds for polynomial programs. Our tool covers a wide range of nonlinear programs, including polynomials and transcendental operations as well as conditional statements. We illustrate the efficiency and precision of this tool on non-trivial programs coming from biology, optimization and space control. Our tool produces more accurate error bounds for 23% of all programs and yields better performance in 66% of all programs.

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

↑