
(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 9 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 (* (log1p (/ (fma (* x x) 2.0 (* 2.0 x)) (fma (- x) x 1.0))) 0.5))
double code(double x) {
return log1p((fma((x * x), 2.0, (2.0 * x)) / fma(-x, x, 1.0))) * 0.5;
}
function code(x) return Float64(log1p(Float64(fma(Float64(x * x), 2.0, Float64(2.0 * x)) / fma(Float64(-x), x, 1.0))) * 0.5) end
code[x_] := N[(N[Log[1 + N[(N[(N[(x * x), $MachinePrecision] * 2.0 + N[(2.0 * x), $MachinePrecision]), $MachinePrecision] / N[((-x) * x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{log1p}\left(\frac{\mathsf{fma}\left(x \cdot x, 2, 2 \cdot x\right)}{\mathsf{fma}\left(-x, x, 1\right)}\right) \cdot 0.5
\end{array}
Initial program 100.0%
lift-/.f64N/A
lift--.f64N/A
flip--N/A
associate-/r/N/A
associate-*l/N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt-outN/A
lower-*.f64N/A
*-lft-identityN/A
lower-fma.f64N/A
metadata-evalN/A
sub-negN/A
+-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64100.0
Applied rewrites100.0%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-rgt-inN/A
*-commutativeN/A
lift-*.f64N/A
lower-fma.f64100.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
Final simplification100.0%
(FPCore (x) :precision binary64 (* (log1p (/ (* (fma x x x) 2.0) (fma (- x) x 1.0))) 0.5))
double code(double x) {
return log1p(((fma(x, x, x) * 2.0) / fma(-x, x, 1.0))) * 0.5;
}
function code(x) return Float64(log1p(Float64(Float64(fma(x, x, x) * 2.0) / fma(Float64(-x), x, 1.0))) * 0.5) end
code[x_] := N[(N[Log[1 + N[(N[(N[(x * x + x), $MachinePrecision] * 2.0), $MachinePrecision] / N[((-x) * x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{log1p}\left(\frac{\mathsf{fma}\left(x, x, x\right) \cdot 2}{\mathsf{fma}\left(-x, x, 1\right)}\right) \cdot 0.5
\end{array}
Initial program 100.0%
lift-/.f64N/A
lift--.f64N/A
flip--N/A
associate-/r/N/A
associate-*l/N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt-outN/A
lower-*.f64N/A
*-lft-identityN/A
lower-fma.f64N/A
metadata-evalN/A
sub-negN/A
+-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64100.0
Applied rewrites100.0%
Final simplification100.0%
(FPCore (x) :precision binary64 (* (log1p (/ (* 2.0 x) (- 1.0 x))) 0.5))
double code(double x) {
return log1p(((2.0 * x) / (1.0 - x))) * 0.5;
}
public static double code(double x) {
return Math.log1p(((2.0 * x) / (1.0 - x))) * 0.5;
}
def code(x): return math.log1p(((2.0 * x) / (1.0 - x))) * 0.5
function code(x) return Float64(log1p(Float64(Float64(2.0 * x) / Float64(1.0 - x))) * 0.5) end
code[x_] := N[(N[Log[1 + N[(N[(2.0 * x), $MachinePrecision] / N[(1.0 - x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \cdot 0.5
\end{array}
Initial program 100.0%
Final simplification100.0%
(FPCore (x) :precision binary64 (fma (* (* (fma (fma 0.14285714285714285 (* x x) 0.2) (* x x) 0.3333333333333333) x) x) x x))
double code(double x) {
return fma(((fma(fma(0.14285714285714285, (x * x), 0.2), (x * x), 0.3333333333333333) * x) * x), x, x);
}
function code(x) return fma(Float64(Float64(fma(fma(0.14285714285714285, Float64(x * x), 0.2), Float64(x * x), 0.3333333333333333) * x) * x), x, x) end
code[x_] := N[(N[(N[(N[(N[(0.14285714285714285 * N[(x * x), $MachinePrecision] + 0.2), $MachinePrecision] * N[(x * x), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision] * x + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.14285714285714285, x \cdot x, 0.2\right), x \cdot x, 0.3333333333333333\right) \cdot x\right) \cdot x, x, x\right)
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.4
Applied rewrites99.4%
Applied rewrites99.4%
(FPCore (x) :precision binary64 (* (fma (fma (fma 0.14285714285714285 (* x x) 0.2) (* x x) 0.3333333333333333) (* x x) 1.0) x))
double code(double x) {
return fma(fma(fma(0.14285714285714285, (x * x), 0.2), (x * x), 0.3333333333333333), (x * x), 1.0) * x;
}
function code(x) return Float64(fma(fma(fma(0.14285714285714285, Float64(x * x), 0.2), Float64(x * x), 0.3333333333333333), Float64(x * x), 1.0) * x) end
code[x_] := N[(N[(N[(N[(0.14285714285714285 * N[(x * x), $MachinePrecision] + 0.2), $MachinePrecision] * N[(x * x), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] * x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.14285714285714285, x \cdot x, 0.2\right), x \cdot x, 0.3333333333333333\right), x \cdot x, 1\right) \cdot x
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.4
Applied rewrites99.4%
(FPCore (x) :precision binary64 (* (fma (fma 0.2 (* x x) 0.3333333333333333) (* x x) 1.0) x))
double code(double x) {
return fma(fma(0.2, (x * x), 0.3333333333333333), (x * x), 1.0) * x;
}
function code(x) return Float64(fma(fma(0.2, Float64(x * x), 0.3333333333333333), Float64(x * x), 1.0) * x) end
code[x_] := N[(N[(N[(0.2 * N[(x * x), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] * x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\mathsf{fma}\left(0.2, x \cdot x, 0.3333333333333333\right), x \cdot x, 1\right) \cdot x
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.3
Applied rewrites99.3%
(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(Float64(0.3333333333333333 * Float64(x * x)), x, x) end
code[x_] := N[(N[(0.3333333333333333 * N[(x * x), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(0.3333333333333333 \cdot \left(x \cdot x\right), x, x\right)
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.1
Applied rewrites99.1%
Applied rewrites99.1%
(FPCore (x) :precision binary64 (* (fma (* x x) 0.3333333333333333 1.0) x))
double code(double x) {
return fma((x * x), 0.3333333333333333, 1.0) * x;
}
function code(x) return Float64(fma(Float64(x * x), 0.3333333333333333, 1.0) * x) end
code[x_] := N[(N[(N[(x * x), $MachinePrecision] * 0.3333333333333333 + 1.0), $MachinePrecision] * x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x \cdot x, 0.3333333333333333, 1\right) \cdot x
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.1
Applied rewrites99.1%
(FPCore (x) :precision binary64 (* 1.0 x))
double code(double x) {
return 1.0 * x;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0 * x
end function
public static double code(double x) {
return 1.0 * x;
}
def code(x): return 1.0 * x
function code(x) return Float64(1.0 * x) end
function tmp = code(x) tmp = 1.0 * x; end
code[x_] := N[(1.0 * x), $MachinePrecision]
\begin{array}{l}
\\
1 \cdot x
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.4
Applied rewrites99.4%
Taylor expanded in x around 0
Applied rewrites98.2%
herbie shell --seed 2024235
(FPCore (x)
:name "Rust f64::atanh"
:precision binary64
(* 0.5 (log1p (/ (* 2.0 x) (- 1.0 x)))))