arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.10384cs.SC
收藏

含解析函数方程组近似解的有效证明

Effective certification of approximate solutions to systems of equations involving analytic functions

Michael Burr, Kisun Lee, Anton Leykin

摘要:

我们开发的算法,用于证明一个近似的非奇异解的一个正方形方程组从单变量解析函数。这些算法的基础上存在的神谕评估的基本数据的输入分析功能。一种验证方法是基于α理论,而另一种是基于牛顿迭代的Krawczyk推广。我们表明,必要的预言存在D-有限函数,并比较这种情况下,使用我们的软件实现SageMath的两种算法方法。

英文摘要:

We develop algorithms for certifying an approximation to a nonsingular solution of a square system of equations built from univariate analytic functions. These algorithms are based on the existence of oracles for evaluating basic data about the input analytic functions. One approach for certification is based on alpha-theory while the other is based on the Krawczyk generalization of Newton's iteration. We show that the necessary oracles exist for D-finite functions and compare the two algorithmic approaches for this case using our software implementation in SageMath.

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

↑