Related papers: Solving for best linear approximates
The goal of this paper is to formulate a systematical method for constructing the fastest possible continued fraction approximations of a class of functions. The main tools are the multiple-correction method, the generalized Mortici's lemma…
We develop a quantitative theory of stochastic homogenization in the more general framework of differential forms. Inspired by recent progress in the uniformly elliptic setting, the analysis relies on the study of certain subadditive…
We provide a lower bound for the ratio between the ordinary and uniform exponent of both simultaneous Diophantine approximation and Diophantine approximation by linear forms in any dimension. This lower bound was conjectured by Schmidt and…
We consider a diffusion equation with highly oscillatory coefficients that admits a homogenized limit. As an alternative to standard corrector problems, we introduce here an embedded corrector problem, written as a diffusion equation in the…
The concept of nearest integer is used to derive theorems and algorithms for the best approximations of an irrational by rational numbers, which are improved with the pigeonhole principle and used to offer an informed presentation of the…
In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method…
We survey classical and recent results on exponents of Diophantine approximation. We give only a few proofs and highlight several open problems.
We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.
We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…
We use the theory of arithmetic quotients of the Bruhat-Tits tree developed by Serre and others to obtain Dirichlet-style theorems for Diophantine approximation on global function fields. This approach allows us to find sharp values for the…
The Rosen fractions are an infinite set of continued fraction algorithms, each giving expansions of real numbers in terms of certain algebraic integers. For each, we give a best possible upper bound for the minimum in appropriate…
We give an algorithm that finds a sequence of approximations with Dirichlet coefficients bounded by a constant only depending on the dimension. The algorithm uses the LLL-algorithm for lattice basis reduction. We present a version of the…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…
The continuous evolution of a wide variety of systems, including continuous-time Markov chains and linear hybrid automata, can be described in terms of linear differential equations. In this paper we study the decision problem of whether…
In the present paper, we have developed a method for solving \textit{diophantine inequalities} using their relationship with the \textit{difference between consecutive primes}. Using this approach we have been able to prove some theorems,…
We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…
We study the best approximation problem: \[ \displaystyle \min_{\alpha\in \mathbb R^m}\max_{1\leq i\leq n}\left|y_i -\sum_{j=1}^m \alpha_j \Gamma_j ({\bf x}_i) \right|. \] Here: $\Gamma:=\left\{\Gamma_1,...,\Gamma_m\right\}$ is a list of…
For a homogenization problem associated to a linear elliptic operator, we prove the existence of a distributional corrector and we find an approximation scheme for the homogenized coefficients. We also study the convergence rates in the…
We introduce a new canonical form of lattices called the systematic normal form (SNF). We show that for every lattice there is an efficiently computable "nearby" SNF lattice, such that for any lattice one can solve lattice problems on its…