2023 - T3 - WS1 - Fundamental algorithms and algorithmic complexity

Collection 2023 - T3 - WS1 - Fundamental algorithms and algorithmic complexity

Organizer(s) van der Hoeven, Joris ; Giesbrecht, Mark ; Koiran, Pascal ; Villard, Gilles
Date(s) 25/09/2023 - 29/09/2023
linked URL https://indico.math.cnrs.fr/event/8113/
14 17

The practical complexity of arbitrary-precision functions

By Fredrik Johansson

Most familiar operations on N-digit real numbers (sum, product, square root, exponential, logarithm, etc.) can be computed in time quasilinear in N. However, this kind of asymptotic statement hides details which can add up to huge differences in practical running times. We will discuss how to think about optimizing arbitrary-precision algorithms, with a detailed look at state-of-the-art methods for transcendental functions.

Information about the video

Citation data

  • DOI 10.57987/IHP.2023.T3.WS1.015
  • Cite this video Johansson, Fredrik (28/09/2023). The practical complexity of arbitrary-precision functions. IHP. Audiovisual resource. DOI: 10.57987/IHP.2023.T3.WS1.015
  • URL https://dx.doi.org/10.57987/IHP.2023.T3.WS1.015

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback