Related papers: Approximate quadrature measures on data--defined s…
A result of P\'olya states that every sequence of quadrature formulas $Q_n(f)$ with $n$ nodes and positive numbers converges to the integral $I(f)$ of a continuous function $f$ provided $Q_n(f)=I(f)$ for a space of algebraic polynomials of…
This paper investigates the numerical approximation of integrals for functions in fractional Gaussian Sobolev spaces $W^s_{p}(\mathbb{R}^d,\gamma)$ with dominating mixed smoothness defined via kernel related to the fractional…
In numerical integration, cubature methods are effective, especially when the integrands can be well-approximated by known test functions, such as polynomials. However, the construction of cubature formulas has not generally been known, and…
We address the problem of sensing the curvature of a manifold by performing measurements on a particle constrained to the manifold itself. In particular, we consider situations where the dynamics of the particle is quantum mechanical and…
The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many…
A quantum theory of multiphase estimation is crucial for quantum-enhanced sensing and imaging and may link quantum metrology to more complex quantum computation and communication protocols. In this letter we tackle one of the key…
Our main interest in this paper is to study some approximation problems for classes of functions with mixed smoothness. We use technique, based on a combination of results from hyperbolic cross approximation, which were obtained in 1980s --…
Classical algorithms in numerical analysis for numerical integration (quadrature/cubature) follow the principle of approximate and integrate: the integrand is approximated by a simple function (e.g. a polynomial), which is then integrated…
The computational complexity of some depths that satisfy the projection property, such as the halfspace depth or the projection depth, is known to be high, especially for data of higher dimensionality. In such scenarios, the exact depth is…
Polygonal finite elements generally do not pass the patch test as a result of quadrature error in the evaluation of weak form integrals. In this work, we examine the consequences of lack of polynomial consistency and show that it can lead…
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…
Data depth is a concept in multivariate statistics that measures the centrality of a point in a given data cloud in $\IR^d$. If the depth of a point can be represented as the minimum of the depths with respect to all one-dimensional…
We investigate the approximation of generalized Laguerre- or Laplace-weighted integrals over $\mathbb{R}^d_+$ or $\mathbb{R}^d$ of functions from generalized Laguerre- or Laplace-weighted Sobolev spaces of mixed smoothness, respectively. We…
Matching methods are widely used for causal inference in observational studies. Among them, nearest neighbor matching is arguably the most popular. However, nearest neighbor matching does not generally yield an average treatment effect…
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…
A method of deriving quadrature rules has been developed which gives nodes and weights for a Gaussian-type rule which integrates functions of the form: f(x,y,t) = a(x,y,t)/((x-t)^2+y^2) + b(x,y,t)/([(x-t)^2+y^2]^{1/2}) +…
In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…
Symmetric polynomial quadrature rules for triangles are commonly used to efficiently integrate two-dimensional domains in finite-element-type problems. While the development of such rules focuses on the maximum degree a given number of…
We introduce a minor variant of the approximate D-optimal design of experiments with a more general information matrix that takes into account the representation of the design space S. The main motivation (and result) is that if S in R^d is…
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…