相关论文: Approximating 1 from below using $n$ Egyptian frac…
In this short note we prove a result that is an extension of an old Olympiad problem and is a very simple variant of the question of finding an approximation for $k$, where it is a nonzero constant and it satisfies the equation $a^k+b^k=c$,…
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 present a general technique for approximating bicriteria minimization problems with positive-valued, polynomially computable objective functions. Given $0<\epsilon\leq1$ and a polynomial-time $\alpha$-approximation algorithm for the…
The purpose of this note is to compare various approximation methods as applied to the inverse of the Bessel function of the first kind, in a given domain of the complex plane.
Using a method of H. Davenport and W. M. Schmidt, we show that, for each positive integer n, the ratio 2/n is the optimal exponent of simultaneous approximation to real irrational numbers 1) by all conjugates of algebraic numbers of degree…
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…
We show that a simple and straightforward rational approximation to the Thomas--Fermi equation provides the slope at origin with unprecedented accuracy. We compare present approach with other available ones.
Iterated Bernstein polynomial approximations of degree n for continuous function which also use the values of the function at i/n, i=0,1,...,n, are proposed. The rate of convergence of the classic Bernstein polynomial approximations is…
Egyptian decompositions of 2/D as a sum of two unit fractions are studied by means of certain divisors of D, namely r and s. Our analysis does not concern the method to find r and s, but just why the scribes have chosen a solution instead…
We prove a discrete approximation of functionals with jumps and creases.
The papers shows an algorithm to search for approximations of reals to rationals of the form a/b^2 that runs on \sqrt(b) polynomial time steps.
The k-means problem consists of finding k centers in the d-dimensional Euclidean space that minimize the sum of the squared distances of all points in an input set P to their closest respective center. Awasthi et. al. recently showed that…
The Gr\"unwald and shifted Gr\"unwald formulas for the function $y(x)-y(b)$ are first order approximations for the Caputo fractional derivative of the function $y(x)$ with lower limit at the point $b$. We obtain second and third order…
The Pythagoras number of a sum of squares is the shortest length among its sums of squares representations. In many algebras, for example real polynomial algebras in two or more variables, there exists no upper bound on the Pythagoras…
An approach to constructing an upper bound for the Riemann-Farey sum is described.
This paper extends the algorithm schemes proposed in \cite{Nesterov2007a} and \cite{Nesterov2007b} to the minimization of the sum of a composite objective function and a convex function. Two proximal point-type schemes are provided and…
Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets $n$ be the number of constraints and $d$ be the number of variables, with…
We present new approximation schemes for bin packing based on the following two approaches: (1) partitioning the given problem into mostly identical sub-problems of constant size and then construct a solution by combining the solutions of…
We propose a numerical analysis of a simplified version of the previous paper "Multiplicity hunting and approximating multiple roots of polynomial systems" written by the two authors.
A new approach to Poisson approximation is proposed. The basic idea is very simple and based on properties of the Charlier polynomials and the Parseval identity. Such an approach quickly leads to new effective bounds for several Poisson…