
(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 and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ alpha (* i 2.0))))
(if (<= i 1.6e+143)
(/
(/
(* i (/ i (/ (+ beta (* i 2.0)) (+ i beta))))
(/ (fma i 2.0 (+ beta alpha)) (+ i (+ beta alpha))))
(+ (+ (* beta beta) (+ (pow t_0 2.0) (* 2.0 (* beta t_0)))) -1.0))
0.0625)))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = alpha + (i * 2.0);
double tmp;
if (i <= 1.6e+143) {
tmp = ((i * (i / ((beta + (i * 2.0)) / (i + beta)))) / (fma(i, 2.0, (beta + alpha)) / (i + (beta + alpha)))) / (((beta * beta) + (pow(t_0, 2.0) + (2.0 * (beta * t_0)))) + -1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(alpha + Float64(i * 2.0)) tmp = 0.0 if (i <= 1.6e+143) tmp = Float64(Float64(Float64(i * Float64(i / Float64(Float64(beta + Float64(i * 2.0)) / Float64(i + beta)))) / Float64(fma(i, 2.0, Float64(beta + alpha)) / Float64(i + Float64(beta + alpha)))) / Float64(Float64(Float64(beta * beta) + Float64((t_0 ^ 2.0) + Float64(2.0 * Float64(beta * t_0)))) + -1.0)); else tmp = 0.0625; end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 1.6e+143], N[(N[(N[(i * N[(i / N[(N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision] / N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta * beta), $MachinePrecision] + N[(N[Power[t$95$0, 2.0], $MachinePrecision] + N[(2.0 * N[(beta * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + i \cdot 2\\
\mathbf{if}\;i \leq 1.6 \cdot 10^{+143}:\\
\;\;\;\;\frac{\frac{i \cdot \frac{i}{\frac{\beta + i \cdot 2}{i + \beta}}}{\frac{\mathsf{fma}\left(i, 2, \beta + \alpha\right)}{i + \left(\beta + \alpha\right)}}}{\left(\beta \cdot \beta + \left({t_0}^{2} + 2 \cdot \left(\beta \cdot t_0\right)\right)\right) + -1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 1.60000000000000008e143Initial program 35.3%
times-frac76.4%
+-commutative76.4%
+-commutative76.4%
*-commutative76.4%
fma-def76.4%
+-commutative76.4%
+-commutative76.4%
*-commutative76.4%
fma-udef76.4%
+-commutative76.4%
*-commutative76.4%
fma-def76.4%
Applied egg-rr76.4%
associate-/l*76.5%
+-commutative76.5%
+-commutative76.5%
+-commutative76.5%
+-commutative76.5%
+-commutative76.5%
*-commutative76.5%
+-commutative76.5%
Simplified76.5%
Taylor expanded in beta around -inf 76.5%
unpow276.5%
*-commutative76.5%
*-commutative76.5%
Simplified76.5%
Taylor expanded in alpha around 0 76.9%
associate-*l/76.9%
associate-/l*79.8%
*-commutative79.8%
+-commutative79.8%
+-commutative79.8%
Applied egg-rr79.8%
if 1.60000000000000008e143 < i Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified2.4%
Taylor expanded in i around inf 82.0%
Final simplification80.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ alpha (* i 2.0)))
(t_1
(*
(/ i (/ (fma i 2.0 (+ beta alpha)) (+ i (+ beta alpha))))
(/ (* i (+ i beta)) (+ beta (* i 2.0)))))
(t_2 (+ (+ beta alpha) (* i 2.0)))
(t_3 (+ (* t_2 t_2) -1.0)))
(if (<= i 1.8e+62)
(/ t_1 t_3)
(if (<= i 1.08e+83)
(/ (* (* i i) 0.25) t_3)
(if (<= i 1.65e+143)
(/
t_1
(+ (+ (* beta beta) (+ (pow t_0 2.0) (* 2.0 (* beta t_0)))) -1.0))
0.0625)))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = alpha + (i * 2.0);
double t_1 = (i / (fma(i, 2.0, (beta + alpha)) / (i + (beta + alpha)))) * ((i * (i + beta)) / (beta + (i * 2.0)));
double t_2 = (beta + alpha) + (i * 2.0);
double t_3 = (t_2 * t_2) + -1.0;
double tmp;
if (i <= 1.8e+62) {
tmp = t_1 / t_3;
} else if (i <= 1.08e+83) {
tmp = ((i * i) * 0.25) / t_3;
} else if (i <= 1.65e+143) {
tmp = t_1 / (((beta * beta) + (pow(t_0, 2.0) + (2.0 * (beta * t_0)))) + -1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(alpha + Float64(i * 2.0)) t_1 = Float64(Float64(i / Float64(fma(i, 2.0, Float64(beta + alpha)) / Float64(i + Float64(beta + alpha)))) * Float64(Float64(i * Float64(i + beta)) / Float64(beta + Float64(i * 2.0)))) t_2 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_3 = Float64(Float64(t_2 * t_2) + -1.0) tmp = 0.0 if (i <= 1.8e+62) tmp = Float64(t_1 / t_3); elseif (i <= 1.08e+83) tmp = Float64(Float64(Float64(i * i) * 0.25) / t_3); elseif (i <= 1.65e+143) tmp = Float64(t_1 / Float64(Float64(Float64(beta * beta) + Float64((t_0 ^ 2.0) + Float64(2.0 * Float64(beta * t_0)))) + -1.0)); else tmp = 0.0625; end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(i / N[(N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(t$95$2 * t$95$2), $MachinePrecision] + -1.0), $MachinePrecision]}, If[LessEqual[i, 1.8e+62], N[(t$95$1 / t$95$3), $MachinePrecision], If[LessEqual[i, 1.08e+83], N[(N[(N[(i * i), $MachinePrecision] * 0.25), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[i, 1.65e+143], N[(t$95$1 / N[(N[(N[(beta * beta), $MachinePrecision] + N[(N[Power[t$95$0, 2.0], $MachinePrecision] + N[(2.0 * N[(beta * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + i \cdot 2\\
t_1 := \frac{i}{\frac{\mathsf{fma}\left(i, 2, \beta + \alpha\right)}{i + \left(\beta + \alpha\right)}} \cdot \frac{i \cdot \left(i + \beta\right)}{\beta + i \cdot 2}\\
t_2 := \left(\beta + \alpha\right) + i \cdot 2\\
t_3 := t_2 \cdot t_2 + -1\\
\mathbf{if}\;i \leq 1.8 \cdot 10^{+62}:\\
\;\;\;\;\frac{t_1}{t_3}\\
\mathbf{elif}\;i \leq 1.08 \cdot 10^{+83}:\\
\;\;\;\;\frac{\left(i \cdot i\right) \cdot 0.25}{t_3}\\
\mathbf{elif}\;i \leq 1.65 \cdot 10^{+143}:\\
\;\;\;\;\frac{t_1}{\left(\beta \cdot \beta + \left({t_0}^{2} + 2 \cdot \left(\beta \cdot t_0\right)\right)\right) + -1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 1.8e62Initial program 70.7%
times-frac87.7%
+-commutative87.7%
+-commutative87.7%
*-commutative87.7%
fma-def87.7%
+-commutative87.7%
+-commutative87.7%
*-commutative87.7%
fma-udef87.7%
+-commutative87.7%
*-commutative87.7%
fma-def87.7%
Applied egg-rr87.7%
associate-/l*87.7%
+-commutative87.7%
+-commutative87.7%
+-commutative87.7%
+-commutative87.7%
+-commutative87.7%
*-commutative87.7%
+-commutative87.7%
Simplified87.7%
Taylor expanded in alpha around 0 85.3%
if 1.8e62 < i < 1.08e83Initial program 32.5%
Taylor expanded in i around inf 79.2%
*-commutative79.2%
unpow279.2%
Simplified79.2%
if 1.08e83 < i < 1.65e143Initial program 2.3%
times-frac73.7%
+-commutative73.7%
+-commutative73.7%
*-commutative73.7%
fma-def73.7%
+-commutative73.7%
+-commutative73.7%
*-commutative73.7%
fma-udef73.7%
+-commutative73.7%
*-commutative73.7%
fma-def73.7%
Applied egg-rr73.7%
associate-/l*73.8%
+-commutative73.8%
+-commutative73.8%
+-commutative73.8%
+-commutative73.8%
+-commutative73.8%
*-commutative73.8%
+-commutative73.8%
Simplified73.8%
Taylor expanded in beta around -inf 73.8%
unpow273.8%
*-commutative73.8%
*-commutative73.8%
Simplified73.8%
Taylor expanded in alpha around 0 69.8%
if 1.65e143 < i Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified2.4%
Taylor expanded in i around inf 82.0%
Final simplification79.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) (* i 2.0)))
(t_1 (+ (* t_0 t_0) -1.0))
(t_2
(/
(*
(/ i (/ (fma i 2.0 (+ beta alpha)) (+ i (+ beta alpha))))
(/ (* i (+ i beta)) (+ beta (* i 2.0))))
t_1)))
(if (<= i 6.2e+62)
t_2
(if (<= i 3.05e+83)
(/ (* (* i i) 0.25) t_1)
(if (<= i 1.65e+143) t_2 0.0625)))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = (t_0 * t_0) + -1.0;
double t_2 = ((i / (fma(i, 2.0, (beta + alpha)) / (i + (beta + alpha)))) * ((i * (i + beta)) / (beta + (i * 2.0)))) / t_1;
double tmp;
if (i <= 6.2e+62) {
tmp = t_2;
} else if (i <= 3.05e+83) {
tmp = ((i * i) * 0.25) / t_1;
} else if (i <= 1.65e+143) {
tmp = t_2;
} else {
tmp = 0.0625;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_1 = Float64(Float64(t_0 * t_0) + -1.0) t_2 = Float64(Float64(Float64(i / Float64(fma(i, 2.0, Float64(beta + alpha)) / Float64(i + Float64(beta + alpha)))) * Float64(Float64(i * Float64(i + beta)) / Float64(beta + Float64(i * 2.0)))) / t_1) tmp = 0.0 if (i <= 6.2e+62) tmp = t_2; elseif (i <= 3.05e+83) tmp = Float64(Float64(Float64(i * i) * 0.25) / t_1); elseif (i <= 1.65e+143) tmp = t_2; else tmp = 0.0625; end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(i / N[(N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[i, 6.2e+62], t$95$2, If[LessEqual[i, 3.05e+83], N[(N[(N[(i * i), $MachinePrecision] * 0.25), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[i, 1.65e+143], t$95$2, 0.0625]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0 + -1\\
t_2 := \frac{\frac{i}{\frac{\mathsf{fma}\left(i, 2, \beta + \alpha\right)}{i + \left(\beta + \alpha\right)}} \cdot \frac{i \cdot \left(i + \beta\right)}{\beta + i \cdot 2}}{t_1}\\
\mathbf{if}\;i \leq 6.2 \cdot 10^{+62}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;i \leq 3.05 \cdot 10^{+83}:\\
\;\;\;\;\frac{\left(i \cdot i\right) \cdot 0.25}{t_1}\\
\mathbf{elif}\;i \leq 1.65 \cdot 10^{+143}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 6.20000000000000029e62 or 3.0500000000000002e83 < i < 1.65e143Initial program 35.9%
times-frac80.6%
+-commutative80.6%
+-commutative80.6%
*-commutative80.6%
fma-def80.6%
+-commutative80.6%
+-commutative80.6%
*-commutative80.6%
fma-udef80.6%
+-commutative80.6%
*-commutative80.6%
fma-def80.6%
Applied egg-rr80.6%
associate-/l*80.6%
+-commutative80.6%
+-commutative80.6%
+-commutative80.6%
+-commutative80.6%
+-commutative80.6%
*-commutative80.6%
+-commutative80.6%
Simplified80.6%
Taylor expanded in alpha around 0 77.4%
if 6.20000000000000029e62 < i < 3.0500000000000002e83Initial program 32.5%
Taylor expanded in i around inf 79.2%
*-commutative79.2%
unpow279.2%
Simplified79.2%
if 1.65e143 < i Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified2.4%
Taylor expanded in i around inf 82.0%
Final simplification79.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (/ (* (* i i) 0.25) (+ (* 4.0 (+ (* i i) (* i beta))) -1.0)))
(t_1 (+ (+ beta alpha) (* i 2.0)))
(t_2 (/ (* i (+ i alpha)) (+ (* t_1 t_1) -1.0))))
(if (<= i 58000000000000.0)
t_0
(if (<= i 2.3e+23)
t_2
(if (<= i 7.1e+37)
t_0
(if (<= i 2.3e+47) t_2 (if (<= i 1.7e+143) t_0 0.0625)))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = ((i * i) * 0.25) / ((4.0 * ((i * i) + (i * beta))) + -1.0);
double t_1 = (beta + alpha) + (i * 2.0);
double t_2 = (i * (i + alpha)) / ((t_1 * t_1) + -1.0);
double tmp;
if (i <= 58000000000000.0) {
tmp = t_0;
} else if (i <= 2.3e+23) {
tmp = t_2;
} else if (i <= 7.1e+37) {
tmp = t_0;
} else if (i <= 2.3e+47) {
tmp = t_2;
} else if (i <= 1.7e+143) {
tmp = t_0;
} else {
tmp = 0.0625;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = ((i * i) * 0.25d0) / ((4.0d0 * ((i * i) + (i * beta))) + (-1.0d0))
t_1 = (beta + alpha) + (i * 2.0d0)
t_2 = (i * (i + alpha)) / ((t_1 * t_1) + (-1.0d0))
if (i <= 58000000000000.0d0) then
tmp = t_0
else if (i <= 2.3d+23) then
tmp = t_2
else if (i <= 7.1d+37) then
tmp = t_0
else if (i <= 2.3d+47) then
tmp = t_2
else if (i <= 1.7d+143) then
tmp = t_0
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = ((i * i) * 0.25) / ((4.0 * ((i * i) + (i * beta))) + -1.0);
double t_1 = (beta + alpha) + (i * 2.0);
double t_2 = (i * (i + alpha)) / ((t_1 * t_1) + -1.0);
double tmp;
if (i <= 58000000000000.0) {
tmp = t_0;
} else if (i <= 2.3e+23) {
tmp = t_2;
} else if (i <= 7.1e+37) {
tmp = t_0;
} else if (i <= 2.3e+47) {
tmp = t_2;
} else if (i <= 1.7e+143) {
tmp = t_0;
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = ((i * i) * 0.25) / ((4.0 * ((i * i) + (i * beta))) + -1.0) t_1 = (beta + alpha) + (i * 2.0) t_2 = (i * (i + alpha)) / ((t_1 * t_1) + -1.0) tmp = 0 if i <= 58000000000000.0: tmp = t_0 elif i <= 2.3e+23: tmp = t_2 elif i <= 7.1e+37: tmp = t_0 elif i <= 2.3e+47: tmp = t_2 elif i <= 1.7e+143: tmp = t_0 else: tmp = 0.0625 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(Float64(i * i) * 0.25) / Float64(Float64(4.0 * Float64(Float64(i * i) + Float64(i * beta))) + -1.0)) t_1 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_2 = Float64(Float64(i * Float64(i + alpha)) / Float64(Float64(t_1 * t_1) + -1.0)) tmp = 0.0 if (i <= 58000000000000.0) tmp = t_0; elseif (i <= 2.3e+23) tmp = t_2; elseif (i <= 7.1e+37) tmp = t_0; elseif (i <= 2.3e+47) tmp = t_2; elseif (i <= 1.7e+143) tmp = t_0; else tmp = 0.0625; end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = ((i * i) * 0.25) / ((4.0 * ((i * i) + (i * beta))) + -1.0);
t_1 = (beta + alpha) + (i * 2.0);
t_2 = (i * (i + alpha)) / ((t_1 * t_1) + -1.0);
tmp = 0.0;
if (i <= 58000000000000.0)
tmp = t_0;
elseif (i <= 2.3e+23)
tmp = t_2;
elseif (i <= 7.1e+37)
tmp = t_0;
elseif (i <= 2.3e+47)
tmp = t_2;
elseif (i <= 1.7e+143)
tmp = t_0;
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(N[(i * i), $MachinePrecision] * 0.25), $MachinePrecision] / N[(N[(4.0 * N[(N[(i * i), $MachinePrecision] + N[(i * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(i * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$1 * t$95$1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 58000000000000.0], t$95$0, If[LessEqual[i, 2.3e+23], t$95$2, If[LessEqual[i, 7.1e+37], t$95$0, If[LessEqual[i, 2.3e+47], t$95$2, If[LessEqual[i, 1.7e+143], t$95$0, 0.0625]]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{\left(i \cdot i\right) \cdot 0.25}{4 \cdot \left(i \cdot i + i \cdot \beta\right) + -1}\\
t_1 := \left(\beta + \alpha\right) + i \cdot 2\\
t_2 := \frac{i \cdot \left(i + \alpha\right)}{t_1 \cdot t_1 + -1}\\
\mathbf{if}\;i \leq 58000000000000:\\
\;\;\;\;t_0\\
\mathbf{elif}\;i \leq 2.3 \cdot 10^{+23}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;i \leq 7.1 \cdot 10^{+37}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;i \leq 2.3 \cdot 10^{+47}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;i \leq 1.7 \cdot 10^{+143}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 5.8e13 or 2.3e23 < i < 7.1000000000000005e37 or 2.2999999999999999e47 < i < 1.69999999999999991e143Initial program 34.8%
Taylor expanded in i around inf 74.0%
*-commutative74.0%
unpow274.1%
Simplified74.1%
Taylor expanded in i around inf 73.4%
distribute-lft-out73.4%
*-commutative73.4%
unpow273.4%
Simplified73.4%
Taylor expanded in beta around inf 68.4%
if 5.8e13 < i < 2.3e23 or 7.1000000000000005e37 < i < 2.2999999999999999e47Initial program 38.2%
Taylor expanded in beta around inf 65.2%
if 1.69999999999999991e143 < i Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified2.4%
Taylor expanded in i around inf 82.0%
Final simplification74.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (/ (* (* i i) 0.25) (+ (* 4.0 (+ (* i i) (* i beta))) -1.0))))
(if (<= i 60000000000000.0)
t_0
(if (<= i 4e+22)
(/ (* i i) (* beta beta))
(if (<= i 4.5e+35)
t_0
(if (<= i 2.4e+47)
(/ (+ i alpha) (/ (* beta beta) i))
(if (<= i 1.55e+143) t_0 0.0625)))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = ((i * i) * 0.25) / ((4.0 * ((i * i) + (i * beta))) + -1.0);
double tmp;
if (i <= 60000000000000.0) {
tmp = t_0;
} else if (i <= 4e+22) {
tmp = (i * i) / (beta * beta);
} else if (i <= 4.5e+35) {
tmp = t_0;
} else if (i <= 2.4e+47) {
tmp = (i + alpha) / ((beta * beta) / i);
} else if (i <= 1.55e+143) {
tmp = t_0;
} else {
tmp = 0.0625;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: tmp
t_0 = ((i * i) * 0.25d0) / ((4.0d0 * ((i * i) + (i * beta))) + (-1.0d0))
if (i <= 60000000000000.0d0) then
tmp = t_0
else if (i <= 4d+22) then
tmp = (i * i) / (beta * beta)
else if (i <= 4.5d+35) then
tmp = t_0
else if (i <= 2.4d+47) then
tmp = (i + alpha) / ((beta * beta) / i)
else if (i <= 1.55d+143) then
tmp = t_0
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = ((i * i) * 0.25) / ((4.0 * ((i * i) + (i * beta))) + -1.0);
double tmp;
if (i <= 60000000000000.0) {
tmp = t_0;
} else if (i <= 4e+22) {
tmp = (i * i) / (beta * beta);
} else if (i <= 4.5e+35) {
tmp = t_0;
} else if (i <= 2.4e+47) {
tmp = (i + alpha) / ((beta * beta) / i);
} else if (i <= 1.55e+143) {
tmp = t_0;
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = ((i * i) * 0.25) / ((4.0 * ((i * i) + (i * beta))) + -1.0) tmp = 0 if i <= 60000000000000.0: tmp = t_0 elif i <= 4e+22: tmp = (i * i) / (beta * beta) elif i <= 4.5e+35: tmp = t_0 elif i <= 2.4e+47: tmp = (i + alpha) / ((beta * beta) / i) elif i <= 1.55e+143: tmp = t_0 else: tmp = 0.0625 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(Float64(i * i) * 0.25) / Float64(Float64(4.0 * Float64(Float64(i * i) + Float64(i * beta))) + -1.0)) tmp = 0.0 if (i <= 60000000000000.0) tmp = t_0; elseif (i <= 4e+22) tmp = Float64(Float64(i * i) / Float64(beta * beta)); elseif (i <= 4.5e+35) tmp = t_0; elseif (i <= 2.4e+47) tmp = Float64(Float64(i + alpha) / Float64(Float64(beta * beta) / i)); elseif (i <= 1.55e+143) tmp = t_0; else tmp = 0.0625; end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = ((i * i) * 0.25) / ((4.0 * ((i * i) + (i * beta))) + -1.0);
tmp = 0.0;
if (i <= 60000000000000.0)
tmp = t_0;
elseif (i <= 4e+22)
tmp = (i * i) / (beta * beta);
elseif (i <= 4.5e+35)
tmp = t_0;
elseif (i <= 2.4e+47)
tmp = (i + alpha) / ((beta * beta) / i);
elseif (i <= 1.55e+143)
tmp = t_0;
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(N[(i * i), $MachinePrecision] * 0.25), $MachinePrecision] / N[(N[(4.0 * N[(N[(i * i), $MachinePrecision] + N[(i * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 60000000000000.0], t$95$0, If[LessEqual[i, 4e+22], N[(N[(i * i), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], If[LessEqual[i, 4.5e+35], t$95$0, If[LessEqual[i, 2.4e+47], N[(N[(i + alpha), $MachinePrecision] / N[(N[(beta * beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[i, 1.55e+143], t$95$0, 0.0625]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{\left(i \cdot i\right) \cdot 0.25}{4 \cdot \left(i \cdot i + i \cdot \beta\right) + -1}\\
\mathbf{if}\;i \leq 60000000000000:\\
\;\;\;\;t_0\\
\mathbf{elif}\;i \leq 4 \cdot 10^{+22}:\\
\;\;\;\;\frac{i \cdot i}{\beta \cdot \beta}\\
\mathbf{elif}\;i \leq 4.5 \cdot 10^{+35}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;i \leq 2.4 \cdot 10^{+47}:\\
\;\;\;\;\frac{i + \alpha}{\frac{\beta \cdot \beta}{i}}\\
\mathbf{elif}\;i \leq 1.55 \cdot 10^{+143}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 6e13 or 4e22 < i < 4.4999999999999997e35 or 2.40000000000000019e47 < i < 1.54999999999999995e143Initial program 34.8%
Taylor expanded in i around inf 74.0%
*-commutative74.0%
unpow274.1%
Simplified74.1%
Taylor expanded in i around inf 73.4%
distribute-lft-out73.4%
*-commutative73.4%
unpow273.4%
Simplified73.4%
Taylor expanded in beta around inf 68.4%
if 6e13 < i < 4e22Initial program 37.3%
Taylor expanded in alpha around 0 63.1%
unpow263.1%
Simplified63.1%
Taylor expanded in beta around inf 39.1%
unpow239.1%
unpow239.1%
Simplified39.1%
if 4.4999999999999997e35 < i < 2.40000000000000019e47Initial program 38.7%
associate-/l/38.3%
associate-*l*38.1%
times-frac45.6%
Simplified71.7%
Taylor expanded in beta around inf 31.7%
*-commutative31.7%
associate-/l*31.8%
+-commutative31.8%
unpow231.8%
Simplified31.8%
if 1.54999999999999995e143 < i Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified2.4%
Taylor expanded in i around inf 82.0%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (let* ((t_0 (+ (+ beta alpha) (* i 2.0)))) (if (<= i 1.35e+143) (/ (* (* i i) 0.25) (+ (* t_0 t_0) -1.0)) 0.0625)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double tmp;
if (i <= 1.35e+143) {
tmp = ((i * i) * 0.25) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + alpha) + (i * 2.0d0)
if (i <= 1.35d+143) then
tmp = ((i * i) * 0.25d0) / ((t_0 * t_0) + (-1.0d0))
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double tmp;
if (i <= 1.35e+143) {
tmp = ((i * i) * 0.25) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = (beta + alpha) + (i * 2.0) tmp = 0 if i <= 1.35e+143: tmp = ((i * i) * 0.25) / ((t_0 * t_0) + -1.0) else: tmp = 0.0625 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) tmp = 0.0 if (i <= 1.35e+143) tmp = Float64(Float64(Float64(i * i) * 0.25) / Float64(Float64(t_0 * t_0) + -1.0)); else tmp = 0.0625; end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (i * 2.0);
tmp = 0.0;
if (i <= 1.35e+143)
tmp = ((i * i) * 0.25) / ((t_0 * t_0) + -1.0);
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 1.35e+143], N[(N[(N[(i * i), $MachinePrecision] * 0.25), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
\mathbf{if}\;i \leq 1.35 \cdot 10^{+143}:\\
\;\;\;\;\frac{\left(i \cdot i\right) \cdot 0.25}{t_0 \cdot t_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 1.3500000000000001e143Initial program 35.3%
Taylor expanded in i around inf 72.5%
*-commutative72.5%
unpow272.5%
Simplified72.5%
if 1.3500000000000001e143 < i Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified2.4%
Taylor expanded in i around inf 82.0%
Final simplification77.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 5.2e+220) 0.0625 (/ (+ i alpha) (/ (* beta beta) i))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.2e+220) {
tmp = 0.0625;
} else {
tmp = (i + alpha) / ((beta * beta) / i);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 5.2d+220) then
tmp = 0.0625d0
else
tmp = (i + alpha) / ((beta * beta) / i)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.2e+220) {
tmp = 0.0625;
} else {
tmp = (i + alpha) / ((beta * beta) / i);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 5.2e+220: tmp = 0.0625 else: tmp = (i + alpha) / ((beta * beta) / i) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 5.2e+220) tmp = 0.0625; else tmp = Float64(Float64(i + alpha) / Float64(Float64(beta * beta) / i)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 5.2e+220)
tmp = 0.0625;
else
tmp = (i + alpha) / ((beta * beta) / i);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 5.2e+220], 0.0625, N[(N[(i + alpha), $MachinePrecision] / N[(N[(beta * beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2 \cdot 10^{+220}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\frac{\beta \cdot \beta}{i}}\\
\end{array}
\end{array}
if beta < 5.19999999999999988e220Initial program 20.6%
associate-/l/19.1%
associate-*l*19.0%
times-frac26.8%
Simplified44.8%
Taylor expanded in i around inf 74.3%
if 5.19999999999999988e220 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified7.7%
Taylor expanded in beta around inf 26.4%
*-commutative26.4%
associate-/l*28.6%
+-commutative28.6%
unpow228.6%
Simplified28.6%
Final simplification69.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4e+260) 0.0625 (/ (* i i) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4e+260) {
tmp = 0.0625;
} else {
tmp = (i * i) / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 4d+260) then
tmp = 0.0625d0
else
tmp = (i * i) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4e+260) {
tmp = 0.0625;
} else {
tmp = (i * i) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 4e+260: tmp = 0.0625 else: tmp = (i * i) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4e+260) tmp = 0.0625; else tmp = Float64(Float64(i * i) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4e+260)
tmp = 0.0625;
else
tmp = (i * i) / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 4e+260], 0.0625, N[(N[(i * i), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4 \cdot 10^{+260}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot i}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 4.00000000000000026e260Initial program 19.3%
associate-/l/17.9%
associate-*l*17.8%
times-frac25.1%
Simplified42.9%
Taylor expanded in i around inf 71.6%
if 4.00000000000000026e260 < beta Initial program 0.0%
Taylor expanded in alpha around 0 0.0%
unpow20.0%
Simplified0.0%
Taylor expanded in beta around inf 33.1%
unpow233.1%
unpow233.1%
Simplified33.1%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return 0.0625
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return 0.0625 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.0625
\end{array}
Initial program 18.5%
associate-/l/17.1%
associate-*l*17.1%
times-frac24.1%
Simplified41.1%
Taylor expanded in i around inf 68.7%
Final simplification68.7%
herbie shell --seed 2023178
(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)))