
(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 8 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 4e+182)
(-
(+ 0.0625 (* 0.0625 (/ (- (* 2.0 (+ beta alpha)) (+ beta alpha)) i)))
(* 0.0625 (/ (+ beta alpha) i)))
(* (/ i beta) (/ (+ alpha i) beta))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4e+182) {
tmp = (0.0625 + (0.0625 * (((2.0 * (beta + alpha)) - (beta + alpha)) / i))) - (0.0625 * ((beta + alpha) / i));
} else {
tmp = (i / beta) * ((alpha + 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 <= 4d+182) then
tmp = (0.0625d0 + (0.0625d0 * (((2.0d0 * (beta + alpha)) - (beta + alpha)) / i))) - (0.0625d0 * ((beta + alpha) / i))
else
tmp = (i / beta) * ((alpha + 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 <= 4e+182) {
tmp = (0.0625 + (0.0625 * (((2.0 * (beta + alpha)) - (beta + alpha)) / i))) - (0.0625 * ((beta + alpha) / i));
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 4e+182: tmp = (0.0625 + (0.0625 * (((2.0 * (beta + alpha)) - (beta + alpha)) / i))) - (0.0625 * ((beta + alpha) / i)) else: tmp = (i / beta) * ((alpha + i) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4e+182) tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(Float64(2.0 * Float64(beta + alpha)) - Float64(beta + alpha)) / i))) - Float64(0.0625 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4e+182)
tmp = (0.0625 + (0.0625 * (((2.0 * (beta + alpha)) - (beta + alpha)) / i))) - (0.0625 * ((beta + alpha) / i));
else
tmp = (i / beta) * ((alpha + 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, 4e+182], N[(N[(0.0625 + N[(0.0625 * N[(N[(N[(2.0 * N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4 \cdot 10^{+182}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right) - \left(\beta + \alpha\right)}{i}\right) - 0.0625 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if beta < 4.0000000000000003e182Initial program 18.9%
Taylor expanded in i around inf 35.9%
+-commutative35.9%
+-commutative35.9%
*-commutative35.9%
fma-def35.9%
distribute-lft-out--35.9%
+-commutative35.9%
distribute-lft-out35.9%
*-commutative35.9%
unpow235.9%
Simplified35.9%
Taylor expanded in i around inf 88.7%
if 4.0000000000000003e182 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified6.8%
Taylor expanded in beta around inf 21.5%
*-commutative21.5%
associate-/l*23.5%
+-commutative23.5%
unpow223.5%
Simplified23.5%
Taylor expanded in beta around 0 21.5%
*-commutative21.5%
+-commutative21.5%
associate-*l/23.5%
unpow223.5%
*-commutative23.5%
associate-/r*54.7%
Simplified54.7%
Taylor expanded in beta around 0 21.5%
*-commutative21.5%
unpow221.5%
times-frac77.8%
Simplified77.8%
Final simplification87.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 6.8e+182) (+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125))) (* (/ i beta) (/ (+ alpha i) beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6.8e+182) {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
} else {
tmp = (i / beta) * ((alpha + 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 <= 6.8d+182) then
tmp = ((-0.125d0) * (beta / i)) + (0.0625d0 + ((beta / i) * 0.125d0))
else
tmp = (i / beta) * ((alpha + 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 <= 6.8e+182) {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 6.8e+182: tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125)) else: tmp = (i / beta) * ((alpha + i) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 6.8e+182) tmp = Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125))); else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 6.8e+182)
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
else
tmp = (i / beta) * ((alpha + 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, 6.8e+182], N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.8 \cdot 10^{+182}:\\
\;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if beta < 6.79999999999999973e182Initial program 18.9%
associate-/l/16.2%
associate-*l*16.1%
times-frac26.5%
Simplified40.9%
Taylor expanded in i around inf 88.7%
cancel-sign-sub-inv88.7%
distribute-lft-out88.7%
metadata-eval88.7%
Simplified88.7%
Taylor expanded in alpha around 0 84.0%
if 6.79999999999999973e182 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified6.8%
Taylor expanded in beta around inf 21.5%
*-commutative21.5%
associate-/l*23.5%
+-commutative23.5%
unpow223.5%
Simplified23.5%
Taylor expanded in beta around 0 21.5%
*-commutative21.5%
+-commutative21.5%
associate-*l/23.5%
unpow223.5%
*-commutative23.5%
associate-/r*54.7%
Simplified54.7%
Taylor expanded in beta around 0 21.5%
*-commutative21.5%
unpow221.5%
times-frac77.8%
Simplified77.8%
Final simplification83.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 9.2e+161) (+ 0.0625 (/ 0.015625 (* i i))) (* (/ i beta) (/ (+ alpha i) beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 9.2e+161) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i / beta) * ((alpha + 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 <= 9.2d+161) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = (i / beta) * ((alpha + 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 <= 9.2e+161) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 9.2e+161: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = (i / beta) * ((alpha + i) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 9.2e+161) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 9.2e+161)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = (i / beta) * ((alpha + 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, 9.2e+161], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.2 \cdot 10^{+161}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if beta < 9.1999999999999997e161Initial program 19.1%
Taylor expanded in i around inf 39.6%
*-commutative39.6%
unpow239.6%
Simplified39.6%
Taylor expanded in i around inf 34.7%
*-commutative34.7%
unpow234.7%
Simplified34.7%
Taylor expanded in i around inf 84.4%
associate-*r/84.4%
metadata-eval84.4%
unpow284.4%
Simplified84.4%
if 9.1999999999999997e161 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified6.3%
Taylor expanded in beta around inf 19.8%
*-commutative19.8%
associate-/l*21.8%
+-commutative21.8%
unpow221.8%
Simplified21.8%
Taylor expanded in beta around 0 19.8%
*-commutative19.8%
+-commutative19.8%
associate-*l/21.8%
unpow221.8%
*-commutative21.8%
associate-/r*53.1%
Simplified53.1%
Taylor expanded in beta around 0 19.8%
*-commutative19.8%
unpow219.8%
times-frac74.3%
Simplified74.3%
Final simplification83.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.5e+253) 0.0625 (* (/ i beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.5e+253) {
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 <= 3.5d+253) 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 <= 3.5e+253) {
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 <= 3.5e+253: 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 <= 3.5e+253) 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 <= 3.5e+253)
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, 3.5e+253], 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 3.5 \cdot 10^{+253}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 3.49999999999999978e253Initial program 17.5%
associate-/l/15.0%
associate-*l*14.9%
times-frac24.5%
Simplified38.8%
Taylor expanded in i around inf 79.5%
if 3.49999999999999978e253 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 30.8%
*-commutative30.8%
associate-/l*32.7%
+-commutative32.7%
unpow232.7%
Simplified32.7%
Taylor expanded in beta around 0 30.8%
*-commutative30.8%
+-commutative30.8%
associate-*l/32.7%
unpow232.7%
*-commutative32.7%
associate-/r*44.6%
Simplified44.6%
Taylor expanded in i around 0 31.9%
unpow231.9%
times-frac33.6%
Simplified33.6%
Final simplification77.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7.6e+165) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.6e+165) {
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 <= 7.6d+165) 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 <= 7.6e+165) {
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 <= 7.6e+165: 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 <= 7.6e+165) 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 <= 7.6e+165)
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, 7.6e+165], 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 7.6 \cdot 10^{+165}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 7.59999999999999981e165Initial program 19.1%
associate-/l/16.4%
associate-*l*16.3%
times-frac26.8%
Simplified41.5%
Taylor expanded in i around inf 84.2%
if 7.59999999999999981e165 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified6.3%
Taylor expanded in beta around inf 19.8%
*-commutative19.8%
associate-/l*21.8%
+-commutative21.8%
unpow221.8%
Simplified21.8%
Taylor expanded in beta around 0 19.8%
*-commutative19.8%
+-commutative19.8%
associate-*l/21.8%
unpow221.8%
*-commutative21.8%
associate-/r*53.1%
Simplified53.1%
Taylor expanded in i around inf 19.8%
unpow219.8%
unpow219.8%
times-frac69.3%
Simplified69.3%
Final simplification82.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.75e+162) (+ 0.0625 (/ 0.015625 (* i i))) (* (/ i beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.75e+162) {
tmp = 0.0625 + (0.015625 / (i * i));
} 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 <= 1.75d+162) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
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 <= 1.75e+162) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 1.75e+162: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.75e+162) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); 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 <= 1.75e+162)
tmp = 0.0625 + (0.015625 / (i * i));
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, 1.75e+162], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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 1.75 \cdot 10^{+162}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 1.75000000000000009e162Initial program 19.1%
Taylor expanded in i around inf 39.6%
*-commutative39.6%
unpow239.6%
Simplified39.6%
Taylor expanded in i around inf 34.7%
*-commutative34.7%
unpow234.7%
Simplified34.7%
Taylor expanded in i around inf 84.4%
associate-*r/84.4%
metadata-eval84.4%
unpow284.4%
Simplified84.4%
if 1.75000000000000009e162 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified6.3%
Taylor expanded in beta around inf 19.8%
*-commutative19.8%
associate-/l*21.8%
+-commutative21.8%
unpow221.8%
Simplified21.8%
Taylor expanded in beta around 0 19.8%
*-commutative19.8%
+-commutative19.8%
associate-*l/21.8%
unpow221.8%
*-commutative21.8%
associate-/r*53.1%
Simplified53.1%
Taylor expanded in i around inf 19.8%
unpow219.8%
unpow219.8%
times-frac69.3%
Simplified69.3%
Final simplification82.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.5e+253) 0.0625 0.0))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.5e+253) {
tmp = 0.0625;
} else {
tmp = 0.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) :: tmp
if (beta <= 3.5d+253) then
tmp = 0.0625d0
else
tmp = 0.0d0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.5e+253) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 3.5e+253: tmp = 0.0625 else: tmp = 0.0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.5e+253) tmp = 0.0625; else tmp = 0.0; end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.5e+253)
tmp = 0.0625;
else
tmp = 0.0;
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.5e+253], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5 \cdot 10^{+253}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 3.49999999999999978e253Initial program 17.5%
associate-/l/15.0%
associate-*l*14.9%
times-frac24.5%
Simplified38.8%
Taylor expanded in i around inf 79.5%
if 3.49999999999999978e253 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 39.7%
cancel-sign-sub-inv39.7%
distribute-lft-out39.7%
metadata-eval39.7%
Simplified39.7%
Taylor expanded in alpha around 0 39.7%
Taylor expanded in i around 0 32.7%
distribute-rgt-out32.7%
metadata-eval32.7%
mul0-rgt32.7%
mul0-rgt32.7%
associate-*l/32.7%
mul0-rgt32.7%
Simplified32.7%
Final simplification76.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0)
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return 0.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
code = 0.0d0
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return 0.0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return 0.0
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return 0.0 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0
\end{array}
Initial program 16.5%
associate-/l/14.1%
associate-*l*14.1%
times-frac23.2%
Simplified36.7%
Taylor expanded in i around inf 82.3%
cancel-sign-sub-inv82.3%
distribute-lft-out82.3%
metadata-eval82.3%
Simplified82.3%
Taylor expanded in alpha around 0 78.1%
Taylor expanded in i around 0 10.0%
distribute-rgt-out10.0%
metadata-eval10.0%
mul0-rgt10.0%
mul0-rgt10.0%
associate-*l/10.0%
mul0-rgt10.0%
Simplified10.0%
Final simplification10.0%
herbie shell --seed 2023255
(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)))