
(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 10 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 (if (<= beta 2e+125) 0.0625 (pow (/ (sqrt i) (/ beta (sqrt (+ i alpha)))) 2.0)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2e+125) {
tmp = 0.0625;
} else {
tmp = pow((sqrt(i) / (beta / sqrt((i + alpha)))), 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) :: tmp
if (beta <= 2d+125) then
tmp = 0.0625d0
else
tmp = (sqrt(i) / (beta / sqrt((i + alpha)))) ** 2.0d0
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 <= 2e+125) {
tmp = 0.0625;
} else {
tmp = Math.pow((Math.sqrt(i) / (beta / Math.sqrt((i + alpha)))), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2e+125: tmp = 0.0625 else: tmp = math.pow((math.sqrt(i) / (beta / math.sqrt((i + alpha)))), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2e+125) tmp = 0.0625; else tmp = Float64(sqrt(i) / Float64(beta / sqrt(Float64(i + alpha)))) ^ 2.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2e+125)
tmp = 0.0625;
else
tmp = (sqrt(i) / (beta / sqrt((i + alpha)))) ^ 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_] := If[LessEqual[beta, 2e+125], 0.0625, N[Power[N[(N[Sqrt[i], $MachinePrecision] / N[(beta / N[Sqrt[N[(i + alpha), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2 \cdot 10^{+125}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\sqrt{i}}{\frac{\beta}{\sqrt{i + \alpha}}}\right)}^{2}\\
\end{array}
\end{array}
if beta < 1.9999999999999998e125Initial program 20.2%
associate-/l/19.1%
associate-*l*19.0%
times-frac27.5%
Simplified27.5%
Taylor expanded in i around inf 81.7%
if 1.9999999999999998e125 < beta Initial program 0.2%
associate-/l/0.0%
associate-*l*0.0%
times-frac2.3%
Simplified2.3%
Taylor expanded in beta around inf 19.2%
associate-/l*21.4%
Simplified21.4%
div-inv21.4%
Applied egg-rr21.4%
+-commutative21.4%
Simplified21.4%
add-sqr-sqrt21.3%
pow221.3%
sqrt-div21.2%
un-div-inv21.2%
sqrt-div21.2%
unpow221.2%
sqrt-prod55.5%
add-sqr-sqrt55.7%
Applied egg-rr55.7%
Final simplification76.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.8e+126) 0.0625 (pow (* (/ (sqrt i) beta) (sqrt (+ i alpha))) 2.0)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.8e+126) {
tmp = 0.0625;
} else {
tmp = pow(((sqrt(i) / beta) * sqrt((i + alpha))), 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) :: tmp
if (beta <= 4.8d+126) then
tmp = 0.0625d0
else
tmp = ((sqrt(i) / beta) * sqrt((i + alpha))) ** 2.0d0
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 <= 4.8e+126) {
tmp = 0.0625;
} else {
tmp = Math.pow(((Math.sqrt(i) / beta) * Math.sqrt((i + alpha))), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 4.8e+126: tmp = 0.0625 else: tmp = math.pow(((math.sqrt(i) / beta) * math.sqrt((i + alpha))), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.8e+126) tmp = 0.0625; else tmp = Float64(Float64(sqrt(i) / beta) * sqrt(Float64(i + alpha))) ^ 2.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4.8e+126)
tmp = 0.0625;
else
tmp = ((sqrt(i) / beta) * sqrt((i + alpha))) ^ 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_] := If[LessEqual[beta, 4.8e+126], 0.0625, N[Power[N[(N[(N[Sqrt[i], $MachinePrecision] / beta), $MachinePrecision] * N[Sqrt[N[(i + alpha), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.8 \cdot 10^{+126}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\sqrt{i}}{\beta} \cdot \sqrt{i + \alpha}\right)}^{2}\\
\end{array}
\end{array}
if beta < 4.80000000000000024e126Initial program 20.2%
associate-/l/19.1%
associate-*l*19.0%
times-frac27.5%
Simplified27.5%
Taylor expanded in i around inf 81.7%
if 4.80000000000000024e126 < beta Initial program 0.2%
associate-/l/0.0%
associate-*l*0.0%
times-frac2.3%
Simplified2.3%
Taylor expanded in beta around inf 19.2%
associate-/l*21.4%
Simplified21.4%
div-inv21.4%
Applied egg-rr21.4%
+-commutative21.4%
Simplified21.4%
add-sqr-sqrt21.3%
sqrt-div21.3%
un-div-inv21.3%
sqrt-div21.3%
unpow221.3%
sqrt-prod21.3%
add-sqr-sqrt21.3%
sqrt-div21.2%
un-div-inv21.2%
sqrt-div21.2%
unpow221.2%
sqrt-prod55.6%
add-sqr-sqrt55.7%
Applied egg-rr55.7%
unpow255.7%
associate-/r/55.7%
+-commutative55.7%
Simplified55.7%
Final simplification76.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.25e+126) 0.0625 (pow (* (sqrt i) (/ (sqrt i) beta)) 2.0)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.25e+126) {
tmp = 0.0625;
} else {
tmp = pow((sqrt(i) * (sqrt(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) :: tmp
if (beta <= 1.25d+126) then
tmp = 0.0625d0
else
tmp = (sqrt(i) * (sqrt(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 tmp;
if (beta <= 1.25e+126) {
tmp = 0.0625;
} else {
tmp = Math.pow((Math.sqrt(i) * (Math.sqrt(i) / beta)), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.25e+126: tmp = 0.0625 else: tmp = math.pow((math.sqrt(i) * (math.sqrt(i) / beta)), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.25e+126) tmp = 0.0625; else tmp = Float64(sqrt(i) * Float64(sqrt(i) / beta)) ^ 2.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.25e+126)
tmp = 0.0625;
else
tmp = (sqrt(i) * (sqrt(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_] := If[LessEqual[beta, 1.25e+126], 0.0625, N[Power[N[(N[Sqrt[i], $MachinePrecision] * N[(N[Sqrt[i], $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.25 \cdot 10^{+126}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;{\left(\sqrt{i} \cdot \frac{\sqrt{i}}{\beta}\right)}^{2}\\
\end{array}
\end{array}
if beta < 1.24999999999999994e126Initial program 20.2%
associate-/l/19.1%
associate-*l*19.0%
times-frac27.5%
Simplified27.5%
Taylor expanded in i around inf 81.7%
if 1.24999999999999994e126 < beta Initial program 0.2%
associate-/l/0.0%
associate-*l*0.0%
times-frac2.3%
Simplified2.3%
Taylor expanded in beta around inf 19.2%
associate-/l*21.4%
Simplified21.4%
Taylor expanded in alpha around 0 21.5%
add-sqr-sqrt21.4%
sqrt-div21.4%
sqrt-div21.4%
unpow221.4%
sqrt-prod21.4%
add-sqr-sqrt21.4%
sqrt-div21.3%
sqrt-div21.3%
unpow221.3%
sqrt-prod49.8%
add-sqr-sqrt49.9%
Applied egg-rr49.9%
unpow249.9%
associate-/r/49.9%
Simplified49.9%
Final simplification75.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7.6e+126) 0.0625 (pow (/ (sqrt i) (/ beta (sqrt i))) 2.0)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.6e+126) {
tmp = 0.0625;
} else {
tmp = pow((sqrt(i) / (beta / sqrt(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) :: tmp
if (beta <= 7.6d+126) then
tmp = 0.0625d0
else
tmp = (sqrt(i) / (beta / sqrt(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 tmp;
if (beta <= 7.6e+126) {
tmp = 0.0625;
} else {
tmp = Math.pow((Math.sqrt(i) / (beta / Math.sqrt(i))), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7.6e+126: tmp = 0.0625 else: tmp = math.pow((math.sqrt(i) / (beta / math.sqrt(i))), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7.6e+126) tmp = 0.0625; else tmp = Float64(sqrt(i) / Float64(beta / sqrt(i))) ^ 2.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 7.6e+126)
tmp = 0.0625;
else
tmp = (sqrt(i) / (beta / sqrt(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_] := If[LessEqual[beta, 7.6e+126], 0.0625, N[Power[N[(N[Sqrt[i], $MachinePrecision] / N[(beta / N[Sqrt[i], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.6 \cdot 10^{+126}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\sqrt{i}}{\frac{\beta}{\sqrt{i}}}\right)}^{2}\\
\end{array}
\end{array}
if beta < 7.60000000000000033e126Initial program 20.2%
associate-/l/19.1%
associate-*l*19.0%
times-frac27.5%
Simplified27.5%
Taylor expanded in i around inf 81.7%
if 7.60000000000000033e126 < beta Initial program 0.2%
associate-/l/0.0%
associate-*l*0.0%
times-frac2.3%
Simplified2.3%
Taylor expanded in beta around inf 19.2%
associate-/l*21.4%
Simplified21.4%
Taylor expanded in alpha around 0 21.5%
add-sqr-sqrt21.4%
pow221.4%
sqrt-div21.3%
sqrt-div21.3%
unpow221.3%
sqrt-prod49.7%
add-sqr-sqrt49.9%
Applied egg-rr49.9%
Final simplification75.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) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ beta alpha))))
(t_3 (* i (+ beta i)))
(t_4 (pow (+ beta (* i 2.0)) 2.0)))
(if (<= (/ (/ (* t_2 (+ t_2 (* beta alpha))) t_1) (+ t_1 -1.0)) INFINITY)
(* (/ t_3 (+ t_4 -1.0)) (/ t_3 t_4))
(+ (+ 0.0625 (* 0.0625 (/ (* beta 2.0) i))) (* -0.125 (/ beta i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double t_3 = i * (beta + i);
double t_4 = pow((beta + (i * 2.0)), 2.0);
double tmp;
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (t_3 / (t_4 + -1.0)) * (t_3 / t_4);
} else {
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i));
}
return tmp;
}
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double t_3 = i * (beta + i);
double t_4 = Math.pow((beta + (i * 2.0)), 2.0);
double tmp;
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= Double.POSITIVE_INFINITY) {
tmp = (t_3 / (t_4 + -1.0)) * (t_3 / t_4);
} else {
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + alpha) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (beta + alpha)) t_3 = i * (beta + i) t_4 = math.pow((beta + (i * 2.0)), 2.0) tmp = 0 if (((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= math.inf: tmp = (t_3 / (t_4 + -1.0)) * (t_3 / t_4) else: tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(beta + alpha))) t_3 = Float64(i * Float64(beta + i)) t_4 = Float64(beta + Float64(i * 2.0)) ^ 2.0 tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(beta * alpha))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(t_3 / Float64(t_4 + -1.0)) * Float64(t_3 / t_4)); else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(beta * 2.0) / i))) + Float64(-0.125 * Float64(beta / i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (beta + alpha));
t_3 = i * (beta + i);
t_4 = (beta + (i * 2.0)) ^ 2.0;
tmp = 0.0;
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= Inf)
tmp = (t_3 / (t_4 + -1.0)) * (t_3 / t_4);
else
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / 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_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(t$95$3 / N[(t$95$4 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$3 / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(N[(beta * 2.0), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\beta + \alpha\right)\right)\\
t_3 := i \cdot \left(\beta + i\right)\\
t_4 := {\left(\beta + i \cdot 2\right)}^{2}\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \beta \cdot \alpha\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\
\;\;\;\;\frac{t\_3}{t\_4 + -1} \cdot \frac{t\_3}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\beta \cdot 2}{i}\right) + -0.125 \cdot \frac{\beta}{i}\\
\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 46.6%
associate-/l/43.9%
times-frac99.8%
Simplified99.8%
Taylor expanded in alpha around 0 94.9%
Taylor expanded in alpha around 0 94.5%
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 72.3%
cancel-sign-sub-inv72.3%
distribute-lft-out72.3%
metadata-eval72.3%
Simplified72.3%
Taylor expanded in alpha around 0 66.8%
associate-*r/66.8%
*-commutative66.8%
Simplified66.8%
Taylor expanded in alpha around 0 68.7%
Final simplification77.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.5e+171) 0.0625 (/ i (pow (/ beta (sqrt (+ i alpha))) 2.0))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.5e+171) {
tmp = 0.0625;
} else {
tmp = i / pow((beta / sqrt((i + alpha))), 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) :: tmp
if (beta <= 2.5d+171) then
tmp = 0.0625d0
else
tmp = i / ((beta / sqrt((i + alpha))) ** 2.0d0)
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 <= 2.5e+171) {
tmp = 0.0625;
} else {
tmp = i / Math.pow((beta / Math.sqrt((i + alpha))), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.5e+171: tmp = 0.0625 else: tmp = i / math.pow((beta / math.sqrt((i + alpha))), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.5e+171) tmp = 0.0625; else tmp = Float64(i / (Float64(beta / sqrt(Float64(i + alpha))) ^ 2.0)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2.5e+171)
tmp = 0.0625;
else
tmp = i / ((beta / sqrt((i + alpha))) ^ 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_] := If[LessEqual[beta, 2.5e+171], 0.0625, N[(i / N[Power[N[(beta / N[Sqrt[N[(i + alpha), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5 \cdot 10^{+171}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{{\left(\frac{\beta}{\sqrt{i + \alpha}}\right)}^{2}}\\
\end{array}
\end{array}
if beta < 2.5000000000000002e171Initial program 19.1%
associate-/l/18.0%
associate-*l*17.9%
times-frac26.4%
Simplified26.4%
Taylor expanded in i around inf 78.9%
if 2.5000000000000002e171 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 11.7%
associate-/l*14.1%
Simplified14.1%
div-inv14.1%
Applied egg-rr14.1%
+-commutative14.1%
Simplified14.1%
add-sqr-sqrt14.1%
pow214.1%
un-div-inv14.1%
sqrt-div14.1%
unpow214.1%
sqrt-prod40.1%
add-sqr-sqrt40.1%
Applied egg-rr40.1%
Final simplification73.7%
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) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ beta alpha))))
(t_3 (/ (/ (* t_2 (+ t_2 (* beta alpha))) t_1) (+ t_1 -1.0))))
(if (<= t_3 0.1)
t_3
(+ (+ 0.0625 (* 0.0625 (/ (* beta 2.0) i))) (* -0.125 (/ beta i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / 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) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_0 = (beta + alpha) + (i * 2.0d0)
t_1 = t_0 * t_0
t_2 = i * (i + (beta + alpha))
t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + (-1.0d0))
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (0.0625d0 + (0.0625d0 * ((beta * 2.0d0) / i))) + ((-0.125d0) * (beta / i))
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) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + alpha) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (beta + alpha)) t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(beta + alpha))) t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(beta * alpha))) / t_1) / Float64(t_1 + -1.0)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(beta * 2.0) / i))) + Float64(-0.125 * Float64(beta / i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (beta + alpha));
t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / 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_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(beta + alpha), $MachinePrecision]), $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[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.0625 + N[(0.0625 * N[(N[(beta * 2.0), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\beta + \alpha\right)\right)\\
t_3 := \frac{\frac{t\_2 \cdot \left(t\_2 + \beta \cdot \alpha\right)}{t\_1}}{t\_1 + -1}\\
\mathbf{if}\;t\_3 \leq 0.1:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\beta \cdot 2}{i}\right) + -0.125 \cdot \frac{\beta}{i}\\
\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.7%
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.7%
associate-/l/0.0%
associate-*l*0.0%
times-frac8.3%
Simplified8.3%
Taylor expanded in i around inf 75.2%
cancel-sign-sub-inv75.2%
distribute-lft-out75.2%
metadata-eval75.2%
Simplified75.2%
Taylor expanded in alpha around 0 70.9%
associate-*r/70.9%
*-commutative70.9%
Simplified70.9%
Taylor expanded in alpha around 0 72.5%
Final simplification76.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (+ (+ 0.0625 (* 0.0625 (/ (* beta 2.0) i))) (* -0.125 (/ beta i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i));
}
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.0625d0 * ((beta * 2.0d0) / i))) + ((-0.125d0) * (beta / i))
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i));
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i))
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(beta * 2.0) / i))) + Float64(-0.125 * Float64(beta / i))) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i));
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.0625 * N[(N[(beta * 2.0), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\left(0.0625 + 0.0625 \cdot \frac{\beta \cdot 2}{i}\right) + -0.125 \cdot \frac{\beta}{i}
\end{array}
Initial program 16.6%
associate-/l/15.6%
associate-*l*15.5%
times-frac22.9%
Simplified22.9%
Taylor expanded in i around inf 77.2%
cancel-sign-sub-inv77.2%
distribute-lft-out77.2%
metadata-eval77.2%
Simplified77.2%
Taylor expanded in alpha around 0 73.5%
associate-*r/73.5%
*-commutative73.5%
Simplified73.5%
Taylor expanded in alpha around 0 74.9%
Final simplification74.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.2e+226) 0.0625 0.0))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.2e+226) {
tmp = 0.0625;
} else {
tmp = 0.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) :: tmp
if (beta <= 3.2d+226) then
tmp = 0.0625d0
else
tmp = 0.0d0
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 <= 3.2e+226) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3.2e+226: tmp = 0.0625 else: tmp = 0.0 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.2e+226) tmp = 0.0625; else tmp = 0.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.2e+226)
tmp = 0.0625;
else
tmp = 0.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_] := If[LessEqual[beta, 3.2e+226], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2 \cdot 10^{+226}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 3.19999999999999977e226Initial program 17.7%
associate-/l/16.7%
associate-*l*16.5%
times-frac24.4%
Simplified24.4%
Taylor expanded in i around inf 76.2%
if 3.19999999999999977e226 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 42.7%
cancel-sign-sub-inv42.7%
distribute-lft-out42.7%
metadata-eval42.7%
Simplified42.7%
Taylor expanded in alpha around 0 42.7%
associate-*r/42.7%
*-commutative42.7%
Simplified42.7%
Taylor expanded in alpha around 0 42.7%
Taylor expanded in i around 0 24.9%
distribute-rgt-out24.9%
metadata-eval24.9%
associate-*l/24.9%
mul0-rgt24.9%
Simplified24.9%
Final simplification73.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0;
}
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.0d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0
\end{array}
Initial program 16.6%
associate-/l/15.6%
associate-*l*15.5%
times-frac22.9%
Simplified22.9%
Taylor expanded in i around inf 77.2%
cancel-sign-sub-inv77.2%
distribute-lft-out77.2%
metadata-eval77.2%
Simplified77.2%
Taylor expanded in alpha around 0 73.5%
associate-*r/73.5%
*-commutative73.5%
Simplified73.5%
Taylor expanded in alpha around 0 74.9%
Taylor expanded in i around 0 7.9%
distribute-rgt-out7.9%
metadata-eval7.9%
associate-*l/7.9%
mul0-rgt7.9%
Simplified7.9%
Final simplification7.9%
herbie shell --seed 2024039
(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)))