Related papers: On the error term of a lattice counting problem
The note presents a modified proof of a loss bound for the exponentially weighted average forecaster with time-varying potential. The regret term of the algorithm is upper-bounded by sqrt{n ln(N)} (uniformly in n), where N is the number of…
We study variational regularisation methods for inverse problems with imperfect forward operators whose errors can be modelled by order intervals in a partial order of a Banach lattice. We carry out analysis with respect to existence and…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
The Lasso is one of the most important approaches for parameter estimation and variable selection in high dimensional linear regression. At the heart of its success is the attractive rate of convergence result even when $p$, the dimension…
We give mean square bounds for the remainder in the lattice point counting problem, counting the number of lattice points in a large ball in $\mathbb{R}^d$, when averaged over families of shears of the lattice.
Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…
A new approach of implementing initial and boundary conditions for the lattice Boltzmann method is presented. The new approach is based on an extended collision operator that uses the gradients of the fluid velocity. The numerical…
We report on a novel algorithm for controlling global error in a step-by-step (stepwise) sense, in the numerical solution of a scalar, autonomous, nonstiff or weakly stiff problem. The algorithm exploits the remainder term of a Taylor…
We revisit the method of Carleman linearization for systems of ordinary differential equations with polynomial right-hand sides. This transformation provides an approximate linearization in a higher-dimensional space through the exact…
This paper studies the estimation of large precision matrices and Cholesky factors obtained by observing a Gaussian process at many locations. Under general assumptions on the precision and the observations, we show that the sample…
We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…
One reason for the well known fact that the Complex Langevin (CL) method sometimes fails to converge or converges to the wrong limit has been identified long ago: it is insufficient decay of the probability density either near infinity or…
We prove effective bounds on the rate in the quadratic growth asymptotics for the orbit of a non-uniform lattice of SL(2,R), acting linearly on the plane. This gives an error bound in the count of saddle connection holonomies, for some…
We consider the problem of estimating the error term $\mathcal{E}_{q}(x)=\big|\mathbb{Z}^{2q+1}\cap\delta_{x}\mathcal{B}\big|-\textit{vol}\big(\mathcal{B}\big)x^{2q+2}$ which occurs in the counting of lattice points in Heisenberg dilates of…
This paper presents a novel systematic methodology to obtain new simple and tight approximations, lower bounds, and upper bounds for the Gaussian Q-function, and functions thereof, in the form of a weighted sum of exponential functions.…
Three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well known Micchelli-Rivlin quadrature formula, when the integrand is a function analytic in the regions bounded by…
Confidence limits are common place in physics analysis. Great care must be taken in their calculation and use, especially in cases of limited statistics when often one-sided limits are quoted. In order to estimate the stability of the…
Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…
A lattice quantizer approximates an arbitrary real-valued source vector with a vector taken from a specific discrete lattice. The quantization error is the difference between the source vector and the lattice vector. In a classic 1996…
Estimation of solution norms and stability for time-dependent nonlinear systems is ubiquitous in numerous applied and control problems. Yet, practically valuable results are rare in this area. This paper develops a novel approach, which…