<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fast inverse transform sampling in one and two dimensions · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1307.1223/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1307.1223/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fast inverse transform sampling in one and two dimensions — mentioned by jacobolus</title><link>https://news.ycombinator.com/item?id=10115033</link><guid isPermaLink="false">urn:hackerpapers:mention:1307.1223:10115033</guid><pubDate>Tue, 25 Aug 2015 07:38:45 GMT</pubDate><description>&lt;p&gt;Here’s a really neat new approach, Olver &amp;amp; Townsend, “Fast inverse transform sampling in one and two dimensions” http://arxiv.org/pdf/1307.1223v1.pdf Built on top of Chebfun, http://www.chebfun.org&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1307.1223/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.NA</category></item></channel></rss>
