<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>FFT, FMM, or Multigrid? A comparative Study of State-Of-the-Art Poisson Solvers for Uniform and Nonuniform Grids in the Unit Cube · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1408.6497/</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/1408.6497/feed.xml" rel="self" type="application/rss+xml" /><item><title>FFT, FMM, or Multigrid? A comparative Study of State-Of-the-Art Poisson Solvers for Uniform and Nonuniform Grids in the Unit Cube — mentioned by mmorse1217</title><link>https://news.ycombinator.com/item?id=32191398</link><guid isPermaLink="false">urn:hackerpapers:mention:1408.6497:32191398</guid><pubDate>Fri, 22 Jul 2022 12:56:19 GMT</pubDate><description>&lt;p&gt;This implementation and associated paper improve the cache locality to make the algorithm more competitive https://github.com/dmalhotra/pvfmm They compare solving toy problems with different methods here https://arxiv.org/pdf/1408.6497.pdf But as you mention, this is just fiddling with constants, and it still may be too costly for your problem&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1408.6497/"&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>
