A fast algorithm for generating a uniform distribution inside a high-dimensional polytope
A. van Hameren, R. Kleiss
Abstract
We describe a uniformly fast algorithm for generating points x uniformly in a hypercube with the restriction that the difference between each pair of coordinates is bounded. We discuss the quality of the algorithm in the sense of its usage of pseudo-random source numbers, and present an interesting result on the correlation between the coordinates.
Create a lesson
Related papers
Physical-state supervision for design-only Gaussian process surrogates of implosion simulations
Chang Liu, Hao Shen, Chuanying Li
Energy-dependent trapping of backscattered helium during magnetron sputtering growth: A molecular dynamics study
Pascal Brault, Anne-Lise Thomann, Alejandro Borroto
Alter-excitons in Altermagnets: Symmetry, Splitting and Dispersion
Yuanfan Xiong, Liangyu Wang, Xuan Wu et al.
All-electron RT-TDDFT with Exact Exchange based on Numeric Atom-centered Orbitals for Condensed Matter
Jianhang Xu, Christopher Shepard, Yosuke Kanai
Polyconvex neural-network surrogates with learned paired directional features for anisotropic hyperelastic homogenization
S. Ares de Parga, A. Cornejo, J. A. Hernández et al.
Parallel Design of a GPU-Resident Semi-Lagrangian Drift-Kinetic Solver on Unstructured Extruded Tokamak Meshes
Mark F. Adams