
(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 (pow (fma i 2.0 (+ alpha beta)) 2.0)))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(* (/ t_3 (+ t_4 -1.0)) (/ (fma i t_2 (* alpha beta)) t_4))
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(/ (* beta 0.125) 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 = pow(fma(i, 2.0, (alpha + beta)), 2.0);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (t_3 / (t_4 + -1.0)) * (fma(i, t_2, (alpha * beta)) / t_4);
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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)) ^ 2.0 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(t_3 / Float64(t_4 + -1.0)) * Float64(fma(i, t_2, Float64(alpha * beta)) / t_4)); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(Float64(beta * 0.125) / 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[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $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[(t$95$3 / N[(t$95$4 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(i * t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(N[(beta * 0.125), $MachinePrecision] / i), $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 := {\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\
\;\;\;\;\frac{t\_3}{t\_4 + -1} \cdot \frac{\mathsf{fma}\left(i, t\_2, \alpha \cdot \beta\right)}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - \frac{\beta \cdot 0.125}{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 48.4%
associate-/l/42.1%
Simplified42.1%
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.0%
+-commutative6.0%
+-commutative6.0%
+-commutative6.0%
associate-+l+6.0%
+-commutative6.0%
associate-*l*6.0%
Simplified6.0%
Taylor expanded in i around inf 74.7%
expm1-log1p-u60.3%
expm1-undefine60.2%
distribute-lft-out60.2%
Applied egg-rr60.2%
expm1-define60.3%
associate-*r/60.3%
associate-*r*60.3%
metadata-eval60.3%
associate-*r/60.3%
Simplified60.3%
Taylor expanded in i around 0 74.7%
Taylor expanded in alpha around 0 67.9%
associate-*r/67.9%
Simplified67.9%
Final simplification80.3%
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)))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
t_4
(/ (fma i t_3 (* alpha beta)) (pow (fma i 2.0 (+ alpha beta)) 2.0)))
t_2)
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(/ (* beta 0.125) 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 tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (t_4 * (fma(i, t_3, (alpha * beta)) / pow(fma(i, 2.0, (alpha + beta)), 2.0))) / t_2;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(t_4 * Float64(fma(i, t_3, Float64(alpha * beta)) / (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(Float64(beta * 0.125) / 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]}, 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[(t$95$4 * N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $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[(N[(beta * 0.125), $MachinePrecision] / i), $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\\
\mathbf{if}\;\frac{\frac{t\_4 \cdot \left(t\_4 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{t\_4 \cdot \frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - \frac{\beta \cdot 0.125}{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 48.4%
associate-/l*99.6%
+-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
*-commutative99.6%
fma-undefine99.6%
pow299.6%
+-commutative99.6%
*-commutative99.6%
fma-undefine99.6%
pow299.6%
+-commutative99.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.0%
+-commutative6.0%
+-commutative6.0%
+-commutative6.0%
associate-+l+6.0%
+-commutative6.0%
associate-*l*6.0%
Simplified6.0%
Taylor expanded in i around inf 74.7%
expm1-log1p-u60.3%
expm1-undefine60.2%
distribute-lft-out60.2%
Applied egg-rr60.2%
expm1-define60.3%
associate-*r/60.3%
associate-*r*60.3%
metadata-eval60.3%
associate-*r/60.3%
Simplified60.3%
Taylor expanded in i around 0 74.7%
Taylor expanded in alpha around 0 67.9%
associate-*r/67.9%
Simplified67.9%
Final simplification80.3%
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)))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) 0.1)
(/
(*
i
(*
(* t_3 (fma i t_3 (* alpha beta)))
(pow (fma i 2.0 (+ alpha beta)) -2.0)))
t_2)
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(/ (* beta 0.125) 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 tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= 0.1) {
tmp = (i * ((t_3 * fma(i, t_3, (alpha * beta))) * pow(fma(i, 2.0, (alpha + beta)), -2.0))) / t_2;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= 0.1) tmp = Float64(Float64(i * Float64(Float64(t_3 * fma(i, t_3, Float64(alpha * beta))) * (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(Float64(beta * 0.125) / 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]}, 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], 0.1], N[(N[(i * N[(N[(t$95$3 * N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], -2.0], $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[(N[(beta * 0.125), $MachinePrecision] / i), $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\\
\mathbf{if}\;\frac{\frac{t\_4 \cdot \left(t\_4 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq 0.1:\\
\;\;\;\;\frac{i \cdot \left(\left(t\_3 \cdot \mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)\right) \cdot {\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} - \frac{\beta \cdot 0.125}{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.6%
div-inv99.5%
associate-*l*99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
associate-+r+99.3%
+-commutative99.3%
*-commutative99.3%
fma-undefine99.3%
+-commutative99.3%
associate-+r+99.3%
pow299.3%
*-commutative99.3%
Applied egg-rr99.5%
associate-*l*99.6%
Simplified99.6%
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.8%
associate-/l/0.0%
associate-/l*5.3%
+-commutative5.3%
+-commutative5.3%
+-commutative5.3%
associate-+l+5.3%
+-commutative5.3%
associate-*l*5.3%
Simplified5.3%
Taylor expanded in i around inf 77.8%
expm1-log1p-u67.0%
expm1-undefine66.9%
distribute-lft-out66.9%
Applied egg-rr66.9%
expm1-define67.0%
associate-*r/67.0%
associate-*r*67.0%
metadata-eval67.0%
associate-*r/67.0%
Simplified67.0%
Taylor expanded in i around 0 77.8%
Taylor expanded in alpha around 0 72.7%
associate-*r/72.7%
Simplified72.7%
Final simplification77.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 (* i (+ i (+ alpha beta))))
(t_3 (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0))))
(if (<= t_3 0.1)
t_3
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(/ (* beta 0.125) i)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (alpha + beta));
double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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) :: tmp
t_0 = (alpha + beta) + (i * 2.0d0)
t_1 = t_0 * t_0
t_2 = i * (i + (alpha + beta))
t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + (-1.0d0))
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (((i * 0.0625d0) + ((alpha + beta) * 0.125d0)) / i) - ((beta * 0.125d0) / 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 = i * (i + (alpha + beta));
double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / i);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (alpha + beta)) t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / i) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(Float64(beta * 0.125) / i)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (alpha + beta));
t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / i);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = 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]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(N[(beta * 0.125), $MachinePrecision] / i), $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 \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := \frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1}\\
\mathbf{if}\;t\_3 \leq 0.1:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - \frac{\beta \cdot 0.125}{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.6%
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.8%
associate-/l/0.0%
associate-/l*5.3%
+-commutative5.3%
+-commutative5.3%
+-commutative5.3%
associate-+l+5.3%
+-commutative5.3%
associate-*l*5.3%
Simplified5.3%
Taylor expanded in i around inf 77.8%
expm1-log1p-u67.0%
expm1-undefine66.9%
distribute-lft-out66.9%
Applied egg-rr66.9%
expm1-define67.0%
associate-*r/67.0%
associate-*r*67.0%
metadata-eval67.0%
associate-*r/67.0%
Simplified67.0%
Taylor expanded in i around 0 77.8%
Taylor expanded in alpha around 0 72.7%
associate-*r/72.7%
Simplified72.7%
Final simplification77.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))))
(if (<= i 5e+102)
(/ (* i (* i (+ 0.25 (* 0.25 (/ alpha i))))) (+ (* t_0 t_0) -1.0))
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(/ (* beta 0.125) i)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double tmp;
if (i <= 5e+102) {
tmp = (i * (i * (0.25 + (0.25 * (alpha / i))))) / ((t_0 * t_0) + -1.0);
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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) :: tmp
t_0 = (alpha + beta) + (i * 2.0d0)
if (i <= 5d+102) then
tmp = (i * (i * (0.25d0 + (0.25d0 * (alpha / i))))) / ((t_0 * t_0) + (-1.0d0))
else
tmp = (((i * 0.0625d0) + ((alpha + beta) * 0.125d0)) / i) - ((beta * 0.125d0) / 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 tmp;
if (i <= 5e+102) {
tmp = (i * (i * (0.25 + (0.25 * (alpha / i))))) / ((t_0 * t_0) + -1.0);
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / i);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) tmp = 0 if i <= 5e+102: tmp = (i * (i * (0.25 + (0.25 * (alpha / i))))) / ((t_0 * t_0) + -1.0) else: tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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)) tmp = 0.0 if (i <= 5e+102) tmp = Float64(Float64(i * Float64(i * Float64(0.25 + Float64(0.25 * Float64(alpha / i))))) / Float64(Float64(t_0 * t_0) + -1.0)); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(Float64(beta * 0.125) / 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);
tmp = 0.0;
if (i <= 5e+102)
tmp = (i * (i * (0.25 + (0.25 * (alpha / i))))) / ((t_0 * t_0) + -1.0);
else
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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]}, If[LessEqual[i, 5e+102], N[(N[(i * N[(i * N[(0.25 + N[(0.25 * N[(alpha / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $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[(N[(beta * 0.125), $MachinePrecision] / i), $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\\
\mathbf{if}\;i \leq 5 \cdot 10^{+102}:\\
\;\;\;\;\frac{i \cdot \left(i \cdot \left(0.25 + 0.25 \cdot \frac{\alpha}{i}\right)\right)}{t\_0 \cdot t\_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - \frac{\beta \cdot 0.125}{i}\\
\end{array}
\end{array}
if i < 5e102Initial program 50.5%
div-inv50.5%
associate-*l*50.4%
+-commutative50.4%
+-commutative50.4%
+-commutative50.4%
associate-+r+50.4%
+-commutative50.4%
*-commutative50.4%
fma-undefine50.4%
+-commutative50.4%
associate-+r+50.4%
pow250.4%
*-commutative50.4%
Applied egg-rr50.5%
associate-*l*71.0%
Simplified71.0%
Taylor expanded in i around inf 70.0%
associate--l+70.0%
distribute-lft-in70.0%
associate-*r/70.0%
distribute-lft-in70.0%
associate-*r/70.0%
div-sub70.0%
distribute-lft-in70.0%
distribute-lft-out--70.0%
associate-/l*70.0%
Simplified70.0%
Taylor expanded in alpha around inf 74.8%
*-commutative74.8%
Simplified74.8%
if 5e102 < i Initial program 0.6%
associate-/l/0.0%
associate-/l*0.6%
+-commutative0.6%
+-commutative0.6%
+-commutative0.6%
associate-+l+0.6%
+-commutative0.6%
associate-*l*0.6%
Simplified0.6%
Taylor expanded in i around inf 78.2%
expm1-log1p-u76.0%
expm1-undefine75.9%
distribute-lft-out75.9%
Applied egg-rr75.9%
expm1-define76.0%
associate-*r/76.0%
associate-*r*76.0%
metadata-eval76.0%
associate-*r/76.0%
Simplified76.0%
Taylor expanded in i around 0 78.2%
Taylor expanded in alpha around 0 77.7%
associate-*r/77.7%
Simplified77.7%
Final simplification76.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))))
(if (<= i 1.65e+103)
(/ (* 0.25 (* i i)) (+ (* t_0 t_0) -1.0))
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(/ (* beta 0.125) i)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double tmp;
if (i <= 1.65e+103) {
tmp = (0.25 * (i * i)) / ((t_0 * t_0) + -1.0);
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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) :: tmp
t_0 = (alpha + beta) + (i * 2.0d0)
if (i <= 1.65d+103) then
tmp = (0.25d0 * (i * i)) / ((t_0 * t_0) + (-1.0d0))
else
tmp = (((i * 0.0625d0) + ((alpha + beta) * 0.125d0)) / i) - ((beta * 0.125d0) / 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 tmp;
if (i <= 1.65e+103) {
tmp = (0.25 * (i * i)) / ((t_0 * t_0) + -1.0);
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / i);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) tmp = 0 if i <= 1.65e+103: tmp = (0.25 * (i * i)) / ((t_0 * t_0) + -1.0) else: tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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)) tmp = 0.0 if (i <= 1.65e+103) tmp = Float64(Float64(0.25 * Float64(i * i)) / Float64(Float64(t_0 * t_0) + -1.0)); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(Float64(beta * 0.125) / 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);
tmp = 0.0;
if (i <= 1.65e+103)
tmp = (0.25 * (i * i)) / ((t_0 * t_0) + -1.0);
else
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / 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]}, If[LessEqual[i, 1.65e+103], N[(N[(0.25 * N[(i * i), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $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[(N[(beta * 0.125), $MachinePrecision] / i), $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\\
\mathbf{if}\;i \leq 1.65 \cdot 10^{+103}:\\
\;\;\;\;\frac{0.25 \cdot \left(i \cdot i\right)}{t\_0 \cdot t\_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - \frac{\beta \cdot 0.125}{i}\\
\end{array}
\end{array}
if i < 1.65000000000000004e103Initial program 50.5%
Taylor expanded in i around inf 79.3%
*-commutative79.3%
Simplified79.3%
unpow279.3%
Applied egg-rr79.3%
if 1.65000000000000004e103 < i Initial program 0.6%
associate-/l/0.0%
associate-/l*0.6%
+-commutative0.6%
+-commutative0.6%
+-commutative0.6%
associate-+l+0.6%
+-commutative0.6%
associate-*l*0.6%
Simplified0.6%
Taylor expanded in i around inf 78.2%
expm1-log1p-u76.0%
expm1-undefine75.9%
distribute-lft-out75.9%
Applied egg-rr75.9%
expm1-define76.0%
associate-*r/76.0%
associate-*r*76.0%
metadata-eval76.0%
associate-*r/76.0%
Simplified76.0%
Taylor expanded in i around 0 78.2%
Taylor expanded in alpha around 0 77.7%
associate-*r/77.7%
Simplified77.7%
Final simplification78.3%
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) (/ (* beta 0.125) i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((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) + ((alpha + beta) * 0.125d0)) / i) - ((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) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / i);
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((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(Float64(alpha + beta) * 0.125)) / i) - Float64(Float64(beta * 0.125) / 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) - ((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[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(N[(beta * 0.125), $MachinePrecision] / i), $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} - \frac{\beta \cdot 0.125}{i}
\end{array}
Initial program 18.9%
associate-/l/16.4%
associate-/l*20.8%
+-commutative20.8%
+-commutative20.8%
+-commutative20.8%
associate-+l+20.8%
+-commutative20.8%
associate-*l*20.7%
Simplified20.7%
Taylor expanded in i around inf 76.9%
expm1-log1p-u68.1%
expm1-undefine68.0%
distribute-lft-out68.0%
Applied egg-rr68.0%
expm1-define68.1%
associate-*r/68.1%
associate-*r*68.1%
metadata-eval68.1%
associate-*r/68.1%
Simplified68.1%
Taylor expanded in i around 0 76.9%
Taylor expanded in alpha around 0 72.6%
associate-*r/72.6%
Simplified72.6%
Final simplification72.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 18.9%
associate-/l/16.4%
associate-/l*20.8%
+-commutative20.8%
+-commutative20.8%
+-commutative20.8%
associate-+l+20.8%
+-commutative20.8%
associate-*l*20.7%
Simplified20.7%
Taylor expanded in i around inf 76.9%
Taylor expanded in i around 0 76.9%
Taylor expanded in alpha around 0 72.2%
*-commutative72.2%
Simplified72.2%
Final simplification72.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (+ 0.0625 (/ (* beta 0.125) i)) (* 0.125 (/ (+ alpha beta) i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.0625 + ((beta * 0.125) / 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 + ((beta * 0.125d0) / 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 + ((beta * 0.125) / i)) - (0.125 * ((alpha + beta) / i));
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.0625 + ((beta * 0.125) / i)) - (0.125 * ((alpha + beta) / i))
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(Float64(beta * 0.125) / 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 + ((beta * 0.125) / 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[(N[(beta * 0.125), $MachinePrecision] / i), $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 + \frac{\beta \cdot 0.125}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}
\end{array}
Initial program 18.9%
associate-/l/16.4%
associate-/l*20.8%
+-commutative20.8%
+-commutative20.8%
+-commutative20.8%
associate-+l+20.8%
+-commutative20.8%
associate-*l*20.7%
Simplified20.7%
Taylor expanded in i around inf 76.9%
Taylor expanded in alpha around 0 72.2%
associate-*r/72.2%
Simplified72.2%
Final simplification72.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.8e+242) 0.0625 0.0))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.8e+242) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.8d+242) then
tmp = 0.0625d0
else
tmp = 0.0d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.8e+242) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.8e+242: tmp = 0.0625 else: tmp = 0.0 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.8e+242) tmp = 0.0625; else tmp = 0.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.8e+242)
tmp = 0.0625;
else
tmp = 0.0;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.8e+242], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.8 \cdot 10^{+242}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 1.79999999999999997e242Initial program 20.7%
associate-/l/18.0%
associate-/l*21.4%
+-commutative21.4%
+-commutative21.4%
+-commutative21.4%
associate-+l+21.4%
+-commutative21.4%
associate-*l*21.3%
Simplified21.3%
Taylor expanded in i around inf 74.5%
if 1.79999999999999997e242 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*13.6%
+-commutative13.6%
+-commutative13.6%
+-commutative13.6%
associate-+l+13.6%
+-commutative13.6%
associate-*l*13.6%
Simplified13.6%
Taylor expanded in i around inf 49.9%
Taylor expanded in i around 0 49.9%
Taylor expanded in i around 0 48.7%
div-sub48.7%
distribute-lft-in48.7%
associate-*r*48.7%
metadata-eval48.7%
associate-*r/48.7%
associate-*r/48.7%
+-inverses48.7%
Simplified48.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0;
}
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.0d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0
\end{array}
Initial program 18.9%
associate-/l/16.4%
associate-/l*20.8%
+-commutative20.8%
+-commutative20.8%
+-commutative20.8%
associate-+l+20.8%
+-commutative20.8%
associate-*l*20.7%
Simplified20.7%
Taylor expanded in i around inf 76.9%
Taylor expanded in i around 0 76.9%
Taylor expanded in i around 0 11.9%
div-sub11.9%
distribute-lft-in11.9%
associate-*r*11.9%
metadata-eval11.9%
associate-*r/11.9%
associate-*r/11.9%
+-inverses11.9%
Simplified11.9%
herbie shell --seed 2024169
(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)))