
(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 9 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 (+ i (+ alpha beta))) (t_1 (fma i 2.0 (+ alpha beta))))
(if (<= i 3.2e+128)
(*
(/ (/ (* i t_0) t_1) (+ t_1 1.0))
(/ (/ (fma i t_0 (* alpha beta)) t_1) (+ t_1 -1.0)))
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) i))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = i + (alpha + beta);
double t_1 = fma(i, 2.0, (alpha + beta));
double tmp;
if (i <= 3.2e+128) {
tmp = (((i * t_0) / t_1) / (t_1 + 1.0)) * ((fma(i, t_0, (alpha * beta)) / t_1) / (t_1 + -1.0));
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(i + Float64(alpha + beta)) t_1 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (i <= 3.2e+128) tmp = Float64(Float64(Float64(Float64(i * t_0) / t_1) / Float64(t_1 + 1.0)) * Float64(Float64(fma(i, t_0, Float64(alpha * beta)) / t_1) / Float64(t_1 + -1.0))); else tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / 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[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 3.2e+128], N[(N[(N[(N[(i * t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i * t$95$0 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := i + \left(\alpha + \beta\right)\\
t_1 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;i \leq 3.2 \cdot 10^{+128}:\\
\;\;\;\;\frac{\frac{i \cdot t\_0}{t\_1}}{t\_1 + 1} \cdot \frac{\frac{\mathsf{fma}\left(i, t\_0, \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{i}\\
\end{array}
\end{array}
if i < 3.19999999999999986e128Initial program 34.2%
associate-/l/30.6%
Simplified30.6%
Applied egg-rr85.6%
if 3.19999999999999986e128 < i Initial program 0.4%
associate-/l/0.0%
associate-/l*0.4%
+-commutative0.4%
+-commutative0.4%
+-commutative0.4%
associate-+l+0.4%
+-commutative0.4%
associate-*l*0.4%
Simplified0.4%
Taylor expanded in i around inf 83.7%
Taylor expanded in i around 0 83.7%
cancel-sign-sub-inv83.7%
distribute-lft-in83.7%
distribute-lft-out83.7%
metadata-eval83.7%
Simplified83.7%
Taylor expanded in alpha around 0 83.1%
Final simplification84.1%
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 t_5) (/ (fma i t_3 (* alpha beta)) t_5)) t_2)
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) 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 = ((t_4 / t_5) * (fma(i, t_3, (alpha * beta)) / t_5)) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / 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(t_4 / t_5) * Float64(fma(i, t_3, Float64(alpha * beta)) / t_5)) / t_2); else tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / 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[(t$95$4 / t$95$5), $MachinePrecision] * N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $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 := 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{t\_4}{t\_5} \cdot \frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{t\_5}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{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 41.0%
*-commutative41.0%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
*-commutative99.8%
fma-undefine99.8%
+-commutative99.8%
*-commutative99.8%
fma-define99.8%
+-commutative99.8%
+-commutative99.8%
*-commutative99.8%
fma-define99.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/0.0%
associate-/l*4.7%
+-commutative4.7%
+-commutative4.7%
+-commutative4.7%
associate-+l+4.7%
+-commutative4.7%
associate-*l*4.7%
Simplified4.7%
Taylor expanded in i around inf 74.6%
Taylor expanded in i around 0 74.6%
cancel-sign-sub-inv74.6%
distribute-lft-in74.6%
distribute-lft-out74.6%
metadata-eval74.6%
Simplified74.6%
Taylor expanded in alpha around 0 71.1%
Final simplification81.1%
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)
(/
(* (pow i 2.0) (/ (pow (+ i beta) 2.0) (pow (+ beta (* i 2.0)) 2.0)))
t_2)
(/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) 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 = (pow(i, 2.0) * (pow((i + beta), 2.0) / pow((beta + (i * 2.0)), 2.0))) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
return tmp;
}
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 tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
tmp = (Math.pow(i, 2.0) * (Math.pow((i + beta), 2.0) / Math.pow((beta + (i * 2.0)), 2.0))) / t_2;
} else {
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / 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)) tmp = 0 if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= math.inf: tmp = (math.pow(i, 2.0) * (math.pow((i + beta), 2.0) / math.pow((beta + (i * 2.0)), 2.0))) / t_2 else: tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / 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((i ^ 2.0) * Float64((Float64(i + beta) ^ 2.0) / (Float64(beta + Float64(i * 2.0)) ^ 2.0))) / t_2); else tmp = Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / 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));
tmp = 0.0;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Inf)
tmp = ((i ^ 2.0) * (((i + beta) ^ 2.0) / ((beta + (i * 2.0)) ^ 2.0))) / t_2;
else
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / 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]}, 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[Power[i, 2.0], $MachinePrecision] * N[(N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision] / N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $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 := t\_1 + -1\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{{i}^{2} \cdot \frac{{\left(i + \beta\right)}^{2}}{{\left(\beta + i \cdot 2\right)}^{2}}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{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 41.0%
Taylor expanded in alpha around 0 37.7%
associate-/l*89.3%
Simplified89.3%
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*4.7%
+-commutative4.7%
+-commutative4.7%
+-commutative4.7%
associate-+l+4.7%
+-commutative4.7%
associate-*l*4.7%
Simplified4.7%
Taylor expanded in i around inf 74.6%
Taylor expanded in i around 0 74.6%
cancel-sign-sub-inv74.6%
distribute-lft-in74.6%
distribute-lft-out74.6%
metadata-eval74.6%
Simplified74.6%
Taylor expanded in alpha around 0 71.1%
Final simplification77.4%
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
(-
(/ (* 0.0625 (+ i (* (+ alpha beta) 2.0))) i)
(* 0.125 (/ (+ alpha 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 * (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 = ((0.0625 * (i + ((alpha + beta) * 2.0))) / i) - (0.125 * ((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) :: 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 = ((0.0625d0 * (i + ((alpha + beta) * 2.0d0))) / i) - (0.125d0 * ((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 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 = ((0.0625 * (i + ((alpha + beta) * 2.0))) / i) - (0.125 * ((alpha + 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 = 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 = ((0.0625 * (i + ((alpha + beta) * 2.0))) / i) - (0.125 * ((alpha + 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(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(0.0625 * Float64(i + Float64(Float64(alpha + beta) * 2.0))) / i) - Float64(0.125 * Float64(Float64(alpha + 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 = 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 = ((0.0625 * (i + ((alpha + beta) * 2.0))) / i) - (0.125 * ((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_] := 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[(0.0625 * N[(i + N[(N[(alpha + beta), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / 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 \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{0.0625 \cdot \left(i + \left(\alpha + \beta\right) \cdot 2\right)}{i} - 0.125 \cdot \frac{\alpha + \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.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.7%
associate-/l/0.0%
associate-/l*4.3%
+-commutative4.3%
+-commutative4.3%
+-commutative4.3%
associate-+l+4.3%
+-commutative4.3%
associate-*l*4.3%
Simplified4.3%
Taylor expanded in i around inf 76.6%
Taylor expanded in i around 0 76.6%
distribute-lft-in76.6%
distribute-lft-out76.6%
Simplified76.6%
Final simplification79.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))))
(if (<= i 8.6e+137)
(/ (* i (* i 0.25)) (+ (* t_0 t_0) -1.0))
(/ (+ (+ 1.0 (* i 0.0625)) -1.0) 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 <= 8.6e+137) {
tmp = (i * (i * 0.25)) / ((t_0 * t_0) + -1.0);
} else {
tmp = ((1.0 + (i * 0.0625)) + -1.0) / 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 <= 8.6d+137) then
tmp = (i * (i * 0.25d0)) / ((t_0 * t_0) + (-1.0d0))
else
tmp = ((1.0d0 + (i * 0.0625d0)) + (-1.0d0)) / 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 <= 8.6e+137) {
tmp = (i * (i * 0.25)) / ((t_0 * t_0) + -1.0);
} else {
tmp = ((1.0 + (i * 0.0625)) + -1.0) / 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 <= 8.6e+137: tmp = (i * (i * 0.25)) / ((t_0 * t_0) + -1.0) else: tmp = ((1.0 + (i * 0.0625)) + -1.0) / 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 <= 8.6e+137) tmp = Float64(Float64(i * Float64(i * 0.25)) / Float64(Float64(t_0 * t_0) + -1.0)); else tmp = Float64(Float64(Float64(1.0 + Float64(i * 0.0625)) + -1.0) / 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 <= 8.6e+137)
tmp = (i * (i * 0.25)) / ((t_0 * t_0) + -1.0);
else
tmp = ((1.0 + (i * 0.0625)) + -1.0) / 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, 8.6e+137], N[(N[(i * N[(i * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + N[(i * 0.0625), $MachinePrecision]), $MachinePrecision] + -1.0), $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\\
\mathbf{if}\;i \leq 8.6 \cdot 10^{+137}:\\
\;\;\;\;\frac{i \cdot \left(i \cdot 0.25\right)}{t\_0 \cdot t\_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + i \cdot 0.0625\right) + -1}{i}\\
\end{array}
\end{array}
if i < 8.59999999999999929e137Initial program 31.6%
div-inv31.6%
Applied egg-rr31.5%
associate-*l*50.1%
fma-define50.1%
+-commutative50.1%
fma-define50.1%
Simplified50.1%
Taylor expanded in i around inf 69.2%
if 8.59999999999999929e137 < i Initial program 0.3%
associate-/l/0.0%
associate-/l*0.3%
+-commutative0.3%
+-commutative0.3%
+-commutative0.3%
associate-+l+0.3%
+-commutative0.3%
associate-*l*0.3%
Simplified0.3%
Taylor expanded in i around inf 85.3%
Taylor expanded in i around 0 85.3%
cancel-sign-sub-inv85.3%
distribute-lft-in85.3%
distribute-lft-out85.3%
metadata-eval85.3%
Simplified85.3%
expm1-log1p-u76.7%
expm1-undefine76.7%
fma-define76.7%
+-commutative76.7%
fma-define76.7%
*-commutative76.7%
Applied egg-rr76.7%
expm1-define76.7%
fma-undefine76.7%
fma-undefine76.7%
distribute-lft-in76.7%
associate-*r*76.7%
metadata-eval76.7%
+-commutative76.7%
*-commutative76.7%
+-commutative76.7%
*-commutative76.7%
+-commutative76.7%
associate-+r+76.9%
*-commutative76.9%
distribute-rgt-out76.9%
metadata-eval76.9%
mul0-rgt76.9%
*-commutative76.9%
Simplified76.9%
expm1-undefine76.9%
log1p-expm1-u76.9%
log1p-undefine76.9%
rem-exp-log76.9%
expm1-log1p-u85.5%
+-lft-identity85.5%
*-commutative85.5%
Applied egg-rr85.5%
Final simplification78.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.9e+233) (/ (+ (+ 1.0 (* i 0.0625)) -1.0) i) 0.0))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.9e+233) {
tmp = ((1.0 + (i * 0.0625)) + -1.0) / i;
} 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 <= 2.9d+233) then
tmp = ((1.0d0 + (i * 0.0625d0)) + (-1.0d0)) / i
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 <= 2.9e+233) {
tmp = ((1.0 + (i * 0.0625)) + -1.0) / i;
} else {
tmp = 0.0;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.9e+233: tmp = ((1.0 + (i * 0.0625)) + -1.0) / i else: tmp = 0.0 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.9e+233) tmp = Float64(Float64(Float64(1.0 + Float64(i * 0.0625)) + -1.0) / i); 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 <= 2.9e+233)
tmp = ((1.0 + (i * 0.0625)) + -1.0) / i;
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, 2.9e+233], N[(N[(N[(1.0 + N[(i * 0.0625), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision] / i), $MachinePrecision], 0.0]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9 \cdot 10^{+233}:\\
\;\;\;\;\frac{\left(1 + i \cdot 0.0625\right) + -1}{i}\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 2.90000000000000012e233Initial program 15.3%
associate-/l/13.5%
associate-/l*16.6%
+-commutative16.6%
+-commutative16.6%
+-commutative16.6%
associate-+l+16.6%
+-commutative16.6%
associate-*l*16.6%
Simplified16.6%
Taylor expanded in i around inf 77.9%
Taylor expanded in i around 0 77.9%
cancel-sign-sub-inv77.9%
distribute-lft-in77.9%
distribute-lft-out77.9%
metadata-eval77.9%
Simplified77.9%
expm1-log1p-u71.2%
expm1-undefine71.2%
fma-define71.2%
+-commutative71.2%
fma-define71.2%
*-commutative71.2%
Applied egg-rr71.2%
expm1-define71.2%
fma-undefine71.2%
fma-undefine71.2%
distribute-lft-in71.2%
associate-*r*71.2%
metadata-eval71.2%
+-commutative71.2%
*-commutative71.2%
+-commutative71.2%
*-commutative71.2%
+-commutative71.2%
associate-+r+67.9%
*-commutative67.9%
distribute-rgt-out67.9%
metadata-eval67.9%
mul0-rgt67.9%
*-commutative67.9%
Simplified67.9%
expm1-undefine67.9%
log1p-expm1-u67.9%
log1p-undefine67.9%
rem-exp-log67.9%
expm1-log1p-u74.6%
+-lft-identity74.6%
*-commutative74.6%
Applied egg-rr74.6%
if 2.90000000000000012e233 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*11.1%
+-commutative11.1%
+-commutative11.1%
+-commutative11.1%
associate-+l+11.1%
+-commutative11.1%
associate-*l*11.1%
Simplified11.1%
Taylor expanded in i around inf 58.1%
Taylor expanded in i around 0 58.1%
cancel-sign-sub-inv58.1%
distribute-lft-in58.1%
distribute-lft-out58.1%
metadata-eval58.1%
Simplified58.1%
Taylor expanded in alpha around 0 58.1%
Taylor expanded in i around 0 47.3%
distribute-rgt-out47.3%
metadata-eval47.3%
*-rgt-identity47.3%
times-frac47.3%
metadata-eval47.3%
mul0-rgt47.3%
Simplified47.3%
Final simplification72.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (/ (+ (* beta -0.125) (* 0.0625 (+ i (* beta 2.0)))) i))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / 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 = ((beta * (-0.125d0)) + (0.0625d0 * (i + (beta * 2.0d0)))) / i
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(Float64(beta * -0.125) + Float64(0.0625 * Float64(i + Float64(beta * 2.0)))) / i) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = ((beta * -0.125) + (0.0625 * (i + (beta * 2.0)))) / i;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(N[(beta * -0.125), $MachinePrecision] + N[(0.0625 * N[(i + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\frac{\beta \cdot -0.125 + 0.0625 \cdot \left(i + \beta \cdot 2\right)}{i}
\end{array}
Initial program 14.3%
associate-/l/12.6%
associate-/l*16.3%
+-commutative16.3%
+-commutative16.3%
+-commutative16.3%
associate-+l+16.3%
+-commutative16.3%
associate-*l*16.2%
Simplified16.2%
Taylor expanded in i around inf 76.5%
Taylor expanded in i around 0 76.5%
cancel-sign-sub-inv76.5%
distribute-lft-in76.5%
distribute-lft-out76.5%
metadata-eval76.5%
Simplified76.5%
Taylor expanded in alpha around 0 74.2%
Final simplification74.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.2e+233) 0.0625 0.0))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.2e+233) {
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.2d+233) 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.2e+233) {
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.2e+233: 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.2e+233) 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.2e+233)
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.2e+233], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2 \cdot 10^{+233}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 3.20000000000000018e233Initial program 15.3%
associate-/l/13.5%
associate-/l*16.6%
+-commutative16.6%
+-commutative16.6%
+-commutative16.6%
associate-+l+16.6%
+-commutative16.6%
associate-*l*16.6%
Simplified16.6%
Taylor expanded in i around inf 74.6%
if 3.20000000000000018e233 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*11.1%
+-commutative11.1%
+-commutative11.1%
+-commutative11.1%
associate-+l+11.1%
+-commutative11.1%
associate-*l*11.1%
Simplified11.1%
Taylor expanded in i around inf 58.1%
Taylor expanded in i around 0 58.1%
cancel-sign-sub-inv58.1%
distribute-lft-in58.1%
distribute-lft-out58.1%
metadata-eval58.1%
Simplified58.1%
Taylor expanded in alpha around 0 58.1%
Taylor expanded in i around 0 47.3%
distribute-rgt-out47.3%
metadata-eval47.3%
*-rgt-identity47.3%
times-frac47.3%
metadata-eval47.3%
mul0-rgt47.3%
Simplified47.3%
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 14.3%
associate-/l/12.6%
associate-/l*16.3%
+-commutative16.3%
+-commutative16.3%
+-commutative16.3%
associate-+l+16.3%
+-commutative16.3%
associate-*l*16.2%
Simplified16.2%
Taylor expanded in i around inf 76.5%
Taylor expanded in i around 0 76.5%
cancel-sign-sub-inv76.5%
distribute-lft-in76.5%
distribute-lft-out76.5%
metadata-eval76.5%
Simplified76.5%
Taylor expanded in alpha around 0 74.2%
Taylor expanded in i around 0 9.7%
distribute-rgt-out9.7%
metadata-eval9.7%
*-rgt-identity9.7%
times-frac9.7%
metadata-eval9.7%
mul0-rgt9.7%
Simplified9.7%
herbie shell --seed 2024163
(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)))