Fast inverse transform sampling in one and two dimensions

Abstract

We develop a computationally efficient and robust algorithm for generating pseudo-random samples from a broad class of smooth probability distributions in one and two dimensions. The algorithm is based on inverse transform sampling with a polynomial approximation scheme using Chebyshev polynomials, Chebyshev grids, and low rank function approximation. Numerical experiments demonstrate that our algorithm outperforms existing approaches.

10 pages

Cited by in corpus (7)

• The statistical challenge of constraining the low-mass IMF in Local Group dwarf galaxies
• Fast inverse transform sampling of non-Gaussian distribution functions in space plasmas
• Inverse Transform Sampling for Efficient Doppler-Averaged Spectroscopy Simulations
• Sampling unitary invariant ensembles
• On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves
• Simulating low-energy neutrino interactions with MARLEY
• Quasi Monte Carlo inverse transform sampling for phase space conserving Lagrangian particle methods and Eulerian-Lagrangian coupling