Fast multiple precision exp(x) with precomputations

Joris Van Der Hoeven, Fredrik Johansson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

What is the most efficient way to compute the exponential function when allowing for the precomputation of lookup tables? In this paper we study this question as a function of the working precision and analyze both classical and asymptotically fast approaches. We present new complexity results, discuss efficient parameter choices and point out improvements that lead to speedups over existing implementations.

Original languageEnglish
Title of host publicationProceedings - 2024 IEEE 31st Symposium on Computer Arithmetic, ARITH 2024
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages80-87
Number of pages8
ISBN (Electronic)9798350384321
DOIs
Publication statusPublished - 1 Jan 2024
Event31st IEEE Symposium on Computer Arithmetic, ARITH 2024 - Malaga, Spain
Duration: 10 Jun 202412 Jun 2024

Publication series

NameProceedings - Symposium on Computer Arithmetic
ISSN (Print)1063-6889
ISSN (Electronic)2576-2265

Conference

Conference31st IEEE Symposium on Computer Arithmetic, ARITH 2024
Country/TerritorySpain
CityMalaga
Period10/06/2412/06/24

Keywords

  • Elementary functions
  • FFT
  • Multiple-precision arithmetic
  • Table-based methods

Fingerprint

Dive into the research topics of 'Fast multiple precision exp(x) with precomputations'. Together they form a unique fingerprint.

Cite this