Related papers: On the error term of a lattice counting problem
We augment the method of Wooley (2015) by some new ideas and in a series of results, improve his metric bounds on the Weyl sums and the discrepancy of fractional parts of real polynomials with partially prescribed coefficients. We also…
This paper derives a posteriori error estimators for the nonlinear first-order optimality conditions associated with the Frank-Oseen elastic free-energy model of nematic and cholesteric liquid crystals, where the required unit-length…
When a large body of data from diverse experiments is analyzed using a theoretical model with many parameters, the standard error matrix method and the general tools for evaluating errors may become inadequate. We present an iterative…
As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such…
We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error…
Lower a posteriori error bounds obtained using the standard bubble function approach are reviewed in the context of anisotropic meshes. A numerical example is given that clearly demonstrates that the short-edge jump residual terms in such…
We obtain a power saving in the error term for a semigroup congruence lattice point count related to continued fractions. This is done by adapting arguments from recent work of Oh and Winter (2014) that give uniform bounds for certain…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
We present an application of the standard Langevin dynamics to the problem of weak coupling perturbative expansions for Lattice QCD. This method can be applied to the computation of the most general observables. In this preliminary work we…
Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…
The Laplace approximation is a popular method for constructing a Gaussian approximation to the Bayesian posterior and thereby approximating the posterior mean and variance. But approximation quality is a concern. One might consider using…
Error estimates for the numerical solution of the master equation are presented. Estimates are based on adjoint methods. We find that a good estimate can often be computed without spending computational effort on a dual problem. Estimates…
This work is focused on the application of functional-type a posteriori error estimates and corresponding indicators to a class of time-dependent problems. We consider the algorithmic part of their derivation and implementation and also…
This paper describes types of errors arising in a recently proposed method of incidence estimation from prevalence data. The errors are illustrated by a simulation study about a hypothetical irreversible disease. In addition, a way of…
We show how powerful algorithms recently developed for counting lattice points and computing volumes of convex polyhedra can be used to compute probabilities of a wide variety of events of interest in social choice theory. Several…
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been known -- e.g.~[Fischer,…
A residual based {\em a posteriori} error estimator is derived for a quadratic finite element method (fem) for the elliptic obstacle problem. The error estimator involves various residuals consisting the data of the problem, discrete…
We derive in this preprint the moment and exponential tail estimates, sufficient conditions for the Non-Central Limit Theorem (NCLT) in the ordinary one-dimensional space as well as in the space of continuous functions for the properly…
This work prepares new probability bounds for sums of random, independent, Hermitian tensors. These probability bounds characterize large-deviation behavior of the extreme eigenvalue of the sums of random tensors. We extend Lapalace…
We study fluctuations of the error term for the number of integer lattice points lying inside a 3-dimensional Cygan-Kor\'anyi ball of large radius. We prove that the error term, suitably normalized, has a limiting value distribution which…