Related papers: Generalization of Euler's Summation Formula to Pat…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…
This is the third and last of three papers introducing generalised Cesaro convergence and is split into two parts. In part 1 we introduce the notion of a "Cesaro-adapted scale" and use it to prove the key generalised Cesaro…
In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…
Probabilistic integration of a continuous dynamical system is a way of systematically introducing model error, at scales no larger than errors introduced by standard numerical discretisation, in order to enable thorough exploration of…
F. Stenger proposed efficient approximation formulas for derivatives over infinite intervals. These formulas were derived by combining the Sinc approximation with appropriate conformal maps. It has been demonstrated that these formulas can…
Translation of "Methodus succincta summas serierum infinitarum per formulas differentiales investigandi" (1780). Euler wants to represent some given series of functions S(x)=X(x)+X(x+1)+X(x+2)+etc. in a different way. He writes S as a…
We cover some useful techniques in computational aspects of analytic number theory, with specific emphasis on ideas relevant to the evaluation of L-functions. These techniques overlap considerably with basic methods from analytic number…
We study a type of object, called a pathway (generalizing pathways in the sense of P. E. Cohen [Proc. Amer. Math. Soc. 74, No. 2 (1979), 318--321]), which is useful for several set-theoretic constructions and whose existence, in a sense,…
By means of the Ito-Nisio theorem, we introduce and discuss a general approach to series representations of path integrals. We then argue that the optimal basis for both ``primitive'' and partial averaged approaches is the Wiener…
Generalized summability results are obtained regarding formal solutions of certain families of linear moment integro-differential equations with time variable coefficients. The main result leans on the knowledge of the behavior of the…
We survey recent developments in the field of complexity of pathwise approximation in $p$-th mean of the solution of a stochastic differential equation at the final time based on finitely many evaluations of the driving Brownian motion.…
We prove sharp $L^p-L^q$ estimates for averaging operators along general polynomial curves in two and three dimensions. These operators are translation-invariant, given by convolution with the so-called affine arclength measure of the curve…
It is well known that the Euler-Maruyama discretisation of an autonomous SDE using a uniform timestep $h$ has a strong convergence error which is $O(h^{1/2})$ when the drift and diffusion are both globally Lipschitz. This note proves that…
The Euler obstruction of a function can be viewed as a generalization of the Milnor number for functions defined on singular spaces. In this work, using the Euler obstruction of a function, we give a version of the L\^e-Greuel formula for…
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…
We prove stability and convergence of a full discretization for a class of stochastic evolution equations with super-linearly growing operators appearing in the drift term. This is done using the recently developed tamed Euler method, which…
In this paper, the Feynman path integral formulation of the continuous-continuous filtering problem, a fundamental problem of applied science, is investigated for the case when the noise in the signal and measurement model is additive. It…
We establish universal approximation theorems for infinite-dimensional geometric rough paths, i.e., we show that continuous functions on the space of infinite-dimensional weakly geometric H\"older continuous rough paths can be approximated…
Sequence-to-sequence deep neural models fine-tuned for abstractive summarization can achieve great performance on datasets with enough human annotations. Yet, it has been shown that they have not reached their full potential, with a wide…
Online and stochastic gradient methods have emerged as potent tools in large scale optimization with both smooth convex and nonsmooth convex problems from the classes $C^{1,1}(\reals^p)$ and $C^{1,0}(\reals^p)$ respectively. However to our…