RLIBM-32: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2104.04043/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTRLIBM-32: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations — mentioned by lifthrasiirhttps://news.ycombinator.com/item?id=36501385urn:hackerpapers:mention:2104.04043:36501385Wed, 28 Jun 2023 02:00:54 GMT<p>&gt; This polynomial is not derived analytically, rather it&#x27;s found using an iterative algorithm, traditionally using the Remez algorithm, but also see my WIP project here: https://gitlab.com/nsajko/FindMinimaxPolynomial.jl. Is this your independent attempt? Because I think RLIBM did the essentially same thing recently [1]. [1] https://arxiv.org/pdf/2104.04043.pdf</p><p><a href="https://hackerpaper.kaipfister.de/p/2104.04043/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.MS