
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t_1 \cdot t_1\\
\frac{\frac{t_0 \cdot \left(\beta \cdot \alpha + t_0\right)}{t_2}}{t_2 - 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t_1 \cdot t_1\\
\frac{\frac{t_0 \cdot \left(\beta \cdot \alpha + t_0\right)}{t_2}}{t_2 - 1}
\end{array}
\end{array}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) (* 2.0 i)))
(t_1
(- (* 0.25 (+ (* alpha 2.0) (* beta 2.0))) (* (+ beta alpha) 0.25))))
(if (<= beta 1.32e+77)
(-
(+
0.0625
(-
(* 0.25 (/ t_1 i))
(/
(+
(* 0.015625 (+ -1.0 (pow (+ beta alpha) 2.0)))
(* (+ beta alpha) (- (* 0.25 t_1) (* 0.0625 (+ beta alpha)))))
(pow i 2.0))))
(* 0.0625 (/ (+ beta alpha) i)))
(if (<= beta 1.8e+109)
(/
(* i (/ i (/ (pow (+ beta (* 2.0 i)) 2.0) (pow (+ beta i) 2.0))))
(+ -1.0 (* t_0 t_0)))
(if (<= beta 3.6e+206)
(+ (+ 0.0625 (* 0.125 (/ beta i))) (* (/ beta i) -0.125))
(pow (* (/ (sqrt i) beta) (sqrt (+ alpha i))) 2.0))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (2.0 * i);
double t_1 = (0.25 * ((alpha * 2.0) + (beta * 2.0))) - ((beta + alpha) * 0.25);
double tmp;
if (beta <= 1.32e+77) {
tmp = (0.0625 + ((0.25 * (t_1 / i)) - (((0.015625 * (-1.0 + pow((beta + alpha), 2.0))) + ((beta + alpha) * ((0.25 * t_1) - (0.0625 * (beta + alpha))))) / pow(i, 2.0)))) - (0.0625 * ((beta + alpha) / i));
} else if (beta <= 1.8e+109) {
tmp = (i * (i / (pow((beta + (2.0 * i)), 2.0) / pow((beta + i), 2.0)))) / (-1.0 + (t_0 * t_0));
} else if (beta <= 3.6e+206) {
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
} else {
tmp = pow(((sqrt(i) / beta) * sqrt((alpha + i))), 2.0);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (beta + alpha) + (2.0d0 * i)
t_1 = (0.25d0 * ((alpha * 2.0d0) + (beta * 2.0d0))) - ((beta + alpha) * 0.25d0)
if (beta <= 1.32d+77) then
tmp = (0.0625d0 + ((0.25d0 * (t_1 / i)) - (((0.015625d0 * ((-1.0d0) + ((beta + alpha) ** 2.0d0))) + ((beta + alpha) * ((0.25d0 * t_1) - (0.0625d0 * (beta + alpha))))) / (i ** 2.0d0)))) - (0.0625d0 * ((beta + alpha) / i))
else if (beta <= 1.8d+109) then
tmp = (i * (i / (((beta + (2.0d0 * i)) ** 2.0d0) / ((beta + i) ** 2.0d0)))) / ((-1.0d0) + (t_0 * t_0))
else if (beta <= 3.6d+206) then
tmp = (0.0625d0 + (0.125d0 * (beta / i))) + ((beta / i) * (-0.125d0))
else
tmp = ((sqrt(i) / beta) * sqrt((alpha + i))) ** 2.0d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (2.0 * i);
double t_1 = (0.25 * ((alpha * 2.0) + (beta * 2.0))) - ((beta + alpha) * 0.25);
double tmp;
if (beta <= 1.32e+77) {
tmp = (0.0625 + ((0.25 * (t_1 / i)) - (((0.015625 * (-1.0 + Math.pow((beta + alpha), 2.0))) + ((beta + alpha) * ((0.25 * t_1) - (0.0625 * (beta + alpha))))) / Math.pow(i, 2.0)))) - (0.0625 * ((beta + alpha) / i));
} else if (beta <= 1.8e+109) {
tmp = (i * (i / (Math.pow((beta + (2.0 * i)), 2.0) / Math.pow((beta + i), 2.0)))) / (-1.0 + (t_0 * t_0));
} else if (beta <= 3.6e+206) {
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
} else {
tmp = Math.pow(((Math.sqrt(i) / beta) * Math.sqrt((alpha + i))), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + alpha) + (2.0 * i) t_1 = (0.25 * ((alpha * 2.0) + (beta * 2.0))) - ((beta + alpha) * 0.25) tmp = 0 if beta <= 1.32e+77: tmp = (0.0625 + ((0.25 * (t_1 / i)) - (((0.015625 * (-1.0 + math.pow((beta + alpha), 2.0))) + ((beta + alpha) * ((0.25 * t_1) - (0.0625 * (beta + alpha))))) / math.pow(i, 2.0)))) - (0.0625 * ((beta + alpha) / i)) elif beta <= 1.8e+109: tmp = (i * (i / (math.pow((beta + (2.0 * i)), 2.0) / math.pow((beta + i), 2.0)))) / (-1.0 + (t_0 * t_0)) elif beta <= 3.6e+206: tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125) else: tmp = math.pow(((math.sqrt(i) / beta) * math.sqrt((alpha + i))), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(2.0 * i)) t_1 = Float64(Float64(0.25 * Float64(Float64(alpha * 2.0) + Float64(beta * 2.0))) - Float64(Float64(beta + alpha) * 0.25)) tmp = 0.0 if (beta <= 1.32e+77) tmp = Float64(Float64(0.0625 + Float64(Float64(0.25 * Float64(t_1 / i)) - Float64(Float64(Float64(0.015625 * Float64(-1.0 + (Float64(beta + alpha) ^ 2.0))) + Float64(Float64(beta + alpha) * Float64(Float64(0.25 * t_1) - Float64(0.0625 * Float64(beta + alpha))))) / (i ^ 2.0)))) - Float64(0.0625 * Float64(Float64(beta + alpha) / i))); elseif (beta <= 1.8e+109) tmp = Float64(Float64(i * Float64(i / Float64((Float64(beta + Float64(2.0 * i)) ^ 2.0) / (Float64(beta + i) ^ 2.0)))) / Float64(-1.0 + Float64(t_0 * t_0))); elseif (beta <= 3.6e+206) tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) + Float64(Float64(beta / i) * -0.125)); else tmp = Float64(Float64(sqrt(i) / beta) * sqrt(Float64(alpha + i))) ^ 2.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (2.0 * i);
t_1 = (0.25 * ((alpha * 2.0) + (beta * 2.0))) - ((beta + alpha) * 0.25);
tmp = 0.0;
if (beta <= 1.32e+77)
tmp = (0.0625 + ((0.25 * (t_1 / i)) - (((0.015625 * (-1.0 + ((beta + alpha) ^ 2.0))) + ((beta + alpha) * ((0.25 * t_1) - (0.0625 * (beta + alpha))))) / (i ^ 2.0)))) - (0.0625 * ((beta + alpha) / i));
elseif (beta <= 1.8e+109)
tmp = (i * (i / (((beta + (2.0 * i)) ^ 2.0) / ((beta + i) ^ 2.0)))) / (-1.0 + (t_0 * t_0));
elseif (beta <= 3.6e+206)
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
else
tmp = ((sqrt(i) / beta) * sqrt((alpha + i))) ^ 2.0;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(0.25 * N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(beta + alpha), $MachinePrecision] * 0.25), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.32e+77], N[(N[(0.0625 + N[(N[(0.25 * N[(t$95$1 / i), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(0.015625 * N[(-1.0 + N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(beta + alpha), $MachinePrecision] * N[(N[(0.25 * t$95$1), $MachinePrecision] - N[(0.0625 * N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Power[i, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.8e+109], N[(N[(i * N[(i / N[(N[Power[N[(beta + N[(2.0 * i), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[Power[N[(beta + i), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-1.0 + N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.6e+206], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(beta / i), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(N[Sqrt[i], $MachinePrecision] / beta), $MachinePrecision] * N[Sqrt[N[(alpha + i), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2 \cdot i\\
t_1 := 0.25 \cdot \left(\alpha \cdot 2 + \beta \cdot 2\right) - \left(\beta + \alpha\right) \cdot 0.25\\
\mathbf{if}\;\beta \leq 1.32 \cdot 10^{+77}:\\
\;\;\;\;\left(0.0625 + \left(0.25 \cdot \frac{t_1}{i} - \frac{0.015625 \cdot \left(-1 + {\left(\beta + \alpha\right)}^{2}\right) + \left(\beta + \alpha\right) \cdot \left(0.25 \cdot t_1 - 0.0625 \cdot \left(\beta + \alpha\right)\right)}{{i}^{2}}\right)\right) - 0.0625 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{elif}\;\beta \leq 1.8 \cdot 10^{+109}:\\
\;\;\;\;\frac{i \cdot \frac{i}{\frac{{\left(\beta + 2 \cdot i\right)}^{2}}{{\left(\beta + i\right)}^{2}}}}{-1 + t_0 \cdot t_0}\\
\mathbf{elif}\;\beta \leq 3.6 \cdot 10^{+206}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) + \frac{\beta}{i} \cdot -0.125\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\sqrt{i}}{\beta} \cdot \sqrt{\alpha + i}\right)}^{2}\\
\end{array}
\end{array}
if beta < 1.32e77Initial program 18.2%
Taylor expanded in i around inf 35.0%
Taylor expanded in i around inf 79.0%
if 1.32e77 < beta < 1.8e109Initial program 31.4%
Applied egg-rr29.6%
expm1-def29.6%
expm1-log1p31.4%
associate-*r*53.2%
associate-*l*60.9%
+-commutative60.9%
+-commutative60.9%
*-commutative60.9%
+-commutative60.9%
+-commutative60.9%
+-commutative60.9%
Simplified60.9%
Taylor expanded in alpha around 0 53.5%
associate-/l*61.1%
*-commutative61.1%
+-commutative61.1%
Simplified61.1%
if 1.8e109 < beta < 3.60000000000000028e206Initial program 0.4%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.4%
Simplified0.4%
Taylor expanded in i around inf 63.0%
cancel-sign-sub-inv63.0%
distribute-lft-out63.0%
metadata-eval63.0%
Simplified63.0%
Taylor expanded in alpha around 0 59.2%
associate-*r/59.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in beta around 0 59.2%
Taylor expanded in alpha around 0 63.0%
if 3.60000000000000028e206 < beta Initial program 0.0%
Taylor expanded in beta around inf 34.2%
Taylor expanded in beta around inf 34.2%
associate-/l*35.8%
+-commutative35.8%
Simplified35.8%
add-sqr-sqrt35.8%
pow235.8%
associate-/r/35.8%
Applied egg-rr35.8%
sqrt-prod35.8%
sqrt-div35.8%
unpow235.8%
sqrt-prod81.3%
add-sqr-sqrt81.3%
Applied egg-rr81.3%
Final simplification76.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) (* 2.0 i)))
(t_1 (* t_0 t_0))
(t_2 (+ -1.0 t_1))
(t_3 (* i (+ (+ beta alpha) i))))
(if (<= (/ (/ (* t_3 (+ t_3 (* beta alpha))) t_1) t_2) INFINITY)
(/ (* i (/ i (/ (pow (+ beta (* 2.0 i)) 2.0) (pow (+ beta i) 2.0)))) t_2)
(+ (+ 0.0625 (* 0.125 (/ beta i))) (* (/ beta i) -0.125)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = -1.0 + t_1;
double t_3 = i * ((beta + alpha) + i);
double tmp;
if ((((t_3 * (t_3 + (beta * alpha))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (i * (i / (pow((beta + (2.0 * i)), 2.0) / pow((beta + i), 2.0)))) / t_2;
} else {
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
}
return tmp;
}
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = -1.0 + t_1;
double t_3 = i * ((beta + alpha) + i);
double tmp;
if ((((t_3 * (t_3 + (beta * alpha))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
tmp = (i * (i / (Math.pow((beta + (2.0 * i)), 2.0) / Math.pow((beta + i), 2.0)))) / t_2;
} else {
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + alpha) + (2.0 * i) t_1 = t_0 * t_0 t_2 = -1.0 + t_1 t_3 = i * ((beta + alpha) + i) tmp = 0 if (((t_3 * (t_3 + (beta * alpha))) / t_1) / t_2) <= math.inf: tmp = (i * (i / (math.pow((beta + (2.0 * i)), 2.0) / math.pow((beta + i), 2.0)))) / t_2 else: tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(2.0 * i)) t_1 = Float64(t_0 * t_0) t_2 = Float64(-1.0 + t_1) t_3 = Float64(i * Float64(Float64(beta + alpha) + i)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(beta * alpha))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(i * Float64(i / Float64((Float64(beta + Float64(2.0 * i)) ^ 2.0) / (Float64(beta + i) ^ 2.0)))) / t_2); else tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) + Float64(Float64(beta / i) * -0.125)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (2.0 * i);
t_1 = t_0 * t_0;
t_2 = -1.0 + t_1;
t_3 = i * ((beta + alpha) + i);
tmp = 0.0;
if ((((t_3 * (t_3 + (beta * alpha))) / t_1) / t_2) <= Inf)
tmp = (i * (i / (((beta + (2.0 * i)) ^ 2.0) / ((beta + i) ^ 2.0)))) / t_2;
else
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(-1.0 + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(i * N[(i / N[(N[Power[N[(beta + N[(2.0 * i), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[Power[N[(beta + i), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(beta / i), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2 \cdot i\\
t_1 := t_0 \cdot t_0\\
t_2 := -1 + t_1\\
t_3 := i \cdot \left(\left(\beta + \alpha\right) + i\right)\\
\mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \beta \cdot \alpha\right)}{t_1}}{t_2} \leq \infty:\\
\;\;\;\;\frac{i \cdot \frac{i}{\frac{{\left(\beta + 2 \cdot i\right)}^{2}}{{\left(\beta + i\right)}^{2}}}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) + \frac{\beta}{i} \cdot -0.125\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 44.9%
Applied egg-rr42.0%
expm1-def42.0%
expm1-log1p44.7%
associate-*r*66.9%
associate-*l*99.3%
+-commutative99.3%
+-commutative99.3%
*-commutative99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in alpha around 0 60.4%
associate-/l*91.1%
*-commutative91.1%
+-commutative91.1%
Simplified91.1%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 75.7%
cancel-sign-sub-inv75.7%
distribute-lft-out75.7%
metadata-eval75.7%
Simplified75.7%
Taylor expanded in alpha around 0 73.0%
associate-*r/72.4%
*-commutative72.4%
Simplified72.4%
Taylor expanded in beta around 0 73.0%
Taylor expanded in alpha around 0 74.4%
Final simplification79.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) (* 2.0 i))))
(if (<= beta 1.1e+95)
0.0625
(if (<= beta 5.2e+108)
(/
(*
i
(+
(+ alpha i)
(/
(+
(+ (* i (+ alpha i)) (* (+ alpha i) (+ alpha i)))
(* -2.0 (* (+ alpha i) (+ alpha (* 2.0 i)))))
beta)))
(+ -1.0 (* t_0 t_0)))
(if (<= beta 3.6e+206)
(+ (+ 0.0625 (* 0.125 (/ beta i))) (* (/ beta i) -0.125))
(pow (/ i beta) 2.0))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (2.0 * i);
double tmp;
if (beta <= 1.1e+95) {
tmp = 0.0625;
} else if (beta <= 5.2e+108) {
tmp = (i * ((alpha + i) + ((((i * (alpha + i)) + ((alpha + i) * (alpha + i))) + (-2.0 * ((alpha + i) * (alpha + (2.0 * i))))) / beta))) / (-1.0 + (t_0 * t_0));
} else if (beta <= 3.6e+206) {
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
} else {
tmp = pow((i / beta), 2.0);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + alpha) + (2.0d0 * i)
if (beta <= 1.1d+95) then
tmp = 0.0625d0
else if (beta <= 5.2d+108) then
tmp = (i * ((alpha + i) + ((((i * (alpha + i)) + ((alpha + i) * (alpha + i))) + ((-2.0d0) * ((alpha + i) * (alpha + (2.0d0 * i))))) / beta))) / ((-1.0d0) + (t_0 * t_0))
else if (beta <= 3.6d+206) then
tmp = (0.0625d0 + (0.125d0 * (beta / i))) + ((beta / i) * (-0.125d0))
else
tmp = (i / beta) ** 2.0d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (2.0 * i);
double tmp;
if (beta <= 1.1e+95) {
tmp = 0.0625;
} else if (beta <= 5.2e+108) {
tmp = (i * ((alpha + i) + ((((i * (alpha + i)) + ((alpha + i) * (alpha + i))) + (-2.0 * ((alpha + i) * (alpha + (2.0 * i))))) / beta))) / (-1.0 + (t_0 * t_0));
} else if (beta <= 3.6e+206) {
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
} else {
tmp = Math.pow((i / beta), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + alpha) + (2.0 * i) tmp = 0 if beta <= 1.1e+95: tmp = 0.0625 elif beta <= 5.2e+108: tmp = (i * ((alpha + i) + ((((i * (alpha + i)) + ((alpha + i) * (alpha + i))) + (-2.0 * ((alpha + i) * (alpha + (2.0 * i))))) / beta))) / (-1.0 + (t_0 * t_0)) elif beta <= 3.6e+206: tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125) else: tmp = math.pow((i / beta), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(2.0 * i)) tmp = 0.0 if (beta <= 1.1e+95) tmp = 0.0625; elseif (beta <= 5.2e+108) tmp = Float64(Float64(i * Float64(Float64(alpha + i) + Float64(Float64(Float64(Float64(i * Float64(alpha + i)) + Float64(Float64(alpha + i) * Float64(alpha + i))) + Float64(-2.0 * Float64(Float64(alpha + i) * Float64(alpha + Float64(2.0 * i))))) / beta))) / Float64(-1.0 + Float64(t_0 * t_0))); elseif (beta <= 3.6e+206) tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) + Float64(Float64(beta / i) * -0.125)); else tmp = Float64(i / beta) ^ 2.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (2.0 * i);
tmp = 0.0;
if (beta <= 1.1e+95)
tmp = 0.0625;
elseif (beta <= 5.2e+108)
tmp = (i * ((alpha + i) + ((((i * (alpha + i)) + ((alpha + i) * (alpha + i))) + (-2.0 * ((alpha + i) * (alpha + (2.0 * i))))) / beta))) / (-1.0 + (t_0 * t_0));
elseif (beta <= 3.6e+206)
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
else
tmp = (i / beta) ^ 2.0;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.1e+95], 0.0625, If[LessEqual[beta, 5.2e+108], N[(N[(i * N[(N[(alpha + i), $MachinePrecision] + N[(N[(N[(N[(i * N[(alpha + i), $MachinePrecision]), $MachinePrecision] + N[(N[(alpha + i), $MachinePrecision] * N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[(N[(alpha + i), $MachinePrecision] * N[(alpha + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-1.0 + N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.6e+206], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(beta / i), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision], N[Power[N[(i / beta), $MachinePrecision], 2.0], $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2 \cdot i\\
\mathbf{if}\;\beta \leq 1.1 \cdot 10^{+95}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 5.2 \cdot 10^{+108}:\\
\;\;\;\;\frac{i \cdot \left(\left(\alpha + i\right) + \frac{\left(i \cdot \left(\alpha + i\right) + \left(\alpha + i\right) \cdot \left(\alpha + i\right)\right) + -2 \cdot \left(\left(\alpha + i\right) \cdot \left(\alpha + 2 \cdot i\right)\right)}{\beta}\right)}{-1 + t_0 \cdot t_0}\\
\mathbf{elif}\;\beta \leq 3.6 \cdot 10^{+206}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) + \frac{\beta}{i} \cdot -0.125\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{i}{\beta}\right)}^{2}\\
\end{array}
\end{array}
if beta < 1.0999999999999999e95Initial program 18.7%
associate-/l/16.0%
associate-*l*16.0%
times-frac27.3%
Simplified27.3%
Taylor expanded in i around inf 81.5%
if 1.0999999999999999e95 < beta < 5.2000000000000005e108Initial program 29.6%
Applied egg-rr28.8%
expm1-def28.9%
expm1-log1p29.6%
associate-*r*56.8%
associate-*l*70.6%
+-commutative70.6%
+-commutative70.6%
*-commutative70.6%
+-commutative70.6%
+-commutative70.6%
+-commutative70.6%
Simplified70.6%
Taylor expanded in beta around -inf 57.1%
mul-1-neg57.1%
unsub-neg57.1%
mul-1-neg57.1%
+-commutative57.1%
mul-1-neg57.1%
unsub-neg57.1%
mul-1-neg57.1%
Simplified57.1%
if 5.2000000000000005e108 < beta < 3.60000000000000028e206Initial program 0.4%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.4%
Simplified0.4%
Taylor expanded in i around inf 63.0%
cancel-sign-sub-inv63.0%
distribute-lft-out63.0%
metadata-eval63.0%
Simplified63.0%
Taylor expanded in alpha around 0 59.2%
associate-*r/59.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in beta around 0 59.2%
Taylor expanded in alpha around 0 63.0%
if 3.60000000000000028e206 < beta Initial program 0.0%
Taylor expanded in beta around inf 34.2%
Taylor expanded in beta around inf 34.2%
associate-/l*35.8%
+-commutative35.8%
Simplified35.8%
add-sqr-sqrt35.8%
pow235.8%
associate-/r/35.8%
Applied egg-rr35.8%
Taylor expanded in i around inf 77.5%
Final simplification78.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) (* 2.0 i)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ (+ beta alpha) i)))
(t_3 (/ (/ (* t_2 (+ t_2 (* beta alpha))) t_1) (+ -1.0 t_1))))
(if (<= t_3 0.1)
t_3
(+ (+ 0.0625 (* 0.125 (/ beta i))) (* (/ beta i) -0.125)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = i * ((beta + alpha) + i);
double t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (-1.0 + t_1);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_0 = (beta + alpha) + (2.0d0 * i)
t_1 = t_0 * t_0
t_2 = i * ((beta + alpha) + i)
t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / ((-1.0d0) + t_1)
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (0.0625d0 + (0.125d0 * (beta / i))) + ((beta / i) * (-0.125d0))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (2.0 * i);
double t_1 = t_0 * t_0;
double t_2 = i * ((beta + alpha) + i);
double t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (-1.0 + t_1);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + alpha) + (2.0 * i) t_1 = t_0 * t_0 t_2 = i * ((beta + alpha) + i) t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (-1.0 + t_1) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(2.0 * i)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(Float64(beta + alpha) + i)) t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(beta * alpha))) / t_1) / Float64(-1.0 + t_1)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) + Float64(Float64(beta / i) * -0.125)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (2.0 * i);
t_1 = t_0 * t_0;
t_2 = i * ((beta + alpha) + i);
t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (-1.0 + t_1);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 * N[(t$95$2 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(-1.0 + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(beta / i), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2 \cdot i\\
t_1 := t_0 \cdot t_0\\
t_2 := i \cdot \left(\left(\beta + \alpha\right) + i\right)\\
t_3 := \frac{\frac{t_2 \cdot \left(t_2 + \beta \cdot \alpha\right)}{t_1}}{-1 + t_1}\\
\mathbf{if}\;t_3 \leq 0.1:\\
\;\;\;\;t_3\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) + \frac{\beta}{i} \cdot -0.125\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < 0.10000000000000001Initial program 99.6%
if 0.10000000000000001 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.6%
associate-/l/0.0%
associate-*l*0.0%
times-frac8.9%
Simplified8.9%
Taylor expanded in i around inf 75.5%
cancel-sign-sub-inv75.5%
distribute-lft-out75.5%
metadata-eval75.5%
Simplified75.5%
Taylor expanded in alpha around 0 73.2%
associate-*r/72.8%
*-commutative72.8%
Simplified72.8%
Taylor expanded in beta around 0 73.2%
Taylor expanded in alpha around 0 74.5%
Final simplification78.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (+ (+ 0.0625 (* 0.125 (/ beta i))) (* (/ beta i) -0.125)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = (0.0625d0 + (0.125d0 * (beta / i))) + ((beta / i) * (-0.125d0))
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125)
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) + Float64(Float64(beta / i) * -0.125)) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (0.0625 + (0.125 * (beta / i))) + ((beta / i) * -0.125);
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(beta / i), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) + \frac{\beta}{i} \cdot -0.125
\end{array}
Initial program 14.6%
associate-/l/11.8%
associate-*l*11.8%
times-frac21.6%
Simplified21.6%
Taylor expanded in i around inf 75.4%
cancel-sign-sub-inv75.4%
distribute-lft-out75.4%
metadata-eval75.4%
Simplified75.4%
Taylor expanded in alpha around 0 73.4%
associate-*r/73.0%
*-commutative73.0%
Simplified73.0%
Taylor expanded in beta around 0 73.4%
Taylor expanded in alpha around 0 74.6%
Final simplification74.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1e+256) 0.0625 (/ (* (+ beta alpha) 0.0) i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1e+256) {
tmp = 0.0625;
} else {
tmp = ((beta + alpha) * 0.0) / i;
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1d+256) then
tmp = 0.0625d0
else
tmp = ((beta + alpha) * 0.0d0) / i
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1e+256) {
tmp = 0.0625;
} else {
tmp = ((beta + alpha) * 0.0) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1e+256: tmp = 0.0625 else: tmp = ((beta + alpha) * 0.0) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1e+256) tmp = 0.0625; else tmp = Float64(Float64(Float64(beta + alpha) * 0.0) / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1e+256)
tmp = 0.0625;
else
tmp = ((beta + alpha) * 0.0) / i;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1e+256], 0.0625, N[(N[(N[(beta + alpha), $MachinePrecision] * 0.0), $MachinePrecision] / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10^{+256}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\beta + \alpha\right) \cdot 0}{i}\\
\end{array}
\end{array}
if beta < 1e256Initial program 15.3%
associate-/l/12.4%
associate-*l*12.4%
times-frac22.8%
Simplified22.8%
Taylor expanded in i around inf 74.3%
if 1e256 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 56.8%
cancel-sign-sub-inv56.8%
distribute-lft-out56.8%
metadata-eval56.8%
Simplified56.8%
Taylor expanded in i around 0 64.4%
distribute-rgt-out64.4%
+-commutative64.4%
metadata-eval64.4%
Simplified64.4%
Final simplification73.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 14.6%
associate-/l/11.8%
associate-*l*11.8%
times-frac21.6%
Simplified21.6%
Taylor expanded in i around inf 70.7%
Final simplification70.7%
herbie shell --seed 2023321
(FPCore (alpha beta i)
:name "Octave 3.8, jcobi/4"
:precision binary64
:pre (and (and (> alpha -1.0) (> beta -1.0)) (> i 1.0))
(/ (/ (* (* i (+ (+ alpha beta) i)) (+ (* beta alpha) (* i (+ (+ alpha beta) i)))) (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i)))) (- (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i))) 1.0)))