Related papers: On lower bounds for integration of multivariate pe…
Numerical integration over the real line for analytic functions is studied. Our main focus is on the sharpness of the error bounds. We first derive two general lower estimates for the worst-case integration error, and then apply these to…
Integral properties of multifunctions with closed convex values are studied. In this more general framework not all the tools and the technique used for weakly compact convex valued multifunctions work. We pay particular attention to the…
Sobolev embeddings, of arbitrary order, are considered into function spaces on domains of $\mathbb R^n$ endowed with measures whose decay on balls is dominated by a power $d$ of their radius. Norms in arbitrary rearrangement-invariant…
We demonstrate the reparametrization invariance of perturbatively defined one-dimensional functional integrals up to the three-loop level for a path integral of a quantum-mechanical point particle in a box. We exhibit the origin of the…
We investigate the approximation of $d$-variate periodic functions in Sobolev spaces of dominating mixed (fractional) smoothness $s>0$ on the $d$-dimensional torus, where the approximation error is measured in the $L_2-$norm. In other…
We propose a unifying general framework of quantitative primal and dual sufficient and necessary error bound conditions covering linear and nonlinear, local and global settings. The function is not assumed to possess any particular…
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…
The problem of distinguishing between a random function and a random permutation on a domain of size $N$ is important in theoretical cryptography, where the security of many primitives depend on the problem's hardness. We study the quantum…
We study the relaxation of multiple integrals of the calculus of variations, where the integrands are nonconvex with convex effective domain and can take the value \infty. We use local techniques based on measure arguments to prove integral…
We introduce a framework based on Rockafellar's perturbation theory to analyze and solve general nonsmooth convex minimization and monotone inclusion problems involving nonlinearly composed functions as well as linear compositions. Such…
Consider the numerical integration $${\rm Int}_{\mathbb S^d,w}(f)=\int_{\mathbb S^d}f({\bf x})w({\bf x}){\rm d}\sigma({\bf x}) $$ for weighted Sobolev classes $BW_{p,w}^r(\mathbb S^d)$ with a Dunkl weight $w$ and weighted Besov classes…
We study high dimensional integration in the quantum model of computation. We develop quantum algorithms for integration of functions from Sobolev classes $W^r_p([0,1]^d)$ and analyze their convergence rates. We also prove lower bounds…
This is a tutorial paper that gives the complete proof of a result of Frolov [2] that shows the optimal order of convergence for numerical integration of functions with bounded mixed derivatives. The presentation follows Temlyakov [8], see…
We tensorize the Faber spline system from [14] to prove sequence space isomorphisms for multivariate function spaces with higher mixed regularity. The respective basis coefficients are local linear combinations of discrete function values…
The present paper is intended to provide the basis for the study of weakly differentiable functions on rectifiable varifolds with locally bounded first variation. The concept proposed here is defined by means of integration by parts…
The compact fourth-order finite-difference scheme for solving the 1d wave equation is studied. New error bounds of the fractional order $\mathcal{O}(h^{4(\lambda-1)/5})$ are proved in the mesh energy norm in terms of data, for two initial…
A permutation-invariant code on m qubits is a subspace of the symmetric subspace of the m qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading order spontaneous…
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…
Deep neural networks have seen tremendous success over the last years. Since the training is performed on digital hardware, in this paper, we analyze what actually can be computed on current hardware platforms modeled as Turing machines,…
We consider the task of computing an approximate minimizer of the sum of a smooth and non-smooth convex functional, respectively, in Banach space. Motivated by the classical forward-backward splitting method for the subgradients in Hilbert…