Numerical Approximation of Real Functions and One Minkowski's Conjecture on Diophintine Approximations
Nikolaj M. Glazunov
Abstract
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 xn+1 = G(x1, ..., xn), where dependency F(x1, ..., xn+1) = 0 is defined on some compact domain by a sufficiently smooth real function F(x1, ..., xn+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 x p + y p ≤ 1, p > 1..
Create a lesson
Related papers
Hybrid Newton-BFGS high-index saddle dynamics for accelerating saddle-point searches
Jianyuan Yin, Lei Zhang, Shixue Zhang
Randomly shifted lattice rules for SDEs with constant diffusion: error bounds uniform in time discretization and dimension
Du Ouyang, Josef Dick, Ziyang Ye
Asymptotic-Preserving Tensor Neural Networks for 3D High-Field Kinetic Equations with Applications to Uncertainty Quantification
Shi Jin, Tian-ai Zhang
Energy-conserving scheme for a shallow-water model with capillary effects
Sudarshan Kumar K, Boniface Nkonga, Praveen Chandrashekar
A physics-based adaptive low-rank method for 6D Vlasov simulations
Fabio Cassini, Lukas Einkemmer
To lift or not to lift: Operator inference for nonlinear PDEs with boundary control
Zhuoyuan Wang, Yorie Nakahira, Wael H. Ali et al.