2000 character limit reached
Spherical cap discrepancy of the Diamond ensemble
Published 11 Oct 2019 in math.NA and cs.NA | (1910.05140v1)
Abstract: We compute the spherical cap discrepancy of the Diamond ensemble (a set of evenly distributed spherical points) as well as some other quantities. We also define an area regular partition on the sphere where each region contains exactly one point of the Diamond ensemble. For a concrete choice of parameters, we prove that the Diamond ensemble provides the best spherical cap discrepancy known until date for a deterministic family of points.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.