<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Communication-optimal parallel and sequential QR and LU factorizations · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0808.2664/</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/0808.2664/feed.xml" rel="self" type="application/rss+xml" /><item><title>Communication-optimal parallel and sequential QR and LU factorizations — mentioned by convolvatron</title><link>https://news.ycombinator.com/item?id=15059234</link><guid isPermaLink="false">urn:hackerpapers:mention:0808.2664:15059234</guid><pubDate>Sun, 20 Aug 2017 17:19:03 GMT</pubDate><description>&lt;p&gt;communication optimal algorithms https://arxiv.org/abs/0808.2664 are a really interesting way to think about static layout and scheduling.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0808.2664/"&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>
