HackerPapers

arXiv:1410.7176cs.MS

Efficient implementation of elementary functions in the medium-precision range

Fredrik Johansson

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and atan for variable precision up to approximately 4096 bits. Compared to the MPFR library, we achieve a maximum speedup ranging from a factor 3 for cos to 30 for atan. Our implementation uses table-based argument reduction together with rectangular splitting to evaluate Taylor series. We collect denominators to reduce the number of divisions in the Taylor series, and avoid overhead by doing all multiprecision arithmetic using the mpn layer of the GMP library. Our implementation provides rigorous error bounds.

arXiv comments
Submitted to ARITH 22
Journal reference
DOI
Subjects
cs.MSMathematical Software math.NANumerical Analysis

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jan 2015 to Jan 2015.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Related: I recently published a preprint describing some techniques to speed up evaluation of transcendental functions in the range of a few hundred bits to a few thousand bits: http://arxiv.org/abs/1410.7176

      fdejView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.