
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ i (+ alpha beta)))
(t_3 (* i t_2))
(t_4 (fma i 2.0 (+ alpha beta))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(/
(* (/ (fma i t_2 (* alpha beta)) t_4) (/ t_3 t_4))
(+
(fma
beta
(+ beta (fma 2.0 alpha (* i 4.0)))
(pow (+ alpha (* i 2.0)) 2.0))
-1.0))
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(* 0.125 (/ beta i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i + (alpha + beta);
double t_3 = i * t_2;
double t_4 = fma(i, 2.0, (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = ((fma(i, t_2, (alpha * beta)) / t_4) * (t_3 / t_4)) / (fma(beta, (beta + fma(2.0, alpha, (i * 4.0))), pow((alpha + (i * 2.0)), 2.0)) + -1.0);
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i + Float64(alpha + beta)) t_3 = Float64(i * t_2) t_4 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(Float64(fma(i, t_2, Float64(alpha * beta)) / t_4) * Float64(t_3 / t_4)) / Float64(fma(beta, Float64(beta + fma(2.0, alpha, Float64(i * 4.0))), (Float64(alpha + Float64(i * 2.0)) ^ 2.0)) + -1.0)); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(beta / i))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i * t$95$2), $MachinePrecision]}, Block[{t$95$4 = 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] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(N[(i * t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision] * N[(t$95$3 / t$95$4), $MachinePrecision]), $MachinePrecision] / N[(N[(beta * N[(beta + N[(2.0 * alpha + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[Power[N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i + \left(\alpha + \beta\right)\\
t_3 := i \cdot t\_2\\
t_4 := \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\_1 + -1} \leq \infty:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, t\_2, \alpha \cdot \beta\right)}{t\_4} \cdot \frac{t\_3}{t\_4}}{\mathsf{fma}\left(\beta, \beta + \mathsf{fma}\left(2, \alpha, i \cdot 4\right), {\left(\alpha + i \cdot 2\right)}^{2}\right) + -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.4%
*-commutative42.4%
+-commutative42.4%
+-commutative42.4%
*-commutative42.4%
fma-undefine42.4%
times-frac99.6%
+-commutative99.6%
*-commutative99.6%
fma-define99.6%
+-commutative99.6%
+-commutative99.6%
*-commutative99.6%
fma-define99.6%
Applied egg-rr99.6%
Taylor expanded in beta around 0 99.5%
fma-define99.5%
fma-define99.5%
Simplified99.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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-/l*6.6%
+-commutative6.6%
+-commutative6.6%
+-commutative6.6%
associate-+l+6.6%
+-commutative6.6%
associate-*l*6.6%
Simplified6.6%
Taylor expanded in i around inf 72.1%
expm1-log1p-u57.3%
expm1-undefine57.2%
associate-*r/57.2%
distribute-lft-out57.2%
Applied egg-rr57.2%
expm1-define57.3%
Simplified57.3%
Taylor expanded in i around 0 72.7%
Taylor expanded in alpha around 0 63.6%
Final simplification78.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ i (+ alpha beta)))
(t_3 (* i t_2))
(t_4 (fma i 2.0 (+ alpha beta))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(/
(* (/ (fma i t_2 (* alpha beta)) t_4) (/ t_3 t_4))
(+
(+ (* i (+ (* i 4.0) (* (+ alpha beta) 4.0))) (pow (+ alpha beta) 2.0))
-1.0))
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(* 0.125 (/ beta i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i + (alpha + beta);
double t_3 = i * t_2;
double t_4 = fma(i, 2.0, (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = ((fma(i, t_2, (alpha * beta)) / t_4) * (t_3 / t_4)) / (((i * ((i * 4.0) + ((alpha + beta) * 4.0))) + pow((alpha + beta), 2.0)) + -1.0);
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i + Float64(alpha + beta)) t_3 = Float64(i * t_2) t_4 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(Float64(fma(i, t_2, Float64(alpha * beta)) / t_4) * Float64(t_3 / t_4)) / Float64(Float64(Float64(i * Float64(Float64(i * 4.0) + Float64(Float64(alpha + beta) * 4.0))) + (Float64(alpha + beta) ^ 2.0)) + -1.0)); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(beta / i))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i * t$95$2), $MachinePrecision]}, Block[{t$95$4 = 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] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(N[(i * t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision] * N[(t$95$3 / t$95$4), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(i * N[(N[(i * 4.0), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[Power[N[(alpha + beta), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i + \left(\alpha + \beta\right)\\
t_3 := i \cdot t\_2\\
t_4 := \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\_1 + -1} \leq \infty:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, t\_2, \alpha \cdot \beta\right)}{t\_4} \cdot \frac{t\_3}{t\_4}}{\left(i \cdot \left(i \cdot 4 + \left(\alpha + \beta\right) \cdot 4\right) + {\left(\alpha + \beta\right)}^{2}\right) + -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.4%
*-commutative42.4%
+-commutative42.4%
+-commutative42.4%
*-commutative42.4%
fma-undefine42.4%
times-frac99.6%
+-commutative99.6%
*-commutative99.6%
fma-define99.6%
+-commutative99.6%
+-commutative99.6%
*-commutative99.6%
fma-define99.6%
Applied egg-rr99.6%
Taylor expanded in i around 0 99.6%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-/l*6.6%
+-commutative6.6%
+-commutative6.6%
+-commutative6.6%
associate-+l+6.6%
+-commutative6.6%
associate-*l*6.6%
Simplified6.6%
Taylor expanded in i around inf 72.1%
expm1-log1p-u57.3%
expm1-undefine57.2%
associate-*r/57.2%
distribute-lft-out57.2%
Applied egg-rr57.2%
expm1-define57.3%
Simplified57.3%
Taylor expanded in i around 0 72.7%
Taylor expanded in alpha around 0 63.6%
Final simplification78.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (+ i (+ alpha beta)))
(t_4 (* i t_3))
(t_5 (fma i 2.0 (+ alpha beta))))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) INFINITY)
(/ (* (/ (fma i t_3 (* alpha beta)) t_5) (/ t_4 t_5)) t_2)
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(* 0.125 (/ beta i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i + (alpha + beta);
double t_4 = i * t_3;
double t_5 = fma(i, 2.0, (alpha + beta));
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = ((fma(i, t_3, (alpha * beta)) / t_5) * (t_4 / t_5)) / t_2;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(i + Float64(alpha + beta)) t_4 = Float64(i * t_3) t_5 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(Float64(fma(i, t_3, Float64(alpha * beta)) / t_5) * Float64(t_4 / t_5)) / t_2); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(beta / i))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $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[(N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision] * N[(t$95$4 / t$95$5), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
t_3 := i + \left(\alpha + \beta\right)\\
t_4 := i \cdot t\_3\\
t_5 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;\frac{\frac{t\_4 \cdot \left(t\_4 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{t\_5} \cdot \frac{t\_4}{t\_5}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.4%
*-commutative42.4%
+-commutative42.4%
+-commutative42.4%
*-commutative42.4%
fma-undefine42.4%
times-frac99.6%
+-commutative99.6%
*-commutative99.6%
fma-define99.6%
+-commutative99.6%
+-commutative99.6%
*-commutative99.6%
fma-define99.6%
Applied egg-rr99.6%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-/l*6.6%
+-commutative6.6%
+-commutative6.6%
+-commutative6.6%
associate-+l+6.6%
+-commutative6.6%
associate-*l*6.6%
Simplified6.6%
Taylor expanded in i around inf 72.1%
expm1-log1p-u57.3%
expm1-undefine57.2%
associate-*r/57.2%
distribute-lft-out57.2%
Applied egg-rr57.2%
expm1-define57.3%
Simplified57.3%
Taylor expanded in i around 0 72.7%
Taylor expanded in alpha around 0 63.6%
Final simplification78.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* i (+ i (+ alpha beta))))
(t_4 (+ alpha (+ i beta))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
(fma i t_4 (* alpha beta))
(* i (/ t_4 (pow (fma i 2.0 (+ alpha beta)) 2.0))))
t_2)
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(* 0.125 (/ beta i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double t_4 = alpha + (i + beta);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (fma(i, t_4, (alpha * beta)) * (i * (t_4 / pow(fma(i, 2.0, (alpha + beta)), 2.0)))) / t_2;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) t_4 = Float64(alpha + Float64(i + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(fma(i, t_4, Float64(alpha * beta)) * Float64(i * Float64(t_4 / (fma(i, 2.0, Float64(alpha + beta)) ^ 2.0)))) / t_2); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(beta / i))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(alpha + N[(i + 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[(i * t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] * N[(i * 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[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_4 := \alpha + \left(i + \beta\right)\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(i, t\_4, \alpha \cdot \beta\right) \cdot \left(i \cdot \frac{t\_4}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}}\right)}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.4%
*-commutative42.4%
+-commutative42.4%
+-commutative42.4%
*-commutative42.4%
fma-undefine42.4%
*-un-lft-identity42.4%
times-frac99.6%
+-commutative99.6%
pow299.6%
+-commutative99.6%
*-commutative99.6%
fma-define99.6%
Applied egg-rr99.6%
/-rgt-identity99.6%
+-commutative99.6%
associate-+r+99.6%
associate-/l*99.4%
+-commutative99.4%
associate-+r+99.4%
Simplified99.4%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-/l*6.6%
+-commutative6.6%
+-commutative6.6%
+-commutative6.6%
associate-+l+6.6%
+-commutative6.6%
associate-*l*6.6%
Simplified6.6%
Taylor expanded in i around inf 72.1%
expm1-log1p-u57.3%
expm1-undefine57.2%
associate-*r/57.2%
distribute-lft-out57.2%
Applied egg-rr57.2%
expm1-define57.3%
Simplified57.3%
Taylor expanded in i around 0 72.7%
Taylor expanded in alpha around 0 63.6%
Final simplification78.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* i (+ i (+ alpha beta)))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
(/ t_3 (fma i 2.0 (+ alpha beta)))
(/ (* i (+ i beta)) (+ beta (* i 2.0))))
t_2)
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(* 0.125 (/ beta i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = ((t_3 / fma(i, 2.0, (alpha + beta))) * ((i * (i + beta)) / (beta + (i * 2.0)))) / t_2;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(Float64(t_3 / fma(i, 2.0, Float64(alpha + beta))) * Float64(Float64(i * Float64(i + beta)) / Float64(beta + Float64(i * 2.0)))) / t_2); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(beta / i))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, 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[(t$95$3 / N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{\frac{t\_3}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)} \cdot \frac{i \cdot \left(i + \beta\right)}{\beta + i \cdot 2}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 42.4%
*-commutative42.4%
+-commutative42.4%
+-commutative42.4%
*-commutative42.4%
fma-undefine42.4%
times-frac99.6%
+-commutative99.6%
*-commutative99.6%
fma-define99.6%
+-commutative99.6%
+-commutative99.6%
*-commutative99.6%
fma-define99.6%
Applied egg-rr99.6%
Taylor expanded in alpha around 0 89.7%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-/l*6.6%
+-commutative6.6%
+-commutative6.6%
+-commutative6.6%
associate-+l+6.6%
+-commutative6.6%
associate-*l*6.6%
Simplified6.6%
Taylor expanded in i around inf 72.1%
expm1-log1p-u57.3%
expm1-undefine57.2%
associate-*r/57.2%
distribute-lft-out57.2%
Applied egg-rr57.2%
expm1-define57.3%
Simplified57.3%
Taylor expanded in i around 0 72.7%
Taylor expanded in alpha around 0 63.6%
Final simplification74.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* i (+ i (+ alpha beta))))
(t_4 (* i (+ i beta))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) 0.1)
(/ (/ (* t_4 (+ (* alpha beta) t_4)) t_1) t_2)
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(* 0.125 (/ beta i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double t_4 = i * (i + beta);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1) {
tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: tmp
t_0 = (alpha + beta) + (i * 2.0d0)
t_1 = t_0 * t_0
t_2 = t_1 + (-1.0d0)
t_3 = i * (i + (alpha + beta))
t_4 = i * (i + beta)
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1d0) then
tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2
else
tmp = (((i * 0.0625d0) + ((alpha + beta) * 0.125d0)) / i) - (0.125d0 * (beta / i))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double t_4 = i * (i + beta);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1) {
tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = t_1 + -1.0 t_3 = i * (i + (alpha + beta)) t_4 = i * (i + beta) tmp = 0 if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1: tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2 else: tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) t_4 = Float64(i * Float64(i + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= 0.1) tmp = Float64(Float64(Float64(t_4 * Float64(Float64(alpha * beta) + t_4)) / t_1) / t_2); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(beta / i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = t_1 + -1.0;
t_3 = i * (i + (alpha + beta));
t_4 = i * (i + beta);
tmp = 0.0;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1)
tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2;
else
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(i + 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], 0.1], N[(N[(N[(t$95$4 * N[(N[(alpha * beta), $MachinePrecision] + t$95$4), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_4 := i \cdot \left(i + \beta\right)\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq 0.1:\\
\;\;\;\;\frac{\frac{t\_4 \cdot \left(\alpha \cdot \beta + t\_4\right)}{t\_1}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\beta}{i}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 0.10000000000000001Initial program 99.8%
Taylor expanded in alpha around 0 93.6%
Taylor expanded in alpha around 0 93.5%
if 0.10000000000000001 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.9%
associate-/l/0.0%
associate-/l*5.6%
+-commutative5.6%
+-commutative5.6%
+-commutative5.6%
associate-+l+5.6%
+-commutative5.6%
associate-*l*5.6%
Simplified5.6%
Taylor expanded in i around inf 73.0%
expm1-log1p-u62.6%
expm1-undefine62.6%
associate-*r/62.6%
distribute-lft-out62.6%
Applied egg-rr62.6%
expm1-define62.6%
Simplified62.6%
Taylor expanded in i around 0 73.5%
Taylor expanded in alpha around 0 66.9%
Final simplification71.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i) (* 0.125 (/ beta i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = (((i * 0.0625d0) + ((alpha + beta) * 0.125d0)) / i) - (0.125d0 * (beta / i))
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i))
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(beta / i))) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\beta}{i}
\end{array}
Initial program 17.9%
associate-/l/15.7%
associate-/l*20.3%
+-commutative20.3%
+-commutative20.3%
+-commutative20.3%
associate-+l+20.3%
+-commutative20.3%
associate-*l*20.2%
Simplified20.2%
Taylor expanded in i around inf 74.6%
expm1-log1p-u66.0%
expm1-undefine66.0%
associate-*r/66.0%
distribute-lft-out66.0%
Applied egg-rr66.0%
expm1-define66.0%
Simplified66.0%
Taylor expanded in i around 0 75.0%
Taylor expanded in alpha around 0 69.6%
Final simplification69.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (/ (- (+ (* i 0.0625) (* beta 0.125)) (* (+ alpha beta) 0.125)) i))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = (((i * 0.0625d0) + (beta * 0.125d0)) - ((alpha + beta) * 0.125d0)) / i
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(Float64(alpha + beta) * 0.125)) / i) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] - N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i}
\end{array}
Initial program 17.9%
associate-/l/15.7%
associate-/l*20.3%
+-commutative20.3%
+-commutative20.3%
+-commutative20.3%
associate-+l+20.3%
+-commutative20.3%
associate-*l*20.2%
Simplified20.2%
Taylor expanded in i around inf 74.6%
Taylor expanded in alpha around 0 69.1%
Taylor expanded in i around 0 69.1%
Final simplification69.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ alpha beta) i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = (0.0625d0 + (0.125d0 * (beta / i))) - (0.125d0 * ((alpha + beta) / i))
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i))
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i))) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}
\end{array}
Initial program 17.9%
associate-/l/15.7%
associate-/l*20.3%
+-commutative20.3%
+-commutative20.3%
+-commutative20.3%
associate-+l+20.3%
+-commutative20.3%
associate-*l*20.2%
Simplified20.2%
Taylor expanded in i around inf 74.6%
Taylor expanded in alpha around 0 69.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7.6e+222) 0.0625 (/ (* 0.125 (- beta (+ alpha beta))) i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.6e+222) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (alpha + beta))) / i;
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 7.6d+222) then
tmp = 0.0625d0
else
tmp = (0.125d0 * (beta - (alpha + beta))) / i
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.6e+222) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (alpha + beta))) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7.6e+222: tmp = 0.0625 else: tmp = (0.125 * (beta - (alpha + beta))) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7.6e+222) tmp = 0.0625; else tmp = Float64(Float64(0.125 * Float64(beta - Float64(alpha + beta))) / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 7.6e+222)
tmp = 0.0625;
else
tmp = (0.125 * (beta - (alpha + beta))) / i;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 7.6e+222], 0.0625, N[(N[(0.125 * N[(beta - N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.6 \cdot 10^{+222}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0.125 \cdot \left(\beta - \left(\alpha + \beta\right)\right)}{i}\\
\end{array}
\end{array}
if beta < 7.60000000000000035e222Initial program 19.8%
associate-/l/17.4%
associate-/l*21.6%
+-commutative21.6%
+-commutative21.6%
+-commutative21.6%
associate-+l+21.6%
+-commutative21.6%
associate-*l*21.6%
Simplified21.6%
Taylor expanded in i around inf 72.8%
if 7.60000000000000035e222 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*8.0%
+-commutative8.0%
+-commutative8.0%
+-commutative8.0%
associate-+l+8.0%
+-commutative8.0%
associate-*l*8.0%
Simplified8.0%
Taylor expanded in i around inf 43.8%
Taylor expanded in alpha around 0 39.7%
Taylor expanded in i around 0 35.3%
distribute-lft-out--35.3%
Simplified35.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 17.9%
associate-/l/15.7%
associate-/l*20.3%
+-commutative20.3%
+-commutative20.3%
+-commutative20.3%
associate-+l+20.3%
+-commutative20.3%
associate-*l*20.2%
Simplified20.2%
Taylor expanded in i around inf 66.5%
herbie shell --seed 2024152
(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)))