<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fast Feasible and Unfeasible Matrix Multiplication · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1804.04102/</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/1804.04102/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fast Feasible and Unfeasible Matrix Multiplication — mentioned by bjourne</title><link>https://news.ycombinator.com/item?id=33133584</link><guid isPermaLink="false">urn:hackerpapers:mention:1804.04102:33133584</guid><pubDate>Sat, 08 Oct 2022 16:21:41 GMT</pubDate><description>&lt;p&gt;&amp;quot;A considerable group of numerical analysts still believes in the folk “theorem” that fast MM is always numerical unstable, but in actual tests loss of accuracy in fast MM algorithms was limited, and formal proofs of quite reasonable numerical stability of all known fast MM algorithms is available (see [23], [90], [91], [62], and [61]).&amp;quot; https://arxiv.org/abs/1804.04102&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1804.04102/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
