<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Robust and Practical Solution of Laplacian Equations by Approximate Elimination · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2303.00709/</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/2303.00709/feed.xml" rel="self" type="application/rss+xml" /><item><title>Robust and Practical Solution of Laplacian Equations by Approximate Elimination — mentioned by okintheory</title><link>https://news.ycombinator.com/item?id=40837040</link><guid isPermaLink="false">urn:hackerpapers:mention:2303.00709:40837040</guid><pubDate>Sun, 30 Jun 2024 13:22:53 GMT</pubDate><description>&lt;p&gt;Interestingly, the same guy also works on making &amp;#x27;theory-only&amp;#x27; algorithms work well in practice [1]. But, it seems like that takes another 20 years -- [1] is building on a theory breakthrough from 2004 [2], but these algorithms are only starting to work in practice in 2024, IIUC. I guess that means there&amp;#x27;s hope for practical min-cost flow algorithms in 2044. [1] https://arxiv.org/pdf/2303.00709 [2] https://arxiv.org/abs/cs/0310051&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2303.00709/"&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>
