
(FPCore (x) :precision binary64 (- (/ 1.0 (+ x 1.0)) (/ 1.0 x)))
double code(double x) {
return (1.0 / (x + 1.0)) - (1.0 / x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = (1.0d0 / (x + 1.0d0)) - (1.0d0 / x)
end function
public static double code(double x) {
return (1.0 / (x + 1.0)) - (1.0 / x);
}
def code(x): return (1.0 / (x + 1.0)) - (1.0 / x)
function code(x) return Float64(Float64(1.0 / Float64(x + 1.0)) - Float64(1.0 / x)) end
function tmp = code(x) tmp = (1.0 / (x + 1.0)) - (1.0 / x); end
code[x_] := N[(N[(1.0 / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{x + 1} - \frac{1}{x}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 5 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (- (/ 1.0 (+ x 1.0)) (/ 1.0 x)))
double code(double x) {
return (1.0 / (x + 1.0)) - (1.0 / x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = (1.0d0 / (x + 1.0d0)) - (1.0d0 / x)
end function
public static double code(double x) {
return (1.0 / (x + 1.0)) - (1.0 / x);
}
def code(x): return (1.0 / (x + 1.0)) - (1.0 / x)
function code(x) return Float64(Float64(1.0 / Float64(x + 1.0)) - Float64(1.0 / x)) end
function tmp = code(x) tmp = (1.0 / (x + 1.0)) - (1.0 / x); end
code[x_] := N[(N[(1.0 / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{x + 1} - \frac{1}{x}
\end{array}
(FPCore (x) :precision binary64 (/ (/ -1.0 (+ 1.0 x)) x))
double code(double x) {
return (-1.0 / (1.0 + x)) / x;
}
real(8) function code(x)
real(8), intent (in) :: x
code = ((-1.0d0) / (1.0d0 + x)) / x
end function
public static double code(double x) {
return (-1.0 / (1.0 + x)) / x;
}
def code(x): return (-1.0 / (1.0 + x)) / x
function code(x) return Float64(Float64(-1.0 / Float64(1.0 + x)) / x) end
function tmp = code(x) tmp = (-1.0 / (1.0 + x)) / x; end
code[x_] := N[(N[(-1.0 / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{-1}{1 + x}}{x}
\end{array}
Initial program 76.1%
frac-sub77.0%
*-rgt-identity77.0%
metadata-eval77.0%
div-inv77.0%
associate-/r*77.0%
*-un-lft-identity77.0%
*-rgt-identity77.0%
+-commutative77.0%
div-inv77.0%
metadata-eval77.0%
*-rgt-identity77.0%
+-commutative77.0%
Applied egg-rr77.0%
Taylor expanded in x around 0 99.9%
Final simplification99.9%
(FPCore (x) :precision binary64 (if (or (<= x -1.0) (not (<= x 0.76))) (/ -1.0 (* x x)) (+ 1.0 (/ -1.0 x))))
double code(double x) {
double tmp;
if ((x <= -1.0) || !(x <= 0.76)) {
tmp = -1.0 / (x * x);
} else {
tmp = 1.0 + (-1.0 / x);
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: tmp
if ((x <= (-1.0d0)) .or. (.not. (x <= 0.76d0))) then
tmp = (-1.0d0) / (x * x)
else
tmp = 1.0d0 + ((-1.0d0) / x)
end if
code = tmp
end function
public static double code(double x) {
double tmp;
if ((x <= -1.0) || !(x <= 0.76)) {
tmp = -1.0 / (x * x);
} else {
tmp = 1.0 + (-1.0 / x);
}
return tmp;
}
def code(x): tmp = 0 if (x <= -1.0) or not (x <= 0.76): tmp = -1.0 / (x * x) else: tmp = 1.0 + (-1.0 / x) return tmp
function code(x) tmp = 0.0 if ((x <= -1.0) || !(x <= 0.76)) tmp = Float64(-1.0 / Float64(x * x)); else tmp = Float64(1.0 + Float64(-1.0 / x)); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if ((x <= -1.0) || ~((x <= 0.76))) tmp = -1.0 / (x * x); else tmp = 1.0 + (-1.0 / x); end tmp_2 = tmp; end
code[x_] := If[Or[LessEqual[x, -1.0], N[Not[LessEqual[x, 0.76]], $MachinePrecision]], N[(-1.0 / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 0.76\right):\\
\;\;\;\;\frac{-1}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;1 + \frac{-1}{x}\\
\end{array}
\end{array}
if x < -1 or 0.76000000000000001 < x Initial program 57.1%
Taylor expanded in x around inf 95.2%
unpow295.2%
Simplified95.2%
if -1 < x < 0.76000000000000001Initial program 100.0%
Taylor expanded in x around 0 99.3%
Final simplification97.0%
(FPCore (x) :precision binary64 (/ -1.0 (* x (+ 1.0 x))))
double code(double x) {
return -1.0 / (x * (1.0 + x));
}
real(8) function code(x)
real(8), intent (in) :: x
code = (-1.0d0) / (x * (1.0d0 + x))
end function
public static double code(double x) {
return -1.0 / (x * (1.0 + x));
}
def code(x): return -1.0 / (x * (1.0 + x))
function code(x) return Float64(-1.0 / Float64(x * Float64(1.0 + x))) end
function tmp = code(x) tmp = -1.0 / (x * (1.0 + x)); end
code[x_] := N[(-1.0 / N[(x * N[(1.0 + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{-1}{x \cdot \left(1 + x\right)}
\end{array}
Initial program 76.1%
sub-neg76.1%
+-commutative76.1%
distribute-neg-frac76.1%
metadata-eval76.1%
Applied egg-rr76.1%
*-rgt-identity76.1%
cancel-sign-sub76.1%
distribute-neg-frac76.1%
metadata-eval76.1%
*-rgt-identity76.1%
*-inverses76.1%
associate-*r/76.1%
associate-*l/49.5%
associate-/r*49.4%
associate-/l/49.5%
associate-*l/76.1%
associate-*r/76.1%
distribute-lft-out--76.1%
*-inverses76.1%
div-sub77.0%
associate-*l/77.0%
associate-*r/77.0%
*-lft-identity77.0%
associate-/l/77.0%
Simplified98.8%
Final simplification98.8%
(FPCore (x) :precision binary64 (/ (/ -1.0 x) (+ 1.0 x)))
double code(double x) {
return (-1.0 / x) / (1.0 + x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = ((-1.0d0) / x) / (1.0d0 + x)
end function
public static double code(double x) {
return (-1.0 / x) / (1.0 + x);
}
def code(x): return (-1.0 / x) / (1.0 + x)
function code(x) return Float64(Float64(-1.0 / x) / Float64(1.0 + x)) end
function tmp = code(x) tmp = (-1.0 / x) / (1.0 + x); end
code[x_] := N[(N[(-1.0 / x), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{-1}{x}}{1 + x}
\end{array}
Initial program 76.1%
sub-neg76.1%
+-commutative76.1%
distribute-neg-frac76.1%
metadata-eval76.1%
Applied egg-rr76.1%
*-rgt-identity76.1%
cancel-sign-sub76.1%
distribute-neg-frac76.1%
metadata-eval76.1%
*-rgt-identity76.1%
*-inverses76.1%
associate-*r/76.1%
associate-*l/49.5%
associate-/r*49.4%
associate-/l/49.5%
associate-*l/76.1%
associate-*r/76.1%
distribute-lft-out--76.1%
*-inverses76.1%
div-sub77.0%
associate-*l/77.0%
associate-*r/77.0%
*-lft-identity77.0%
associate-/l/77.0%
Simplified98.8%
associate-/r*99.9%
+-commutative99.9%
flip-+98.8%
associate-/r/94.1%
metadata-eval94.1%
Applied egg-rr94.1%
associate-*l/98.8%
associate-/l*98.8%
metadata-eval98.8%
flip-+99.9%
+-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(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}
\\
\frac{-1}{x}
\end{array}
Initial program 76.1%
Taylor expanded in x around 0 46.6%
Final simplification46.6%
herbie shell --seed 2023178
(FPCore (x)
:name "2frac (problem 3.3.1)"
:precision binary64
(- (/ 1.0 (+ x 1.0)) (/ 1.0 x)))