
(FPCore (x) :precision binary64 (/ (- 1.0 (cos x)) (sin x)))
double code(double x) {
return (1.0 - cos(x)) / sin(x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = (1.0d0 - cos(x)) / sin(x)
end function
public static double code(double x) {
return (1.0 - Math.cos(x)) / Math.sin(x);
}
def code(x): return (1.0 - math.cos(x)) / math.sin(x)
function code(x) return Float64(Float64(1.0 - cos(x)) / sin(x)) end
function tmp = code(x) tmp = (1.0 - cos(x)) / sin(x); end
code[x_] := N[(N[(1.0 - N[Cos[x], $MachinePrecision]), $MachinePrecision] / N[Sin[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1 - \cos x}{\sin x}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (/ (- 1.0 (cos x)) (sin x)))
double code(double x) {
return (1.0 - cos(x)) / sin(x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = (1.0d0 - cos(x)) / sin(x)
end function
public static double code(double x) {
return (1.0 - Math.cos(x)) / Math.sin(x);
}
def code(x): return (1.0 - math.cos(x)) / math.sin(x)
function code(x) return Float64(Float64(1.0 - cos(x)) / sin(x)) end
function tmp = code(x) tmp = (1.0 - cos(x)) / sin(x); end
code[x_] := N[(N[(1.0 - N[Cos[x], $MachinePrecision]), $MachinePrecision] / N[Sin[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1 - \cos x}{\sin x}
\end{array}
(FPCore (x) :precision binary64 (tan (/ x 2.0)))
double code(double x) {
return tan((x / 2.0));
}
real(8) function code(x)
real(8), intent (in) :: x
code = tan((x / 2.0d0))
end function
public static double code(double x) {
return Math.tan((x / 2.0));
}
def code(x): return math.tan((x / 2.0))
function code(x) return tan(Float64(x / 2.0)) end
function tmp = code(x) tmp = tan((x / 2.0)); end
code[x_] := N[Tan[N[(x / 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\tan \left(\frac{x}{2}\right)
\end{array}
Initial program 54.6%
hang-p0-tan100.0%
Simplified100.0%
(FPCore (x) :precision binary64 (/ x (+ 1.0 (+ (* x 0.5) 1.0))))
double code(double x) {
return x / (1.0 + ((x * 0.5) + 1.0));
}
real(8) function code(x)
real(8), intent (in) :: x
code = x / (1.0d0 + ((x * 0.5d0) + 1.0d0))
end function
public static double code(double x) {
return x / (1.0 + ((x * 0.5) + 1.0));
}
def code(x): return x / (1.0 + ((x * 0.5) + 1.0))
function code(x) return Float64(x / Float64(1.0 + Float64(Float64(x * 0.5) + 1.0))) end
function tmp = code(x) tmp = x / (1.0 + ((x * 0.5) + 1.0)); end
code[x_] := N[(x / N[(1.0 + N[(N[(x * 0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x}{1 + \left(x \cdot 0.5 + 1\right)}
\end{array}
Initial program 54.6%
hang-p0-tan100.0%
Simplified100.0%
Taylor expanded in x around 0 49.3%
expm1-log1p-u48.5%
expm1-undefine4.8%
flip--4.7%
log1p-undefine4.7%
rem-exp-log4.7%
+-commutative4.7%
log1p-undefine4.7%
rem-exp-log4.7%
+-commutative4.7%
metadata-eval4.7%
log1p-undefine4.7%
rem-exp-log5.5%
+-commutative5.5%
Applied egg-rr5.5%
Taylor expanded in x around 0 52.2%
Final simplification52.2%
(FPCore (x) :precision binary64 (if (<= x 4.0) (* x 0.5) 2.0))
double code(double x) {
double tmp;
if (x <= 4.0) {
tmp = x * 0.5;
} else {
tmp = 2.0;
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: tmp
if (x <= 4.0d0) then
tmp = x * 0.5d0
else
tmp = 2.0d0
end if
code = tmp
end function
public static double code(double x) {
double tmp;
if (x <= 4.0) {
tmp = x * 0.5;
} else {
tmp = 2.0;
}
return tmp;
}
def code(x): tmp = 0 if x <= 4.0: tmp = x * 0.5 else: tmp = 2.0 return tmp
function code(x) tmp = 0.0 if (x <= 4.0) tmp = Float64(x * 0.5); else tmp = 2.0; end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (x <= 4.0) tmp = x * 0.5; else tmp = 2.0; end tmp_2 = tmp; end
code[x_] := If[LessEqual[x, 4.0], N[(x * 0.5), $MachinePrecision], 2.0]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 4:\\
\;\;\;\;x \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;2\\
\end{array}
\end{array}
if x < 4Initial program 38.6%
hang-p0-tan100.0%
Simplified100.0%
Taylor expanded in x around 0 66.0%
if 4 < x Initial program 98.7%
hang-p0-tan100.0%
Simplified100.0%
Taylor expanded in x around 0 3.2%
expm1-log1p-u3.2%
expm1-undefine3.2%
flip--3.1%
log1p-undefine3.1%
rem-exp-log3.1%
+-commutative3.1%
log1p-undefine3.1%
rem-exp-log3.1%
+-commutative3.1%
metadata-eval3.1%
log1p-undefine3.1%
rem-exp-log3.1%
+-commutative3.1%
Applied egg-rr3.1%
Taylor expanded in x around 0 9.0%
Taylor expanded in x around inf 9.0%
Final simplification50.9%
(FPCore (x) :precision binary64 2.0)
double code(double x) {
return 2.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 2.0d0
end function
public static double code(double x) {
return 2.0;
}
def code(x): return 2.0
function code(x) return 2.0 end
function tmp = code(x) tmp = 2.0; end
code[x_] := 2.0
\begin{array}{l}
\\
2
\end{array}
Initial program 54.6%
hang-p0-tan100.0%
Simplified100.0%
Taylor expanded in x around 0 49.3%
expm1-log1p-u48.5%
expm1-undefine4.8%
flip--4.7%
log1p-undefine4.7%
rem-exp-log4.7%
+-commutative4.7%
log1p-undefine4.7%
rem-exp-log4.7%
+-commutative4.7%
metadata-eval4.7%
log1p-undefine4.7%
rem-exp-log5.5%
+-commutative5.5%
Applied egg-rr5.5%
Taylor expanded in x around 0 52.2%
Taylor expanded in x around inf 7.2%
(FPCore (x) :precision binary64 1.0)
double code(double x) {
return 1.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0
end function
public static double code(double x) {
return 1.0;
}
def code(x): return 1.0
function code(x) return 1.0 end
function tmp = code(x) tmp = 1.0; end
code[x_] := 1.0
\begin{array}{l}
\\
1
\end{array}
Initial program 54.6%
hang-p0-tan100.0%
Simplified100.0%
Taylor expanded in x around 0 49.3%
expm1-log1p-u48.5%
expm1-undefine4.8%
flip--4.7%
log1p-undefine4.7%
rem-exp-log4.7%
+-commutative4.7%
log1p-undefine4.7%
rem-exp-log4.7%
+-commutative4.7%
metadata-eval4.7%
log1p-undefine4.7%
rem-exp-log5.5%
+-commutative5.5%
Applied egg-rr5.5%
Taylor expanded in x around 0 8.1%
Taylor expanded in x around inf 7.1%
(FPCore (x) :precision binary64 0.0)
double code(double x) {
return 0.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 0.0d0
end function
public static double code(double x) {
return 0.0;
}
def code(x): return 0.0
function code(x) return 0.0 end
function tmp = code(x) tmp = 0.0; end
code[x_] := 0.0
\begin{array}{l}
\\
0
\end{array}
Initial program 54.6%
hang-p0-tan100.0%
Simplified100.0%
Taylor expanded in x around 0 49.3%
expm1-log1p-u48.5%
expm1-undefine4.8%
log1p-undefine4.8%
rem-exp-log5.6%
+-commutative5.6%
Applied egg-rr5.6%
Taylor expanded in x around 0 4.1%
metadata-eval4.1%
Applied egg-rr4.1%
(FPCore (x) :precision binary64 (tan (/ x 2.0)))
double code(double x) {
return tan((x / 2.0));
}
real(8) function code(x)
real(8), intent (in) :: x
code = tan((x / 2.0d0))
end function
public static double code(double x) {
return Math.tan((x / 2.0));
}
def code(x): return math.tan((x / 2.0))
function code(x) return tan(Float64(x / 2.0)) end
function tmp = code(x) tmp = tan((x / 2.0)); end
code[x_] := N[Tan[N[(x / 2.0), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\tan \left(\frac{x}{2}\right)
\end{array}
herbie shell --seed 2024119
(FPCore (x)
:name "tanhf (example 3.4)"
:precision binary64
:alt
(! :herbie-platform default (tan (/ x 2)))
(/ (- 1.0 (cos x)) (sin x)))