Skip to content
Permalink

Comparing changes

Choose two branches to see what’s changed or to start a new pull request. If you need to, you can also or learn more about diff comparisons.

Open a pull request

Create a new pull request by comparing changes across two branches. If you need to, you can also . Learn more about diff comparisons here.
base repository: huonw/fast-math
Failed to load repositories. Confirm that selected base ref is valid, then try again.
Loading
base: master
Choose a base ref
...
head repository: huonw/fast-math
Failed to load repositories. Confirm that selected head ref is valid, then try again.
Loading
compare: optimiser
Choose a head ref
  • 6 commits
  • 12 files changed
  • 1 contributor

Commits on Jan 16, 2019

  1. Fix bad formatting.

    huonw committed Jan 16, 2019
    Configuration menu
    Copy the full SHA
    cbc52b9 View commit details
    Browse the repository at this point in the history

Commits on Jan 22, 2019

  1. add optimiser for automatically finding good parameters

    The existing parameters are currently pretty good and there's not much
    point in changing them.
    huonw committed Jan 22, 2019
    Configuration menu
    Copy the full SHA
    614cd28 View commit details
    Browse the repository at this point in the history
  2. Configuration menu
    Copy the full SHA
    55d4bef View commit details
    Browse the repository at this point in the history

Commits on Jan 26, 2019

  1. Implement exp_m1 and exp2_m1

    This switches between a Taylor-esque approximation based on x + x/2,
    and the "obvious" exp(x) - 1 based on the size of x, with the exact
    polynomial and the size threshold chosen by `optimiser`.
    
    Fixes #10.
    huonw committed Jan 26, 2019
    Configuration menu
    Copy the full SHA
    b16ad3c View commit details
    Browse the repository at this point in the history
  2. Implement log2_1p.

    This switches between the linear approximation log_B(x) ~ x/ln(B) for
    small x and the "obvious" log_B(1 + x), with the size threshold chosen
    by `optimizer`. There was not much value in optimizing the
    multiplicative constant (especially true for `ln_1p` if that is every
    implemented: ln(x) ~ x avoids a multiplication), or using a
    higher-degree polynomial, because the equation above is as accurate as
    the `log2` approximation.
    
    Fixes #11.
    huonw committed Jan 26, 2019
    Configuration menu
    Copy the full SHA
    4453c8e View commit details
    Browse the repository at this point in the history
  3. Configuration menu
    Copy the full SHA
    d5701f5 View commit details
    Browse the repository at this point in the history
Loading