<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>General Purpose Convolution Algorithm in S4-Classes by means of FFT · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1006.0764/</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/1006.0764/feed.xml" rel="self" type="application/rss+xml" /><item><title>General Purpose Convolution Algorithm in S4-Classes by means of FFT — mentioned by data-ottawa</title><link>https://news.ycombinator.com/item?id=48834581</link><guid isPermaLink="false">urn:hackerpapers:mention:1006.0764:48834581</guid><pubDate>Wed, 08 Jul 2026 17:18:28 GMT</pubDate><description>&lt;p&gt;I built a small one of these as a calculator back in the day, it was fun and I always wanted to see someone really run with the idea more, so your project is super cool! Did you ever look at symbolic or exact operators instead of purely monte-Carlo? I remember reading the paper for distr, they used a mix of Fourier transforms for convolution and symbolic reduction to build a probabilistic computing library in R. I attempted building a small python library for this, but for my problems the CLT ended up sufficient to approximate the results faster, so I went with that. You may enjoy reading the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1006.0764/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.CO</category></item></channel></rss>
