Related papers: Rational approximation to the Thomas--Fermi equati…
We describe a simple analytical method for effective summation of series, including divergent series. The method is based on self-similar approximation theory resulting in self-similar root approximants. The method is shown to be general…
We propose a simple subsampling scheme for fast randomized approximate computation of optimal transport distances. This scheme operates on a random subset of the full data and can use any exact algorithm as a black-box back-end, including…
A Thomas-Fermi-Weizsaecker type theory is constructed, by means of which we are able to give a relatively simple proof of the stability of relativistic matter. Our procedure has the advantage over previous ones in that the critical value of…
We prove existence and uniqueness of a positive solution to a system of two coupled Gross-Pitaevskii equations. We give a full asymptotic expansion of this solution into powers of the semi classical parameter $\varepsilon$ in the…
We introduce and study a geometric modification of the Douglas-Rach\-ford method called the Circumcentered-Douglas-Rachford method. This method iterates by taking the intersection of bisectors of reflection steps for solving certain classes…
We propose a stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Our approach is based on a bi-objective viewpoint of chance-constrained programs that seeks solutions on the…
We prove a discrete approximation of functionals with jumps and creases.
We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph,…
We study the approximation of stationary processes by a simple class of purely deterministic signals. This has an analytic counterpart in the approximation of symmetric positive definite Toeplitz matrices by submatrices of finite rank. We…
We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.
In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and…
It is shown, that any sufficiently smooth periodic solution of the self-focusing Nonlinear Schr\"odinger equation can be approximated by periodic finite-gap ones with an arbitrary small error. As a corollary an analogous result for the…
We show that in the limit of small Rossby number $\eps$, the primitive equations of the ocean (OPEs) can be approximated by ``higher-order quasi-geostrophic equations'' up to an exponential accuracy in $\eps$. This approximation assumes…
We present a novel iterative algorithm for approximating the linear least squares solution with low complexity. After a motivation of the algorithm we discuss the algorithm's properties including its complexity, and we present theoretical…
In this paper, the fractional order of rational Bessel functions collocation method (FRBC) to solve Thomas-Fermi equation which is defined in the semi-infinite domain and has singularity at $x = 0$ and its boundary condition occurs at…
This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
An approach to constructing an upper bound for the Riemann-Farey sum is described.
We derive an efficient algorithm to find solutions to Euler's concordant form problem and rational points on elliptic curves associated with this problem.
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…