
(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 8 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 (* 0.5 (- (log1p x) (log1p (- 0.0 x)))))
double code(double x) {
return 0.5 * (log1p(x) - log1p((0.0 - x)));
}
public static double code(double x) {
return 0.5 * (Math.log1p(x) - Math.log1p((0.0 - x)));
}
def code(x): return 0.5 * (math.log1p(x) - math.log1p((0.0 - x)))
function code(x) return Float64(0.5 * Float64(log1p(x) - log1p(Float64(0.0 - x)))) end
code[x_] := N[(0.5 * N[(N[Log[1 + x], $MachinePrecision] - N[Log[1 + N[(0.0 - x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(0 - x\right)\right)
\end{array}
Initial program 8.5%
metadata-eval8.5
Applied egg-rr8.5%
log-divN/A
--lowering--.f64N/A
accelerator-lowering-log1p.f64N/A
log-lowering-log.f64N/A
--lowering--.f6421.2
Applied egg-rr21.2%
sub-negN/A
accelerator-lowering-log1p.f64N/A
neg-sub0N/A
--lowering--.f64100.0
Applied egg-rr100.0%
(FPCore (x) :precision binary64 (* x (fma (* x x) (fma x (* x (fma (* x x) 0.14285714285714285 0.2)) 0.3333333333333333) 1.0)))
double code(double x) {
return x * fma((x * x), fma(x, (x * fma((x * x), 0.14285714285714285, 0.2)), 0.3333333333333333), 1.0);
}
function code(x) return Float64(x * fma(Float64(x * x), fma(x, Float64(x * fma(Float64(x * x), 0.14285714285714285, 0.2)), 0.3333333333333333), 1.0)) end
code[x_] := N[(x * N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.14285714285714285 + 0.2), $MachinePrecision]), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x \cdot x, 0.14285714285714285, 0.2\right), 0.3333333333333333\right), 1\right)
\end{array}
Initial program 8.5%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified99.8%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6499.8
Simplified99.8%
(FPCore (x) :precision binary64 (fma (* x (* x (fma x (* x 0.2) 0.3333333333333333))) x x))
double code(double x) {
return fma((x * (x * fma(x, (x * 0.2), 0.3333333333333333))), x, x);
}
function code(x) return fma(Float64(x * Float64(x * fma(x, Float64(x * 0.2), 0.3333333333333333))), x, x) end
code[x_] := N[(N[(x * N[(x * N[(x * N[(x * 0.2), $MachinePrecision] + 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x \cdot \left(x \cdot \mathsf{fma}\left(x, x \cdot 0.2, 0.3333333333333333\right)\right), x, x\right)
\end{array}
Initial program 8.5%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
remove-double-negN/A
+-rgt-identityN/A
distribute-neg-inN/A
remove-double-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6499.6
Simplified99.6%
distribute-rgt-inN/A
+-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
unpow3N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
cube-multN/A
*-lowering-*.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f6499.6
Applied egg-rr99.6%
+-rgt-identityN/A
associate-*r*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-rgt-identityN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (x) :precision binary64 (* x (fma (* x x) (fma x (* x 0.2) 0.3333333333333333) 1.0)))
double code(double x) {
return x * fma((x * x), fma(x, (x * 0.2), 0.3333333333333333), 1.0);
}
function code(x) return Float64(x * fma(Float64(x * x), fma(x, Float64(x * 0.2), 0.3333333333333333), 1.0)) end
code[x_] := N[(x * N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * 0.2), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot 0.2, 0.3333333333333333\right), 1\right)
\end{array}
Initial program 8.5%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
remove-double-negN/A
+-rgt-identityN/A
distribute-neg-inN/A
remove-double-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6499.6
Simplified99.6%
+-rgt-identityN/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
(FPCore (x) :precision binary64 (+ x (* x (* x (* x 0.3333333333333333)))))
double code(double x) {
return x + (x * (x * (x * 0.3333333333333333)));
}
real(8) function code(x)
real(8), intent (in) :: x
code = x + (x * (x * (x * 0.3333333333333333d0)))
end function
public static double code(double x) {
return x + (x * (x * (x * 0.3333333333333333)));
}
def code(x): return x + (x * (x * (x * 0.3333333333333333)))
function code(x) return Float64(x + Float64(x * Float64(x * Float64(x * 0.3333333333333333)))) end
function tmp = code(x) tmp = x + (x * (x * (x * 0.3333333333333333))); end
code[x_] := N[(x + N[(x * N[(x * N[(x * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x + x \cdot \left(x \cdot \left(x \cdot 0.3333333333333333\right)\right)
\end{array}
Initial program 8.5%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
remove-double-negN/A
+-rgt-identityN/A
distribute-neg-inN/A
remove-double-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f6499.4
Simplified99.4%
distribute-rgt-inN/A
*-lft-identityN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f6499.4
Applied egg-rr99.4%
+-rgt-identityN/A
+-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
Final simplification99.4%
(FPCore (x) :precision binary64 (fma (* x (* x 0.3333333333333333)) x x))
double code(double x) {
return fma((x * (x * 0.3333333333333333)), x, x);
}
function code(x) return fma(Float64(x * Float64(x * 0.3333333333333333)), x, x) end
code[x_] := N[(N[(x * N[(x * 0.3333333333333333), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x \cdot \left(x \cdot 0.3333333333333333\right), x, x\right)
\end{array}
Initial program 8.5%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
remove-double-negN/A
+-rgt-identityN/A
distribute-neg-inN/A
remove-double-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6499.6
Simplified99.6%
distribute-rgt-inN/A
+-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
unpow3N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
cube-multN/A
*-lowering-*.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f6499.6
Applied egg-rr99.6%
+-rgt-identityN/A
associate-*r*N/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-rgt-identityN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
Taylor expanded in x around 0
Simplified99.4%
Final simplification99.4%
(FPCore (x) :precision binary64 (* x (fma (* x 0.3333333333333333) x 1.0)))
double code(double x) {
return x * fma((x * 0.3333333333333333), x, 1.0);
}
function code(x) return Float64(x * fma(Float64(x * 0.3333333333333333), x, 1.0)) end
code[x_] := N[(x * N[(N[(x * 0.3333333333333333), $MachinePrecision] * x + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \mathsf{fma}\left(x \cdot 0.3333333333333333, x, 1\right)
\end{array}
Initial program 8.5%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
remove-double-negN/A
+-rgt-identityN/A
distribute-neg-inN/A
remove-double-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f6499.4
Simplified99.4%
+-rgt-identityN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
Final simplification99.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 8.5%
Taylor expanded in x around 0
Simplified98.9%
herbie shell --seed 2024199
(FPCore (x)
:name "Hyperbolic arc-(co)tangent"
:precision binary64
(* (/ 1.0 2.0) (log (/ (+ 1.0 x) (- 1.0 x)))))