Related papers: Spherical $t_\epsilon$-Designs for Approximations …
In this paper, we compare two optimization algorithms using full Hessian and approximation Hessian to obtain numerical spherical designs through their variational characterization. Based on the obtained spherical design point sets, we…
This paper proposes a sketching strategy based on spherical designs, which is applied to the classical spherical basis function approach for massive spherical data fitting. We conduct theoretical analysis and numerical verifications to…
In this paper we prove the conjecture of Korevaar and Meyers: for each $N\ge c_dt^d$ there exists a spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $c_d$ is a constant depending only on $d$.
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…
In this paper, we study spherical $T$-designs and their harmonic strength $\text{Hst}(X)$ on the unit circle $S^1$. For any finite set $T\subset\mathbb{N}$, we constructively demonstrate the existence of a finite design $X$ such that…
A Euclidean $t$-design, as introduced by Neumaier and Seidel (1988), is a finite set ${\cal X} \subset \mathbb{R}^n$ with a weight function $w: {\cal X} \rightarrow \mathbb{R}^+$ for which $$\sum_{r \in R} W_r \overline{f}_{S_{r}} =…
This paper provides triangular spherical designs for the complex unit sphere $\Omega^d$ by exploiting the natural correspondence between the complex unit sphere in $d$ dimensions and the real unit sphere in $2d-1$. The existence of…
In this paper, we study conditions under which a finite subset $Z$ of the unit sphere $S^{d-1}\subset \mathbb{R}^{d}$ becomes a spherical $t$-design, when $Z$ is constructed by the following procedure: starting from a finite set of…
A point set $\mathrm X_N$ on the unit sphere is a spherical $t$-design is equivalent to the nonnegative quantity $A_{N,t+1}$ vanished. We show that if $\mathrm X_N$ is a stationary point set of $A_{N,t+1}$ and the minimal singular value of…
For each $N\ge C_dt^d$ we prove the existence of a well separated spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $C_d$ is a constant depending only on $d$.
If a (weighted) spherical design is defined as an integration (cubature) rule for a unitarily invariant space P of polynomials (on the sphere), then any unitary image of it is also such a spherical design. It therefore follows that such…
Let N(n, t) be the minimal number of points in a spherical t-design on the unit sphere S^n in R^{n+1}. For each n >= 3, we prove a new asymptotic upper bound N(n, t) <= C(n)t^{a_n}, where C(n) is a constant depending only on n, a_3 <= 4,…
Approximation using Fourier features is a popular technique for scaling kernel methods to large-scale problems, with myriad applications in machine learning and statistics. This method replaces the integral representation of a…
A finite set $X \seq \RR^n$ with a weight function $w : X \longrightarrow \RR_{>0}$ is called \emph{Euclidean $t$-design} in $\RR^n$ (supported by $p$ concentric spheres) if the following condition holds: \[ \sum_{i=1}^p…
We study numerical integration on the unit sphere $\mathbb{S}^2 \subset \mathbb{R}^3$ using equal weight quadrature rules, where the weights are such that constant functions are integrated exactly. The quadrature points are constructed by…
We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…
The purpose of this paper is to construct universal, auto--adaptive, localized, linear, polynomial (-valued) operators based on scattered data on the (hyper--)sphere $\SS^q$ ($q\ge 2$). The approximation and localization properties of our…
For a distribution function $F$ on $\mathbb{R}^d$ and a point $q\in \mathbb{R}^d$, the \emph{spherical depth} $\SphD(q;F)$ is defined to be the probability that a point $q$ is contained inside a random closed hyper-ball obtained from a pair…
Category-level object pose estimation aims to determine the pose and size of novel objects in specific categories. Existing correspondence-based approaches typically adopt point-based representations to establish the correspondences between…
Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…