
(FPCore (x) :precision binary64 (* (/ 1.0 2.0) (log (/ (+ 1.0 x) (- 1.0 x)))))
double code(double x) {
return (1.0 / 2.0) * log(((1.0 + x) / (1.0 - x)));
}
real(8) function code(x)
real(8), intent (in) :: x
code = (1.0d0 / 2.0d0) * log(((1.0d0 + x) / (1.0d0 - x)))
end function
public static double code(double x) {
return (1.0 / 2.0) * Math.log(((1.0 + x) / (1.0 - x)));
}
def code(x): return (1.0 / 2.0) * math.log(((1.0 + x) / (1.0 - x)))
function code(x) return Float64(Float64(1.0 / 2.0) * log(Float64(Float64(1.0 + x) / Float64(1.0 - x)))) end
function tmp = code(x) tmp = (1.0 / 2.0) * log(((1.0 + x) / (1.0 - x))); end
code[x_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[Log[N[(N[(1.0 + x), $MachinePrecision] / N[(1.0 - x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{2} \cdot \log \left(\frac{1 + x}{1 - x}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (* (/ 1.0 2.0) (log (/ (+ 1.0 x) (- 1.0 x)))))
double code(double x) {
return (1.0 / 2.0) * log(((1.0 + x) / (1.0 - x)));
}
real(8) function code(x)
real(8), intent (in) :: x
code = (1.0d0 / 2.0d0) * log(((1.0d0 + x) / (1.0d0 - x)))
end function
public static double code(double x) {
return (1.0 / 2.0) * Math.log(((1.0 + x) / (1.0 - x)));
}
def code(x): return (1.0 / 2.0) * math.log(((1.0 + x) / (1.0 - x)))
function code(x) return Float64(Float64(1.0 / 2.0) * log(Float64(Float64(1.0 + x) / Float64(1.0 - x)))) end
function tmp = code(x) tmp = (1.0 / 2.0) * log(((1.0 + x) / (1.0 - x))); end
code[x_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[Log[N[(N[(1.0 + x), $MachinePrecision] / N[(1.0 - x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{2} \cdot \log \left(\frac{1 + x}{1 - x}\right)
\end{array}
(FPCore (x) :precision binary64 (* (- (* (log1p x) 2.0) (log1p (* (- x) x))) (/ 1.0 2.0)))
double code(double x) {
return ((log1p(x) * 2.0) - log1p((-x * x))) * (1.0 / 2.0);
}
public static double code(double x) {
return ((Math.log1p(x) * 2.0) - Math.log1p((-x * x))) * (1.0 / 2.0);
}
def code(x): return ((math.log1p(x) * 2.0) - math.log1p((-x * x))) * (1.0 / 2.0)
function code(x) return Float64(Float64(Float64(log1p(x) * 2.0) - log1p(Float64(Float64(-x) * x))) * Float64(1.0 / 2.0)) end
code[x_] := N[(N[(N[(N[Log[1 + x], $MachinePrecision] * 2.0), $MachinePrecision] - N[Log[1 + N[((-x) * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 / 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\mathsf{log1p}\left(x\right) \cdot 2 - \mathsf{log1p}\left(\left(-x\right) \cdot x\right)\right) \cdot \frac{1}{2}
\end{array}
Initial program 9.0%
Applied rewrites100.0%
Final simplification100.0%
(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 9.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.8
Applied rewrites99.8%
(FPCore (x) :precision binary64 (fma (* (* (fma 0.2 (* x x) 0.3333333333333333) x) x) x x))
double code(double x) {
return fma(((fma(0.2, (x * x), 0.3333333333333333) * x) * x), x, x);
}
function code(x) return fma(Float64(Float64(fma(0.2, Float64(x * x), 0.3333333333333333) * x) * x), x, x) end
code[x_] := N[(N[(N[(N[(0.2 * N[(x * x), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision] * x + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\left(\mathsf{fma}\left(0.2, x \cdot x, 0.3333333333333333\right) \cdot x\right) \cdot x, x, x\right)
\end{array}
Initial program 9.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.7
Applied rewrites99.7%
Applied rewrites99.7%
(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 9.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.7
Applied rewrites99.7%
(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 9.0%
Taylor expanded in x around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.5
Applied rewrites99.5%
Applied rewrites99.5%
(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 9.0%
Taylor expanded in x around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.5
Applied rewrites99.5%
(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 9.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.8
Applied rewrites99.8%
Taylor expanded in x around 0
Applied rewrites98.9%
herbie shell --seed 2024240
(FPCore (x)
:name "Hyperbolic arc-(co)tangent"
:precision binary64
(* (/ 1.0 2.0) (log (/ (+ 1.0 x) (- 1.0 x)))))