<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fast matrix multiplication is stable · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0603207/</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/math_0603207/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fast matrix multiplication is stable — mentioned by eigenket</title><link>https://news.ycombinator.com/item?id=33123442</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0603207:33123442</guid><pubDate>Fri, 07 Oct 2022 16:24:13 GMT</pubDate><description>&lt;p&gt;You seem to be confusing the mathematical definition of matrix multiplication with an explicit algorithm to compute it. The wiki page you linked is almost entirely about the abstract mathematical definition and talks about algorithms only for a single paragraph, which is about computational complexity. If you look at the wiki page for a particular algorithm (e.g. Strassen: https://en.wikipedia.org/wiki/Strassen_algorithm) then of course they talk about stability in comparison to the naive algorithm (although the page could be improved quite a bit). If your college textbooks do not mention…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0603207/"&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>
