Related papers: Second order interlaced polynomial lattice rules f…
We study fast approximation of integrals with respect to stationary probability measures associated to iterated functions systems on the unit interval. We provide an algorithm for approximating the integrals under certain conditions on the…
In this paper, we develop and test a fast numerical algorithm, called MDI-LR, for efficient implementation of quasi-Monte Carlo lattice rules for computing $d$-dimensional integrals of a given function. It is based on the idea of converting…
We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…
We develop a general framework for estimating the $L_\infty(\mathbb{T}^d)$ error for the approximation of multivariate periodic functions belonging to specific reproducing kernel Hilbert spaces (RHKS) using approximants that are…
We prove a global version of the classical result that $p$-harmonic functions belong to $W^{2,2}_{loc}$ for $1<p<3+\frac{2}{n-2}$. The proof relies on Cordes' matrix inequalities [7] and techniques from the work of Cianchi and Maz'ya [5,6].
We develop efficient numerical integration methods for computing an integral whose integrand is a product of a smooth function and the Gaussian function with a small standard deviation. Traditional numerical integration methods applied to…
This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…
We demonstrate how path integrals often used in problems of theoretical physics can be adapted to provide a machinery for performing Bayesian inference in function spaces. Such inference comes about naturally in the study of inverse…
We study $L_q$-approximation and integration for functions from the Sobolev space $W^s_p(\Omega)$ and compare optimal randomized (Monte Carlo) algorithms with algorithms that can only use iid sample points, uniformly distributed on the…
We apply the orthonormalization procedure previously introduced by two of us and adopted in connection with coherent states to Gabor frames and other examples. For instance, for Gabor frames we show how to construct $g(x)\in L^2(\Bbb{R})$…
We revisit the work of the first named author and using simpler algebraic arguments we calculate integrals of polynomial functions with respect to the Haar measure on the unitary group U(d). The previous result provided exact formulas only…
In this article we revisit the problem of numerical integration for monotone bounded functions, with a focus on the class of nonsequential Monte Carlo methods. We first provide new a lower bound on the maximal $L^p$ error of nonsequential…
We suggest a new Hamiltonian lattice approach, using a regularisation motivated by deep inelastic scattering. We discuss the relation between distribution functions and the $F_1$ structure function. We have tested this method by computing…
We consider a homogeneous stochastic higher spin six vertex model in a quadrant. For this model we derive concise integral representations for multi-point q-moments of the height function and for the q-correlation functions. At least in the…
In the first part we have shown that, for $L_2$-approximation of functions from a separable Hilbert space in the worst-case setting, linear algorithms based on function values are almost as powerful as arbitrary linear algorithms if the…
The aim of this paper is to show that one can achieve convergence rates of $N^{-\alpha+ \delta}$ for $\alpha > 1/2$ (and for $\delta > 0$ arbitrarily small) for nonperiodic $\alpha$-smooth cosine series using lattice rules without random…
Numerical solutions of differential equations are usually not smooth functions. However, they should resemble the smoothness of the corresponding real solutions in one way or another. In two of our recent papers, a kind of spacial…
Functional data registration is a critical challenge in modern statistics, essential for separating phase variability from amplitude variability. While derivative-based frameworks offer mathematically elegant solutions, their dependence on…
We study the complexity of randomized computation of integrals depending on a parameter, with integrands from Sobolev spaces. That is, for $r,d_1,d_2\in{\mathbb N}$, $1\le p,q\le \infty$, $D_1= [0,1]^{d_1}$, and $D_2= [0,1]^{d_2}$ we are…
Generalizations of Ostrowski type inequality for functions of Lipschitzian type are established. Applications in numerical integration and cumulative distribution functions are also given.