
(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:
Herbie found 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(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}
(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}
Initial program 100.0%
(FPCore (x)
:precision binary64
(/
x
(fma
(* x x)
(fma
x
(* x (fma (* x x) -0.04656084656084656 -0.08888888888888889))
-0.3333333333333333)
1.0)))
double code(double x) {
return x / fma((x * x), fma(x, (x * fma((x * x), -0.04656084656084656, -0.08888888888888889)), -0.3333333333333333), 1.0);
}
function code(x) return Float64(x / fma(Float64(x * x), fma(x, Float64(x * fma(Float64(x * x), -0.04656084656084656, -0.08888888888888889)), -0.3333333333333333), 1.0)) end
code[x_] := N[(x / N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * -0.04656084656084656 + -0.08888888888888889), $MachinePrecision]), $MachinePrecision] + -0.3333333333333333), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x}{\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x \cdot x, -0.04656084656084656, -0.08888888888888889\right), -0.3333333333333333\right), 1\right)}
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
+-commutativeN/A
distribute-lft1-inN/A
*-commutativeN/A
associate-*l*N/A
unpow2N/A
unpow3N/A
lower-fma.f64N/A
Applied rewrites99.5%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
flip3-+N/A
clear-numN/A
Applied rewrites99.2%
Taylor expanded in x around 0
lower-/.f64N/A
Applied rewrites99.2%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-fma.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
clear-numN/A
lift-/.f64N/A
Applied rewrites99.5%
(FPCore (x) :precision binary64 (fma (fma (* x x) (fma x (* x 0.14285714285714285) 0.2) 0.3333333333333333) (* x (* x x)) x))
double code(double x) {
return fma(fma((x * x), fma(x, (x * 0.14285714285714285), 0.2), 0.3333333333333333), (x * (x * x)), x);
}
function code(x) return fma(fma(Float64(x * x), fma(x, Float64(x * 0.14285714285714285), 0.2), 0.3333333333333333), Float64(x * Float64(x * x)), x) end
code[x_] := N[(N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * 0.14285714285714285), $MachinePrecision] + 0.2), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot 0.14285714285714285, 0.2\right), 0.3333333333333333\right), x \cdot \left(x \cdot x\right), x\right)
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
+-commutativeN/A
distribute-lft1-inN/A
*-commutativeN/A
associate-*l*N/A
unpow2N/A
unpow3N/A
lower-fma.f64N/A
Applied rewrites99.5%
(FPCore (x) :precision binary64 (fma (fma (* x x) 0.2 0.3333333333333333) (* x (* x x)) x))
double code(double x) {
return fma(fma((x * x), 0.2, 0.3333333333333333), (x * (x * x)), x);
}
function code(x) return fma(fma(Float64(x * x), 0.2, 0.3333333333333333), Float64(x * Float64(x * x)), x) end
code[x_] := N[(N[(N[(x * x), $MachinePrecision] * 0.2 + 0.3333333333333333), $MachinePrecision] * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.2, 0.3333333333333333\right), x \cdot \left(x \cdot x\right), x\right)
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
distribute-rgt-inN/A
*-lft-identityN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
unpow2N/A
unpow3N/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.5
Applied rewrites99.5%
(FPCore (x) :precision binary64 (fma 0.3333333333333333 (* x (* x x)) x))
double code(double x) {
return fma(0.3333333333333333, (x * (x * x)), x);
}
function code(x) return fma(0.3333333333333333, Float64(x * Float64(x * x)), x) end
code[x_] := N[(0.3333333333333333 * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(0.3333333333333333, x \cdot \left(x \cdot x\right), x\right)
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
+-commutativeN/A
distribute-lft1-inN/A
associate-*l*N/A
unpow2N/A
unpow3N/A
lower-fma.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.4
Applied rewrites99.4%
(FPCore (x) :precision binary64 x)
double code(double x) {
return x;
}
real(8) function code(x)
real(8), intent (in) :: x
code = x
end function
public static double code(double x) {
return x;
}
def code(x): return x
function code(x) return x end
function tmp = code(x) tmp = x; end
code[x_] := x
\begin{array}{l}
\\
x
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
lower-*.f6498.8
Applied rewrites98.8%
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
*-lft-identity98.8
Applied rewrites98.8%
herbie shell --seed 2024219
(FPCore (x)
:name "Rust f64::atanh"
:precision binary64
(* 0.5 (log1p (/ (* 2.0 x) (- 1.0 x)))))