
(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 11 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.4e+143)
0.0625
(if (<= beta 3.7e+164)
(* (/ i beta) (/ i beta))
(if (<= beta 8.8e+201) 0.0625 (* (/ i beta) (/ (+ i alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.4e+143) {
tmp = 0.0625;
} else if (beta <= 3.7e+164) {
tmp = (i / beta) * (i / beta);
} else if (beta <= 8.8e+201) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + 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.4d+143) then
tmp = 0.0625d0
else if (beta <= 3.7d+164) then
tmp = (i / beta) * (i / beta)
else if (beta <= 8.8d+201) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((i + 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.4e+143) {
tmp = 0.0625;
} else if (beta <= 3.7e+164) {
tmp = (i / beta) * (i / beta);
} else if (beta <= 8.8e+201) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 3.4e+143: tmp = 0.0625 elif beta <= 3.7e+164: tmp = (i / beta) * (i / beta) elif beta <= 8.8e+201: tmp = 0.0625 else: tmp = (i / beta) * ((i + alpha) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.4e+143) tmp = 0.0625; elseif (beta <= 3.7e+164) tmp = Float64(Float64(i / beta) * Float64(i / beta)); elseif (beta <= 8.8e+201) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(i + 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.4e+143)
tmp = 0.0625;
elseif (beta <= 3.7e+164)
tmp = (i / beta) * (i / beta);
elseif (beta <= 8.8e+201)
tmp = 0.0625;
else
tmp = (i / beta) * ((i + 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.4e+143], 0.0625, If[LessEqual[beta, 3.7e+164], N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 8.8e+201], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4 \cdot 10^{+143}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 3.7 \cdot 10^{+164}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\mathbf{elif}\;\beta \leq 8.8 \cdot 10^{+201}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 3.39999999999999982e143 or 3.7000000000000001e164 < beta < 8.8e201Initial program 22.1%
associate-/l/19.8%
associate-*l*19.7%
times-frac27.3%
Simplified45.3%
Taylor expanded in i around inf 80.4%
if 3.39999999999999982e143 < beta < 3.7000000000000001e164Initial program 0.9%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.9%
Simplified33.7%
Taylor expanded in beta around inf 34.5%
*-commutative34.5%
associate-/l*35.6%
+-commutative35.6%
unpow235.6%
Simplified35.6%
div-inv35.6%
associate-/l*66.7%
Applied egg-rr66.7%
associate-/r/66.7%
Simplified66.7%
Taylor expanded in alpha around 0 34.5%
unpow234.5%
unpow234.5%
times-frac66.5%
Simplified66.5%
if 8.8e201 < beta Initial program 0.0%
expm1-log1p-u0.0%
expm1-udef0.0%
Applied egg-rr15.8%
expm1-def15.8%
expm1-log1p15.8%
associate-*r/15.8%
+-commutative15.8%
+-commutative15.8%
+-commutative15.8%
+-commutative15.8%
+-commutative15.8%
*-commutative15.8%
Simplified15.8%
Taylor expanded in beta around inf 43.6%
Taylor expanded in beta around inf 43.6%
*-commutative43.6%
unpow243.6%
times-frac89.3%
+-commutative89.3%
Simplified89.3%
Final simplification81.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ alpha (* i 2.0)))
(t_3 (+ i (+ alpha beta)))
(t_4 (* i t_3))
(t_5 (* 0.125 (/ beta i))))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(*
(/ t_4 (+ (pow (fma i 2.0 (+ alpha beta)) 2.0) -1.0))
(/
(fma i t_3 (* alpha beta))
(+ (* beta beta) (+ (pow t_2 2.0) (* 2.0 (* beta t_2))))))
(- (+ 0.0625 t_5) t_5))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = alpha + (i * 2.0);
double t_3 = i + (alpha + beta);
double t_4 = i * t_3;
double t_5 = 0.125 * (beta / i);
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (t_4 / (pow(fma(i, 2.0, (alpha + beta)), 2.0) + -1.0)) * (fma(i, t_3, (alpha * beta)) / ((beta * beta) + (pow(t_2, 2.0) + (2.0 * (beta * t_2)))));
} else {
tmp = (0.0625 + t_5) - t_5;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(alpha + Float64(i * 2.0)) t_3 = Float64(i + Float64(alpha + beta)) t_4 = Float64(i * t_3) t_5 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(t_4 / Float64((fma(i, 2.0, Float64(alpha + beta)) ^ 2.0) + -1.0)) * Float64(fma(i, t_3, Float64(alpha * beta)) / Float64(Float64(beta * beta) + Float64((t_2 ^ 2.0) + Float64(2.0 * Float64(beta * t_2)))))); else tmp = Float64(Float64(0.0625 + t_5) - t_5); end return 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[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(t$95$4 / N[(N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / N[(N[(beta * beta), $MachinePrecision] + N[(N[Power[t$95$2, 2.0], $MachinePrecision] + N[(2.0 * N[(beta * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + t$95$5), $MachinePrecision] - t$95$5), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := \alpha + i \cdot 2\\
t_3 := i + \left(\alpha + \beta\right)\\
t_4 := i \cdot t_3\\
t_5 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\frac{\frac{t_4 \cdot \left(t_4 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\
\;\;\;\;\frac{t_4}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2} + -1} \cdot \frac{\mathsf{fma}\left(i, t_3, \alpha \cdot \beta\right)}{\beta \cdot \beta + \left({t_2}^{2} + 2 \cdot \left(\beta \cdot t_2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_5\right) - t_5\\
\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 50.2%
associate-/l/44.9%
+-commutative44.9%
fma-def44.9%
+-commutative44.9%
Simplified44.9%
times-frac99.8%
fma-udef99.8%
pow299.8%
associate-+r+99.8%
*-commutative99.8%
+-commutative99.8%
*-commutative99.8%
fma-udef99.8%
Applied egg-rr99.8%
Taylor expanded in beta around -inf 99.8%
unpow299.8%
Simplified99.8%
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%
Simplified6.5%
Taylor expanded in i around inf 76.7%
Taylor expanded in alpha around 0 71.7%
Taylor expanded in beta around inf 72.4%
Final simplification82.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ i (+ alpha beta)))
(t_1 (* i t_0))
(t_2 (+ (+ alpha beta) (* i 2.0)))
(t_3 (* t_2 t_2))
(t_4 (+ t_3 -1.0))
(t_5 (* 0.125 (/ beta i))))
(if (<= (/ (/ (* t_1 (+ t_1 (* alpha beta))) t_3) t_4) INFINITY)
(/
(*
i
(*
(/ t_0 (pow (fma i 2.0 (+ alpha beta)) 2.0))
(fma i t_0 (* alpha beta))))
t_4)
(- (+ 0.0625 t_5) t_5))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = i + (alpha + beta);
double t_1 = i * t_0;
double t_2 = (alpha + beta) + (i * 2.0);
double t_3 = t_2 * t_2;
double t_4 = t_3 + -1.0;
double t_5 = 0.125 * (beta / i);
double tmp;
if ((((t_1 * (t_1 + (alpha * beta))) / t_3) / t_4) <= ((double) INFINITY)) {
tmp = (i * ((t_0 / pow(fma(i, 2.0, (alpha + beta)), 2.0)) * fma(i, t_0, (alpha * beta)))) / t_4;
} else {
tmp = (0.0625 + t_5) - t_5;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(i + Float64(alpha + beta)) t_1 = Float64(i * t_0) t_2 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_3 = Float64(t_2 * t_2) t_4 = Float64(t_3 + -1.0) t_5 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (Float64(Float64(Float64(t_1 * Float64(t_1 + Float64(alpha * beta))) / t_3) / t_4) <= Inf) tmp = Float64(Float64(i * Float64(Float64(t_0 / (fma(i, 2.0, Float64(alpha + beta)) ^ 2.0)) * fma(i, t_0, Float64(alpha * beta)))) / t_4); else tmp = Float64(Float64(0.0625 + t_5) - t_5); end return 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[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(i * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 + -1.0), $MachinePrecision]}, Block[{t$95$5 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$1 * N[(t$95$1 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision] / t$95$4), $MachinePrecision], Infinity], N[(N[(i * N[(N[(t$95$0 / N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(i * t$95$0 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], N[(N[(0.0625 + t$95$5), $MachinePrecision] - t$95$5), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := i + \left(\alpha + \beta\right)\\
t_1 := i \cdot t_0\\
t_2 := \left(\alpha + \beta\right) + i \cdot 2\\
t_3 := t_2 \cdot t_2\\
t_4 := t_3 + -1\\
t_5 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\frac{\frac{t_1 \cdot \left(t_1 + \alpha \cdot \beta\right)}{t_3}}{t_4} \leq \infty:\\
\;\;\;\;\frac{i \cdot \left(\frac{t_0}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}} \cdot \mathsf{fma}\left(i, t_0, \alpha \cdot \beta\right)\right)}{t_4}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_5\right) - t_5\\
\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 50.2%
expm1-log1p-u47.0%
expm1-udef47.0%
Applied egg-rr91.3%
expm1-def91.3%
expm1-log1p99.7%
associate-*r/99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
*-commutative99.7%
Simplified99.7%
associate-/r/99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.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%
Simplified6.5%
Taylor expanded in i around inf 76.7%
Taylor expanded in alpha around 0 71.7%
Taylor expanded in beta around inf 72.4%
Final simplification82.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ i (+ alpha beta)))
(t_1 (* i t_0))
(t_2 (+ (+ alpha beta) (* i 2.0)))
(t_3 (* t_2 t_2))
(t_4 (+ t_3 -1.0))
(t_5 (* 0.125 (/ beta i))))
(if (<= (/ (/ (* t_1 (+ t_1 (* alpha beta))) t_3) t_4) INFINITY)
(/
(*
i
(/
t_0
(/ (pow (fma i 2.0 (+ alpha beta)) 2.0) (fma i t_0 (* alpha beta)))))
t_4)
(- (+ 0.0625 t_5) t_5))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = i + (alpha + beta);
double t_1 = i * t_0;
double t_2 = (alpha + beta) + (i * 2.0);
double t_3 = t_2 * t_2;
double t_4 = t_3 + -1.0;
double t_5 = 0.125 * (beta / i);
double tmp;
if ((((t_1 * (t_1 + (alpha * beta))) / t_3) / t_4) <= ((double) INFINITY)) {
tmp = (i * (t_0 / (pow(fma(i, 2.0, (alpha + beta)), 2.0) / fma(i, t_0, (alpha * beta))))) / t_4;
} else {
tmp = (0.0625 + t_5) - t_5;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(i + Float64(alpha + beta)) t_1 = Float64(i * t_0) t_2 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_3 = Float64(t_2 * t_2) t_4 = Float64(t_3 + -1.0) t_5 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (Float64(Float64(Float64(t_1 * Float64(t_1 + Float64(alpha * beta))) / t_3) / t_4) <= Inf) tmp = Float64(Float64(i * Float64(t_0 / Float64((fma(i, 2.0, Float64(alpha + beta)) ^ 2.0) / fma(i, t_0, Float64(alpha * beta))))) / t_4); else tmp = Float64(Float64(0.0625 + t_5) - t_5); end return 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[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(i * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 + -1.0), $MachinePrecision]}, Block[{t$95$5 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$1 * N[(t$95$1 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision] / t$95$4), $MachinePrecision], Infinity], N[(N[(i * N[(t$95$0 / N[(N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[(i * t$95$0 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], N[(N[(0.0625 + t$95$5), $MachinePrecision] - t$95$5), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := i + \left(\alpha + \beta\right)\\
t_1 := i \cdot t_0\\
t_2 := \left(\alpha + \beta\right) + i \cdot 2\\
t_3 := t_2 \cdot t_2\\
t_4 := t_3 + -1\\
t_5 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\frac{\frac{t_1 \cdot \left(t_1 + \alpha \cdot \beta\right)}{t_3}}{t_4} \leq \infty:\\
\;\;\;\;\frac{i \cdot \frac{t_0}{\frac{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}}{\mathsf{fma}\left(i, t_0, \alpha \cdot \beta\right)}}}{t_4}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_5\right) - t_5\\
\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 50.2%
expm1-log1p-u47.0%
expm1-udef47.0%
Applied egg-rr91.3%
expm1-def91.3%
expm1-log1p99.7%
associate-*r/99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
*-commutative99.7%
Simplified99.7%
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%
Simplified6.5%
Taylor expanded in i around inf 76.7%
Taylor expanded in alpha around 0 71.7%
Taylor expanded in beta around inf 72.4%
Final simplification82.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* 0.125 (/ beta i)))
(t_3 (* i (+ i (+ alpha beta)))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(*
(/ t_3 (+ (pow (fma i 2.0 (+ alpha beta)) 2.0) -1.0))
(/ (* i (+ i beta)) (pow (+ beta (* i 2.0)) 2.0)))
(- (+ 0.0625 t_2) t_2))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = 0.125 * (beta / i);
double t_3 = i * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (t_3 / (pow(fma(i, 2.0, (alpha + beta)), 2.0) + -1.0)) * ((i * (i + beta)) / pow((beta + (i * 2.0)), 2.0));
} else {
tmp = (0.0625 + t_2) - t_2;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(0.125 * Float64(beta / i)) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(t_3 / Float64((fma(i, 2.0, Float64(alpha + beta)) ^ 2.0) + -1.0)) * Float64(Float64(i * Float64(i + beta)) / (Float64(beta + Float64(i * 2.0)) ^ 2.0))); else tmp = Float64(Float64(0.0625 + t_2) - t_2); end return 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[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(t$95$3 / N[(N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + t$95$2), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := 0.125 \cdot \frac{\beta}{i}\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\
\;\;\;\;\frac{t_3}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2} + -1} \cdot \frac{i \cdot \left(i + \beta\right)}{{\left(\beta + i \cdot 2\right)}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_2\right) - t_2\\
\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 50.2%
associate-/l/44.9%
+-commutative44.9%
fma-def44.9%
+-commutative44.9%
Simplified44.9%
times-frac99.8%
fma-udef99.8%
pow299.8%
associate-+r+99.8%
*-commutative99.8%
+-commutative99.8%
*-commutative99.8%
fma-udef99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 93.2%
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%
Simplified6.5%
Taylor expanded in i around inf 76.7%
Taylor expanded in alpha around 0 71.7%
Taylor expanded in beta around inf 72.4%
Final simplification80.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* 0.125 (/ beta i)))
(t_3 (* i (+ i (+ alpha beta))))
(t_4 (pow (+ beta (* i 2.0)) 2.0)))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(* (/ (* i i) t_4) (/ (pow (+ i beta) 2.0) (+ -1.0 t_4)))
(- (+ 0.0625 t_2) t_2))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = 0.125 * (beta / i);
double t_3 = i * (i + (alpha + beta));
double t_4 = pow((beta + (i * 2.0)), 2.0);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = ((i * i) / t_4) * (pow((i + beta), 2.0) / (-1.0 + t_4));
} else {
tmp = (0.0625 + t_2) - t_2;
}
return tmp;
}
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = 0.125 * (beta / i);
double t_3 = i * (i + (alpha + beta));
double t_4 = Math.pow((beta + (i * 2.0)), 2.0);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Double.POSITIVE_INFINITY) {
tmp = ((i * i) / t_4) * (Math.pow((i + beta), 2.0) / (-1.0 + t_4));
} else {
tmp = (0.0625 + t_2) - t_2;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = 0.125 * (beta / i) t_3 = i * (i + (alpha + beta)) t_4 = math.pow((beta + (i * 2.0)), 2.0) tmp = 0 if (((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= math.inf: tmp = ((i * i) / t_4) * (math.pow((i + beta), 2.0) / (-1.0 + t_4)) else: tmp = (0.0625 + t_2) - t_2 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(0.125 * Float64(beta / i)) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) t_4 = Float64(beta + Float64(i * 2.0)) ^ 2.0 tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(Float64(i * i) / t_4) * Float64((Float64(i + beta) ^ 2.0) / Float64(-1.0 + t_4))); else tmp = Float64(Float64(0.0625 + t_2) - t_2); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = 0.125 * (beta / i);
t_3 = i * (i + (alpha + beta));
t_4 = (beta + (i * 2.0)) ^ 2.0;
tmp = 0.0;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Inf)
tmp = ((i * i) / t_4) * (((i + beta) ^ 2.0) / (-1.0 + t_4));
else
tmp = (0.0625 + t_2) - t_2;
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[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $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$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(i * i), $MachinePrecision] / t$95$4), $MachinePrecision] * N[(N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision] / N[(-1.0 + t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + t$95$2), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := 0.125 \cdot \frac{\beta}{i}\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_4 := {\left(\beta + i \cdot 2\right)}^{2}\\
\mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\
\;\;\;\;\frac{i \cdot i}{t_4} \cdot \frac{{\left(i + \beta\right)}^{2}}{-1 + t_4}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_2\right) - t_2\\
\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 50.2%
associate-/l/44.9%
+-commutative44.9%
fma-def44.9%
+-commutative44.9%
Simplified44.9%
Taylor expanded in alpha around 0 43.6%
unpow243.6%
Simplified43.6%
Taylor expanded in alpha around 0 44.0%
times-frac93.1%
unpow293.1%
sub-neg93.1%
metadata-eval93.1%
Simplified93.1%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified6.5%
Taylor expanded in i around inf 76.7%
Taylor expanded in alpha around 0 71.7%
Taylor expanded in beta around inf 72.4%
Final simplification80.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* 0.125 (/ beta i)))
(t_3 (+ t_1 -1.0))
(t_4 (+ i (+ alpha beta)))
(t_5 (* i t_4)))
(if (<= (/ (/ (* t_5 (+ t_5 (* alpha beta))) t_1) t_3) INFINITY)
(/ (* i (/ t_4 (/ (pow (+ beta (* i 2.0)) 2.0) (* i (+ i beta))))) t_3)
(- (+ 0.0625 t_2) t_2))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = 0.125 * (beta / i);
double t_3 = t_1 + -1.0;
double t_4 = i + (alpha + beta);
double t_5 = i * t_4;
double tmp;
if ((((t_5 * (t_5 + (alpha * beta))) / t_1) / t_3) <= ((double) INFINITY)) {
tmp = (i * (t_4 / (pow((beta + (i * 2.0)), 2.0) / (i * (i + beta))))) / t_3;
} else {
tmp = (0.0625 + t_2) - t_2;
}
return tmp;
}
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = 0.125 * (beta / i);
double t_3 = t_1 + -1.0;
double t_4 = i + (alpha + beta);
double t_5 = i * t_4;
double tmp;
if ((((t_5 * (t_5 + (alpha * beta))) / t_1) / t_3) <= Double.POSITIVE_INFINITY) {
tmp = (i * (t_4 / (Math.pow((beta + (i * 2.0)), 2.0) / (i * (i + beta))))) / t_3;
} else {
tmp = (0.0625 + t_2) - t_2;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = 0.125 * (beta / i) t_3 = t_1 + -1.0 t_4 = i + (alpha + beta) t_5 = i * t_4 tmp = 0 if (((t_5 * (t_5 + (alpha * beta))) / t_1) / t_3) <= math.inf: tmp = (i * (t_4 / (math.pow((beta + (i * 2.0)), 2.0) / (i * (i + beta))))) / t_3 else: tmp = (0.0625 + t_2) - t_2 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(0.125 * Float64(beta / i)) t_3 = Float64(t_1 + -1.0) t_4 = Float64(i + Float64(alpha + beta)) t_5 = Float64(i * t_4) tmp = 0.0 if (Float64(Float64(Float64(t_5 * Float64(t_5 + Float64(alpha * beta))) / t_1) / t_3) <= Inf) tmp = Float64(Float64(i * Float64(t_4 / Float64((Float64(beta + Float64(i * 2.0)) ^ 2.0) / Float64(i * Float64(i + beta))))) / t_3); else tmp = Float64(Float64(0.0625 + t_2) - t_2); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = 0.125 * (beta / i);
t_3 = t_1 + -1.0;
t_4 = i + (alpha + beta);
t_5 = i * t_4;
tmp = 0.0;
if ((((t_5 * (t_5 + (alpha * beta))) / t_1) / t_3) <= Inf)
tmp = (i * (t_4 / (((beta + (i * 2.0)) ^ 2.0) / (i * (i + beta))))) / t_3;
else
tmp = (0.0625 + t_2) - t_2;
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[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$4 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(i * t$95$4), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$5 * N[(t$95$5 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$3), $MachinePrecision], Infinity], N[(N[(i * N[(t$95$4 / N[(N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[(0.0625 + t$95$2), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := 0.125 \cdot \frac{\beta}{i}\\
t_3 := t_1 + -1\\
t_4 := i + \left(\alpha + \beta\right)\\
t_5 := i \cdot t_4\\
\mathbf{if}\;\frac{\frac{t_5 \cdot \left(t_5 + \alpha \cdot \beta\right)}{t_1}}{t_3} \leq \infty:\\
\;\;\;\;\frac{i \cdot \frac{t_4}{\frac{{\left(\beta + i \cdot 2\right)}^{2}}{i \cdot \left(i + \beta\right)}}}{t_3}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_2\right) - t_2\\
\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 50.2%
expm1-log1p-u47.0%
expm1-udef47.0%
Applied egg-rr91.3%
expm1-def91.3%
expm1-log1p99.7%
associate-*r/99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
*-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 93.2%
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%
Simplified6.5%
Taylor expanded in i around inf 76.7%
Taylor expanded in alpha around 0 71.7%
Taylor expanded in beta around inf 72.4%
Final simplification80.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 5.2e+142)
0.0625
(if (or (<= beta 1.3e+165) (not (<= beta 8.8e+201)))
(* (/ i beta) (/ i beta))
0.0625)))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.2e+142) {
tmp = 0.0625;
} else if ((beta <= 1.3e+165) || !(beta <= 8.8e+201)) {
tmp = (i / beta) * (i / beta);
} 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+142) then
tmp = 0.0625d0
else if ((beta <= 1.3d+165) .or. (.not. (beta <= 8.8d+201))) then
tmp = (i / beta) * (i / beta)
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+142) {
tmp = 0.0625;
} else if ((beta <= 1.3e+165) || !(beta <= 8.8e+201)) {
tmp = (i / beta) * (i / beta);
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 5.2e+142: tmp = 0.0625 elif (beta <= 1.3e+165) or not (beta <= 8.8e+201): tmp = (i / beta) * (i / beta) else: tmp = 0.0625 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 5.2e+142) tmp = 0.0625; elseif ((beta <= 1.3e+165) || !(beta <= 8.8e+201)) tmp = Float64(Float64(i / beta) * Float64(i / beta)); 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+142)
tmp = 0.0625;
elseif ((beta <= 1.3e+165) || ~((beta <= 8.8e+201)))
tmp = (i / beta) * (i / beta);
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+142], 0.0625, If[Or[LessEqual[beta, 1.3e+165], N[Not[LessEqual[beta, 8.8e+201]], $MachinePrecision]], N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2 \cdot 10^{+142}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.3 \cdot 10^{+165} \lor \neg \left(\beta \leq 8.8 \cdot 10^{+201}\right):\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if beta < 5.20000000000000043e142 or 1.3000000000000001e165 < beta < 8.8e201Initial program 22.1%
associate-/l/19.8%
associate-*l*19.7%
times-frac27.3%
Simplified45.3%
Taylor expanded in i around inf 80.4%
if 5.20000000000000043e142 < beta < 1.3000000000000001e165 or 8.8e201 < beta Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified18.7%
Taylor expanded in beta around inf 42.2%
*-commutative42.2%
associate-/l*44.0%
+-commutative44.0%
unpow244.0%
Simplified44.0%
div-inv44.0%
associate-/l*56.8%
Applied egg-rr56.8%
associate-/r/57.8%
Simplified57.8%
Taylor expanded in alpha around 0 42.4%
unpow242.4%
unpow242.4%
times-frac84.6%
Simplified84.6%
Final simplification81.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.95e+213) 0.0625 (* alpha (/ (/ i beta) beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.95e+213) {
tmp = 0.0625;
} else {
tmp = alpha * ((i / beta) / 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.95d+213) then
tmp = 0.0625d0
else
tmp = alpha * ((i / beta) / 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.95e+213) {
tmp = 0.0625;
} else {
tmp = alpha * ((i / beta) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 1.95e+213: tmp = 0.0625 else: tmp = alpha * ((i / beta) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.95e+213) tmp = 0.0625; else tmp = Float64(alpha * Float64(Float64(i / beta) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.95e+213)
tmp = 0.0625;
else
tmp = alpha * ((i / beta) / 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.95e+213], 0.0625, N[(alpha * N[(N[(i / beta), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.95 \cdot 10^{+213}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\alpha \cdot \frac{\frac{i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.9500000000000001e213Initial program 21.3%
associate-/l/19.1%
associate-*l*19.0%
times-frac26.4%
Simplified44.6%
Taylor expanded in i around inf 78.6%
if 1.9500000000000001e213 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified16.7%
Taylor expanded in beta around inf 46.3%
*-commutative46.3%
associate-/l*48.2%
+-commutative48.2%
unpow248.2%
Simplified48.2%
Taylor expanded in alpha around inf 47.6%
associate-/l*48.2%
unpow248.2%
Simplified48.2%
Taylor expanded in i around 0 47.6%
associate-*l/48.2%
unpow248.2%
*-commutative48.2%
associate-/r*48.3%
Simplified48.3%
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 3.8e+214) 0.0625 (* (/ i beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.8e+214) {
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.8d+214) 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.8e+214) {
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.8e+214: 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.8e+214) 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.8e+214)
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.8e+214], 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.8 \cdot 10^{+214}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 3.79999999999999997e214Initial program 21.3%
associate-/l/19.1%
associate-*l*19.0%
times-frac26.4%
Simplified44.6%
Taylor expanded in i around inf 78.6%
if 3.79999999999999997e214 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified16.7%
Taylor expanded in beta around inf 46.3%
*-commutative46.3%
associate-/l*48.2%
+-commutative48.2%
unpow248.2%
Simplified48.2%
div-inv48.2%
associate-/l*55.0%
Applied egg-rr55.0%
associate-/r/56.3%
Simplified56.3%
Taylor expanded in alpha around inf 47.6%
unpow247.6%
times-frac49.7%
Simplified49.7%
Final simplification75.2%
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.8%
associate-/l/16.8%
associate-*l*16.7%
times-frac23.3%
Simplified41.3%
Taylor expanded in i around inf 70.6%
Final simplification70.6%
herbie shell --seed 2023240
(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)))