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

实函数的数值逼近与关于丢番图逼近的一个闵可夫斯基猜想

Numerical Approximation of Real Functions and One Minkowski's Conjecture on Diophintine Approximations

Nikolaj M. Glazunov

AI总结:

本文利用实函数的多种数值逼近方法,结合构造性Kolmogorov-Arnold定理和隐函数定理,实现隐式定义函数值域的可靠计算,并以闵可夫斯基猜想为例验证方法有效性。

摘要:

本文考虑了若干种实函数逼近方法在隐式定义实函数 $x_{n+1} = G(x_{1}, ..., x_{n})$ 的值域的验证计算(可靠计算)问题中的应用,其中依赖关系 $F(x_{1}, ..., x_{n+1}) = 0$ 定义在某个紧致域上,由足够光滑的实函数 $F(x_{1}, ..., x_{n+1}) >$ 给出。为此,我们使用了Kolmogorov-Arnold定理和隐函数定理的构造性版本、浮点逼近的结果、给出某些实函数下界和上界估计的浮点逼近,以及近似代数计算。严格的理论可以建立在浮点域上的流形分析的基础上。在文中,我们通过研究闵可夫斯基关于区域 $\mid x \mid^p + \mid y \mid^p \leq 1, p > 1$ 的临界行列式的猜想实例来展示我们的方法。

英文摘要:

In this paper I consider the applications of several kinds of approximations of real functions to the problem of verified computation (reliable computing) of the range of implicitly defined real function $x_{n+1} = G(x_{1}, ..., x_{n}),$ where dependency $F(x_{1}, ..., x_{n+1}) = 0$ is defined on some compact domain by a sufficiently smooth real function $F(x_{1}, ..., x_{n+1}) >.$ Constructive version of Kolmogorov-Arnold and implicit function theorems, results about floating-point approximation, floating-point approximations which give lower-bound and upper-bound estimates of some real functions, and approximate algebraic computation are used for the purpose. The rigorous theory can be build on the base of analysis on manifolds over floating points domains. In the text we demonstrate our approach on examples from investigation of Minkowski's conjecture on critical determinant of the region $\mid x \mid^p + \mid y \mid^p \leq 1, p > 1.$.

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

↑