相关论文: Numerical cubature from Archimedes' hat-box theore…
A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…
We consider a polynomial reconstruction of smooth functions from their noisy values at discrete nodes on the unit sphere by a variant of the regularized least-squares method of An et al., SIAM J. Numer. Anal. 50 (2012), 1513--1534. As nodes…
The nodes of certain minimal cubature rule are real common zeros of a set of orthogonal polynomials of degree $n$. They often consist of a well distributed set of points and interpolation polynomials based on them have desired convergence…
We give an inequality on the packing of vectors/lines in quaternionic Hilbert space $\Hd$, which generalises those of Sidelnikov and Welch for unit vectors in $\Rd$ and $\Cd$. This has a parameter $t$, and depends only on the vectors up to…
Node elimination is a numerical approach to obtain cubature rules for the approximation of multivariate integrals. Beginning with a known cubature rule, nodes are selected for elimination, and a new, more efficient rule is constructed by…
Positive cubature rules of degree 4 and 5 on the $d$-dimensional simplex are constructed and used to construct cubature rules of index 8 or degree 9 on the unit sphere. The latter ones lead to explicit isometric embedding among the…
Yudin's lower bound for the spherical designs is generalized to the cubature formulas on the projective spaces over a field K, where K can be R, C, or H (the field of quaternions), and thus to isometric embeddings of l_2 into l_p with p an…
Given a probability measure $\mu$ on a set $\mathcal{X}$ and a vector-valued function $\varphi$, a common problem is to construct a discrete probability measure on $\mathcal{X}$ such that the push-forward of these two probability measures…
We describe a new method to compute general cubature formulae. The problem is initially transformed into the computation of truncated Hankel operators with flat extensions. We then analyse the algebraic properties associated to flat…
We construct an interpolatory high-order cubature rule to compute integrals of smooth functions over self-affine sets with respect to an invariant measure. The main difficulty is the computation of the cubature weights, which we…
We propose and analyse randomized cubature formulae for the numerical integration of functions with respect to a given probability measure $\mu$ defined on a domain $\Gamma \subseteq \mathbb{R}^d$, in any dimension $d$. Each cubature…
We introduce a new concept for generating optimal quadrature rules for splines. Given a target spline space where we aim to generate an optimal quadrature rule, we build an associated source space with known optimal quadrature and transfer…
We employ a multivariate extension of the Gauss quadrature formula, originally due to Berens, Schmid and Xu [BSX95], so as to derive cubature rules for the integration of symmetric functions over hypercubes (or infinite limiting…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
We address the problem of curvature estimation from sampled compact sets. The main contribution is a stability result: we show that the gaussian, mean or anisotropic curvature measures of the offset of a compact set K with positive…
The expected value of some complex valued random vectors is computed by means of the indicator function of a designed experiment as known in algebraic statistics. The general theory is set-up and results are obtained for finite discrete…
For the purpose of uncertainty quantification with collocation, a method is proposed for generating families of one-dimensional nested quadrature rules with positive weights and symmetric nodes. This is achieved through a reduction…
A recent result in [2] on the non-existence of Gauss-Lobatto cubature rules on the triangle is strengthened by establishing a lower bound for the number of nodes of such rules. A method of constructing Lobatto type cubature rules on the…
This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…
This paper contains a survey of results obtained by the authors mostly during the past few years and published by 2021. In particular, we present the best of known estimates of numerical characteristics related to the research theme.…