
(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 14 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
(let* ((t_0 (+ (+ beta alpha) (* 2.0 i)))
(t_1 (* -0.0625 (- (+ beta alpha) (+ beta alpha)))))
(if (<= beta 6.6e+83)
(+
(+
0.0625
(/
(-
(* (+ beta alpha) t_1)
(* (+ (pow (+ beta alpha) 2.0) -1.0) 0.015625))
(* i i)))
(/ t_1 i))
(if (<= beta 7.5e+153)
(/
(/ (* i i) (/ (pow (fma i 2.0 beta) 2.0) (pow (+ beta i) 2.0)))
(+ -1.0 (* t_0 t_0)))
(if (<= beta 9e+165)
(- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ beta alpha) i)))
(/ (/ i (/ beta (+ alpha i))) beta))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (2.0 * i);
double t_1 = -0.0625 * ((beta + alpha) - (beta + alpha));
double tmp;
if (beta <= 6.6e+83) {
tmp = (0.0625 + ((((beta + alpha) * t_1) - ((pow((beta + alpha), 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_1 / i);
} else if (beta <= 7.5e+153) {
tmp = ((i * i) / (pow(fma(i, 2.0, beta), 2.0) / pow((beta + i), 2.0))) / (-1.0 + (t_0 * t_0));
} else if (beta <= 9e+165) {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(2.0 * i)) t_1 = Float64(-0.0625 * Float64(Float64(beta + alpha) - Float64(beta + alpha))) tmp = 0.0 if (beta <= 6.6e+83) tmp = Float64(Float64(0.0625 + Float64(Float64(Float64(Float64(beta + alpha) * t_1) - Float64(Float64((Float64(beta + alpha) ^ 2.0) + -1.0) * 0.015625)) / Float64(i * i))) + Float64(t_1 / i)); elseif (beta <= 7.5e+153) tmp = Float64(Float64(Float64(i * i) / Float64((fma(i, 2.0, beta) ^ 2.0) / (Float64(beta + i) ^ 2.0))) / Float64(-1.0 + Float64(t_0 * t_0))); elseif (beta <= 9e+165) tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(i / Float64(beta / Float64(alpha + i))) / beta); 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[(beta + alpha), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-0.0625 * N[(N[(beta + alpha), $MachinePrecision] - N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 6.6e+83], N[(N[(0.0625 + N[(N[(N[(N[(beta + alpha), $MachinePrecision] * t$95$1), $MachinePrecision] - N[(N[(N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision] * 0.015625), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 7.5e+153], N[(N[(N[(i * i), $MachinePrecision] / N[(N[Power[N[(i * 2.0 + beta), $MachinePrecision], 2.0], $MachinePrecision] / N[Power[N[(beta + i), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-1.0 + N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 9e+165], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(beta / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2 \cdot i\\
t_1 := -0.0625 \cdot \left(\left(\beta + \alpha\right) - \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\beta \leq 6.6 \cdot 10^{+83}:\\
\;\;\;\;\left(0.0625 + \frac{\left(\beta + \alpha\right) \cdot t_1 - \left({\left(\beta + \alpha\right)}^{2} + -1\right) \cdot 0.015625}{i \cdot i}\right) + \frac{t_1}{i}\\
\mathbf{elif}\;\beta \leq 7.5 \cdot 10^{+153}:\\
\;\;\;\;\frac{\frac{i \cdot i}{\frac{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}}{{\left(\beta + i\right)}^{2}}}}{-1 + t_0 \cdot t_0}\\
\mathbf{elif}\;\beta \leq 9 \cdot 10^{+165}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta}{\alpha + i}}}{\beta}\\
\end{array}
\end{array}
if beta < 6.59999999999999969e83Initial program 19.4%
Taylor expanded in i around inf 40.7%
fma-def40.7%
unpow240.7%
distribute-lft-out--40.7%
distribute-lft-out40.7%
Simplified40.7%
Taylor expanded in i around -inf 79.8%
associate-+r+79.8%
mul-1-neg79.8%
unsub-neg79.8%
Simplified79.8%
if 6.59999999999999969e83 < beta < 7.50000000000000065e153Initial program 14.3%
Taylor expanded in alpha around 0 14.4%
associate-/l*65.2%
unpow265.2%
+-commutative65.2%
*-commutative65.2%
fma-udef65.2%
Simplified65.2%
if 7.50000000000000065e153 < beta < 8.9999999999999993e165Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified2.4%
Taylor expanded in i around inf 77.4%
Taylor expanded in alpha around 0 77.4%
Taylor expanded in i around 0 77.4%
if 8.9999999999999993e165 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified9.4%
Taylor expanded in beta around inf 29.5%
associate-/l*30.7%
unpow230.7%
Simplified30.7%
add-cbrt-cube30.7%
associate-/l*30.7%
associate-/l*30.7%
associate-/l*42.4%
Applied egg-rr42.4%
associate-*l*42.4%
associate-/r/42.5%
associate-/r/42.5%
associate-/r/47.4%
Simplified47.4%
cube-unmult47.4%
rem-cbrt-cube89.7%
associate-*l/89.8%
+-commutative89.8%
Applied egg-rr89.8%
Taylor expanded in beta around 0 67.6%
associate-/l*89.8%
Simplified89.8%
Final simplification79.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ alpha (fma i 2.0 beta)))
(t_1 (+ (+ beta alpha) i))
(t_2 (* -0.0625 (- (+ beta alpha) (+ beta alpha)))))
(if (<= beta 3.3e+81)
(+
(+
0.0625
(/
(-
(* (+ beta alpha) t_2)
(* (+ (pow (+ beta alpha) 2.0) -1.0) 0.015625))
(* i i)))
(/ t_2 i))
(if (<= beta 6.5e+142)
(*
(/ i (fma t_0 t_0 -1.0))
(* (/ (fma i t_1 (* beta alpha)) t_0) (/ t_1 t_0)))
(/ (/ i (/ beta (+ alpha i))) beta)))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = alpha + fma(i, 2.0, beta);
double t_1 = (beta + alpha) + i;
double t_2 = -0.0625 * ((beta + alpha) - (beta + alpha));
double tmp;
if (beta <= 3.3e+81) {
tmp = (0.0625 + ((((beta + alpha) * t_2) - ((pow((beta + alpha), 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_2 / i);
} else if (beta <= 6.5e+142) {
tmp = (i / fma(t_0, t_0, -1.0)) * ((fma(i, t_1, (beta * alpha)) / t_0) * (t_1 / t_0));
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(alpha + fma(i, 2.0, beta)) t_1 = Float64(Float64(beta + alpha) + i) t_2 = Float64(-0.0625 * Float64(Float64(beta + alpha) - Float64(beta + alpha))) tmp = 0.0 if (beta <= 3.3e+81) tmp = Float64(Float64(0.0625 + Float64(Float64(Float64(Float64(beta + alpha) * t_2) - Float64(Float64((Float64(beta + alpha) ^ 2.0) + -1.0) * 0.015625)) / Float64(i * i))) + Float64(t_2 / i)); elseif (beta <= 6.5e+142) tmp = Float64(Float64(i / fma(t_0, t_0, -1.0)) * Float64(Float64(fma(i, t_1, Float64(beta * alpha)) / t_0) * Float64(t_1 / t_0))); else tmp = Float64(Float64(i / Float64(beta / Float64(alpha + i))) / beta); 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[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision]}, Block[{t$95$2 = N[(-0.0625 * N[(N[(beta + alpha), $MachinePrecision] - N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.3e+81], N[(N[(0.0625 + N[(N[(N[(N[(beta + alpha), $MachinePrecision] * t$95$2), $MachinePrecision] - N[(N[(N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision] * 0.015625), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 6.5e+142], N[(N[(i / N[(t$95$0 * t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i * t$95$1 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(t$95$1 / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(beta / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\
t_1 := \left(\beta + \alpha\right) + i\\
t_2 := -0.0625 \cdot \left(\left(\beta + \alpha\right) - \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\beta \leq 3.3 \cdot 10^{+81}:\\
\;\;\;\;\left(0.0625 + \frac{\left(\beta + \alpha\right) \cdot t_2 - \left({\left(\beta + \alpha\right)}^{2} + -1\right) \cdot 0.015625}{i \cdot i}\right) + \frac{t_2}{i}\\
\mathbf{elif}\;\beta \leq 6.5 \cdot 10^{+142}:\\
\;\;\;\;\frac{i}{\mathsf{fma}\left(t_0, t_0, -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, t_1, \beta \cdot \alpha\right)}{t_0} \cdot \frac{t_1}{t_0}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta}{\alpha + i}}}{\beta}\\
\end{array}
\end{array}
if beta < 3.3e81Initial program 19.4%
Taylor expanded in i around inf 40.7%
fma-def40.7%
unpow240.7%
distribute-lft-out--40.7%
distribute-lft-out40.7%
Simplified40.7%
Taylor expanded in i around -inf 79.8%
associate-+r+79.8%
mul-1-neg79.8%
unsub-neg79.8%
Simplified79.8%
if 3.3e81 < beta < 6.4999999999999997e142Initial program 17.1%
associate-/l/0.7%
associate-*l*0.7%
times-frac37.4%
Simplified68.1%
if 6.4999999999999997e142 < beta Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified12.4%
Taylor expanded in beta around inf 29.1%
associate-/l*30.3%
unpow230.3%
Simplified30.3%
add-cbrt-cube28.1%
associate-/l*28.1%
associate-/l*28.0%
associate-/l*37.8%
Applied egg-rr37.8%
associate-*l*37.8%
associate-/r/37.9%
associate-/r/37.9%
associate-/r/41.9%
Simplified41.9%
cube-unmult41.9%
rem-cbrt-cube80.9%
associate-*l/81.0%
+-commutative81.0%
Applied egg-rr81.0%
Taylor expanded in beta around 0 62.6%
associate-/l*80.9%
Simplified80.9%
Final simplification79.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma i 2.0 (+ beta alpha)))
(t_1 (+ (+ beta alpha) i))
(t_2 (* -0.0625 (- (+ beta alpha) (+ beta alpha)))))
(if (<= beta 9.8e+80)
(+
(+
0.0625
(/
(-
(* (+ beta alpha) t_2)
(* (+ (pow (+ beta alpha) 2.0) -1.0) 0.015625))
(* i i)))
(/ t_2 i))
(if (<= beta 3e+143)
(*
(* (/ i (+ -1.0 (pow t_0 2.0))) (/ (fma i t_1 (* beta alpha)) t_0))
(/ t_1 t_0))
(/ (/ i (/ beta (+ alpha i))) beta)))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (beta + alpha));
double t_1 = (beta + alpha) + i;
double t_2 = -0.0625 * ((beta + alpha) - (beta + alpha));
double tmp;
if (beta <= 9.8e+80) {
tmp = (0.0625 + ((((beta + alpha) * t_2) - ((pow((beta + alpha), 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_2 / i);
} else if (beta <= 3e+143) {
tmp = ((i / (-1.0 + pow(t_0, 2.0))) * (fma(i, t_1, (beta * alpha)) / t_0)) * (t_1 / t_0);
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(beta + alpha)) t_1 = Float64(Float64(beta + alpha) + i) t_2 = Float64(-0.0625 * Float64(Float64(beta + alpha) - Float64(beta + alpha))) tmp = 0.0 if (beta <= 9.8e+80) tmp = Float64(Float64(0.0625 + Float64(Float64(Float64(Float64(beta + alpha) * t_2) - Float64(Float64((Float64(beta + alpha) ^ 2.0) + -1.0) * 0.015625)) / Float64(i * i))) + Float64(t_2 / i)); elseif (beta <= 3e+143) tmp = Float64(Float64(Float64(i / Float64(-1.0 + (t_0 ^ 2.0))) * Float64(fma(i, t_1, Float64(beta * alpha)) / t_0)) * Float64(t_1 / t_0)); else tmp = Float64(Float64(i / Float64(beta / Float64(alpha + i))) / beta); 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 * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision]}, Block[{t$95$2 = N[(-0.0625 * N[(N[(beta + alpha), $MachinePrecision] - N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 9.8e+80], N[(N[(0.0625 + N[(N[(N[(N[(beta + alpha), $MachinePrecision] * t$95$2), $MachinePrecision] - N[(N[(N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision] * 0.015625), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3e+143], N[(N[(N[(i / N[(-1.0 + N[Power[t$95$0, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * t$95$1 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(beta / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(i, 2, \beta + \alpha\right)\\
t_1 := \left(\beta + \alpha\right) + i\\
t_2 := -0.0625 \cdot \left(\left(\beta + \alpha\right) - \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\beta \leq 9.8 \cdot 10^{+80}:\\
\;\;\;\;\left(0.0625 + \frac{\left(\beta + \alpha\right) \cdot t_2 - \left({\left(\beta + \alpha\right)}^{2} + -1\right) \cdot 0.015625}{i \cdot i}\right) + \frac{t_2}{i}\\
\mathbf{elif}\;\beta \leq 3 \cdot 10^{+143}:\\
\;\;\;\;\left(\frac{i}{-1 + {t_0}^{2}} \cdot \frac{\mathsf{fma}\left(i, t_1, \beta \cdot \alpha\right)}{t_0}\right) \cdot \frac{t_1}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta}{\alpha + i}}}{\beta}\\
\end{array}
\end{array}
if beta < 9.79999999999999919e80Initial program 19.4%
Taylor expanded in i around inf 40.7%
fma-def40.7%
unpow240.7%
distribute-lft-out--40.7%
distribute-lft-out40.7%
Simplified40.7%
Taylor expanded in i around -inf 79.8%
associate-+r+79.8%
mul-1-neg79.8%
unsub-neg79.8%
Simplified79.8%
if 9.79999999999999919e80 < beta < 3.0000000000000001e143Initial program 17.1%
Simplified0.7%
Applied egg-rr68.1%
if 3.0000000000000001e143 < beta Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified12.4%
Taylor expanded in beta around inf 29.1%
associate-/l*30.3%
unpow230.3%
Simplified30.3%
add-cbrt-cube28.1%
associate-/l*28.1%
associate-/l*28.0%
associate-/l*37.8%
Applied egg-rr37.8%
associate-*l*37.8%
associate-/r/37.9%
associate-/r/37.9%
associate-/r/41.9%
Simplified41.9%
cube-unmult41.9%
rem-cbrt-cube80.9%
associate-*l/81.0%
+-commutative81.0%
Applied egg-rr81.0%
Taylor expanded in beta around 0 62.6%
associate-/l*80.9%
Simplified80.9%
Final simplification79.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (pow (fma i 2.0 (+ beta alpha)) 2.0))
(t_1 (+ (+ beta alpha) i))
(t_2 (* -0.0625 (- (+ beta alpha) (+ beta alpha)))))
(if (<= beta 2.45e+83)
(+
(+
0.0625
(/
(-
(* (+ beta alpha) t_2)
(* (+ (pow (+ beta alpha) 2.0) -1.0) 0.015625))
(* i i)))
(/ t_2 i))
(if (<= beta 1.85e+143)
(/ i (/ (+ -1.0 t_0) (* t_1 (/ (fma i t_1 (* beta alpha)) t_0))))
(/ (/ i (/ beta (+ alpha i))) beta)))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = pow(fma(i, 2.0, (beta + alpha)), 2.0);
double t_1 = (beta + alpha) + i;
double t_2 = -0.0625 * ((beta + alpha) - (beta + alpha));
double tmp;
if (beta <= 2.45e+83) {
tmp = (0.0625 + ((((beta + alpha) * t_2) - ((pow((beta + alpha), 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_2 / i);
} else if (beta <= 1.85e+143) {
tmp = i / ((-1.0 + t_0) / (t_1 * (fma(i, t_1, (beta * alpha)) / t_0)));
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(beta + alpha)) ^ 2.0 t_1 = Float64(Float64(beta + alpha) + i) t_2 = Float64(-0.0625 * Float64(Float64(beta + alpha) - Float64(beta + alpha))) tmp = 0.0 if (beta <= 2.45e+83) tmp = Float64(Float64(0.0625 + Float64(Float64(Float64(Float64(beta + alpha) * t_2) - Float64(Float64((Float64(beta + alpha) ^ 2.0) + -1.0) * 0.015625)) / Float64(i * i))) + Float64(t_2 / i)); elseif (beta <= 1.85e+143) tmp = Float64(i / Float64(Float64(-1.0 + t_0) / Float64(t_1 * Float64(fma(i, t_1, Float64(beta * alpha)) / t_0)))); else tmp = Float64(Float64(i / Float64(beta / Float64(alpha + i))) / beta); 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[Power[N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision]}, Block[{t$95$2 = N[(-0.0625 * N[(N[(beta + alpha), $MachinePrecision] - N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.45e+83], N[(N[(0.0625 + N[(N[(N[(N[(beta + alpha), $MachinePrecision] * t$95$2), $MachinePrecision] - N[(N[(N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision] * 0.015625), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.85e+143], N[(i / N[(N[(-1.0 + t$95$0), $MachinePrecision] / N[(t$95$1 * N[(N[(i * t$95$1 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(beta / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := {\left(\mathsf{fma}\left(i, 2, \beta + \alpha\right)\right)}^{2}\\
t_1 := \left(\beta + \alpha\right) + i\\
t_2 := -0.0625 \cdot \left(\left(\beta + \alpha\right) - \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\beta \leq 2.45 \cdot 10^{+83}:\\
\;\;\;\;\left(0.0625 + \frac{\left(\beta + \alpha\right) \cdot t_2 - \left({\left(\beta + \alpha\right)}^{2} + -1\right) \cdot 0.015625}{i \cdot i}\right) + \frac{t_2}{i}\\
\mathbf{elif}\;\beta \leq 1.85 \cdot 10^{+143}:\\
\;\;\;\;\frac{i}{\frac{-1 + t_0}{t_1 \cdot \frac{\mathsf{fma}\left(i, t_1, \beta \cdot \alpha\right)}{t_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta}{\alpha + i}}}{\beta}\\
\end{array}
\end{array}
if beta < 2.44999999999999989e83Initial program 19.4%
Taylor expanded in i around inf 40.7%
fma-def40.7%
unpow240.7%
distribute-lft-out--40.7%
distribute-lft-out40.7%
Simplified40.7%
Taylor expanded in i around -inf 79.8%
associate-+r+79.8%
mul-1-neg79.8%
unsub-neg79.8%
Simplified79.8%
if 2.44999999999999989e83 < beta < 1.8500000000000001e143Initial program 17.1%
associate-/l/0.7%
associate-*l*0.7%
times-frac37.4%
Simplified68.1%
associate-*l/68.0%
Applied egg-rr68.0%
associate-/l*68.0%
+-commutative68.0%
associate-/r/67.9%
+-commutative67.9%
+-commutative67.9%
Simplified67.9%
if 1.8500000000000001e143 < beta Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified12.4%
Taylor expanded in beta around inf 29.1%
associate-/l*30.3%
unpow230.3%
Simplified30.3%
add-cbrt-cube28.1%
associate-/l*28.1%
associate-/l*28.0%
associate-/l*37.8%
Applied egg-rr37.8%
associate-*l*37.8%
associate-/r/37.9%
associate-/r/37.9%
associate-/r/41.9%
Simplified41.9%
cube-unmult41.9%
rem-cbrt-cube80.9%
associate-*l/81.0%
+-commutative81.0%
Applied egg-rr81.0%
Taylor expanded in beta around 0 62.6%
associate-/l*80.9%
Simplified80.9%
Final simplification79.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) i))
(t_1 (fma i 2.0 (+ beta alpha)))
(t_2 (+ (+ beta alpha) (* 2.0 i)))
(t_3 (* -0.0625 (- (+ beta alpha) (+ beta alpha)))))
(if (<= beta 1.2e+83)
(+
(+
0.0625
(/
(-
(* (+ beta alpha) t_3)
(* (+ (pow (+ beta alpha) 2.0) -1.0) 0.015625))
(* i i)))
(/ t_3 i))
(if (<= beta 2e+142)
(/
(* (/ (fma i t_0 (* beta alpha)) t_1) (/ (* i t_0) t_1))
(+ -1.0 (* t_2 t_2)))
(/ (/ i (/ beta (+ alpha i))) beta)))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + i;
double t_1 = fma(i, 2.0, (beta + alpha));
double t_2 = (beta + alpha) + (2.0 * i);
double t_3 = -0.0625 * ((beta + alpha) - (beta + alpha));
double tmp;
if (beta <= 1.2e+83) {
tmp = (0.0625 + ((((beta + alpha) * t_3) - ((pow((beta + alpha), 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_3 / i);
} else if (beta <= 2e+142) {
tmp = ((fma(i, t_0, (beta * alpha)) / t_1) * ((i * t_0) / t_1)) / (-1.0 + (t_2 * t_2));
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + i) t_1 = fma(i, 2.0, Float64(beta + alpha)) t_2 = Float64(Float64(beta + alpha) + Float64(2.0 * i)) t_3 = Float64(-0.0625 * Float64(Float64(beta + alpha) - Float64(beta + alpha))) tmp = 0.0 if (beta <= 1.2e+83) tmp = Float64(Float64(0.0625 + Float64(Float64(Float64(Float64(beta + alpha) * t_3) - Float64(Float64((Float64(beta + alpha) ^ 2.0) + -1.0) * 0.015625)) / Float64(i * i))) + Float64(t_3 / i)); elseif (beta <= 2e+142) tmp = Float64(Float64(Float64(fma(i, t_0, Float64(beta * alpha)) / t_1) * Float64(Float64(i * t_0) / t_1)) / Float64(-1.0 + Float64(t_2 * t_2))); else tmp = Float64(Float64(i / Float64(beta / Float64(alpha + i))) / beta); 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[(beta + alpha), $MachinePrecision] + i), $MachinePrecision]}, Block[{t$95$1 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(beta + alpha), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-0.0625 * N[(N[(beta + alpha), $MachinePrecision] - N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.2e+83], N[(N[(0.0625 + N[(N[(N[(N[(beta + alpha), $MachinePrecision] * t$95$3), $MachinePrecision] - N[(N[(N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision] * 0.015625), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$3 / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2e+142], N[(N[(N[(N[(i * t$95$0 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(i * t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] / N[(-1.0 + N[(t$95$2 * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(beta / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i\\
t_1 := \mathsf{fma}\left(i, 2, \beta + \alpha\right)\\
t_2 := \left(\beta + \alpha\right) + 2 \cdot i\\
t_3 := -0.0625 \cdot \left(\left(\beta + \alpha\right) - \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\beta \leq 1.2 \cdot 10^{+83}:\\
\;\;\;\;\left(0.0625 + \frac{\left(\beta + \alpha\right) \cdot t_3 - \left({\left(\beta + \alpha\right)}^{2} + -1\right) \cdot 0.015625}{i \cdot i}\right) + \frac{t_3}{i}\\
\mathbf{elif}\;\beta \leq 2 \cdot 10^{+142}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, t_0, \beta \cdot \alpha\right)}{t_1} \cdot \frac{i \cdot t_0}{t_1}}{-1 + t_2 \cdot t_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta}{\alpha + i}}}{\beta}\\
\end{array}
\end{array}
if beta < 1.19999999999999996e83Initial program 19.4%
Taylor expanded in i around inf 40.7%
fma-def40.7%
unpow240.7%
distribute-lft-out--40.7%
distribute-lft-out40.7%
Simplified40.7%
Taylor expanded in i around -inf 79.8%
associate-+r+79.8%
mul-1-neg79.8%
unsub-neg79.8%
Simplified79.8%
if 1.19999999999999996e83 < beta < 2.0000000000000001e142Initial program 17.1%
times-frac67.9%
+-commutative67.9%
+-commutative67.9%
*-commutative67.9%
fma-udef67.9%
+-commutative67.9%
associate-+l+67.9%
+-commutative67.9%
*-commutative67.9%
+-commutative67.9%
associate-+l+67.9%
+-commutative67.9%
fma-udef67.9%
+-commutative67.9%
*-commutative67.9%
fma-udef67.9%
Applied egg-rr67.9%
if 2.0000000000000001e142 < beta Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified12.4%
Taylor expanded in beta around inf 29.1%
associate-/l*30.3%
unpow230.3%
Simplified30.3%
add-cbrt-cube28.1%
associate-/l*28.1%
associate-/l*28.0%
associate-/l*37.8%
Applied egg-rr37.8%
associate-*l*37.8%
associate-/r/37.9%
associate-/r/37.9%
associate-/r/41.9%
Simplified41.9%
cube-unmult41.9%
rem-cbrt-cube80.9%
associate-*l/81.0%
+-commutative81.0%
Applied egg-rr81.0%
Taylor expanded in beta around 0 62.6%
associate-/l*80.9%
Simplified80.9%
Final simplification79.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ beta (* 2.0 i)))
(t_1 (* -0.0625 (- (+ beta alpha) (+ beta alpha)))))
(if (<= beta 9.8e+80)
(+
(+
0.0625
(/
(-
(* (+ beta alpha) t_1)
(* (+ (pow (+ beta alpha) 2.0) -1.0) 0.015625))
(* i i)))
(/ t_1 i))
(if (<= beta 4.8e+153)
(*
(/ i (+ -1.0 (pow t_0 2.0)))
(*
(/ (+ (+ beta alpha) i) (+ alpha (fma i 2.0 beta)))
(/ (* i (+ beta i)) t_0)))
(if (<= beta 1.2e+164)
(- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ beta alpha) i)))
(/ (/ i (/ beta (+ alpha i))) beta))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = beta + (2.0 * i);
double t_1 = -0.0625 * ((beta + alpha) - (beta + alpha));
double tmp;
if (beta <= 9.8e+80) {
tmp = (0.0625 + ((((beta + alpha) * t_1) - ((pow((beta + alpha), 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_1 / i);
} else if (beta <= 4.8e+153) {
tmp = (i / (-1.0 + pow(t_0, 2.0))) * ((((beta + alpha) + i) / (alpha + fma(i, 2.0, beta))) * ((i * (beta + i)) / t_0));
} else if (beta <= 1.2e+164) {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(beta + Float64(2.0 * i)) t_1 = Float64(-0.0625 * Float64(Float64(beta + alpha) - Float64(beta + alpha))) tmp = 0.0 if (beta <= 9.8e+80) tmp = Float64(Float64(0.0625 + Float64(Float64(Float64(Float64(beta + alpha) * t_1) - Float64(Float64((Float64(beta + alpha) ^ 2.0) + -1.0) * 0.015625)) / Float64(i * i))) + Float64(t_1 / i)); elseif (beta <= 4.8e+153) tmp = Float64(Float64(i / Float64(-1.0 + (t_0 ^ 2.0))) * Float64(Float64(Float64(Float64(beta + alpha) + i) / Float64(alpha + fma(i, 2.0, beta))) * Float64(Float64(i * Float64(beta + i)) / t_0))); elseif (beta <= 1.2e+164) tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(i / Float64(beta / Float64(alpha + i))) / beta); 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[(beta + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-0.0625 * N[(N[(beta + alpha), $MachinePrecision] - N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 9.8e+80], N[(N[(0.0625 + N[(N[(N[(N[(beta + alpha), $MachinePrecision] * t$95$1), $MachinePrecision] - N[(N[(N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision] * 0.015625), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 4.8e+153], N[(N[(i / N[(-1.0 + N[Power[t$95$0, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision] / N[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.2e+164], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(beta / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + 2 \cdot i\\
t_1 := -0.0625 \cdot \left(\left(\beta + \alpha\right) - \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\beta \leq 9.8 \cdot 10^{+80}:\\
\;\;\;\;\left(0.0625 + \frac{\left(\beta + \alpha\right) \cdot t_1 - \left({\left(\beta + \alpha\right)}^{2} + -1\right) \cdot 0.015625}{i \cdot i}\right) + \frac{t_1}{i}\\
\mathbf{elif}\;\beta \leq 4.8 \cdot 10^{+153}:\\
\;\;\;\;\frac{i}{-1 + {t_0}^{2}} \cdot \left(\frac{\left(\beta + \alpha\right) + i}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i \cdot \left(\beta + i\right)}{t_0}\right)\\
\mathbf{elif}\;\beta \leq 1.2 \cdot 10^{+164}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta}{\alpha + i}}}{\beta}\\
\end{array}
\end{array}
if beta < 9.79999999999999919e80Initial program 19.4%
Taylor expanded in i around inf 40.7%
fma-def40.7%
unpow240.7%
distribute-lft-out--40.7%
distribute-lft-out40.7%
Simplified40.7%
Taylor expanded in i around -inf 79.8%
associate-+r+79.8%
mul-1-neg79.8%
unsub-neg79.8%
Simplified79.8%
if 9.79999999999999919e80 < beta < 4.79999999999999985e153Initial program 15.0%
associate-/l/0.6%
associate-*l*0.6%
times-frac32.6%
Simplified67.9%
Taylor expanded in alpha around 0 67.9%
Taylor expanded in alpha around 0 67.9%
if 4.79999999999999985e153 < beta < 1.20000000000000005e164Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified1.9%
Taylor expanded in i around inf 62.7%
Taylor expanded in alpha around 0 62.3%
Taylor expanded in i around 0 62.3%
if 1.20000000000000005e164 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified9.4%
Taylor expanded in beta around inf 29.5%
associate-/l*30.7%
unpow230.7%
Simplified30.7%
add-cbrt-cube30.7%
associate-/l*30.7%
associate-/l*30.7%
associate-/l*42.4%
Applied egg-rr42.4%
associate-*l*42.4%
associate-/r/42.5%
associate-/r/42.5%
associate-/r/47.4%
Simplified47.4%
cube-unmult47.4%
rem-cbrt-cube89.7%
associate-*l/89.8%
+-commutative89.8%
Applied egg-rr89.8%
Taylor expanded in beta around 0 67.6%
associate-/l*89.8%
Simplified89.8%
Final simplification79.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* -0.0625 (- (+ beta alpha) (+ beta alpha)))))
(if (<= beta 6.4e+115)
(+
(+
0.0625
(/
(-
(* (+ beta alpha) t_0)
(* (+ (pow (+ beta alpha) 2.0) -1.0) 0.015625))
(* i i)))
(/ t_0 i))
(/ (/ i (/ beta (+ alpha i))) beta))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = -0.0625 * ((beta + alpha) - (beta + alpha));
double tmp;
if (beta <= 6.4e+115) {
tmp = (0.0625 + ((((beta + alpha) * t_0) - ((pow((beta + alpha), 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_0 / i);
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: tmp
t_0 = (-0.0625d0) * ((beta + alpha) - (beta + alpha))
if (beta <= 6.4d+115) then
tmp = (0.0625d0 + ((((beta + alpha) * t_0) - ((((beta + alpha) ** 2.0d0) + (-1.0d0)) * 0.015625d0)) / (i * i))) + (t_0 / i)
else
tmp = (i / (beta / (alpha + i))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = -0.0625 * ((beta + alpha) - (beta + alpha));
double tmp;
if (beta <= 6.4e+115) {
tmp = (0.0625 + ((((beta + alpha) * t_0) - ((Math.pow((beta + alpha), 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_0 / i);
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = -0.0625 * ((beta + alpha) - (beta + alpha)) tmp = 0 if beta <= 6.4e+115: tmp = (0.0625 + ((((beta + alpha) * t_0) - ((math.pow((beta + alpha), 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_0 / i) else: tmp = (i / (beta / (alpha + i))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(-0.0625 * Float64(Float64(beta + alpha) - Float64(beta + alpha))) tmp = 0.0 if (beta <= 6.4e+115) tmp = Float64(Float64(0.0625 + Float64(Float64(Float64(Float64(beta + alpha) * t_0) - Float64(Float64((Float64(beta + alpha) ^ 2.0) + -1.0) * 0.015625)) / Float64(i * i))) + Float64(t_0 / i)); else tmp = Float64(Float64(i / Float64(beta / Float64(alpha + i))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = -0.0625 * ((beta + alpha) - (beta + alpha));
tmp = 0.0;
if (beta <= 6.4e+115)
tmp = (0.0625 + ((((beta + alpha) * t_0) - ((((beta + alpha) ^ 2.0) + -1.0) * 0.015625)) / (i * i))) + (t_0 / i);
else
tmp = (i / (beta / (alpha + i))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(-0.0625 * N[(N[(beta + alpha), $MachinePrecision] - N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 6.4e+115], N[(N[(0.0625 + N[(N[(N[(N[(beta + alpha), $MachinePrecision] * t$95$0), $MachinePrecision] - N[(N[(N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision] * 0.015625), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$0 / i), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(beta / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := -0.0625 \cdot \left(\left(\beta + \alpha\right) - \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\beta \leq 6.4 \cdot 10^{+115}:\\
\;\;\;\;\left(0.0625 + \frac{\left(\beta + \alpha\right) \cdot t_0 - \left({\left(\beta + \alpha\right)}^{2} + -1\right) \cdot 0.015625}{i \cdot i}\right) + \frac{t_0}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta}{\alpha + i}}}{\beta}\\
\end{array}
\end{array}
if beta < 6.4e115Initial program 19.5%
Taylor expanded in i around inf 39.8%
fma-def39.8%
unpow239.8%
distribute-lft-out--39.8%
distribute-lft-out39.8%
Simplified39.8%
Taylor expanded in i around -inf 77.7%
associate-+r+77.7%
mul-1-neg77.7%
unsub-neg77.7%
Simplified77.7%
if 6.4e115 < beta Initial program 2.1%
associate-/l/0.1%
associate-*l*0.1%
times-frac3.9%
Simplified21.3%
Taylor expanded in beta around inf 34.5%
associate-/l*35.5%
unpow235.5%
Simplified35.5%
add-cbrt-cube28.4%
associate-/l*28.4%
associate-/l*28.3%
associate-/l*36.5%
Applied egg-rr36.5%
associate-*l*36.5%
associate-/r/36.5%
associate-/r/36.5%
associate-/r/39.9%
Simplified39.9%
cube-unmult39.9%
rem-cbrt-cube77.7%
associate-*l/77.8%
+-commutative77.8%
Applied egg-rr77.8%
Taylor expanded in beta around 0 62.4%
associate-/l*77.8%
Simplified77.8%
Final simplification77.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.5e+115) 0.0625 (* (/ i beta) (/ (+ alpha i) beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.5e+115) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 4.5d+115) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((alpha + i) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.5e+115) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 4.5e+115: tmp = 0.0625 else: tmp = (i / beta) * ((alpha + i) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.5e+115) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4.5e+115)
tmp = 0.0625;
else
tmp = (i / beta) * ((alpha + i) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 4.5e+115], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5 \cdot 10^{+115}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if beta < 4.49999999999999963e115Initial program 19.5%
associate-/l/16.4%
associate-*l*16.3%
times-frac25.2%
Simplified46.6%
Taylor expanded in i around inf 80.2%
if 4.49999999999999963e115 < beta Initial program 2.1%
associate-/l/0.1%
associate-*l*0.1%
times-frac3.9%
Simplified21.3%
Taylor expanded in beta around inf 34.5%
associate-/l*35.5%
unpow235.5%
Simplified35.5%
*-un-lft-identity35.5%
associate-/l*55.3%
Applied egg-rr55.3%
*-lft-identity55.3%
associate-/r/77.7%
Simplified77.7%
Final simplification79.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.55e+115) 0.0625 (/ (* i (/ (+ alpha i) beta)) beta)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.55e+115) {
tmp = 0.0625;
} else {
tmp = (i * ((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.55d+115) then
tmp = 0.0625d0
else
tmp = (i * ((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.55e+115) {
tmp = 0.0625;
} else {
tmp = (i * ((alpha + i) / beta)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 1.55e+115: tmp = 0.0625 else: tmp = (i * ((alpha + i) / beta)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.55e+115) tmp = 0.0625; else tmp = Float64(Float64(i * Float64(Float64(alpha + 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.55e+115)
tmp = 0.0625;
else
tmp = (i * ((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.55e+115], 0.0625, N[(N[(i * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.55 \cdot 10^{+115}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \frac{\alpha + i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.55000000000000002e115Initial program 19.5%
associate-/l/16.4%
associate-*l*16.3%
times-frac25.2%
Simplified46.6%
Taylor expanded in i around inf 80.2%
if 1.55000000000000002e115 < beta Initial program 2.1%
associate-/l/0.1%
associate-*l*0.1%
times-frac3.9%
Simplified21.3%
Taylor expanded in beta around inf 34.5%
associate-/l*35.5%
unpow235.5%
Simplified35.5%
add-cbrt-cube28.4%
associate-/l*28.4%
associate-/l*28.3%
associate-/l*36.5%
Applied egg-rr36.5%
associate-*l*36.5%
associate-/r/36.5%
associate-/r/36.5%
associate-/r/39.9%
Simplified39.9%
cube-unmult39.9%
rem-cbrt-cube77.7%
associate-*l/77.8%
+-commutative77.8%
Applied egg-rr77.8%
Final simplification79.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.2e+115) 0.0625 (/ (/ i (/ beta (+ alpha i))) beta)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.2e+115) {
tmp = 0.0625;
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 2.2d+115) then
tmp = 0.0625d0
else
tmp = (i / (beta / (alpha + i))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.2e+115) {
tmp = 0.0625;
} else {
tmp = (i / (beta / (alpha + i))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 2.2e+115: tmp = 0.0625 else: tmp = (i / (beta / (alpha + i))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.2e+115) tmp = 0.0625; else tmp = Float64(Float64(i / Float64(beta / Float64(alpha + i))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2.2e+115)
tmp = 0.0625;
else
tmp = (i / (beta / (alpha + i))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 2.2e+115], 0.0625, N[(N[(i / N[(beta / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2 \cdot 10^{+115}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta}{\alpha + i}}}{\beta}\\
\end{array}
\end{array}
if beta < 2.2e115Initial program 19.5%
associate-/l/16.4%
associate-*l*16.3%
times-frac25.2%
Simplified46.6%
Taylor expanded in i around inf 80.2%
if 2.2e115 < beta Initial program 2.1%
associate-/l/0.1%
associate-*l*0.1%
times-frac3.9%
Simplified21.3%
Taylor expanded in beta around inf 34.5%
associate-/l*35.5%
unpow235.5%
Simplified35.5%
add-cbrt-cube28.4%
associate-/l*28.4%
associate-/l*28.3%
associate-/l*36.5%
Applied egg-rr36.5%
associate-*l*36.5%
associate-/r/36.5%
associate-/r/36.5%
associate-/r/39.9%
Simplified39.9%
cube-unmult39.9%
rem-cbrt-cube77.7%
associate-*l/77.8%
+-commutative77.8%
Applied egg-rr77.8%
Taylor expanded in beta around 0 62.4%
associate-/l*77.8%
Simplified77.8%
Final simplification79.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4e+167) 0.0625 (* (/ i beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4e+167) {
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 <= 4d+167) 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 <= 4e+167) {
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 <= 4e+167: 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 <= 4e+167) 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 <= 4e+167)
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, 4e+167], 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 4 \cdot 10^{+167}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 4.0000000000000002e167Initial program 18.5%
associate-/l/15.2%
associate-*l*15.1%
times-frac24.2%
Simplified46.6%
Taylor expanded in i around inf 77.0%
if 4.0000000000000002e167 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified9.4%
Taylor expanded in beta around inf 29.5%
associate-/l*30.7%
unpow230.7%
Simplified30.7%
add-cbrt-cube30.7%
associate-/l*30.7%
associate-/l*30.7%
associate-/l*42.4%
Applied egg-rr42.4%
associate-*l*42.4%
associate-/r/42.5%
associate-/r/42.5%
associate-/r/47.4%
Simplified47.4%
cube-unmult47.4%
rem-cbrt-cube89.7%
associate-*l/89.8%
+-commutative89.8%
Applied egg-rr89.8%
Taylor expanded in i around 0 30.5%
unpow230.5%
times-frac35.8%
Simplified35.8%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 8e+115) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8e+115) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 8d+115) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8e+115) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 8e+115: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 8e+115) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 8e+115)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 8e+115], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8 \cdot 10^{+115}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 8.0000000000000001e115Initial program 19.5%
associate-/l/16.4%
associate-*l*16.3%
times-frac25.2%
Simplified46.6%
Taylor expanded in i around inf 80.2%
if 8.0000000000000001e115 < beta Initial program 2.1%
associate-/l/0.1%
associate-*l*0.1%
times-frac3.9%
Simplified21.3%
Taylor expanded in beta around inf 34.5%
associate-/l*35.5%
unpow235.5%
Simplified35.5%
add-cbrt-cube28.4%
associate-/l*28.4%
associate-/l*28.3%
associate-/l*36.5%
Applied egg-rr36.5%
associate-*l*36.5%
associate-/r/36.5%
associate-/r/36.5%
associate-/r/39.9%
Simplified39.9%
cube-unmult39.9%
rem-cbrt-cube77.7%
associate-*l/77.8%
+-commutative77.8%
Applied egg-rr77.8%
Taylor expanded in i around inf 34.6%
unpow234.6%
unpow234.6%
times-frac74.7%
Simplified74.7%
Final simplification79.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 8.5e+115) 0.0625 (/ (* i (/ i beta)) beta)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8.5e+115) {
tmp = 0.0625;
} else {
tmp = (i * (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 <= 8.5d+115) then
tmp = 0.0625d0
else
tmp = (i * (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 <= 8.5e+115) {
tmp = 0.0625;
} else {
tmp = (i * (i / beta)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 8.5e+115: tmp = 0.0625 else: tmp = (i * (i / beta)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 8.5e+115) tmp = 0.0625; else tmp = Float64(Float64(i * 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 <= 8.5e+115)
tmp = 0.0625;
else
tmp = (i * (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, 8.5e+115], 0.0625, N[(N[(i * N[(i / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.5 \cdot 10^{+115}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \frac{i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 8.50000000000000057e115Initial program 19.5%
associate-/l/16.4%
associate-*l*16.3%
times-frac25.2%
Simplified46.6%
Taylor expanded in i around inf 80.2%
if 8.50000000000000057e115 < beta Initial program 2.1%
associate-/l/0.1%
associate-*l*0.1%
times-frac3.9%
Simplified21.3%
Taylor expanded in beta around inf 34.5%
associate-/l*35.5%
unpow235.5%
Simplified35.5%
add-cbrt-cube28.4%
associate-/l*28.4%
associate-/l*28.3%
associate-/l*36.5%
Applied egg-rr36.5%
associate-*l*36.5%
associate-/r/36.5%
associate-/r/36.5%
associate-/r/39.9%
Simplified39.9%
cube-unmult39.9%
rem-cbrt-cube77.7%
associate-*l/77.8%
+-commutative77.8%
Applied egg-rr77.8%
Taylor expanded in i around inf 74.7%
Final simplification79.0%
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 15.9%
associate-/l/13.0%
associate-*l*12.9%
times-frac20.7%
Simplified41.2%
Taylor expanded in i around inf 66.9%
Final simplification66.9%
herbie shell --seed 2023293
(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)))