
(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 6 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 3.8e+143)
0.0625
(if (or (<= beta 3.9e+192) (not (<= beta 1.6e+211)))
(pow (/ (* (sqrt (+ i alpha)) (sqrt i)) beta) 2.0)
(-
(+ 0.0625 (* 0.0625 (/ (+ (* alpha 2.0) (* beta 2.0)) i)))
(* 0.125 (pow (cbrt (/ (+ beta alpha) i)) 3.0))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.8e+143) {
tmp = 0.0625;
} else if ((beta <= 3.9e+192) || !(beta <= 1.6e+211)) {
tmp = pow(((sqrt((i + alpha)) * sqrt(i)) / beta), 2.0);
} else {
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * pow(cbrt(((beta + alpha) / i)), 3.0));
}
return tmp;
}
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.8e+143) {
tmp = 0.0625;
} else if ((beta <= 3.9e+192) || !(beta <= 1.6e+211)) {
tmp = Math.pow(((Math.sqrt((i + alpha)) * Math.sqrt(i)) / beta), 2.0);
} else {
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * Math.pow(Math.cbrt(((beta + alpha) / i)), 3.0));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.8e+143) tmp = 0.0625; elseif ((beta <= 3.9e+192) || !(beta <= 1.6e+211)) tmp = Float64(Float64(sqrt(Float64(i + alpha)) * sqrt(i)) / beta) ^ 2.0; else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)) / i))) - Float64(0.125 * (cbrt(Float64(Float64(beta + alpha) / i)) ^ 3.0))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 3.8e+143], 0.0625, If[Or[LessEqual[beta, 3.9e+192], N[Not[LessEqual[beta, 1.6e+211]], $MachinePrecision]], N[Power[N[(N[(N[Sqrt[N[(i + alpha), $MachinePrecision]], $MachinePrecision] * N[Sqrt[i], $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision], 2.0], $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[Power[N[Power[N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision], 1/3], $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.8 \cdot 10^{+143}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 3.9 \cdot 10^{+192} \lor \neg \left(\beta \leq 1.6 \cdot 10^{+211}\right):\\
\;\;\;\;{\left(\frac{\sqrt{i + \alpha} \cdot \sqrt{i}}{\beta}\right)}^{2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\alpha \cdot 2 + \beta \cdot 2}{i}\right) - 0.125 \cdot {\left(\sqrt[3]{\frac{\beta + \alpha}{i}}\right)}^{3}\\
\end{array}
\end{array}
if beta < 3.8e143Initial program 13.0%
associate-/l/11.5%
associate-*l*11.4%
times-frac19.4%
Simplified38.2%
Taylor expanded in i around inf 80.6%
if 3.8e143 < beta < 3.8999999999999998e192 or 1.59999999999999988e211 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified7.1%
Taylor expanded in beta around inf 21.5%
associate-/l*23.5%
+-commutative23.5%
Simplified23.5%
associate-/r/23.5%
+-commutative23.5%
Applied egg-rr23.5%
add-sqr-sqrt23.5%
pow223.5%
associate-*l/21.5%
sqrt-div21.5%
+-commutative21.5%
unpow221.5%
sqrt-prod45.1%
add-sqr-sqrt45.2%
Applied egg-rr45.2%
pow1/245.2%
*-commutative45.2%
unpow-prod-down68.7%
pow1/268.7%
pow1/268.7%
Applied egg-rr68.7%
if 3.8999999999999998e192 < beta < 1.59999999999999988e211Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 76.9%
add-cube-cbrt63.3%
pow363.3%
Applied egg-rr63.3%
Final simplification78.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* 0.125 (/ beta i))))
(if (<= beta 4.7e+143)
0.0625
(if (<= beta 3.4e+192)
(* (* (/ 1.0 beta) (/ i beta)) (+ i alpha))
(if (<= beta 3.1e+218) (- (+ 0.0625 t_0) t_0) (pow (/ i beta) 2.0))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 4.7e+143) {
tmp = 0.0625;
} else if (beta <= 3.4e+192) {
tmp = ((1.0 / beta) * (i / beta)) * (i + alpha);
} else if (beta <= 3.1e+218) {
tmp = (0.0625 + t_0) - t_0;
} else {
tmp = pow((i / beta), 2.0);
}
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) :: t_0
real(8) :: tmp
t_0 = 0.125d0 * (beta / i)
if (beta <= 4.7d+143) then
tmp = 0.0625d0
else if (beta <= 3.4d+192) then
tmp = ((1.0d0 / beta) * (i / beta)) * (i + alpha)
else if (beta <= 3.1d+218) then
tmp = (0.0625d0 + t_0) - t_0
else
tmp = (i / beta) ** 2.0d0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 4.7e+143) {
tmp = 0.0625;
} else if (beta <= 3.4e+192) {
tmp = ((1.0 / beta) * (i / beta)) * (i + alpha);
} else if (beta <= 3.1e+218) {
tmp = (0.0625 + t_0) - t_0;
} else {
tmp = Math.pow((i / beta), 2.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) tmp = 0 if beta <= 4.7e+143: tmp = 0.0625 elif beta <= 3.4e+192: tmp = ((1.0 / beta) * (i / beta)) * (i + alpha) elif beta <= 3.1e+218: tmp = (0.0625 + t_0) - t_0 else: tmp = math.pow((i / beta), 2.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (beta <= 4.7e+143) tmp = 0.0625; elseif (beta <= 3.4e+192) tmp = Float64(Float64(Float64(1.0 / beta) * Float64(i / beta)) * Float64(i + alpha)); elseif (beta <= 3.1e+218) tmp = Float64(Float64(0.0625 + t_0) - t_0); else tmp = Float64(i / beta) ^ 2.0; end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = 0.125 * (beta / i);
tmp = 0.0;
if (beta <= 4.7e+143)
tmp = 0.0625;
elseif (beta <= 3.4e+192)
tmp = ((1.0 / beta) * (i / beta)) * (i + alpha);
elseif (beta <= 3.1e+218)
tmp = (0.0625 + t_0) - t_0;
else
tmp = (i / beta) ^ 2.0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.7e+143], 0.0625, If[LessEqual[beta, 3.4e+192], N[(N[(N[(1.0 / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision] * N[(i + alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.1e+218], N[(N[(0.0625 + t$95$0), $MachinePrecision] - t$95$0), $MachinePrecision], N[Power[N[(i / beta), $MachinePrecision], 2.0], $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\beta \leq 4.7 \cdot 10^{+143}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 3.4 \cdot 10^{+192}:\\
\;\;\;\;\left(\frac{1}{\beta} \cdot \frac{i}{\beta}\right) \cdot \left(i + \alpha\right)\\
\mathbf{elif}\;\beta \leq 3.1 \cdot 10^{+218}:\\
\;\;\;\;\left(0.0625 + t_0\right) - t_0\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{i}{\beta}\right)}^{2}\\
\end{array}
\end{array}
if beta < 4.7e143Initial program 13.0%
associate-/l/11.5%
associate-*l*11.4%
times-frac19.4%
Simplified38.2%
Taylor expanded in i around inf 80.6%
if 4.7e143 < beta < 3.39999999999999996e192Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified14.2%
Taylor expanded in beta around inf 14.6%
associate-/l*16.5%
+-commutative16.5%
Simplified16.5%
associate-/r/16.5%
+-commutative16.5%
Applied egg-rr16.5%
*-un-lft-identity16.5%
unpow216.5%
times-frac50.1%
Applied egg-rr50.1%
if 3.39999999999999996e192 < beta < 3.1000000000000002e218Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified11.4%
Taylor expanded in i around inf 80.6%
Taylor expanded in alpha around 0 70.9%
Taylor expanded in alpha around 0 80.6%
if 3.1000000000000002e218 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 24.3%
associate-/l*26.4%
+-commutative26.4%
Simplified26.4%
associate-/r/26.4%
+-commutative26.4%
Applied egg-rr26.4%
add-sqr-sqrt26.4%
pow226.4%
associate-*l/24.3%
sqrt-div24.3%
+-commutative24.3%
unpow224.3%
sqrt-prod46.9%
add-sqr-sqrt47.1%
Applied egg-rr47.1%
Taylor expanded in i around inf 69.1%
Final simplification77.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 5.2e+143)
0.0625
(if (or (<= beta 5e+192) (not (<= beta 2.4e+201)))
(* (* (/ 1.0 beta) (/ i beta)) (+ i alpha))
0.0625)))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.2e+143) {
tmp = 0.0625;
} else if ((beta <= 5e+192) || !(beta <= 2.4e+201)) {
tmp = ((1.0 / beta) * (i / beta)) * (i + alpha);
} else {
tmp = 0.0625;
}
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.2d+143) then
tmp = 0.0625d0
else if ((beta <= 5d+192) .or. (.not. (beta <= 2.4d+201))) then
tmp = ((1.0d0 / beta) * (i / beta)) * (i + alpha)
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.2e+143) {
tmp = 0.0625;
} else if ((beta <= 5e+192) || !(beta <= 2.4e+201)) {
tmp = ((1.0 / beta) * (i / beta)) * (i + alpha);
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 5.2e+143: tmp = 0.0625 elif (beta <= 5e+192) or not (beta <= 2.4e+201): tmp = ((1.0 / beta) * (i / beta)) * (i + alpha) else: tmp = 0.0625 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 5.2e+143) tmp = 0.0625; elseif ((beta <= 5e+192) || !(beta <= 2.4e+201)) tmp = Float64(Float64(Float64(1.0 / beta) * Float64(i / beta)) * Float64(i + alpha)); else tmp = 0.0625; end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 5.2e+143)
tmp = 0.0625;
elseif ((beta <= 5e+192) || ~((beta <= 2.4e+201)))
tmp = ((1.0 / beta) * (i / beta)) * (i + alpha);
else
tmp = 0.0625;
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.2e+143], 0.0625, If[Or[LessEqual[beta, 5e+192], N[Not[LessEqual[beta, 2.4e+201]], $MachinePrecision]], N[(N[(N[(1.0 / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision] * N[(i + alpha), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2 \cdot 10^{+143}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 5 \cdot 10^{+192} \lor \neg \left(\beta \leq 2.4 \cdot 10^{+201}\right):\\
\;\;\;\;\left(\frac{1}{\beta} \cdot \frac{i}{\beta}\right) \cdot \left(i + \alpha\right)\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if beta < 5.1999999999999998e143 or 5.00000000000000033e192 < beta < 2.39999999999999993e201Initial program 12.8%
associate-/l/11.2%
associate-*l*11.2%
times-frac19.0%
Simplified37.5%
Taylor expanded in i around inf 80.6%
if 5.1999999999999998e143 < beta < 5.00000000000000033e192 or 2.39999999999999993e201 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified7.0%
Taylor expanded in beta around inf 22.7%
associate-/l*24.6%
+-commutative24.6%
Simplified24.6%
associate-/r/24.6%
+-commutative24.6%
Applied egg-rr24.6%
*-un-lft-identity24.6%
unpow224.6%
times-frac47.4%
Applied egg-rr47.4%
Final simplification75.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (let* ((t_0 (* 0.125 (/ beta i)))) (- (+ 0.0625 t_0) t_0)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
return (0.0625 + t_0) - t_0;
}
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) :: t_0
t_0 = 0.125d0 * (beta / i)
code = (0.0625d0 + t_0) - t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
return (0.0625 + t_0) - t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) return (0.0625 + t_0) - t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) return Float64(Float64(0.0625 + t_0) - t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
t_0 = 0.125 * (beta / i);
tmp = (0.0625 + t_0) - t_0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, N[(N[(0.0625 + t$95$0), $MachinePrecision] - t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
\left(0.0625 + t_0\right) - t_0
\end{array}
\end{array}
Initial program 10.7%
associate-/l/9.4%
associate-*l*9.4%
times-frac15.9%
Simplified32.5%
Taylor expanded in i around inf 80.4%
Taylor expanded in alpha around 0 74.2%
Taylor expanded in alpha around 0 75.5%
Final simplification75.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2e+263) 0.0625 (/ (* 0.125 (- beta (+ beta alpha))) i)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2e+263) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (beta + alpha))) / 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 <= 2d+263) then
tmp = 0.0625d0
else
tmp = (0.125d0 * (beta - (beta + alpha))) / i
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2e+263) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (beta + alpha))) / i;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 2e+263: tmp = 0.0625 else: tmp = (0.125 * (beta - (beta + alpha))) / i return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2e+263) tmp = 0.0625; else tmp = Float64(Float64(0.125 * Float64(beta - Float64(beta + alpha))) / i); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2e+263)
tmp = 0.0625;
else
tmp = (0.125 * (beta - (beta + alpha))) / 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, 2e+263], 0.0625, N[(N[(0.125 * N[(beta - N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2 \cdot 10^{+263}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0.125 \cdot \left(\beta - \left(\beta + \alpha\right)\right)}{i}\\
\end{array}
\end{array}
if beta < 2.00000000000000003e263Initial program 11.3%
associate-/l/9.9%
associate-*l*9.9%
times-frac16.8%
Simplified34.3%
Taylor expanded in i around inf 75.9%
if 2.00000000000000003e263 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 45.4%
Taylor expanded in alpha around 0 45.4%
Taylor expanded in i around 0 45.4%
distribute-lft-out--45.4%
Simplified45.4%
Final simplification74.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 10.7%
associate-/l/9.4%
associate-*l*9.4%
times-frac15.9%
Simplified32.5%
Taylor expanded in i around inf 72.3%
Final simplification72.3%
herbie shell --seed 2023311
(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)))