
(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 10 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 (/ i (+ i alpha))) (t_1 (+ (+ alpha beta) (* i 2.0))))
(if (<= beta 2.75e+125)
0.0625
(if (<= beta 1.1e+154)
(/
(*
i
(/
(+ i (+ alpha beta))
(-
(+
(* 4.0 t_0)
(+ (* 2.0 (/ alpha (+ i alpha))) (/ beta (+ i alpha))))
t_0)))
(+ (* t_1 t_1) -1.0))
(if (<= beta 1.3e+196)
(+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125)))
(* (/ (+ i alpha) beta) (/ i beta)))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = i / (i + alpha);
double t_1 = (alpha + beta) + (i * 2.0);
double tmp;
if (beta <= 2.75e+125) {
tmp = 0.0625;
} else if (beta <= 1.1e+154) {
tmp = (i * ((i + (alpha + beta)) / (((4.0 * t_0) + ((2.0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + -1.0);
} else if (beta <= 1.3e+196) {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
} else {
tmp = ((i + alpha) / 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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = i / (i + alpha)
t_1 = (alpha + beta) + (i * 2.0d0)
if (beta <= 2.75d+125) then
tmp = 0.0625d0
else if (beta <= 1.1d+154) then
tmp = (i * ((i + (alpha + beta)) / (((4.0d0 * t_0) + ((2.0d0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + (-1.0d0))
else if (beta <= 1.3d+196) then
tmp = ((-0.125d0) * (beta / i)) + (0.0625d0 + ((beta / i) * 0.125d0))
else
tmp = ((i + alpha) / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = i / (i + alpha);
double t_1 = (alpha + beta) + (i * 2.0);
double tmp;
if (beta <= 2.75e+125) {
tmp = 0.0625;
} else if (beta <= 1.1e+154) {
tmp = (i * ((i + (alpha + beta)) / (((4.0 * t_0) + ((2.0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + -1.0);
} else if (beta <= 1.3e+196) {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
} else {
tmp = ((i + alpha) / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = i / (i + alpha) t_1 = (alpha + beta) + (i * 2.0) tmp = 0 if beta <= 2.75e+125: tmp = 0.0625 elif beta <= 1.1e+154: tmp = (i * ((i + (alpha + beta)) / (((4.0 * t_0) + ((2.0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + -1.0) elif beta <= 1.3e+196: tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125)) else: tmp = ((i + alpha) / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(i / Float64(i + alpha)) t_1 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) tmp = 0.0 if (beta <= 2.75e+125) tmp = 0.0625; elseif (beta <= 1.1e+154) tmp = Float64(Float64(i * Float64(Float64(i + Float64(alpha + beta)) / Float64(Float64(Float64(4.0 * t_0) + Float64(Float64(2.0 * Float64(alpha / Float64(i + alpha))) + Float64(beta / Float64(i + alpha)))) - t_0))) / Float64(Float64(t_1 * t_1) + -1.0)); elseif (beta <= 1.3e+196) tmp = Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125))); else tmp = Float64(Float64(Float64(i + alpha) / beta) * Float64(i / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = i / (i + alpha);
t_1 = (alpha + beta) + (i * 2.0);
tmp = 0.0;
if (beta <= 2.75e+125)
tmp = 0.0625;
elseif (beta <= 1.1e+154)
tmp = (i * ((i + (alpha + beta)) / (((4.0 * t_0) + ((2.0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + -1.0);
elseif (beta <= 1.3e+196)
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
else
tmp = ((i + alpha) / 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_] := Block[{t$95$0 = N[(i / N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.75e+125], 0.0625, If[LessEqual[beta, 1.1e+154], N[(N[(i * N[(N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * t$95$0), $MachinePrecision] + N[(N[(2.0 * N[(alpha / N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(beta / N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$1 * t$95$1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.3e+196], N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{i}{i + \alpha}\\
t_1 := \left(\alpha + \beta\right) + i \cdot 2\\
\mathbf{if}\;\beta \leq 2.75 \cdot 10^{+125}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.1 \cdot 10^{+154}:\\
\;\;\;\;\frac{i \cdot \frac{i + \left(\alpha + \beta\right)}{\left(4 \cdot t_0 + \left(2 \cdot \frac{\alpha}{i + \alpha} + \frac{\beta}{i + \alpha}\right)\right) - t_0}}{t_1 \cdot t_1 + -1}\\
\mathbf{elif}\;\beta \leq 1.3 \cdot 10^{+196}:\\
\;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 2.74999999999999998e125Initial program 20.4%
associate-/l/17.5%
associate-*l*17.4%
times-frac26.9%
Simplified45.3%
Taylor expanded in i around inf 82.3%
if 2.74999999999999998e125 < beta < 1.1000000000000001e154Initial program 1.6%
expm1-log1p-u1.6%
expm1-udef1.6%
Applied egg-rr55.0%
expm1-def55.0%
expm1-log1p61.0%
associate-*r/61.1%
+-commutative61.1%
+-commutative61.1%
+-commutative61.1%
+-commutative61.1%
+-commutative61.1%
*-commutative61.1%
Simplified61.1%
Taylor expanded in beta around inf 61.9%
if 1.1000000000000001e154 < beta < 1.30000000000000006e196Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.4%
Taylor expanded in i around inf 74.5%
cancel-sign-sub-inv74.5%
distribute-lft-out74.5%
metadata-eval74.5%
Applied egg-rr74.5%
Taylor expanded in alpha around 0 74.5%
if 1.30000000000000006e196 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.3%
Taylor expanded in beta around inf 10.5%
*-commutative10.5%
associate-/l*13.6%
+-commutative13.6%
unpow213.6%
Simplified13.6%
Taylor expanded in beta around 0 13.6%
unpow213.6%
associate-/l*41.6%
Simplified41.6%
associate-/r/71.9%
Applied egg-rr71.9%
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 beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (+ i (+ alpha beta)))
(t_4 (* i t_3)))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
i
(/
t_3
(/ (pow (fma i 2.0 (+ alpha beta)) 2.0) (fma i t_3 (* alpha beta)))))
t_2)
(+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i + (alpha + beta);
double t_4 = i * t_3;
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (i * (t_3 / (pow(fma(i, 2.0, (alpha + beta)), 2.0) / fma(i, t_3, (alpha * beta))))) / t_2;
} else {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(i + Float64(alpha + beta)) t_4 = Float64(i * t_3) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(i * Float64(t_3 / Float64((fma(i, 2.0, Float64(alpha + beta)) ^ 2.0) / fma(i, t_3, Float64(alpha * beta))))) / t_2); else tmp = Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * t$95$3), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(i * N[(t$95$3 / N[(N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := t_1 + -1\\
t_3 := i + \left(\alpha + \beta\right)\\
t_4 := i \cdot t_3\\
\mathbf{if}\;\frac{\frac{t_4 \cdot \left(t_4 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\
\;\;\;\;\frac{i \cdot \frac{t_3}{\frac{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}}{\mathsf{fma}\left(i, t_3, \alpha \cdot \beta\right)}}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 44.7%
expm1-log1p-u41.3%
expm1-udef41.3%
Applied egg-rr90.5%
expm1-def90.5%
expm1-log1p99.8%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
*-commutative99.8%
Simplified99.8%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified4.5%
Taylor expanded in i around inf 77.7%
cancel-sign-sub-inv77.7%
distribute-lft-out77.7%
metadata-eval77.7%
Applied egg-rr77.7%
Taylor expanded in alpha around 0 70.4%
Final simplification81.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* i (+ i (+ alpha beta))))
(t_4 (+ beta (+ i alpha))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
i
(*
(fma i t_4 (* alpha beta))
(/ t_4 (pow (fma i 2.0 (+ alpha beta)) 2.0))))
t_2)
(+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double t_4 = beta + (i + alpha);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (i * (fma(i, t_4, (alpha * beta)) * (t_4 / pow(fma(i, 2.0, (alpha + beta)), 2.0)))) / t_2;
} else {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) t_4 = 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(i * Float64(fma(i, t_4, Float64(alpha * beta)) * Float64(t_4 / (fma(i, 2.0, Float64(alpha + beta)) ^ 2.0)))) / t_2); else tmp = Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(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[(beta + N[(i + alpha), $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[(i * N[(N[(i * t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] * N[(t$95$4 / N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := t_1 + -1\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_4 := \beta + \left(i + \alpha\right)\\
\mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\
\;\;\;\;\frac{i \cdot \left(\mathsf{fma}\left(i, t_4, \alpha \cdot \beta\right) \cdot \frac{t_4}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}}\right)}{t_2}\\
\mathbf{else}:\\
\;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 44.7%
expm1-log1p-u41.3%
expm1-udef41.3%
Applied egg-rr90.5%
expm1-def90.5%
expm1-log1p99.8%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
*-commutative99.8%
Simplified99.8%
*-un-lft-identity99.8%
associate-/r/99.7%
associate-+l+99.7%
associate-+l+99.7%
Applied egg-rr99.7%
*-lft-identity99.7%
*-commutative99.7%
*-commutative99.7%
+-commutative99.7%
Simplified99.7%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified4.5%
Taylor expanded in i around inf 77.7%
cancel-sign-sub-inv77.7%
distribute-lft-out77.7%
metadata-eval77.7%
Applied egg-rr77.7%
Taylor expanded in alpha around 0 70.4%
Final simplification81.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (+ i (+ alpha beta)))
(t_4 (* i t_3)))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) INFINITY)
(/ (* i (/ t_3 (/ (pow (+ beta (* i 2.0)) 2.0) (* i (+ i beta))))) t_2)
(+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i + (alpha + beta);
double t_4 = i * t_3;
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (i * (t_3 / (pow((beta + (i * 2.0)), 2.0) / (i * (i + beta))))) / t_2;
} else {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
}
return tmp;
}
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i + (alpha + beta);
double t_4 = i * t_3;
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
tmp = (i * (t_3 / (Math.pow((beta + (i * 2.0)), 2.0) / (i * (i + beta))))) / t_2;
} else {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = t_1 + -1.0 t_3 = i + (alpha + beta) t_4 = i * t_3 tmp = 0 if (((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= math.inf: tmp = (i * (t_3 / (math.pow((beta + (i * 2.0)), 2.0) / (i * (i + beta))))) / t_2 else: tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(i + Float64(alpha + beta)) t_4 = Float64(i * t_3) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(i * Float64(t_3 / Float64((Float64(beta + Float64(i * 2.0)) ^ 2.0) / Float64(i * Float64(i + beta))))) / t_2); else tmp = Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = t_1 + -1.0;
t_3 = i + (alpha + beta);
t_4 = i * t_3;
tmp = 0.0;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= Inf)
tmp = (i * (t_3 / (((beta + (i * 2.0)) ^ 2.0) / (i * (i + beta))))) / t_2;
else
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * t$95$3), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(i * N[(t$95$3 / N[(N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := t_1 + -1\\
t_3 := i + \left(\alpha + \beta\right)\\
t_4 := i \cdot t_3\\
\mathbf{if}\;\frac{\frac{t_4 \cdot \left(t_4 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\
\;\;\;\;\frac{i \cdot \frac{t_3}{\frac{{\left(\beta + i \cdot 2\right)}^{2}}{i \cdot \left(i + \beta\right)}}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 44.7%
expm1-log1p-u41.3%
expm1-udef41.3%
Applied egg-rr90.5%
expm1-def90.5%
expm1-log1p99.8%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
*-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 95.1%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified4.5%
Taylor expanded in i around inf 77.7%
cancel-sign-sub-inv77.7%
distribute-lft-out77.7%
metadata-eval77.7%
Applied egg-rr77.7%
Taylor expanded in alpha around 0 70.4%
Final simplification79.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 5.05e+126)
0.0625
(if (<= beta 1.32e+154)
(* (+ i alpha) (/ 1.0 (/ (* beta beta) i)))
(if (<= beta 1.3e+196)
(+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125)))
(* (/ (+ i alpha) beta) (/ i beta))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.05e+126) {
tmp = 0.0625;
} else if (beta <= 1.32e+154) {
tmp = (i + alpha) * (1.0 / ((beta * beta) / i));
} else if (beta <= 1.3e+196) {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
} else {
tmp = ((i + alpha) / 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 <= 5.05d+126) then
tmp = 0.0625d0
else if (beta <= 1.32d+154) then
tmp = (i + alpha) * (1.0d0 / ((beta * beta) / i))
else if (beta <= 1.3d+196) then
tmp = ((-0.125d0) * (beta / i)) + (0.0625d0 + ((beta / i) * 0.125d0))
else
tmp = ((i + alpha) / 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 <= 5.05e+126) {
tmp = 0.0625;
} else if (beta <= 1.32e+154) {
tmp = (i + alpha) * (1.0 / ((beta * beta) / i));
} else if (beta <= 1.3e+196) {
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
} else {
tmp = ((i + alpha) / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 5.05e+126: tmp = 0.0625 elif beta <= 1.32e+154: tmp = (i + alpha) * (1.0 / ((beta * beta) / i)) elif beta <= 1.3e+196: tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125)) else: tmp = ((i + alpha) / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 5.05e+126) tmp = 0.0625; elseif (beta <= 1.32e+154) tmp = Float64(Float64(i + alpha) * Float64(1.0 / Float64(Float64(beta * beta) / i))); elseif (beta <= 1.3e+196) tmp = Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125))); else tmp = Float64(Float64(Float64(i + alpha) / 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 <= 5.05e+126)
tmp = 0.0625;
elseif (beta <= 1.32e+154)
tmp = (i + alpha) * (1.0 / ((beta * beta) / i));
elseif (beta <= 1.3e+196)
tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
else
tmp = ((i + alpha) / 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, 5.05e+126], 0.0625, If[LessEqual[beta, 1.32e+154], N[(N[(i + alpha), $MachinePrecision] * N[(1.0 / N[(N[(beta * beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.3e+196], N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.05 \cdot 10^{+126}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.32 \cdot 10^{+154}:\\
\;\;\;\;\left(i + \alpha\right) \cdot \frac{1}{\frac{\beta \cdot \beta}{i}}\\
\mathbf{elif}\;\beta \leq 1.3 \cdot 10^{+196}:\\
\;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 5.05000000000000026e126Initial program 20.4%
associate-/l/17.5%
associate-*l*17.4%
times-frac26.9%
Simplified45.3%
Taylor expanded in i around inf 82.3%
if 5.05000000000000026e126 < beta < 1.31999999999999998e154Initial program 1.6%
associate-/l/0.0%
associate-*l*0.0%
times-frac1.6%
Simplified61.2%
Taylor expanded in beta around inf 57.6%
*-commutative57.6%
associate-/l*58.0%
+-commutative58.0%
unpow258.0%
Simplified58.0%
div-inv58.1%
Applied egg-rr58.1%
if 1.31999999999999998e154 < beta < 1.30000000000000006e196Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.4%
Taylor expanded in i around inf 74.5%
cancel-sign-sub-inv74.5%
distribute-lft-out74.5%
metadata-eval74.5%
Applied egg-rr74.5%
Taylor expanded in alpha around 0 74.5%
if 1.30000000000000006e196 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.3%
Taylor expanded in beta around inf 10.5%
*-commutative10.5%
associate-/l*13.6%
+-commutative13.6%
unpow213.6%
Simplified13.6%
Taylor expanded in beta around 0 13.6%
unpow213.6%
associate-/l*41.6%
Simplified41.6%
associate-/r/71.9%
Applied egg-rr71.9%
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.1e+126) 0.0625 (* (/ (+ i alpha) beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.1e+126) {
tmp = 0.0625;
} else {
tmp = ((i + alpha) / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.1d+126) then
tmp = 0.0625d0
else
tmp = ((i + alpha) / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.1e+126) {
tmp = 0.0625;
} else {
tmp = ((i + alpha) / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 1.1e+126: tmp = 0.0625 else: tmp = ((i + alpha) / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.1e+126) tmp = 0.0625; else tmp = Float64(Float64(Float64(i + alpha) / beta) * Float64(i / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.1e+126)
tmp = 0.0625;
else
tmp = ((i + alpha) / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.1e+126], 0.0625, N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.1 \cdot 10^{+126}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 1.09999999999999999e126Initial program 20.4%
associate-/l/17.5%
associate-*l*17.4%
times-frac26.9%
Simplified45.3%
Taylor expanded in i around inf 82.3%
if 1.09999999999999999e126 < beta Initial program 0.4%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.4%
Simplified16.5%
Taylor expanded in beta around inf 20.5%
*-commutative20.5%
associate-/l*22.8%
+-commutative22.8%
unpow222.8%
Simplified22.8%
Taylor expanded in beta around 0 22.8%
unpow222.8%
associate-/l*40.1%
Simplified40.1%
associate-/r/55.0%
Applied egg-rr55.0%
Final simplification77.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.4e+263) 0.0625 (* (/ i beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.4e+263) {
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 <= 2.4d+263) 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 <= 2.4e+263) {
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 <= 2.4e+263: 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 <= 2.4e+263) 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 <= 2.4e+263)
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, 2.4e+263], 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 2.4 \cdot 10^{+263}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 2.4e263Initial program 17.3%
associate-/l/14.8%
associate-*l*14.7%
times-frac22.8%
Simplified41.5%
Taylor expanded in i around inf 76.4%
if 2.4e263 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 20.8%
*-commutative20.8%
associate-/l*24.1%
+-commutative24.1%
unpow224.1%
Simplified24.1%
Taylor expanded in beta around 0 24.1%
unpow224.1%
associate-/l*41.9%
Simplified41.9%
Taylor expanded in alpha around inf 21.1%
unpow221.1%
times-frac49.9%
Simplified49.9%
Final simplification75.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.35e+196) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.35e+196) {
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 <= 1.35d+196) 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 <= 1.35e+196) {
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 <= 1.35e+196: 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 <= 1.35e+196) 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 <= 1.35e+196)
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, 1.35e+196], 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 1.35 \cdot 10^{+196}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 1.34999999999999998e196Initial program 18.3%
associate-/l/15.6%
associate-*l*15.5%
times-frac24.1%
Simplified43.8%
Taylor expanded in i around inf 78.8%
if 1.34999999999999998e196 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.3%
Taylor expanded in beta around inf 10.5%
*-commutative10.5%
associate-/l*13.6%
+-commutative13.6%
unpow213.6%
Simplified13.6%
associate-/r/13.6%
Applied egg-rr13.6%
Taylor expanded in alpha around 0 11.2%
unpow211.2%
unpow211.2%
times-frac59.5%
Simplified59.5%
Final simplification77.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.4e+268) 0.0625 (/ 0.0 i)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.4e+268) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 3.4d+268) then
tmp = 0.0625d0
else
tmp = 0.0d0 / i
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.4e+268) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 3.4e+268: tmp = 0.0625 else: tmp = 0.0 / i return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.4e+268) tmp = 0.0625; else tmp = Float64(0.0 / i); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.4e+268)
tmp = 0.0625;
else
tmp = 0.0 / i;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 3.4e+268], 0.0625, N[(0.0 / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4 \cdot 10^{+268}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0}{i}\\
\end{array}
\end{array}
if beta < 3.4000000000000003e268Initial program 17.3%
associate-/l/14.7%
associate-*l*14.7%
times-frac22.7%
Simplified41.4%
Taylor expanded in i around inf 76.1%
if 3.4000000000000003e268 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 35.8%
cancel-sign-sub-inv35.8%
distribute-lft-out35.8%
metadata-eval35.8%
Applied egg-rr35.8%
Taylor expanded in i around 0 26.1%
distribute-rgt-out26.1%
metadata-eval26.1%
mul0-rgt26.1%
Simplified26.1%
Final simplification74.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return 0.0625
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return 0.0625 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.0625
\end{array}
Initial program 16.6%
associate-/l/14.1%
associate-*l*14.1%
times-frac21.8%
Simplified39.8%
Taylor expanded in i around inf 73.7%
Final simplification73.7%
herbie shell --seed 2023238
(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)))