
(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 7 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)))
(t_1 (sqrt (* (/ i beta) (/ (+ i alpha) beta))))
(t_2 (+ i (+ beta alpha))))
(if (<= beta 5.7e+88)
0.0625
(if (<= beta 5.8e+153)
(/
(*
i
(/
t_2
(/
(+ (* beta beta) (+ (pow t_0 2.0) (* 2.0 (* beta t_0))))
(fma i t_2 (* beta alpha)))))
(+
(+
(fma 4.0 (* i (+ beta alpha)) (pow (+ beta alpha) 2.0))
(* 4.0 (* i i)))
-1.0))
(if (<= beta 6.4e+154) 0.0625 (* t_1 t_1))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = alpha + (i * 2.0);
double t_1 = sqrt(((i / beta) * ((i + alpha) / beta)));
double t_2 = i + (beta + alpha);
double tmp;
if (beta <= 5.7e+88) {
tmp = 0.0625;
} else if (beta <= 5.8e+153) {
tmp = (i * (t_2 / (((beta * beta) + (pow(t_0, 2.0) + (2.0 * (beta * t_0)))) / fma(i, t_2, (beta * alpha))))) / ((fma(4.0, (i * (beta + alpha)), pow((beta + alpha), 2.0)) + (4.0 * (i * i))) + -1.0);
} else if (beta <= 6.4e+154) {
tmp = 0.0625;
} else {
tmp = t_1 * t_1;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(alpha + Float64(i * 2.0)) t_1 = sqrt(Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta))) t_2 = Float64(i + Float64(beta + alpha)) tmp = 0.0 if (beta <= 5.7e+88) tmp = 0.0625; elseif (beta <= 5.8e+153) tmp = Float64(Float64(i * Float64(t_2 / Float64(Float64(Float64(beta * beta) + Float64((t_0 ^ 2.0) + Float64(2.0 * Float64(beta * t_0)))) / fma(i, t_2, Float64(beta * alpha))))) / Float64(Float64(fma(4.0, Float64(i * Float64(beta + alpha)), (Float64(beta + alpha) ^ 2.0)) + Float64(4.0 * Float64(i * i))) + -1.0)); elseif (beta <= 6.4e+154) tmp = 0.0625; else tmp = Float64(t_1 * t_1); 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[Sqrt[N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.7e+88], 0.0625, If[LessEqual[beta, 5.8e+153], N[(N[(i * N[(t$95$2 / 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] / N[(i * t$95$2 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(4.0 * N[(i * N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 6.4e+154], 0.0625, N[(t$95$1 * t$95$1), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + i \cdot 2\\
t_1 := \sqrt{\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}}\\
t_2 := i + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 5.7 \cdot 10^{+88}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 5.8 \cdot 10^{+153}:\\
\;\;\;\;\frac{i \cdot \frac{t_2}{\frac{\beta \cdot \beta + \left({t_0}^{2} + 2 \cdot \left(\beta \cdot t_0\right)\right)}{\mathsf{fma}\left(i, t_2, \beta \cdot \alpha\right)}}}{\left(\mathsf{fma}\left(4, i \cdot \left(\beta + \alpha\right), {\left(\beta + \alpha\right)}^{2}\right) + 4 \cdot \left(i \cdot i\right)\right) + -1}\\
\mathbf{elif}\;\beta \leq 6.4 \cdot 10^{+154}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;t_1 \cdot t_1\\
\end{array}
\end{array}
if beta < 5.70000000000000021e88 or 5.80000000000000004e153 < beta < 6.4e154Initial program 20.4%
associate-/l/17.8%
associate-*l*17.7%
times-frac25.6%
Simplified39.6%
Taylor expanded in i around inf 85.4%
if 5.70000000000000021e88 < beta < 5.80000000000000004e153Initial program 19.8%
expm1-log1p-u19.0%
expm1-udef19.0%
Applied egg-rr52.4%
expm1-def52.4%
expm1-log1p56.8%
associate-*r/57.0%
+-commutative57.0%
+-commutative57.0%
+-commutative57.0%
+-commutative57.0%
+-commutative57.0%
*-commutative57.0%
Simplified57.0%
Taylor expanded in beta around -inf 57.0%
unpow257.0%
Simplified57.0%
Taylor expanded in i around 0 57.2%
associate-+r+57.2%
fma-def57.2%
unpow257.2%
Simplified57.2%
if 6.4e154 < beta Initial program 0.0%
expm1-log1p-u0.0%
expm1-udef0.0%
Applied egg-rr8.8%
expm1-def8.8%
expm1-log1p8.8%
associate-*r/8.8%
+-commutative8.8%
+-commutative8.8%
+-commutative8.8%
+-commutative8.8%
+-commutative8.8%
*-commutative8.8%
Simplified8.8%
Taylor expanded in beta around inf 14.8%
unpow214.8%
Simplified14.8%
add-sqr-sqrt14.8%
times-frac14.8%
times-frac69.9%
Applied egg-rr69.9%
Final simplification79.9%
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 (sqrt (* (/ i beta) (/ (+ i alpha) beta))))
(t_2 (+ alpha (* i 2.0)))
(t_3 (+ i (+ beta alpha))))
(if (<= beta 5.7e+88)
0.0625
(if (<= beta 7e+152)
(/
(*
i
(/
t_3
(/
(+ (* beta beta) (+ (pow t_2 2.0) (* 2.0 (* beta t_2))))
(fma i t_3 (* beta alpha)))))
(+ (* t_0 t_0) -1.0))
(if (<= beta 6.4e+154) 0.0625 (* t_1 t_1))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = sqrt(((i / beta) * ((i + alpha) / beta)));
double t_2 = alpha + (i * 2.0);
double t_3 = i + (beta + alpha);
double tmp;
if (beta <= 5.7e+88) {
tmp = 0.0625;
} else if (beta <= 7e+152) {
tmp = (i * (t_3 / (((beta * beta) + (pow(t_2, 2.0) + (2.0 * (beta * t_2)))) / fma(i, t_3, (beta * alpha))))) / ((t_0 * t_0) + -1.0);
} else if (beta <= 6.4e+154) {
tmp = 0.0625;
} else {
tmp = t_1 * t_1;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_1 = sqrt(Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta))) t_2 = Float64(alpha + Float64(i * 2.0)) t_3 = Float64(i + Float64(beta + alpha)) tmp = 0.0 if (beta <= 5.7e+88) tmp = 0.0625; elseif (beta <= 7e+152) tmp = Float64(Float64(i * Float64(t_3 / Float64(Float64(Float64(beta * beta) + Float64((t_2 ^ 2.0) + Float64(2.0 * Float64(beta * t_2)))) / fma(i, t_3, Float64(beta * alpha))))) / Float64(Float64(t_0 * t_0) + -1.0)); elseif (beta <= 6.4e+154) tmp = 0.0625; else tmp = Float64(t_1 * t_1); 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[Sqrt[N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.7e+88], 0.0625, If[LessEqual[beta, 7e+152], N[(N[(i * N[(t$95$3 / N[(N[(N[(beta * beta), $MachinePrecision] + N[(N[Power[t$95$2, 2.0], $MachinePrecision] + N[(2.0 * N[(beta * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * t$95$3 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 6.4e+154], 0.0625, N[(t$95$1 * t$95$1), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
t_1 := \sqrt{\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}}\\
t_2 := \alpha + i \cdot 2\\
t_3 := i + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 5.7 \cdot 10^{+88}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 7 \cdot 10^{+152}:\\
\;\;\;\;\frac{i \cdot \frac{t_3}{\frac{\beta \cdot \beta + \left({t_2}^{2} + 2 \cdot \left(\beta \cdot t_2\right)\right)}{\mathsf{fma}\left(i, t_3, \beta \cdot \alpha\right)}}}{t_0 \cdot t_0 + -1}\\
\mathbf{elif}\;\beta \leq 6.4 \cdot 10^{+154}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;t_1 \cdot t_1\\
\end{array}
\end{array}
if beta < 5.70000000000000021e88 or 6.99999999999999963e152 < beta < 6.4e154Initial program 20.4%
associate-/l/17.8%
associate-*l*17.7%
times-frac25.6%
Simplified39.6%
Taylor expanded in i around inf 85.4%
if 5.70000000000000021e88 < beta < 6.99999999999999963e152Initial program 19.8%
expm1-log1p-u19.0%
expm1-udef19.0%
Applied egg-rr52.4%
expm1-def52.4%
expm1-log1p56.8%
associate-*r/57.0%
+-commutative57.0%
+-commutative57.0%
+-commutative57.0%
+-commutative57.0%
+-commutative57.0%
*-commutative57.0%
Simplified57.0%
Taylor expanded in beta around -inf 57.0%
unpow257.0%
Simplified57.0%
if 6.4e154 < beta Initial program 0.0%
expm1-log1p-u0.0%
expm1-udef0.0%
Applied egg-rr8.8%
expm1-def8.8%
expm1-log1p8.8%
associate-*r/8.8%
+-commutative8.8%
+-commutative8.8%
+-commutative8.8%
+-commutative8.8%
+-commutative8.8%
*-commutative8.8%
Simplified8.8%
Taylor expanded in beta around inf 14.8%
unpow214.8%
Simplified14.8%
add-sqr-sqrt14.8%
times-frac14.8%
times-frac69.9%
Applied egg-rr69.9%
Final simplification79.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (sqrt (* (/ i beta) (/ (+ i alpha) beta))))
(t_1 (+ (+ beta alpha) (* i 2.0))))
(if (<= beta 4e+88)
0.0625
(if (<= beta 1.45e+110)
(/
(*
i
(/
(+ i (+ beta alpha))
(/
(fma 4.0 (* beta i) (+ (* beta beta) (* 4.0 (* i i))))
(* i (+ beta i)))))
(+ (* t_1 t_1) -1.0))
(if (<= beta 2.9e+121) 0.0625 (* t_0 t_0))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = sqrt(((i / beta) * ((i + alpha) / beta)));
double t_1 = (beta + alpha) + (i * 2.0);
double tmp;
if (beta <= 4e+88) {
tmp = 0.0625;
} else if (beta <= 1.45e+110) {
tmp = (i * ((i + (beta + alpha)) / (fma(4.0, (beta * i), ((beta * beta) + (4.0 * (i * i)))) / (i * (beta + i))))) / ((t_1 * t_1) + -1.0);
} else if (beta <= 2.9e+121) {
tmp = 0.0625;
} else {
tmp = t_0 * t_0;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = sqrt(Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta))) t_1 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) tmp = 0.0 if (beta <= 4e+88) tmp = 0.0625; elseif (beta <= 1.45e+110) tmp = Float64(Float64(i * Float64(Float64(i + Float64(beta + alpha)) / Float64(fma(4.0, Float64(beta * i), Float64(Float64(beta * beta) + Float64(4.0 * Float64(i * i)))) / Float64(i * Float64(beta + i))))) / Float64(Float64(t_1 * t_1) + -1.0)); elseif (beta <= 2.9e+121) tmp = 0.0625; else tmp = Float64(t_0 * t_0); 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[Sqrt[N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+88], 0.0625, If[LessEqual[beta, 1.45e+110], N[(N[(i * N[(N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(4.0 * N[(beta * i), $MachinePrecision] + N[(N[(beta * beta), $MachinePrecision] + N[(4.0 * N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$1 * t$95$1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2.9e+121], 0.0625, N[(t$95$0 * t$95$0), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}}\\
t_1 := \left(\beta + \alpha\right) + i \cdot 2\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+88}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.45 \cdot 10^{+110}:\\
\;\;\;\;\frac{i \cdot \frac{i + \left(\beta + \alpha\right)}{\frac{\mathsf{fma}\left(4, \beta \cdot i, \beta \cdot \beta + 4 \cdot \left(i \cdot i\right)\right)}{i \cdot \left(\beta + i\right)}}}{t_1 \cdot t_1 + -1}\\
\mathbf{elif}\;\beta \leq 2.9 \cdot 10^{+121}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot t_0\\
\end{array}
\end{array}
if beta < 3.99999999999999984e88 or 1.45e110 < beta < 2.8999999999999999e121Initial program 20.3%
associate-/l/17.7%
associate-*l*17.6%
times-frac25.5%
Simplified39.4%
Taylor expanded in i around inf 85.5%
if 3.99999999999999984e88 < beta < 1.45e110Initial program 40.6%
expm1-log1p-u39.2%
expm1-udef39.2%
Applied egg-rr75.8%
expm1-def75.8%
expm1-log1p80.2%
associate-*r/80.5%
+-commutative80.5%
+-commutative80.5%
+-commutative80.5%
+-commutative80.5%
+-commutative80.5%
*-commutative80.5%
Simplified80.5%
Taylor expanded in beta around -inf 80.5%
unpow280.5%
Simplified80.5%
Taylor expanded in alpha around 0 80.5%
fma-def80.5%
unpow280.5%
unpow280.5%
Simplified80.5%
if 2.8999999999999999e121 < beta Initial program 3.1%
expm1-log1p-u3.0%
expm1-udef3.0%
Applied egg-rr17.3%
expm1-def17.3%
expm1-log1p18.3%
associate-*r/18.4%
+-commutative18.4%
+-commutative18.4%
+-commutative18.4%
+-commutative18.4%
+-commutative18.4%
*-commutative18.4%
Simplified18.4%
Taylor expanded in beta around inf 20.8%
unpow220.8%
Simplified20.8%
add-sqr-sqrt20.8%
times-frac20.8%
times-frac64.1%
Applied egg-rr64.1%
Final simplification79.6%
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 (<= beta 6e+88)
0.0625
(if (<= beta 3.5e+110)
(/
(*
i
(/
(+ i (+ beta alpha))
(/
(fma 4.0 (* beta i) (+ (* beta beta) (* 4.0 (* i i))))
(* i (+ beta i)))))
(+ (* t_0 t_0) -1.0))
(if (<= beta 2.9e+121) 0.0625 (* (/ i beta) (/ (+ i alpha) beta)))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double tmp;
if (beta <= 6e+88) {
tmp = 0.0625;
} else if (beta <= 3.5e+110) {
tmp = (i * ((i + (beta + alpha)) / (fma(4.0, (beta * i), ((beta * beta) + (4.0 * (i * i)))) / (i * (beta + i))))) / ((t_0 * t_0) + -1.0);
} else if (beta <= 2.9e+121) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
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 (beta <= 6e+88) tmp = 0.0625; elseif (beta <= 3.5e+110) tmp = Float64(Float64(i * Float64(Float64(i + Float64(beta + alpha)) / Float64(fma(4.0, Float64(beta * i), Float64(Float64(beta * beta) + Float64(4.0 * Float64(i * i)))) / Float64(i * Float64(beta + i))))) / Float64(Float64(t_0 * t_0) + -1.0)); elseif (beta <= 2.9e+121) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta)); 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]}, If[LessEqual[beta, 6e+88], 0.0625, If[LessEqual[beta, 3.5e+110], N[(N[(i * N[(N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(4.0 * N[(beta * i), $MachinePrecision] + N[(N[(beta * beta), $MachinePrecision] + N[(4.0 * N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2.9e+121], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
\mathbf{if}\;\beta \leq 6 \cdot 10^{+88}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 3.5 \cdot 10^{+110}:\\
\;\;\;\;\frac{i \cdot \frac{i + \left(\beta + \alpha\right)}{\frac{\mathsf{fma}\left(4, \beta \cdot i, \beta \cdot \beta + 4 \cdot \left(i \cdot i\right)\right)}{i \cdot \left(\beta + i\right)}}}{t_0 \cdot t_0 + -1}\\
\mathbf{elif}\;\beta \leq 2.9 \cdot 10^{+121}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 6.00000000000000011e88 or 3.4999999999999999e110 < beta < 2.8999999999999999e121Initial program 20.3%
associate-/l/17.7%
associate-*l*17.6%
times-frac25.5%
Simplified39.4%
Taylor expanded in i around inf 85.5%
if 6.00000000000000011e88 < beta < 3.4999999999999999e110Initial program 40.6%
expm1-log1p-u39.2%
expm1-udef39.2%
Applied egg-rr75.8%
expm1-def75.8%
expm1-log1p80.2%
associate-*r/80.5%
+-commutative80.5%
+-commutative80.5%
+-commutative80.5%
+-commutative80.5%
+-commutative80.5%
*-commutative80.5%
Simplified80.5%
Taylor expanded in beta around -inf 80.5%
unpow280.5%
Simplified80.5%
Taylor expanded in alpha around 0 80.5%
fma-def80.5%
unpow280.5%
unpow280.5%
Simplified80.5%
if 2.8999999999999999e121 < beta Initial program 3.1%
expm1-log1p-u3.0%
expm1-udef3.0%
Applied egg-rr17.3%
expm1-def17.3%
expm1-log1p18.3%
associate-*r/18.4%
+-commutative18.4%
+-commutative18.4%
+-commutative18.4%
+-commutative18.4%
+-commutative18.4%
*-commutative18.4%
Simplified18.4%
Taylor expanded in beta around inf 20.8%
unpow220.8%
Simplified20.8%
*-un-lft-identity20.8%
times-frac64.1%
Applied egg-rr64.1%
*-lft-identity64.1%
Simplified64.1%
Final simplification79.6%
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 (<= beta 5e+88)
0.0625
(if (<= beta 1.45e+110)
(/
(*
i
(/
(+ i (+ beta alpha))
(/ (pow (+ beta (* i 2.0)) 2.0) (* i (+ beta i)))))
(+ (* t_0 t_0) -1.0))
(if (<= beta 2.8e+121) 0.0625 (* (/ i beta) (/ (+ i alpha) beta)))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double tmp;
if (beta <= 5e+88) {
tmp = 0.0625;
} else if (beta <= 1.45e+110) {
tmp = (i * ((i + (beta + alpha)) / (pow((beta + (i * 2.0)), 2.0) / (i * (beta + i))))) / ((t_0 * t_0) + -1.0);
} else if (beta <= 2.8e+121) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / 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) :: t_0
real(8) :: tmp
t_0 = (beta + alpha) + (i * 2.0d0)
if (beta <= 5d+88) then
tmp = 0.0625d0
else if (beta <= 1.45d+110) then
tmp = (i * ((i + (beta + alpha)) / (((beta + (i * 2.0d0)) ** 2.0d0) / (i * (beta + i))))) / ((t_0 * t_0) + (-1.0d0))
else if (beta <= 2.8d+121) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((i + alpha) / beta)
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 (beta <= 5e+88) {
tmp = 0.0625;
} else if (beta <= 1.45e+110) {
tmp = (i * ((i + (beta + alpha)) / (Math.pow((beta + (i * 2.0)), 2.0) / (i * (beta + i))))) / ((t_0 * t_0) + -1.0);
} else if (beta <= 2.8e+121) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = (beta + alpha) + (i * 2.0) tmp = 0 if beta <= 5e+88: tmp = 0.0625 elif beta <= 1.45e+110: tmp = (i * ((i + (beta + alpha)) / (math.pow((beta + (i * 2.0)), 2.0) / (i * (beta + i))))) / ((t_0 * t_0) + -1.0) elif beta <= 2.8e+121: tmp = 0.0625 else: tmp = (i / beta) * ((i + alpha) / beta) 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 (beta <= 5e+88) tmp = 0.0625; elseif (beta <= 1.45e+110) tmp = Float64(Float64(i * Float64(Float64(i + Float64(beta + alpha)) / Float64((Float64(beta + Float64(i * 2.0)) ^ 2.0) / Float64(i * Float64(beta + i))))) / Float64(Float64(t_0 * t_0) + -1.0)); elseif (beta <= 2.8e+121) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta)); 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 (beta <= 5e+88)
tmp = 0.0625;
elseif (beta <= 1.45e+110)
tmp = (i * ((i + (beta + alpha)) / (((beta + (i * 2.0)) ^ 2.0) / (i * (beta + i))))) / ((t_0 * t_0) + -1.0);
elseif (beta <= 2.8e+121)
tmp = 0.0625;
else
tmp = (i / beta) * ((i + alpha) / beta);
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[beta, 5e+88], 0.0625, If[LessEqual[beta, 1.45e+110], N[(N[(i * N[(N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2.8e+121], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+88}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.45 \cdot 10^{+110}:\\
\;\;\;\;\frac{i \cdot \frac{i + \left(\beta + \alpha\right)}{\frac{{\left(\beta + i \cdot 2\right)}^{2}}{i \cdot \left(\beta + i\right)}}}{t_0 \cdot t_0 + -1}\\
\mathbf{elif}\;\beta \leq 2.8 \cdot 10^{+121}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 4.99999999999999997e88 or 1.45e110 < beta < 2.80000000000000006e121Initial program 20.3%
associate-/l/17.7%
associate-*l*17.6%
times-frac25.5%
Simplified39.4%
Taylor expanded in i around inf 85.5%
if 4.99999999999999997e88 < beta < 1.45e110Initial program 40.6%
expm1-log1p-u39.2%
expm1-udef39.2%
Applied egg-rr75.8%
expm1-def75.8%
expm1-log1p80.2%
associate-*r/80.5%
+-commutative80.5%
+-commutative80.5%
+-commutative80.5%
+-commutative80.5%
+-commutative80.5%
*-commutative80.5%
Simplified80.5%
Taylor expanded in alpha around 0 80.5%
if 2.80000000000000006e121 < beta Initial program 3.1%
expm1-log1p-u3.0%
expm1-udef3.0%
Applied egg-rr17.3%
expm1-def17.3%
expm1-log1p18.3%
associate-*r/18.4%
+-commutative18.4%
+-commutative18.4%
+-commutative18.4%
+-commutative18.4%
+-commutative18.4%
*-commutative18.4%
Simplified18.4%
Taylor expanded in beta around inf 20.8%
unpow220.8%
Simplified20.8%
*-un-lft-identity20.8%
times-frac64.1%
Applied egg-rr64.1%
*-lft-identity64.1%
Simplified64.1%
Final simplification79.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 6e+88) 0.0625 (* (/ i beta) (/ (+ i alpha) beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6e+88) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / 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 <= 6d+88) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((i + alpha) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6e+88) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 6e+88: tmp = 0.0625 else: tmp = (i / beta) * ((i + alpha) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 6e+88) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 6e+88)
tmp = 0.0625;
else
tmp = (i / beta) * ((i + alpha) / 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, 6e+88], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6 \cdot 10^{+88}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 6.00000000000000011e88Initial program 20.5%
associate-/l/17.9%
associate-*l*17.8%
times-frac25.8%
Simplified39.8%
Taylor expanded in i around inf 85.4%
if 6.00000000000000011e88 < beta Initial program 5.5%
expm1-log1p-u5.3%
expm1-udef5.3%
Applied egg-rr20.7%
expm1-def20.7%
expm1-log1p21.9%
associate-*r/22.0%
+-commutative22.0%
+-commutative22.0%
+-commutative22.0%
+-commutative22.0%
+-commutative22.0%
*-commutative22.0%
Simplified22.0%
Taylor expanded in beta around inf 22.6%
unpow222.6%
Simplified22.6%
*-un-lft-identity22.6%
times-frac61.8%
Applied egg-rr61.8%
*-lft-identity61.8%
Simplified61.8%
Final simplification78.4%
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 16.0%
associate-/l/12.6%
associate-*l*12.6%
times-frac20.5%
Simplified34.5%
Taylor expanded in i around inf 68.7%
Final simplification68.7%
herbie shell --seed 2023216
(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)))