
(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 and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 6.8e+132) 0.0625 (/ (/ (+ i alpha) beta) (/ beta i))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6.8e+132) {
tmp = 0.0625;
} else {
tmp = ((i + alpha) / beta) / (beta / i);
}
return tmp;
}
NOTE: alpha and beta 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 <= 6.8d+132) then
tmp = 0.0625d0
else
tmp = ((i + alpha) / beta) / (beta / i)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6.8e+132) {
tmp = 0.0625;
} else {
tmp = ((i + alpha) / beta) / (beta / i);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 6.8e+132: tmp = 0.0625 else: tmp = ((i + alpha) / beta) / (beta / i) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 6.8e+132) tmp = 0.0625; else tmp = Float64(Float64(Float64(i + alpha) / beta) / Float64(beta / i)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 6.8e+132)
tmp = 0.0625;
else
tmp = ((i + alpha) / beta) / (beta / i);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 6.8e+132], 0.0625, N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.8 \cdot 10^{+132}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i + \alpha}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 6.80000000000000051e132Initial program 22.6%
associate-/l/21.6%
associate-*l*21.5%
times-frac27.6%
Simplified41.8%
Taylor expanded in i around inf 77.2%
if 6.80000000000000051e132 < beta Initial program 0.2%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.2%
Simplified15.2%
Taylor expanded in beta around inf 28.5%
*-commutative28.5%
associate-/l*30.1%
+-commutative30.1%
unpow230.1%
Simplified30.1%
div-inv30.1%
associate-/l*46.7%
Applied egg-rr46.7%
add-cbrt-cube34.8%
un-div-inv34.9%
+-commutative34.9%
div-inv34.9%
clear-num34.9%
un-div-inv34.8%
+-commutative34.8%
div-inv34.8%
clear-num34.8%
un-div-inv34.9%
+-commutative34.9%
div-inv34.9%
clear-num34.9%
Applied egg-rr34.9%
add-cbrt-cube46.8%
associate-/r*70.0%
Applied egg-rr70.0%
Final simplification75.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 5.8e+132)
0.0625
(if (<= beta 2.6e+165)
(* (+ i alpha) (/ (/ i beta) beta))
(if (<= beta 9e+168) 0.0625 (* (/ i beta) (/ i beta))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.8e+132) {
tmp = 0.0625;
} else if (beta <= 2.6e+165) {
tmp = (i + alpha) * ((i / beta) / beta);
} else if (beta <= 9e+168) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha and beta 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 <= 5.8d+132) then
tmp = 0.0625d0
else if (beta <= 2.6d+165) then
tmp = (i + alpha) * ((i / beta) / beta)
else if (beta <= 9d+168) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.8e+132) {
tmp = 0.0625;
} else if (beta <= 2.6e+165) {
tmp = (i + alpha) * ((i / beta) / beta);
} else if (beta <= 9e+168) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 5.8e+132: tmp = 0.0625 elif beta <= 2.6e+165: tmp = (i + alpha) * ((i / beta) / beta) elif beta <= 9e+168: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 5.8e+132) tmp = 0.0625; elseif (beta <= 2.6e+165) tmp = Float64(Float64(i + alpha) * Float64(Float64(i / beta) / beta)); elseif (beta <= 9e+168) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 5.8e+132)
tmp = 0.0625;
elseif (beta <= 2.6e+165)
tmp = (i + alpha) * ((i / beta) / beta);
elseif (beta <= 9e+168)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 5.8e+132], 0.0625, If[LessEqual[beta, 2.6e+165], N[(N[(i + alpha), $MachinePrecision] * N[(N[(i / beta), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 9e+168], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.8 \cdot 10^{+132}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 2.6 \cdot 10^{+165}:\\
\;\;\;\;\left(i + \alpha\right) \cdot \frac{\frac{i}{\beta}}{\beta}\\
\mathbf{elif}\;\beta \leq 9 \cdot 10^{+168}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 5.7999999999999997e132 or 2.6000000000000001e165 < beta < 9.00000000000000024e168Initial program 22.3%
associate-/l/21.4%
associate-*l*21.3%
times-frac27.4%
Simplified41.4%
Taylor expanded in i around inf 77.4%
if 5.7999999999999997e132 < beta < 2.6000000000000001e165Initial program 1.5%
associate-/l/0.0%
associate-*l*0.0%
times-frac1.5%
Simplified57.7%
Taylor expanded in beta around inf 40.5%
*-commutative40.5%
associate-/l*41.0%
+-commutative41.0%
unpow241.0%
Simplified41.0%
div-inv41.0%
associate-/l*54.0%
Applied egg-rr54.0%
*-un-lft-identity54.0%
associate-/r/53.8%
Applied egg-rr53.8%
*-lft-identity53.8%
associate-*l/53.6%
*-lft-identity53.6%
Simplified53.6%
if 9.00000000000000024e168 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified8.3%
Taylor expanded in beta around inf 27.8%
*-commutative27.8%
associate-/l*29.5%
+-commutative29.5%
unpow229.5%
Simplified29.5%
div-inv29.5%
associate-/l*47.4%
Applied egg-rr47.4%
Taylor expanded in alpha around 0 28.1%
unpow228.1%
unpow228.1%
times-frac66.7%
Simplified66.7%
Final simplification75.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 5.4e+132)
0.0625
(if (<= beta 1.72e+165)
(/ (+ i alpha) (/ beta (/ i beta)))
(if (<= beta 5.5e+168) 0.0625 (* (/ i beta) (/ i beta))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.4e+132) {
tmp = 0.0625;
} else if (beta <= 1.72e+165) {
tmp = (i + alpha) / (beta / (i / beta));
} else if (beta <= 5.5e+168) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha and beta 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 <= 5.4d+132) then
tmp = 0.0625d0
else if (beta <= 1.72d+165) then
tmp = (i + alpha) / (beta / (i / beta))
else if (beta <= 5.5d+168) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.4e+132) {
tmp = 0.0625;
} else if (beta <= 1.72e+165) {
tmp = (i + alpha) / (beta / (i / beta));
} else if (beta <= 5.5e+168) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 5.4e+132: tmp = 0.0625 elif beta <= 1.72e+165: tmp = (i + alpha) / (beta / (i / beta)) elif beta <= 5.5e+168: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 5.4e+132) tmp = 0.0625; elseif (beta <= 1.72e+165) tmp = Float64(Float64(i + alpha) / Float64(beta / Float64(i / beta))); elseif (beta <= 5.5e+168) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 5.4e+132)
tmp = 0.0625;
elseif (beta <= 1.72e+165)
tmp = (i + alpha) / (beta / (i / beta));
elseif (beta <= 5.5e+168)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 5.4e+132], 0.0625, If[LessEqual[beta, 1.72e+165], N[(N[(i + alpha), $MachinePrecision] / N[(beta / N[(i / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 5.5e+168], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.4 \cdot 10^{+132}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.72 \cdot 10^{+165}:\\
\;\;\;\;\frac{i + \alpha}{\frac{\beta}{\frac{i}{\beta}}}\\
\mathbf{elif}\;\beta \leq 5.5 \cdot 10^{+168}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 5.3999999999999999e132 or 1.72e165 < beta < 5.5000000000000001e168Initial program 22.3%
associate-/l/21.4%
associate-*l*21.3%
times-frac27.4%
Simplified41.4%
Taylor expanded in i around inf 77.4%
if 5.3999999999999999e132 < beta < 1.72e165Initial program 1.5%
associate-/l/0.0%
associate-*l*0.0%
times-frac1.5%
Simplified57.7%
Taylor expanded in beta around inf 40.5%
*-commutative40.5%
associate-/l*41.0%
+-commutative41.0%
unpow241.0%
Simplified41.0%
div-inv41.0%
associate-/l*54.0%
Applied egg-rr54.0%
Taylor expanded in beta around 0 40.5%
*-commutative40.5%
associate-/l*41.0%
unpow241.0%
associate-*r/54.0%
Simplified54.0%
Taylor expanded in beta around 0 41.0%
unpow241.0%
associate-/l*54.2%
Simplified54.2%
if 5.5000000000000001e168 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified8.3%
Taylor expanded in beta around inf 27.8%
*-commutative27.8%
associate-/l*29.5%
+-commutative29.5%
unpow229.5%
Simplified29.5%
div-inv29.5%
associate-/l*47.4%
Applied egg-rr47.4%
Taylor expanded in alpha around 0 28.1%
unpow228.1%
unpow228.1%
times-frac66.7%
Simplified66.7%
Final simplification75.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.5e+195) 0.0625 (* (/ i beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.5e+195) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (alpha / beta);
}
return tmp;
}
NOTE: alpha and beta 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.5d+195) then
tmp = 0.0625d0
else
tmp = (i / beta) * (alpha / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.5e+195) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 1.5e+195: tmp = 0.0625 else: tmp = (i / beta) * (alpha / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.5e+195) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(alpha / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.5e+195)
tmp = 0.0625;
else
tmp = (i / beta) * (alpha / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.5e+195], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.5 \cdot 10^{+195}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 1.5e195Initial program 20.4%
associate-/l/19.5%
associate-*l*19.5%
times-frac25.0%
Simplified40.1%
Taylor expanded in i around inf 73.6%
if 1.5e195 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified7.7%
Taylor expanded in beta around inf 36.1%
*-commutative36.1%
associate-/l*38.1%
+-commutative38.1%
unpow238.1%
Simplified38.1%
Taylor expanded in alpha around inf 37.5%
*-commutative37.5%
unpow237.5%
Simplified37.5%
Taylor expanded in alpha around 0 37.5%
unpow237.5%
times-frac49.0%
*-commutative49.0%
Simplified49.0%
Final simplification71.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.6e+145) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.6e+145) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha and beta 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.6d+145) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.6e+145) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 2.6e+145: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.6e+145) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2.6e+145)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 2.6e+145], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6 \cdot 10^{+145}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 2.60000000000000003e145Initial program 22.3%
associate-/l/21.3%
associate-*l*21.2%
times-frac27.3%
Simplified42.2%
Taylor expanded in i around inf 77.1%
if 2.60000000000000003e145 < beta Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified11.8%
Taylor expanded in beta around inf 27.9%
*-commutative27.9%
associate-/l*29.6%
+-commutative29.6%
unpow229.6%
Simplified29.6%
div-inv29.6%
associate-/l*47.3%
Applied egg-rr47.3%
Taylor expanded in alpha around 0 28.1%
unpow228.1%
unpow228.1%
times-frac62.4%
Simplified62.4%
Final simplification74.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.25e+212) 0.0625 (/ 0.0 i)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.25e+212) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
NOTE: alpha and beta 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.25d+212) then
tmp = 0.0625d0
else
tmp = 0.0d0 / i
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.25e+212) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 3.25e+212: tmp = 0.0625 else: tmp = 0.0 / i return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.25e+212) tmp = 0.0625; else tmp = Float64(0.0 / i); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.25e+212)
tmp = 0.0625;
else
tmp = 0.0 / i;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 3.25e+212], 0.0625, N[(0.0 / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.25 \cdot 10^{+212}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0}{i}\\
\end{array}
\end{array}
if beta < 3.24999999999999999e212Initial program 19.9%
associate-/l/19.0%
associate-*l*19.0%
times-frac24.4%
Simplified39.5%
Taylor expanded in i around inf 72.7%
if 3.24999999999999999e212 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified5.0%
Taylor expanded in i around inf 48.9%
cancel-sign-sub-inv48.9%
distribute-lft-out48.9%
metadata-eval48.9%
Simplified48.9%
Taylor expanded in alpha around 0 48.9%
Taylor expanded in i around 0 43.5%
distribute-rgt-out43.5%
metadata-eval43.5%
mul0-rgt43.5%
Simplified43.5%
Final simplification70.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha and beta 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;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return 0.0625
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return 0.0625 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.0625
\end{array}
Initial program 18.4%
associate-/l/17.6%
associate-*l*17.5%
times-frac22.5%
Simplified36.8%
Taylor expanded in i around inf 67.7%
Final simplification67.7%
herbie shell --seed 2023171
(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)))