
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
NOTE: alpha, 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)
(/ (* t_4 (/ (fma i t_3 (* alpha beta)) (pow t_5 2.0))) t_2)
(* (/ i (+ 1.0 t_5)) (/ (* 0.25 (+ i alpha)) (+ t_5 -1.0))))))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 = (t_4 * (fma(i, t_3, (alpha * beta)) / pow(t_5, 2.0))) / t_2;
} else {
tmp = (i / (1.0 + t_5)) * ((0.25 * (i + alpha)) / (t_5 + -1.0));
}
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(t_4 * Float64(fma(i, t_3, Float64(alpha * beta)) / (t_5 ^ 2.0))) / t_2); else tmp = Float64(Float64(i / Float64(1.0 + t_5)) * Float64(Float64(0.25 * Float64(i + alpha)) / Float64(t_5 + -1.0))); 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[(t$95$4 * N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / N[Power[t$95$5, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(i / N[(1.0 + t$95$5), $MachinePrecision]), $MachinePrecision] * N[(N[(0.25 * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$5 + -1.0), $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{t\_4 \cdot \frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{{t\_5}^{2}}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{1 + t\_5} \cdot \frac{0.25 \cdot \left(i + \alpha\right)}{t\_5 + -1}\\
\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 50.3%
associate-/l*99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
*-commutative99.8%
fma-undefine99.8%
pow299.8%
+-commutative99.8%
*-commutative99.8%
fma-undefine99.8%
pow299.8%
+-commutative99.8%
Applied egg-rr99.8%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #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*5.7%
+-commutative5.7%
+-commutative5.7%
associate-+r+5.7%
+-commutative5.7%
*-commutative5.7%
fma-undefine5.7%
pow25.7%
+-commutative5.7%
*-commutative5.7%
fma-undefine5.7%
pow25.7%
+-commutative5.7%
Applied egg-rr5.7%
Taylor expanded in i around inf 5.7%
Taylor expanded in beta around 0 7.6%
associate-*l*7.6%
difference-of-sqr-17.6%
times-frac71.1%
+-commutative71.1%
*-commutative71.1%
fma-define71.1%
+-commutative71.1%
+-commutative71.1%
*-commutative71.1%
fma-define71.1%
Applied egg-rr71.1%
Final simplification81.2%
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)))
(t_4 (fma i 2.0 (+ alpha beta))))
(if (<= t_3 0.0625)
t_3
(* (/ i (+ 1.0 t_4)) (/ (* 0.25 (+ i alpha)) (+ t_4 -1.0))))))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 t_4 = fma(i, 2.0, (alpha + beta));
double tmp;
if (t_3 <= 0.0625) {
tmp = t_3;
} else {
tmp = (i / (1.0 + t_4)) * ((0.25 * (i + alpha)) / (t_4 + -1.0));
}
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)) t_4 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (t_3 <= 0.0625) tmp = t_3; else tmp = Float64(Float64(i / Float64(1.0 + t_4)) * Float64(Float64(0.25 * Float64(i + alpha)) / Float64(t_4 + -1.0))); 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[(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]}, Block[{t$95$4 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.0625], t$95$3, N[(N[(i / N[(1.0 + t$95$4), $MachinePrecision]), $MachinePrecision] * N[(N[(0.25 * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$4 + -1.0), $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 \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}\\
t_4 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;t\_3 \leq 0.0625:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{1 + t\_4} \cdot \frac{0.25 \cdot \left(i + \alpha\right)}{t\_4 + -1}\\
\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.0625Initial program 99.7%
if 0.0625 < (/.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 2.9%
associate-/l*27.8%
+-commutative27.8%
+-commutative27.8%
associate-+r+27.8%
+-commutative27.8%
*-commutative27.8%
fma-undefine27.8%
pow227.8%
+-commutative27.8%
*-commutative27.8%
fma-undefine27.8%
pow227.8%
+-commutative27.8%
Applied egg-rr27.8%
Taylor expanded in i around inf 24.0%
Taylor expanded in beta around 0 25.5%
associate-*l*25.5%
difference-of-sqr-125.5%
times-frac74.1%
+-commutative74.1%
*-commutative74.1%
fma-define74.1%
+-commutative74.1%
+-commutative74.1%
*-commutative74.1%
fma-define74.1%
Applied egg-rr74.1%
Final simplification78.0%
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)))
(t_4 (fma i 2.0 (+ alpha beta))))
(if (<= t_3 0.1)
t_3
(* (/ 0.25 (+ 1.0 t_4)) (* i (/ (+ i alpha) (+ t_4 -1.0)))))))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 t_4 = fma(i, 2.0, (alpha + beta));
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.25 / (1.0 + t_4)) * (i * ((i + alpha) / (t_4 + -1.0)));
}
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)) t_4 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(0.25 / Float64(1.0 + t_4)) * Float64(i * Float64(Float64(i + alpha) / Float64(t_4 + -1.0)))); 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[(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]}, Block[{t$95$4 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.25 / N[(1.0 + t$95$4), $MachinePrecision]), $MachinePrecision] * N[(i * N[(N[(i + alpha), $MachinePrecision] / N[(t$95$4 + -1.0), $MachinePrecision]), $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 \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}\\
t_4 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;t\_3 \leq 0.1:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{0.25}{1 + t\_4} \cdot \left(i \cdot \frac{i + \alpha}{t\_4 + -1}\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #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.7%
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.6%
associate-/l*26.1%
+-commutative26.1%
+-commutative26.1%
associate-+r+26.1%
+-commutative26.1%
*-commutative26.1%
fma-undefine26.1%
pow226.1%
+-commutative26.1%
*-commutative26.1%
fma-undefine26.1%
pow226.1%
+-commutative26.1%
Applied egg-rr26.1%
Taylor expanded in i around inf 22.2%
Taylor expanded in beta around 0 23.8%
*-commutative23.8%
difference-of-sqr-123.8%
times-frac24.3%
+-commutative24.3%
*-commutative24.3%
fma-define24.3%
+-commutative24.3%
+-commutative24.3%
*-commutative24.3%
fma-define24.3%
Applied egg-rr24.3%
+-commutative24.3%
associate-/l*73.3%
+-commutative73.3%
sub-neg73.3%
metadata-eval73.3%
Simplified73.3%
Final simplification77.9%
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) (* 0.0625 (+ (* alpha 2.0) (* beta 2.0))))
(* (+ alpha 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) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((alpha + 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) + (0.0625d0 * ((alpha * 2.0d0) + (beta * 2.0d0)))) - ((alpha + 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) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((alpha + 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) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((alpha + 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(0.0625 * Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)))) - Float64(Float64(alpha + 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) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((alpha + 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[(0.0625 * N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $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{\left(i \cdot 0.0625 + 0.0625 \cdot \left(\alpha \cdot 2 + \beta \cdot 2\right)\right) - \left(\alpha + \beta\right) \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.7%
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.6%
associate-/l/0.0%
associate-/l*5.2%
+-commutative5.2%
+-commutative5.2%
+-commutative5.2%
associate-+l+5.2%
+-commutative5.2%
associate-*l*5.2%
Simplified5.2%
Taylor expanded in i around inf 75.7%
Taylor expanded in i around 0 75.7%
Final simplification79.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))))
(if (<= i 3.45e+145)
(/ (* 0.25 (* i (+ i alpha))) (+ (* t_0 t_0) -1.0))
0.0625)))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 <= 3.45e+145) {
tmp = (0.25 * (i * (i + alpha))) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
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 <= 3.45d+145) then
tmp = (0.25d0 * (i * (i + alpha))) / ((t_0 * t_0) + (-1.0d0))
else
tmp = 0.0625d0
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 <= 3.45e+145) {
tmp = (0.25 * (i * (i + alpha))) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
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 <= 3.45e+145: tmp = (0.25 * (i * (i + alpha))) / ((t_0 * t_0) + -1.0) else: tmp = 0.0625 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 <= 3.45e+145) tmp = Float64(Float64(0.25 * Float64(i * Float64(i + alpha))) / Float64(Float64(t_0 * t_0) + -1.0)); else tmp = 0.0625; 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 <= 3.45e+145)
tmp = (0.25 * (i * (i + alpha))) / ((t_0 * t_0) + -1.0);
else
tmp = 0.0625;
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, 3.45e+145], N[(N[(0.25 * N[(i * N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]
\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 3.45 \cdot 10^{+145}:\\
\;\;\;\;\frac{0.25 \cdot \left(i \cdot \left(i + \alpha\right)\right)}{t\_0 \cdot t\_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 3.45e145Initial program 38.9%
associate-/l*81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
+-commutative81.2%
*-commutative81.2%
fma-undefine81.2%
pow281.2%
+-commutative81.2%
*-commutative81.2%
fma-undefine81.2%
pow281.2%
+-commutative81.2%
Applied egg-rr81.2%
Taylor expanded in i around inf 65.7%
Taylor expanded in beta around 0 68.8%
if 3.45e145 < i Initial program 0.1%
associate-/l/0.0%
associate-/l*0.1%
+-commutative0.1%
+-commutative0.1%
+-commutative0.1%
associate-+l+0.1%
+-commutative0.1%
associate-*l*0.1%
Simplified0.1%
Taylor expanded in i around inf 79.3%
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)))) (if (<= i 8.4e+145) (/ (* 0.25 (* i i)) (+ (* t_0 t_0) -1.0)) 0.0625)))
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 <= 8.4e+145) {
tmp = (0.25 * (i * i)) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
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 <= 8.4d+145) then
tmp = (0.25d0 * (i * i)) / ((t_0 * t_0) + (-1.0d0))
else
tmp = 0.0625d0
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 <= 8.4e+145) {
tmp = (0.25 * (i * i)) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
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 <= 8.4e+145: tmp = (0.25 * (i * i)) / ((t_0 * t_0) + -1.0) else: tmp = 0.0625 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 <= 8.4e+145) tmp = Float64(Float64(0.25 * Float64(i * i)) / Float64(Float64(t_0 * t_0) + -1.0)); else tmp = 0.0625; 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 <= 8.4e+145)
tmp = (0.25 * (i * i)) / ((t_0 * t_0) + -1.0);
else
tmp = 0.0625;
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, 8.4e+145], N[(N[(0.25 * N[(i * i), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]
\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 8.4 \cdot 10^{+145}:\\
\;\;\;\;\frac{0.25 \cdot \left(i \cdot i\right)}{t\_0 \cdot t\_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 8.39999999999999958e145Initial program 38.9%
associate-/l*81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
+-commutative81.2%
*-commutative81.2%
fma-undefine81.2%
pow281.2%
+-commutative81.2%
*-commutative81.2%
fma-undefine81.2%
pow281.2%
+-commutative81.2%
Applied egg-rr81.2%
Taylor expanded in i around inf 65.7%
Taylor expanded in i around inf 73.9%
if 8.39999999999999958e145 < i Initial program 0.1%
associate-/l/0.0%
associate-/l*0.1%
+-commutative0.1%
+-commutative0.1%
+-commutative0.1%
associate-+l+0.1%
+-commutative0.1%
associate-*l*0.1%
Simplified0.1%
Taylor expanded in i around inf 79.3%
Final simplification76.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (/ (- (+ (* i 0.0625) (* 0.0625 (+ (* alpha 2.0) (* beta 2.0)))) (* (+ alpha beta) 0.125)) i))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (((i * 0.0625) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((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) + (0.0625d0 * ((alpha * 2.0d0) + (beta * 2.0d0)))) - ((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) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((alpha + beta) * 0.125)) / i;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (((i * 0.0625) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((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(0.0625 * Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)))) - 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) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((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[(0.0625 * N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $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 + 0.0625 \cdot \left(\alpha \cdot 2 + \beta \cdot 2\right)\right) - \left(\alpha + \beta\right) \cdot 0.125}{i}
\end{array}
Initial program 17.7%
associate-/l/15.7%
associate-/l*19.9%
+-commutative19.9%
+-commutative19.9%
+-commutative19.9%
associate-+l+19.9%
+-commutative19.9%
associate-*l*19.9%
Simplified19.9%
Taylor expanded in i around inf 75.3%
Taylor expanded in i around 0 75.3%
Final simplification75.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (+ 0.0625 (* 0.0625 (/ (+ (* alpha 2.0) (* beta 2.0)) i))) (* 0.125 (/ (+ alpha beta) i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / 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.0625d0 * (((alpha * 2.0d0) + (beta * 2.0d0)) / 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.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + beta) / i));
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / 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.0625 * Float64(Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)) / 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.0625 * (((alpha * 2.0) + (beta * 2.0)) / 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.0625 * N[(N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / 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.0625 \cdot \frac{\alpha \cdot 2 + \beta \cdot 2}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}
\end{array}
Initial program 17.7%
associate-/l/15.7%
associate-/l*19.9%
+-commutative19.9%
+-commutative19.9%
+-commutative19.9%
associate-+l+19.9%
+-commutative19.9%
associate-*l*19.9%
Simplified19.9%
Taylor expanded in i around inf 75.3%
Final simplification75.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.3e+249) 0.0625 0.0))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.3e+249) {
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 <= 3.3d+249) 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 <= 3.3e+249) {
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 <= 3.3e+249: 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 <= 3.3e+249) 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 <= 3.3e+249)
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, 3.3e+249], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3 \cdot 10^{+249}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 3.30000000000000014e249Initial program 18.9%
associate-/l/16.7%
associate-/l*19.6%
+-commutative19.6%
+-commutative19.6%
+-commutative19.6%
associate-+l+19.6%
+-commutative19.6%
associate-*l*19.5%
Simplified19.5%
Taylor expanded in i around inf 73.5%
if 3.30000000000000014e249 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*25.0%
+-commutative25.0%
+-commutative25.0%
+-commutative25.0%
associate-+l+25.0%
+-commutative25.0%
associate-*l*25.0%
Simplified25.0%
Taylor expanded in i around inf 46.8%
Taylor expanded in i around 0 46.8%
Taylor expanded in i around 0 46.4%
div-sub46.4%
distribute-lft-in46.4%
associate-*r*46.4%
metadata-eval46.4%
associate-*r/46.4%
associate-*r/46.4%
+-inverses46.4%
Simplified46.4%
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 17.7%
associate-/l/15.7%
associate-/l*19.9%
+-commutative19.9%
+-commutative19.9%
+-commutative19.9%
associate-+l+19.9%
+-commutative19.9%
associate-*l*19.9%
Simplified19.9%
Taylor expanded in i around inf 75.3%
Taylor expanded in i around 0 75.3%
Taylor expanded in i around 0 9.8%
div-sub9.8%
distribute-lft-in9.8%
associate-*r*9.8%
metadata-eval9.8%
associate-*r/9.8%
associate-*r/9.8%
+-inverses9.8%
Simplified9.8%
herbie shell --seed 2024167
(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)))