<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Faster arbitrary-precision dot product and matrix multiplication · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1901.04289/</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/1901.04289/feed.xml" rel="self" type="application/rss+xml" /><item><title>Faster arbitrary-precision dot product and matrix multiplication — mentioned by fdej</title><link>https://news.ycombinator.com/item?id=26055145</link><guid isPermaLink="false">urn:hackerpapers:mention:1901.04289:26055145</guid><pubDate>Sun, 07 Feb 2021 14:15:28 GMT</pubDate><description>&lt;p&gt;Author here. I will take the opportunity to advertise my blog at https://fredrikj.net/blog/ where I post occasional development updates about Arb and other projects. Some improvements not covered in the 2016 preprint include much faster code for arithmetic and matrix multiplication (https://arxiv.org/abs/1901.04289, https://fredrikj.net/blog/2018/07/high-precision-linear-alge...), and code for rigorous arbitrary-precision numerical integration (https://arxiv.org/abs/1802.07942, http://fredrikj.net/blog/2017/11/new-rigorous-numerical-inte...).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1901.04289/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.MS</category></item></channel></rss>
