
(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, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* (/ i beta) (/ (+ i alpha) (fma i 2.0 (+ alpha beta))))))
(if (<= beta 1.3e+130)
0.0625
(if (<= beta 2.1e+214)
t_0
(if (<= beta 3.6e+236)
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) i)
(if (or (<= beta 6.2e+257) (not (<= beta 6.4e+257))) t_0 0.0625))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (i / beta) * ((i + alpha) / fma(i, 2.0, (alpha + beta)));
double tmp;
if (beta <= 1.3e+130) {
tmp = 0.0625;
} else if (beta <= 2.1e+214) {
tmp = t_0;
} else if (beta <= 3.6e+236) {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
} else if ((beta <= 6.2e+257) || !(beta <= 6.4e+257)) {
tmp = t_0;
} else {
tmp = 0.0625;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / fma(i, 2.0, Float64(alpha + beta)))) tmp = 0.0 if (beta <= 1.3e+130) tmp = 0.0625; elseif (beta <= 2.1e+214) tmp = t_0; elseif (beta <= 3.6e+236) tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / i); elseif ((beta <= 6.2e+257) || !(beta <= 6.4e+257)) tmp = t_0; else tmp = 0.0625; end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.3e+130], 0.0625, If[LessEqual[beta, 2.1e+214], t$95$0, If[LessEqual[beta, 3.6e+236], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision], If[Or[LessEqual[beta, 6.2e+257], N[Not[LessEqual[beta, 6.4e+257]], $MachinePrecision]], t$95$0, 0.0625]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \frac{i}{\beta} \cdot \frac{i + \alpha}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)}\\
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+130}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 2.1 \cdot 10^{+214}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\beta \leq 3.6 \cdot 10^{+236}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{i}\\
\mathbf{elif}\;\beta \leq 6.2 \cdot 10^{+257} \lor \neg \left(\beta \leq 6.4 \cdot 10^{+257}\right):\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if beta < 1.2999999999999999e130 or 6.2000000000000001e257 < beta < 6.4000000000000002e257Initial program 20.2%
associate-/l/17.1%
associate-*l*17.1%
associate-/l*17.4%
Simplified44.1%
Taylor expanded in i around inf 80.6%
if 1.2999999999999999e130 < beta < 2.1000000000000001e214 or 3.6e236 < beta < 6.2000000000000001e257 or 6.4000000000000002e257 < beta Initial program 0.2%
associate-/l/0.0%
times-frac12.5%
Simplified12.5%
Taylor expanded in beta around inf 20.1%
Taylor expanded in beta around inf 67.9%
if 2.1000000000000001e214 < beta < 3.6e236Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified36.8%
Taylor expanded in i around inf 75.6%
Taylor expanded in i around 0 75.6%
cancel-sign-sub-inv75.6%
distribute-lft-in75.6%
distribute-lft-out75.6%
metadata-eval75.6%
*-commutative75.6%
Simplified75.6%
Taylor expanded in alpha around 0 75.6%
Final simplification78.0%
NOTE: alpha, beta, and i 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 (+ t_1 -1.0))
(t_3 (* i (+ i (+ alpha beta))))
(t_4 (* i (+ beta (+ i alpha)))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/
(* t_4 (/ (fma alpha beta t_4) (pow (fma i 2.0 (+ alpha beta)) 2.0)))
t_2)
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) i))))assert(alpha < beta && beta < i);
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 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double t_4 = i * (beta + (i + alpha));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (t_4 * (fma(alpha, beta, t_4) / pow(fma(i, 2.0, (alpha + beta)), 2.0))) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) 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(t_1 + -1.0) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) t_4 = Float64(i * Float64(beta + Float64(i + alpha))) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(t_4 * Float64(fma(alpha, beta, t_4) / (fma(i, 2.0, Float64(alpha + beta)) ^ 2.0))) / t_2); else tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / i); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(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[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(beta + N[(i + alpha), $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] / t$95$2), $MachinePrecision], Infinity], N[(N[(t$95$4 * N[(N[(alpha * beta + t$95$4), $MachinePrecision] / N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_4 := i \cdot \left(\beta + \left(i + \alpha\right)\right)\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{t\_4 \cdot \frac{\mathsf{fma}\left(\alpha, \beta, t\_4\right)}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 43.9%
associate-/l*99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
fma-undefine99.7%
pow299.7%
*-commutative99.7%
pow299.7%
associate-+r+99.7%
+-commutative99.7%
pow299.7%
Applied egg-rr99.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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.3%
Taylor expanded in i around inf 76.0%
Taylor expanded in i around 0 76.0%
cancel-sign-sub-inv76.0%
distribute-lft-in76.0%
distribute-lft-out76.0%
metadata-eval76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in alpha around 0 72.4%
Final simplification82.2%
NOTE: alpha, beta, and i 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 (* i (+ i (+ alpha beta)))))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(/
(*
(pow i 2.0)
(/ (* (+ i beta) (+ i beta)) (pow (+ beta (* i 2.0)) 2.0)))
(+
(+ (* i (+ (* i 4.0) (* (+ alpha beta) 4.0))) (pow (+ alpha beta) 2.0))
-1.0))
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) i))))assert(alpha < beta && beta < i);
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 = i * (i + (alpha + beta));
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (pow(i, 2.0) * (((i + beta) * (i + beta)) / pow((beta + (i * 2.0)), 2.0))) / (((i * ((i * 4.0) + ((alpha + beta) * 4.0))) + pow((alpha + beta), 2.0)) + -1.0);
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
assert alpha < beta && beta < i;
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 = i * (i + (alpha + beta));
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Double.POSITIVE_INFINITY) {
tmp = (Math.pow(i, 2.0) * (((i + beta) * (i + beta)) / Math.pow((beta + (i * 2.0)), 2.0))) / (((i * ((i * 4.0) + ((alpha + beta) * 4.0))) + Math.pow((alpha + beta), 2.0)) + -1.0);
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (alpha + beta)) tmp = 0 if (((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= math.inf: tmp = (math.pow(i, 2.0) * (((i + beta) * (i + beta)) / math.pow((beta + (i * 2.0)), 2.0))) / (((i * ((i * 4.0) + ((alpha + beta) * 4.0))) + math.pow((alpha + beta), 2.0)) + -1.0) else: tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) 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(i * Float64(i + Float64(alpha + beta))) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64((i ^ 2.0) * Float64(Float64(Float64(i + beta) * Float64(i + beta)) / (Float64(beta + Float64(i * 2.0)) ^ 2.0))) / Float64(Float64(Float64(i * Float64(Float64(i * 4.0) + Float64(Float64(alpha + beta) * 4.0))) + (Float64(alpha + beta) ^ 2.0)) + -1.0)); else tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (alpha + beta));
tmp = 0.0;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Inf)
tmp = ((i ^ 2.0) * (((i + beta) * (i + beta)) / ((beta + (i * 2.0)) ^ 2.0))) / (((i * ((i * 4.0) + ((alpha + beta) * 4.0))) + ((alpha + beta) ^ 2.0)) + -1.0);
else
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[Power[i, 2.0], $MachinePrecision] * N[(N[(N[(i + beta), $MachinePrecision] * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(i * N[(N[(i * 4.0), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[Power[N[(alpha + beta), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\
\;\;\;\;\frac{{i}^{2} \cdot \frac{\left(i + \beta\right) \cdot \left(i + \beta\right)}{{\left(\beta + i \cdot 2\right)}^{2}}}{\left(i \cdot \left(i \cdot 4 + \left(\alpha + \beta\right) \cdot 4\right) + {\left(\alpha + \beta\right)}^{2}\right) + -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 43.9%
associate-/l*99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
fma-undefine99.7%
pow299.7%
*-commutative99.7%
pow299.7%
associate-+r+99.7%
+-commutative99.7%
pow299.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 39.0%
associate-/l*87.4%
Simplified87.4%
unpow287.4%
Applied egg-rr87.4%
Taylor expanded in i around 0 87.4%
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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.3%
Taylor expanded in i around inf 76.0%
Taylor expanded in i around 0 76.0%
cancel-sign-sub-inv76.0%
distribute-lft-in76.0%
distribute-lft-out76.0%
metadata-eval76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in alpha around 0 72.4%
Final simplification77.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ alpha beta)))))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(/
(*
(* i (+ beta (+ i alpha)))
(/ (* i (+ i beta)) (pow (+ beta (* i 2.0)) 2.0)))
(+
(+ (* i (+ (* i 4.0) (* (+ alpha beta) 4.0))) (pow (+ alpha beta) 2.0))
-1.0))
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) i))))assert(alpha < beta && beta < i);
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 = i * (i + (alpha + beta));
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = ((i * (beta + (i + alpha))) * ((i * (i + beta)) / pow((beta + (i * 2.0)), 2.0))) / (((i * ((i * 4.0) + ((alpha + beta) * 4.0))) + pow((alpha + beta), 2.0)) + -1.0);
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
assert alpha < beta && beta < i;
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 = i * (i + (alpha + beta));
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Double.POSITIVE_INFINITY) {
tmp = ((i * (beta + (i + alpha))) * ((i * (i + beta)) / Math.pow((beta + (i * 2.0)), 2.0))) / (((i * ((i * 4.0) + ((alpha + beta) * 4.0))) + Math.pow((alpha + beta), 2.0)) + -1.0);
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (alpha + beta)) tmp = 0 if (((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= math.inf: tmp = ((i * (beta + (i + alpha))) * ((i * (i + beta)) / math.pow((beta + (i * 2.0)), 2.0))) / (((i * ((i * 4.0) + ((alpha + beta) * 4.0))) + math.pow((alpha + beta), 2.0)) + -1.0) else: tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) 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(i * Float64(i + Float64(alpha + beta))) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(Float64(i * Float64(beta + Float64(i + alpha))) * Float64(Float64(i * Float64(i + beta)) / (Float64(beta + Float64(i * 2.0)) ^ 2.0))) / Float64(Float64(Float64(i * Float64(Float64(i * 4.0) + Float64(Float64(alpha + beta) * 4.0))) + (Float64(alpha + beta) ^ 2.0)) + -1.0)); else tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (alpha + beta));
tmp = 0.0;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Inf)
tmp = ((i * (beta + (i + alpha))) * ((i * (i + beta)) / ((beta + (i * 2.0)) ^ 2.0))) / (((i * ((i * 4.0) + ((alpha + beta) * 4.0))) + ((alpha + beta) ^ 2.0)) + -1.0);
else
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(i * N[(beta + N[(i + alpha), $MachinePrecision]), $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[(N[(i * N[(N[(i * 4.0), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[Power[N[(alpha + beta), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\
\;\;\;\;\frac{\left(i \cdot \left(\beta + \left(i + \alpha\right)\right)\right) \cdot \frac{i \cdot \left(i + \beta\right)}{{\left(\beta + i \cdot 2\right)}^{2}}}{\left(i \cdot \left(i \cdot 4 + \left(\alpha + \beta\right) \cdot 4\right) + {\left(\alpha + \beta\right)}^{2}\right) + -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 43.9%
associate-/l*99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
fma-undefine99.7%
pow299.7%
*-commutative99.7%
pow299.7%
associate-+r+99.7%
+-commutative99.7%
pow299.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 87.9%
Taylor expanded in i around 0 88.0%
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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.3%
Taylor expanded in i around inf 76.0%
Taylor expanded in i around 0 76.0%
cancel-sign-sub-inv76.0%
distribute-lft-in76.0%
distribute-lft-out76.0%
metadata-eval76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in alpha around 0 72.4%
Final simplification78.0%
NOTE: alpha, beta, and i 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 (+ t_1 -1.0))
(t_3 (* i (+ i (+ alpha beta)))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
(pow i 2.0)
(/ (* (+ i beta) (+ i beta)) (pow (+ beta (* i 2.0)) 2.0)))
t_2)
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) i))))assert(alpha < beta && beta < i);
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 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (pow(i, 2.0) * (((i + beta) * (i + beta)) / pow((beta + (i * 2.0)), 2.0))) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
assert alpha < beta && beta < i;
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 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
tmp = (Math.pow(i, 2.0) * (((i + beta) * (i + beta)) / Math.pow((beta + (i * 2.0)), 2.0))) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = t_1 + -1.0 t_3 = i * (i + (alpha + beta)) tmp = 0 if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= math.inf: tmp = (math.pow(i, 2.0) * (((i + beta) * (i + beta)) / math.pow((beta + (i * 2.0)), 2.0))) / t_2 else: tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) 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(t_1 + -1.0) 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) / t_2) <= Inf) tmp = Float64(Float64((i ^ 2.0) * Float64(Float64(Float64(i + beta) * Float64(i + beta)) / (Float64(beta + Float64(i * 2.0)) ^ 2.0))) / t_2); else tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = t_1 + -1.0;
t_3 = i * (i + (alpha + beta));
tmp = 0.0;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Inf)
tmp = ((i ^ 2.0) * (((i + beta) * (i + beta)) / ((beta + (i * 2.0)) ^ 2.0))) / t_2;
else
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(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[(t$95$1 + -1.0), $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] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[Power[i, 2.0], $MachinePrecision] * N[(N[(N[(i + beta), $MachinePrecision] * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
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\_2} \leq \infty:\\
\;\;\;\;\frac{{i}^{2} \cdot \frac{\left(i + \beta\right) \cdot \left(i + \beta\right)}{{\left(\beta + i \cdot 2\right)}^{2}}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 43.9%
associate-/l*99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
fma-undefine99.7%
pow299.7%
*-commutative99.7%
pow299.7%
associate-+r+99.7%
+-commutative99.7%
pow299.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 39.0%
associate-/l*87.4%
Simplified87.4%
unpow287.4%
Applied egg-rr87.4%
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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.3%
Taylor expanded in i around inf 76.0%
Taylor expanded in i around 0 76.0%
cancel-sign-sub-inv76.0%
distribute-lft-in76.0%
distribute-lft-out76.0%
metadata-eval76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in alpha around 0 72.4%
Final simplification77.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* i (+ i (+ alpha beta)))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
(* i (+ beta (+ i alpha)))
(/ (* i (+ i beta)) (pow (+ beta (* i 2.0)) 2.0)))
t_2)
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) i))))assert(alpha < beta && beta < i);
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 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = ((i * (beta + (i + alpha))) * ((i * (i + beta)) / pow((beta + (i * 2.0)), 2.0))) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
assert alpha < beta && beta < i;
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 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
tmp = ((i * (beta + (i + alpha))) * ((i * (i + beta)) / Math.pow((beta + (i * 2.0)), 2.0))) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = t_1 + -1.0 t_3 = i * (i + (alpha + beta)) tmp = 0 if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= math.inf: tmp = ((i * (beta + (i + alpha))) * ((i * (i + beta)) / math.pow((beta + (i * 2.0)), 2.0))) / t_2 else: tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) 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(t_1 + -1.0) 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) / t_2) <= Inf) tmp = Float64(Float64(Float64(i * Float64(beta + Float64(i + alpha))) * Float64(Float64(i * Float64(i + beta)) / (Float64(beta + Float64(i * 2.0)) ^ 2.0))) / t_2); else tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = t_1 + -1.0;
t_3 = i * (i + (alpha + beta));
tmp = 0.0;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Inf)
tmp = ((i * (beta + (i + alpha))) * ((i * (i + beta)) / ((beta + (i * 2.0)) ^ 2.0))) / t_2;
else
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(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[(t$95$1 + -1.0), $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] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(i * N[(beta + N[(i + alpha), $MachinePrecision]), $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] / t$95$2), $MachinePrecision], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
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\_2} \leq \infty:\\
\;\;\;\;\frac{\left(i \cdot \left(\beta + \left(i + \alpha\right)\right)\right) \cdot \frac{i \cdot \left(i + \beta\right)}{{\left(\beta + i \cdot 2\right)}^{2}}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 43.9%
associate-/l*99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
fma-undefine99.7%
pow299.7%
*-commutative99.7%
pow299.7%
associate-+r+99.7%
+-commutative99.7%
pow299.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 87.9%
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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.3%
Taylor expanded in i around inf 76.0%
Taylor expanded in i around 0 76.0%
cancel-sign-sub-inv76.0%
distribute-lft-in76.0%
distribute-lft-out76.0%
metadata-eval76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in alpha around 0 72.4%
Final simplification78.0%
NOTE: alpha, beta, and i 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 (+ t_1 -1.0))
(t_3 (* i (+ i (+ alpha beta)))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
(* i (+ beta (+ i alpha)))
(* i (/ (+ i beta) (pow (+ beta (* i 2.0)) 2.0))))
t_2)
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) i))))assert(alpha < beta && beta < i);
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 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = ((i * (beta + (i + alpha))) * (i * ((i + beta) / pow((beta + (i * 2.0)), 2.0)))) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
assert alpha < beta && beta < i;
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 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
tmp = ((i * (beta + (i + alpha))) * (i * ((i + beta) / Math.pow((beta + (i * 2.0)), 2.0)))) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = t_1 + -1.0 t_3 = i * (i + (alpha + beta)) tmp = 0 if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= math.inf: tmp = ((i * (beta + (i + alpha))) * (i * ((i + beta) / math.pow((beta + (i * 2.0)), 2.0)))) / t_2 else: tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) 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(t_1 + -1.0) 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) / t_2) <= Inf) tmp = Float64(Float64(Float64(i * Float64(beta + Float64(i + alpha))) * Float64(i * Float64(Float64(i + beta) / (Float64(beta + Float64(i * 2.0)) ^ 2.0)))) / t_2); else tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = t_1 + -1.0;
t_3 = i * (i + (alpha + beta));
tmp = 0.0;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Inf)
tmp = ((i * (beta + (i + alpha))) * (i * ((i + beta) / ((beta + (i * 2.0)) ^ 2.0)))) / t_2;
else
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(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[(t$95$1 + -1.0), $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] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(i * N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i * N[(N[(i + beta), $MachinePrecision] / N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
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\_2} \leq \infty:\\
\;\;\;\;\frac{\left(i \cdot \left(\beta + \left(i + \alpha\right)\right)\right) \cdot \left(i \cdot \frac{i + \beta}{{\left(\beta + i \cdot 2\right)}^{2}}\right)}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 43.9%
associate-/l*99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
fma-undefine99.7%
pow299.7%
*-commutative99.7%
pow299.7%
associate-+r+99.7%
+-commutative99.7%
pow299.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 87.9%
associate-/l*87.6%
Simplified87.6%
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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.3%
Taylor expanded in i around inf 76.0%
Taylor expanded in i around 0 76.0%
cancel-sign-sub-inv76.0%
distribute-lft-in76.0%
distribute-lft-out76.0%
metadata-eval76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in alpha around 0 72.4%
Final simplification77.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 2.95e+184)
0.0625
(if (or (<= beta 4.4e+206)
(not
(or (<= beta 1.25e+221)
(and (not (<= beta 3.8e+232)) (<= beta 4.8e+232)))))
(/ (/ (* i i) beta) beta)
0.0625)))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.95e+184) {
tmp = 0.0625;
} else if ((beta <= 4.4e+206) || !((beta <= 1.25e+221) || (!(beta <= 3.8e+232) && (beta <= 4.8e+232)))) {
tmp = ((i * i) / beta) / beta;
} else {
tmp = 0.0625;
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 2.95d+184) then
tmp = 0.0625d0
else if ((beta <= 4.4d+206) .or. (.not. (beta <= 1.25d+221) .or. (.not. (beta <= 3.8d+232)) .and. (beta <= 4.8d+232))) then
tmp = ((i * i) / beta) / beta
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.95e+184) {
tmp = 0.0625;
} else if ((beta <= 4.4e+206) || !((beta <= 1.25e+221) || (!(beta <= 3.8e+232) && (beta <= 4.8e+232)))) {
tmp = ((i * i) / beta) / beta;
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.95e+184: tmp = 0.0625 elif (beta <= 4.4e+206) or not ((beta <= 1.25e+221) or (not (beta <= 3.8e+232) and (beta <= 4.8e+232))): tmp = ((i * i) / beta) / beta else: tmp = 0.0625 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.95e+184) tmp = 0.0625; elseif ((beta <= 4.4e+206) || !((beta <= 1.25e+221) || (!(beta <= 3.8e+232) && (beta <= 4.8e+232)))) tmp = Float64(Float64(Float64(i * i) / beta) / beta); else tmp = 0.0625; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2.95e+184)
tmp = 0.0625;
elseif ((beta <= 4.4e+206) || ~(((beta <= 1.25e+221) || (~((beta <= 3.8e+232)) && (beta <= 4.8e+232)))))
tmp = ((i * i) / beta) / beta;
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 2.95e+184], 0.0625, If[Or[LessEqual[beta, 4.4e+206], N[Not[Or[LessEqual[beta, 1.25e+221], And[N[Not[LessEqual[beta, 3.8e+232]], $MachinePrecision], LessEqual[beta, 4.8e+232]]]], $MachinePrecision]], N[(N[(N[(i * i), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.95 \cdot 10^{+184}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 4.4 \cdot 10^{+206} \lor \neg \left(\beta \leq 1.25 \cdot 10^{+221} \lor \neg \left(\beta \leq 3.8 \cdot 10^{+232}\right) \land \beta \leq 4.8 \cdot 10^{+232}\right):\\
\;\;\;\;\frac{\frac{i \cdot i}{\beta}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if beta < 2.9500000000000001e184 or 4.40000000000000003e206 < beta < 1.2500000000000001e221 or 3.8000000000000001e232 < beta < 4.8000000000000003e232Initial program 18.7%
associate-/l/15.8%
associate-*l*15.7%
associate-/l*16.1%
Simplified43.0%
Taylor expanded in i around inf 77.3%
if 2.9500000000000001e184 < beta < 4.40000000000000003e206 or 1.2500000000000001e221 < beta < 3.8000000000000001e232 or 4.8000000000000003e232 < beta Initial program 0.0%
associate-/l/0.0%
times-frac10.0%
Simplified10.0%
Taylor expanded in beta around inf 14.4%
Taylor expanded in i around 0 48.6%
Taylor expanded in i around inf 35.9%
Taylor expanded in alpha around 0 46.5%
unpow246.5%
Applied egg-rr46.5%
Final simplification72.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 1.2e+182)
0.0625
(if (or (<= beta 2.9e+214) (not (<= beta 2.25e+219)))
(* (/ i beta) (/ (+ i alpha) beta))
0.0625)))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.2e+182) {
tmp = 0.0625;
} else if ((beta <= 2.9e+214) || !(beta <= 2.25e+219)) {
tmp = (i / beta) * ((i + alpha) / beta);
} else {
tmp = 0.0625;
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.2d+182) then
tmp = 0.0625d0
else if ((beta <= 2.9d+214) .or. (.not. (beta <= 2.25d+219))) then
tmp = (i / beta) * ((i + alpha) / beta)
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.2e+182) {
tmp = 0.0625;
} else if ((beta <= 2.9e+214) || !(beta <= 2.25e+219)) {
tmp = (i / beta) * ((i + alpha) / beta);
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.2e+182: tmp = 0.0625 elif (beta <= 2.9e+214) or not (beta <= 2.25e+219): tmp = (i / beta) * ((i + alpha) / beta) else: tmp = 0.0625 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.2e+182) tmp = 0.0625; elseif ((beta <= 2.9e+214) || !(beta <= 2.25e+219)) tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta)); else tmp = 0.0625; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.2e+182)
tmp = 0.0625;
elseif ((beta <= 2.9e+214) || ~((beta <= 2.25e+219)))
tmp = (i / beta) * ((i + alpha) / beta);
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.2e+182], 0.0625, If[Or[LessEqual[beta, 2.9e+214], N[Not[LessEqual[beta, 2.25e+219]], $MachinePrecision]], N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.2 \cdot 10^{+182}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 2.9 \cdot 10^{+214} \lor \neg \left(\beta \leq 2.25 \cdot 10^{+219}\right):\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if beta < 1.20000000000000005e182 or 2.8999999999999999e214 < beta < 2.25000000000000012e219Initial program 19.0%
associate-/l/16.0%
associate-*l*15.9%
associate-/l*16.3%
Simplified43.6%
Taylor expanded in i around inf 77.9%
if 1.20000000000000005e182 < beta < 2.8999999999999999e214 or 2.25000000000000012e219 < beta Initial program 0.0%
associate-/l/0.0%
times-frac9.5%
Simplified9.5%
Taylor expanded in beta around inf 15.8%
Taylor expanded in i around 0 51.2%
Taylor expanded in beta around inf 70.6%
Final simplification76.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.4e+247) 0.0625 (/ 0.0 i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.4e+247) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.4d+247) then
tmp = 0.0625d0
else
tmp = 0.0d0 / i
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.4e+247) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.4e+247: tmp = 0.0625 else: tmp = 0.0 / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.4e+247) tmp = 0.0625; else tmp = Float64(0.0 / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.4e+247)
tmp = 0.0625;
else
tmp = 0.0 / i;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.4e+247], 0.0625, N[(0.0 / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.4 \cdot 10^{+247}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0}{i}\\
\end{array}
\end{array}
if beta < 1.3999999999999999e247Initial program 17.4%
associate-/l/14.7%
associate-*l*14.6%
associate-/l*15.0%
Simplified41.8%
Taylor expanded in i around inf 74.3%
if 1.3999999999999999e247 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified0.0%
Taylor expanded in i around inf 48.8%
Taylor expanded in i around 0 48.8%
cancel-sign-sub-inv48.8%
distribute-lft-in48.8%
distribute-lft-out48.8%
metadata-eval48.8%
*-commutative48.8%
Simplified48.8%
Taylor expanded in i around 0 41.6%
distribute-rgt-out41.6%
metadata-eval41.6%
mul0-rgt41.6%
Simplified41.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 15.8%
associate-/l/13.3%
associate-*l*13.3%
associate-/l*13.6%
Simplified37.8%
Taylor expanded in i around inf 68.4%
herbie shell --seed 2024107
(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)))