
(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 6.2e+122)
0.0625
(if (<= beta 3.05e+128)
(/
(*
i
(/
(+ beta (+ i alpha))
(-
(+
(* 4.0 t_0)
(+ (* 2.0 (/ alpha (+ i alpha))) (/ beta (+ i alpha))))
t_0)))
(+ (* t_1 t_1) -1.0))
(if (<= beta 1.85e+135) 0.0625 (* (/ i 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 <= 6.2e+122) {
tmp = 0.0625;
} else if (beta <= 3.05e+128) {
tmp = (i * ((beta + (i + alpha)) / (((4.0 * t_0) + ((2.0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + -1.0);
} else if (beta <= 1.85e+135) {
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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = i / (i + alpha)
t_1 = (alpha + beta) + (i * 2.0d0)
if (beta <= 6.2d+122) then
tmp = 0.0625d0
else if (beta <= 3.05d+128) then
tmp = (i * ((beta + (i + alpha)) / (((4.0d0 * t_0) + ((2.0d0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + (-1.0d0))
else if (beta <= 1.85d+135) 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 t_0 = i / (i + alpha);
double t_1 = (alpha + beta) + (i * 2.0);
double tmp;
if (beta <= 6.2e+122) {
tmp = 0.0625;
} else if (beta <= 3.05e+128) {
tmp = (i * ((beta + (i + alpha)) / (((4.0 * t_0) + ((2.0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + -1.0);
} else if (beta <= 1.85e+135) {
tmp = 0.0625;
} else {
tmp = (i / 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 <= 6.2e+122: tmp = 0.0625 elif beta <= 3.05e+128: tmp = (i * ((beta + (i + alpha)) / (((4.0 * t_0) + ((2.0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + -1.0) elif beta <= 1.85e+135: tmp = 0.0625 else: tmp = (i / 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 <= 6.2e+122) tmp = 0.0625; elseif (beta <= 3.05e+128) tmp = Float64(Float64(i * Float64(Float64(beta + Float64(i + alpha)) / 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.85e+135) 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)
t_0 = i / (i + alpha);
t_1 = (alpha + beta) + (i * 2.0);
tmp = 0.0;
if (beta <= 6.2e+122)
tmp = 0.0625;
elseif (beta <= 3.05e+128)
tmp = (i * ((beta + (i + alpha)) / (((4.0 * t_0) + ((2.0 * (alpha / (i + alpha))) + (beta / (i + alpha)))) - t_0))) / ((t_1 * t_1) + -1.0);
elseif (beta <= 1.85e+135)
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_] := 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, 6.2e+122], 0.0625, If[LessEqual[beta, 3.05e+128], N[(N[(i * N[(N[(beta + N[(i + alpha), $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.85e+135], 0.0625, N[(N[(i / 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 6.2 \cdot 10^{+122}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 3.05 \cdot 10^{+128}:\\
\;\;\;\;\frac{i \cdot \frac{\beta + \left(i + \alpha\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.85 \cdot 10^{+135}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 6.19999999999999998e122 or 3.0500000000000001e128 < beta < 1.84999999999999999e135Initial program 23.1%
associate-/l/20.3%
associate-*l*20.2%
times-frac29.5%
Simplified42.3%
Taylor expanded in i around inf 81.1%
if 6.19999999999999998e122 < beta < 3.0500000000000001e128Initial program 34.3%
expm1-log1p-u33.8%
expm1-udef33.8%
Applied egg-rr92.0%
expm1-def92.0%
expm1-log1p99.0%
associate-*r/99.0%
associate-+r+99.0%
+-commutative99.0%
+-commutative99.0%
associate-+r+99.0%
+-commutative99.0%
*-commutative99.0%
Simplified99.0%
Taylor expanded in beta around inf 99.0%
if 1.84999999999999999e135 < beta Initial program 2.3%
Taylor expanded in beta around inf 30.7%
Taylor expanded in i around inf 31.0%
unpow231.0%
Simplified31.0%
Taylor expanded in beta around inf 31.2%
unpow231.2%
unpow231.2%
times-frac63.8%
Simplified63.8%
Final simplification78.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 (* i (+ i (+ alpha beta))))
(t_3 (+ beta (+ i alpha))))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(/
(*
i
(/
t_3
(/ (pow (fma i 2.0 (+ alpha beta)) 2.0) (fma i t_3 (* alpha beta)))))
(+
(+
(fma beta (fma 4.0 i (* alpha 2.0)) (* beta beta))
(pow (+ alpha (* i 2.0)) 2.0))
-1.0))
(+ (* -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 = i * (i + (alpha + beta));
double t_3 = beta + (i + alpha);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (i * (t_3 / (pow(fma(i, 2.0, (alpha + beta)), 2.0) / fma(i, t_3, (alpha * beta))))) / ((fma(beta, fma(4.0, i, (alpha * 2.0)), (beta * beta)) + pow((alpha + (i * 2.0)), 2.0)) + -1.0);
} 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(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(beta + Float64(i + alpha)) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(i * Float64(t_3 / Float64((fma(i, 2.0, Float64(alpha + beta)) ^ 2.0) / fma(i, t_3, Float64(alpha * beta))))) / Float64(Float64(fma(beta, fma(4.0, i, Float64(alpha * 2.0)), Float64(beta * beta)) + (Float64(alpha + Float64(i * 2.0)) ^ 2.0)) + -1.0)); 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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(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] / N[(N[(N[(beta * N[(4.0 * i + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] + N[(beta * beta), $MachinePrecision]), $MachinePrecision] + N[Power[N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $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 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := \beta + \left(i + \alpha\right)\\
\mathbf{if}\;\frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \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)}}}{\left(\mathsf{fma}\left(\beta, \mathsf{fma}\left(4, i, \alpha \cdot 2\right), \beta \cdot \beta\right) + {\left(\alpha + i \cdot 2\right)}^{2}\right) + -1}\\
\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 52.8%
expm1-log1p-u49.3%
expm1-udef49.3%
Applied egg-rr91.3%
expm1-def91.3%
expm1-log1p99.6%
associate-*r/99.6%
associate-+r+99.6%
+-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
*-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 99.6%
associate-+r+99.7%
fma-def99.7%
fma-def99.7%
*-commutative99.7%
unpow299.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%
Simplified3.0%
Taylor expanded in i around inf 74.7%
cancel-sign-sub-inv74.7%
distribute-lft-out74.7%
metadata-eval74.7%
Simplified74.7%
Taylor expanded in alpha around 0 72.2%
Final simplification82.4%
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)))
(t_5 (fma i 2.0 (+ alpha beta))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/ (* (/ (fma i t_4 (* alpha beta)) t_5) (/ i (/ t_5 t_4))) 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 t_5 = fma(i, 2.0, (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = ((fma(i, t_4, (alpha * beta)) / t_5) * (i / (t_5 / t_4))) / 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)) t_5 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(Float64(fma(i, t_4, Float64(alpha * beta)) / t_5) * Float64(i / Float64(t_5 / t_4))) / 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]}, Block[{t$95$5 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(N[(i * t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision] * N[(i / N[(t$95$5 / t$95$4), $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)\\
t_5 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, t_4, \alpha \cdot \beta\right)}{t_5} \cdot \frac{i}{\frac{t_5}{t_4}}}{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 52.8%
times-frac99.5%
+-commutative99.5%
+-commutative99.5%
*-commutative99.5%
fma-udef99.5%
+-commutative99.5%
+-commutative99.5%
*-commutative99.5%
fma-udef99.5%
+-commutative99.5%
*-commutative99.5%
fma-udef99.5%
Applied egg-rr99.5%
*-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
*-commutative99.5%
+-commutative99.5%
associate-/l*99.6%
+-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
Simplified99.6%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 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%
Simplified3.0%
Taylor expanded in i around inf 74.7%
cancel-sign-sub-inv74.7%
distribute-lft-out74.7%
metadata-eval74.7%
Simplified74.7%
Taylor expanded in alpha around 0 72.2%
Final simplification82.4%
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 (* i (+ i (+ alpha beta))))
(t_3 (+ beta (+ i alpha))))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(/
(*
i
(/
t_3
(/ (pow (fma i 2.0 (+ alpha beta)) 2.0) (fma i t_3 (* alpha beta)))))
(+ (* t_0 (+ beta (+ alpha (* i 2.0)))) -1.0))
(+ (* -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 = i * (i + (alpha + beta));
double t_3 = beta + (i + alpha);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (i * (t_3 / (pow(fma(i, 2.0, (alpha + beta)), 2.0) / fma(i, t_3, (alpha * beta))))) / ((t_0 * (beta + (alpha + (i * 2.0)))) + -1.0);
} 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(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(beta + Float64(i + alpha)) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(i * Float64(t_3 / Float64((fma(i, 2.0, Float64(alpha + beta)) ^ 2.0) / fma(i, t_3, Float64(alpha * beta))))) / Float64(Float64(t_0 * Float64(beta + Float64(alpha + Float64(i * 2.0)))) + -1.0)); 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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(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] / N[(N[(t$95$0 * N[(beta + N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $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 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := \beta + \left(i + \alpha\right)\\
\mathbf{if}\;\frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \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_0 \cdot \left(\beta + \left(\alpha + i \cdot 2\right)\right) + -1}\\
\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 52.8%
expm1-log1p-u49.3%
expm1-udef49.3%
Applied egg-rr91.3%
expm1-def91.3%
expm1-log1p99.6%
associate-*r/99.6%
associate-+r+99.6%
+-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
*-commutative99.6%
Simplified99.6%
Taylor expanded in alpha around 0 99.6%
*-commutative99.6%
Simplified99.6%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 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%
Simplified3.0%
Taylor expanded in i around inf 74.7%
cancel-sign-sub-inv74.7%
distribute-lft-out74.7%
metadata-eval74.7%
Simplified74.7%
Taylor expanded in alpha around 0 72.2%
Final simplification82.4%
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 (* i (+ i (+ alpha beta))))
(t_3 (+ beta (+ i alpha))))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(/
(*
i
(/
t_3
(/ (pow (fma i 2.0 (+ alpha beta)) 2.0) (fma i t_3 (* alpha beta)))))
(+ (* t_0 (+ beta (* i 2.0))) -1.0))
(+ (* -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 = i * (i + (alpha + beta));
double t_3 = beta + (i + alpha);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (i * (t_3 / (pow(fma(i, 2.0, (alpha + beta)), 2.0) / fma(i, t_3, (alpha * beta))))) / ((t_0 * (beta + (i * 2.0))) + -1.0);
} 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(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(beta + Float64(i + alpha)) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(i * Float64(t_3 / Float64((fma(i, 2.0, Float64(alpha + beta)) ^ 2.0) / fma(i, t_3, Float64(alpha * beta))))) / Float64(Float64(t_0 * Float64(beta + Float64(i * 2.0))) + -1.0)); 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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(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] / N[(N[(t$95$0 * N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $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 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := \beta + \left(i + \alpha\right)\\
\mathbf{if}\;\frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \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_0 \cdot \left(\beta + i \cdot 2\right) + -1}\\
\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 52.8%
expm1-log1p-u49.3%
expm1-udef49.3%
Applied egg-rr91.3%
expm1-def91.3%
expm1-log1p99.6%
associate-*r/99.6%
associate-+r+99.6%
+-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
*-commutative99.6%
Simplified99.6%
Taylor expanded in alpha around 0 90.2%
*-commutative90.2%
Simplified90.2%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified3.0%
Taylor expanded in i around inf 74.7%
cancel-sign-sub-inv74.7%
distribute-lft-out74.7%
metadata-eval74.7%
Simplified74.7%
Taylor expanded in alpha around 0 72.2%
Final simplification78.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 (* i (+ i (+ alpha beta))))
(t_3 (pow (+ beta (* i 2.0)) 2.0)))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(* (/ (* i i) t_3) (/ (pow (+ i beta) 2.0) (+ t_3 -1.0)))
(+ (* -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 = i * (i + (alpha + beta));
double t_3 = pow((beta + (i * 2.0)), 2.0);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = ((i * i) / t_3) * (pow((i + beta), 2.0) / (t_3 + -1.0));
} 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 = i * (i + (alpha + beta));
double t_3 = Math.pow((beta + (i * 2.0)), 2.0);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Double.POSITIVE_INFINITY) {
tmp = ((i * i) / t_3) * (Math.pow((i + beta), 2.0) / (t_3 + -1.0));
} 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 = i * (i + (alpha + beta)) t_3 = math.pow((beta + (i * 2.0)), 2.0) tmp = 0 if (((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= math.inf: tmp = ((i * i) / t_3) * (math.pow((i + beta), 2.0) / (t_3 + -1.0)) 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(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(beta + Float64(i * 2.0)) ^ 2.0 tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(Float64(i * i) / t_3) * Float64((Float64(i + beta) ^ 2.0) / Float64(t_3 + -1.0))); 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 = i * (i + (alpha + beta));
t_3 = (beta + (i * 2.0)) ^ 2.0;
tmp = 0.0;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Inf)
tmp = ((i * i) / t_3) * (((i + beta) ^ 2.0) / (t_3 + -1.0));
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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(i * i), $MachinePrecision] / t$95$3), $MachinePrecision] * N[(N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision] / N[(t$95$3 + -1.0), $MachinePrecision]), $MachinePrecision]), $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 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := {\left(\beta + i \cdot 2\right)}^{2}\\
\mathbf{if}\;\frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\
\;\;\;\;\frac{i \cdot i}{t_3} \cdot \frac{{\left(i + \beta\right)}^{2}}{t_3 + -1}\\
\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 52.8%
expm1-log1p-u49.3%
expm1-udef49.3%
Applied egg-rr91.3%
expm1-def91.3%
expm1-log1p99.6%
associate-*r/99.6%
associate-+r+99.6%
+-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
*-commutative99.6%
Simplified99.6%
Taylor expanded in alpha around 0 44.0%
times-frac89.5%
unpow289.5%
*-commutative89.5%
+-commutative89.5%
sub-neg89.5%
*-commutative89.5%
metadata-eval89.5%
Simplified89.5%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified3.0%
Taylor expanded in i around inf 74.7%
cancel-sign-sub-inv74.7%
distribute-lft-out74.7%
metadata-eval74.7%
Simplified74.7%
Taylor expanded in alpha around 0 72.2%
Final simplification78.6%
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)))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
i
(/
(+ beta (+ i alpha))
(/ (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 * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (i * ((beta + (i + alpha)) / (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 * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
tmp = (i * ((beta + (i + alpha)) / (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 * (i + (alpha + beta)) tmp = 0 if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= math.inf: tmp = (i * ((beta + (i + alpha)) / (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(i + Float64(alpha + beta))) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(i * Float64(Float64(beta + Float64(i + alpha)) / 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 * (i + (alpha + beta));
tmp = 0.0;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Inf)
tmp = (i * ((beta + (i + alpha)) / (((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[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(i * N[(N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision] / 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 \cdot \left(i + \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\
\;\;\;\;\frac{i \cdot \frac{\beta + \left(i + \alpha\right)}{\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 52.8%
expm1-log1p-u49.3%
expm1-udef49.3%
Applied egg-rr91.3%
expm1-def91.3%
expm1-log1p99.6%
associate-*r/99.6%
associate-+r+99.6%
+-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
*-commutative99.6%
Simplified99.6%
Taylor expanded in alpha around 0 89.6%
*-commutative89.6%
+-commutative89.6%
Simplified89.6%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 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%
Simplified3.0%
Taylor expanded in i around inf 74.7%
cancel-sign-sub-inv74.7%
distribute-lft-out74.7%
metadata-eval74.7%
Simplified74.7%
Taylor expanded in alpha around 0 72.2%
Final simplification78.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 5.7e+135) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.7e+135) {
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 <= 5.7d+135) 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 <= 5.7e+135) {
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 <= 5.7e+135: 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 <= 5.7e+135) 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 <= 5.7e+135)
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, 5.7e+135], 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 5.7 \cdot 10^{+135}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 5.7000000000000002e135Initial program 23.3%
associate-/l/20.0%
associate-*l*19.9%
times-frac30.1%
Simplified43.1%
Taylor expanded in i around inf 80.0%
if 5.7000000000000002e135 < beta Initial program 2.3%
Taylor expanded in beta around inf 30.7%
Taylor expanded in i around inf 31.0%
unpow231.0%
Simplified31.0%
Taylor expanded in beta around inf 31.2%
unpow231.2%
unpow231.2%
times-frac63.8%
Simplified63.8%
Final simplification77.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 5.7e+259) 0.0625 (/ 0.0 i)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.7e+259) {
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 <= 5.7d+259) 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 <= 5.7e+259) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 5.7e+259: 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 <= 5.7e+259) 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 <= 5.7e+259)
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, 5.7e+259], 0.0625, N[(0.0 / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.7 \cdot 10^{+259}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0}{i}\\
\end{array}
\end{array}
if beta < 5.7e259Initial program 20.6%
associate-/l/17.4%
associate-*l*17.3%
times-frac26.5%
Simplified40.0%
Taylor expanded in i around inf 73.7%
if 5.7e259 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified15.4%
Taylor expanded in i around inf 51.6%
cancel-sign-sub-inv51.6%
distribute-lft-out51.6%
metadata-eval51.6%
Simplified51.6%
Taylor expanded in alpha around 0 51.6%
Taylor expanded in i around 0 50.1%
distribute-rgt-out50.1%
metadata-eval50.1%
mul0-rgt50.1%
Simplified50.1%
Final simplification72.5%
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 19.6%
associate-/l/16.5%
associate-*l*16.4%
times-frac25.2%
Simplified38.7%
Taylor expanded in i around inf 70.2%
Final simplification70.2%
herbie shell --seed 2023252
(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)))