Rust f64::atanh

Percentage Accurate: 100.0% → 99.5%
Time: 3.6s
Alternatives: 2
Speedup: N/A×

Specification

?
\[\begin{array}{l} \\ \tanh^{-1} x \end{array} \]
(FPCore (x) :precision binary64 (atanh x))
double code(double x) {
	return atanh(x);
}

def code(x):
	return math.atanh(x)

function code(x)
	return atanh(x)
end

function tmp = code(x)
	tmp = atanh(x);
end

code[x_] := N[ArcTanh[x], $MachinePrecision]

\begin{array}{l}

\\
\tanh^{-1} x
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 2 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 100.0% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \end{array} \]
(FPCore (x) :precision binary64 (* 0.5 (log1p (/ (* 2.0 x) (- 1.0 x)))))
double code(double x) {
	return 0.5 * log1p(((2.0 * x) / (1.0 - x)));
}

public static double code(double x) {
	return 0.5 * Math.log1p(((2.0 * x) / (1.0 - x)));
}

def code(x):
	return 0.5 * math.log1p(((2.0 * x) / (1.0 - x)))

function code(x)
	return Float64(0.5 * log1p(Float64(Float64(2.0 * x) / Float64(1.0 - x))))
end

code[x_] := N[(0.5 * N[Log[1 + N[(N[(2.0 * x), $MachinePrecision] / N[(1.0 - x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

\begin{array}{l}

\\
0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right)
\end{array}

Alternative 1: 99.5% accurate, 7.4× speedup?

\[\begin{array}{l} \\ \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, 0.3333333333333333, x\right) \end{array} \]
(FPCore (x) :precision binary64 (fma (* (* x x) x) 0.3333333333333333 x))
double code(double x) {
	return fma(((x * x) * x), 0.3333333333333333, x);
}

function code(x)
	return fma(Float64(Float64(x * x) * x), 0.3333333333333333, x)
end

code[x_] := N[(N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision] * 0.3333333333333333 + x), $MachinePrecision]

\begin{array}{l}

\\
\mathsf{fma}\left(\left(x \cdot x\right) \cdot x, 0.3333333333333333, x\right)
\end{array}
Derivation

  1. Initial program 100.0%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Add Preprocessing

  3. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x \cdot \left(1 + \frac{1}{3} \cdot {x}^{2}\right)} \]
  4. Step-by-step derivation

    1. +-commutativeN/A

      \[\leadsto x \cdot \color{blue}{\left(\frac{1}{3} \cdot {x}^{2} + 1\right)} \]

    2. distribute-lft-inN/A

      \[\leadsto \color{blue}{x \cdot \left(\frac{1}{3} \cdot {x}^{2}\right) + x \cdot 1} \]

    3. *-commutativeN/A

      \[\leadsto x \cdot \color{blue}{\left({x}^{2} \cdot \frac{1}{3}\right)} + x \cdot 1 \]

    4. associate-*r*N/A

      \[\leadsto \color{blue}{\left(x \cdot {x}^{2}\right) \cdot \frac{1}{3}} + x \cdot 1 \]

    5. unpow2N/A

      \[\leadsto \left(x \cdot \color{blue}{\left(x \cdot x\right)}\right) \cdot \frac{1}{3} + x \cdot 1 \]

    6. cube-multN/A

      \[\leadsto \color{blue}{{x}^{3}} \cdot \frac{1}{3} + x \cdot 1 \]

    7. *-rgt-identityN/A

      \[\leadsto {x}^{3} \cdot \frac{1}{3} + \color{blue}{x} \]

    8. lower-fma.f64N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \frac{1}{3}, x\right)} \]

    9. lower-pow.f64100.0

      \[\leadsto \mathsf{fma}\left(\color{blue}{{x}^{3}}, 0.3333333333333333, x\right) \]

  5. Applied rewrites100.0%

    \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, 0.3333333333333333, x\right)} \]
  6. Step-by-step derivation

    1. Applied rewrites100.0%

      \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, 0.3333333333333333, x\right) \]
    2. Add Preprocessing

    Alternative 2: 99.0% accurate, 11.4× speedup?

    \[\begin{array}{l} \\ \left(x \cdot 2\right) \cdot 0.5 \end{array} \]
    (FPCore (x) :precision binary64 (* (* x 2.0) 0.5))
    double code(double x) {
	return (x * 2.0) * 0.5;
}

    real(8) function code(x)
    real(8), intent (in) :: x
    code = (x * 2.0d0) * 0.5d0
end function

    public static double code(double x) {
	return (x * 2.0) * 0.5;
}

    def code(x):
	return (x * 2.0) * 0.5

    function code(x)
	return Float64(Float64(x * 2.0) * 0.5)
end

    function tmp = code(x)
	tmp = (x * 2.0) * 0.5;
end

    code[x_] := N[(N[(x * 2.0), $MachinePrecision] * 0.5), $MachinePrecision]

    \begin{array}{l}

\\
\left(x \cdot 2\right) \cdot 0.5
\end{array}
    Derivation

    1. Initial program 100.0%

      \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
    2. Add Preprocessing

    3. Taylor expanded in x around 0

      \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(2 \cdot x\right)} \]
    4. Step-by-step derivation

      1. lower-*.f6499.6

        \[\leadsto 0.5 \cdot \color{blue}{\left(2 \cdot x\right)} \]

    5. Applied rewrites99.6%

      \[\leadsto 0.5 \cdot \color{blue}{\left(2 \cdot x\right)} \]

    6. Final simplification99.6%

      \[\leadsto \left(x \cdot 2\right) \cdot 0.5 \]
    7. Add Preprocessing

    Reproduce

    ?
    herbie shell --seed 2024255 
(FPCore (x)
  :name "Rust f64::atanh"
  :precision binary64
  (* 0.5 (log1p (/ (* 2.0 x) (- 1.0 x)))))