
(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 8 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 (fma i 2.0 (+ beta alpha)))
(t_1 (+ (+ beta alpha) (* i 2.0)))
(t_2 (* i (+ (+ beta i) alpha))))
(if (<= beta 2.1e+67)
0.0625
(if (<= beta 1.66e+90)
(/ (* (/ t_2 t_0) (/ (fma alpha beta t_2) t_0)) (+ (* t_1 t_1) -1.0))
(if (<= beta 2.5e+163)
(- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ beta alpha) i)))
(* (/ i beta) (/ (+ i alpha) t_0)))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (beta + alpha));
double t_1 = (beta + alpha) + (i * 2.0);
double t_2 = i * ((beta + i) + alpha);
double tmp;
if (beta <= 2.1e+67) {
tmp = 0.0625;
} else if (beta <= 1.66e+90) {
tmp = ((t_2 / t_0) * (fma(alpha, beta, t_2) / t_0)) / ((t_1 * t_1) + -1.0);
} else if (beta <= 2.5e+163) {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = (i / beta) * ((i + alpha) / t_0);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(beta + alpha)) t_1 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_2 = Float64(i * Float64(Float64(beta + i) + alpha)) tmp = 0.0 if (beta <= 2.1e+67) tmp = 0.0625; elseif (beta <= 1.66e+90) tmp = Float64(Float64(Float64(t_2 / t_0) * Float64(fma(alpha, beta, t_2) / t_0)) / Float64(Float64(t_1 * t_1) + -1.0)); elseif (beta <= 2.5e+163) tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / t_0)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(N[(beta + i), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.1e+67], 0.0625, If[LessEqual[beta, 1.66e+90], N[(N[(N[(t$95$2 / t$95$0), $MachinePrecision] * N[(N[(alpha * beta + t$95$2), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$1 * t$95$1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2.5e+163], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(i, 2, \beta + \alpha\right)\\
t_1 := \left(\beta + \alpha\right) + i \cdot 2\\
t_2 := i \cdot \left(\left(\beta + i\right) + \alpha\right)\\
\mathbf{if}\;\beta \leq 2.1 \cdot 10^{+67}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.66 \cdot 10^{+90}:\\
\;\;\;\;\frac{\frac{t\_2}{t\_0} \cdot \frac{\mathsf{fma}\left(\alpha, \beta, t\_2\right)}{t\_0}}{t\_1 \cdot t\_1 + -1}\\
\mathbf{elif}\;\beta \leq 2.5 \cdot 10^{+163}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{t\_0}\\
\end{array}
\end{array}
if beta < 2.1000000000000001e67Initial program 21.6%
associate-/l/18.6%
associate-*l*18.5%
associate-/l*18.7%
Simplified42.0%
Taylor expanded in i around inf 79.2%
if 2.1000000000000001e67 < beta < 1.6599999999999999e90Initial program 50.0%
times-frac50.0%
+-commutative50.0%
associate-+r+50.0%
+-commutative50.0%
+-commutative50.0%
*-commutative50.0%
fma-undefine50.0%
*-commutative50.0%
+-commutative50.0%
fma-undefine50.0%
associate-+r+50.0%
+-commutative50.0%
+-commutative50.0%
*-commutative50.0%
fma-undefine50.0%
Applied egg-rr50.0%
associate-+r+50.0%
associate-+r+50.0%
Simplified50.0%
if 1.6599999999999999e90 < beta < 2.5e163Initial program 5.1%
associate-/l/0.2%
associate-*l*0.2%
associate-/l*0.5%
Simplified34.5%
Taylor expanded in i around inf 67.6%
Taylor expanded in alpha around 0 63.1%
if 2.5e163 < beta Initial program 0.0%
associate-/l/0.0%
times-frac8.4%
Simplified8.4%
Taylor expanded in beta around inf 23.3%
Taylor expanded in beta around inf 61.4%
Final simplification74.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma i 2.0 (+ beta alpha)))
(t_1 (+ (+ beta alpha) (* i 2.0)))
(t_2 (* i (+ beta (+ i alpha)))))
(if (<= beta 2.1e+67)
0.0625
(if (<= beta 1.66e+90)
(/ (* t_2 (/ (fma alpha beta t_2) (pow t_0 2.0))) (+ (* t_1 t_1) -1.0))
(if (<= beta 4.4e+163)
(- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ beta alpha) i)))
(* (/ i beta) (/ (+ i alpha) t_0)))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (beta + alpha));
double t_1 = (beta + alpha) + (i * 2.0);
double t_2 = i * (beta + (i + alpha));
double tmp;
if (beta <= 2.1e+67) {
tmp = 0.0625;
} else if (beta <= 1.66e+90) {
tmp = (t_2 * (fma(alpha, beta, t_2) / pow(t_0, 2.0))) / ((t_1 * t_1) + -1.0);
} else if (beta <= 4.4e+163) {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = (i / beta) * ((i + alpha) / t_0);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(beta + alpha)) t_1 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_2 = Float64(i * Float64(beta + Float64(i + alpha))) tmp = 0.0 if (beta <= 2.1e+67) tmp = 0.0625; elseif (beta <= 1.66e+90) tmp = Float64(Float64(t_2 * Float64(fma(alpha, beta, t_2) / (t_0 ^ 2.0))) / Float64(Float64(t_1 * t_1) + -1.0)); elseif (beta <= 4.4e+163) tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / t_0)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.1e+67], 0.0625, If[LessEqual[beta, 1.66e+90], N[(N[(t$95$2 * N[(N[(alpha * beta + t$95$2), $MachinePrecision] / N[Power[t$95$0, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$1 * t$95$1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 4.4e+163], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(i, 2, \beta + \alpha\right)\\
t_1 := \left(\beta + \alpha\right) + i \cdot 2\\
t_2 := i \cdot \left(\beta + \left(i + \alpha\right)\right)\\
\mathbf{if}\;\beta \leq 2.1 \cdot 10^{+67}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.66 \cdot 10^{+90}:\\
\;\;\;\;\frac{t\_2 \cdot \frac{\mathsf{fma}\left(\alpha, \beta, t\_2\right)}{{t\_0}^{2}}}{t\_1 \cdot t\_1 + -1}\\
\mathbf{elif}\;\beta \leq 4.4 \cdot 10^{+163}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{t\_0}\\
\end{array}
\end{array}
if beta < 2.1000000000000001e67Initial program 21.6%
associate-/l/18.6%
associate-*l*18.5%
associate-/l*18.7%
Simplified42.0%
Taylor expanded in i around inf 79.2%
if 2.1000000000000001e67 < beta < 1.6599999999999999e90Initial program 50.0%
associate-/l*50.0%
+-commutative50.0%
associate-+r+50.0%
+-commutative50.0%
*-commutative50.0%
+-commutative50.0%
fma-undefine50.0%
pow250.0%
*-commutative50.0%
pow250.0%
associate-+r+50.0%
+-commutative50.0%
pow250.0%
Applied egg-rr50.0%
if 1.6599999999999999e90 < beta < 4.39999999999999973e163Initial program 5.1%
associate-/l/0.2%
associate-*l*0.2%
associate-/l*0.5%
Simplified34.5%
Taylor expanded in i around inf 67.6%
Taylor expanded in alpha around 0 63.1%
if 4.39999999999999973e163 < beta Initial program 0.0%
associate-/l/0.0%
times-frac8.4%
Simplified8.4%
Taylor expanded in beta around inf 23.3%
Taylor expanded in beta around inf 61.4%
Final simplification74.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.4e+163) 0.0625 (* (/ i beta) (/ (+ i alpha) (fma i 2.0 (+ beta alpha))))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.4e+163) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / fma(i, 2.0, (beta + alpha)));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.4e+163) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / fma(i, 2.0, Float64(beta + alpha)))); end return 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.4e+163], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4 \cdot 10^{+163}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\mathsf{fma}\left(i, 2, \beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 3.4000000000000001e163Initial program 20.1%
associate-/l/16.5%
associate-*l*16.4%
associate-/l*16.6%
Simplified41.2%
Taylor expanded in i around inf 77.2%
if 3.4000000000000001e163 < beta Initial program 0.0%
associate-/l/0.0%
times-frac8.4%
Simplified8.4%
Taylor expanded in beta around inf 23.3%
Taylor expanded in beta around inf 61.4%
Final simplification74.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.2e+171) (- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ beta alpha) i))) (* i (* (/ (+ i alpha) beta) (/ 1.0 beta)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.2e+171) {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = i * (((i + alpha) / beta) * (1.0 / beta));
}
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 <= 4.2d+171) then
tmp = (0.0625d0 + (0.125d0 * (beta / i))) - (0.125d0 * ((beta + alpha) / i))
else
tmp = i * (((i + alpha) / beta) * (1.0d0 / beta))
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 <= 4.2e+171) {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = i * (((i + alpha) / beta) * (1.0 / beta));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 4.2e+171: tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i)) else: tmp = i * (((i + alpha) / beta) * (1.0 / beta)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.2e+171) tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(i * Float64(Float64(Float64(i + alpha) / beta) * Float64(1.0 / beta))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4.2e+171)
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i));
else
tmp = i * (((i + alpha) / beta) * (1.0 / beta));
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, 4.2e+171], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(i * N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2 \cdot 10^{+171}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;i \cdot \left(\frac{i + \alpha}{\beta} \cdot \frac{1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 4.2000000000000003e171Initial program 19.9%
associate-/l/16.3%
associate-*l*16.2%
associate-/l*16.3%
Simplified40.7%
Taylor expanded in i around inf 80.5%
Taylor expanded in alpha around 0 76.1%
if 4.2000000000000003e171 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified8.9%
Taylor expanded in beta around inf 15.5%
Taylor expanded in beta around inf 22.9%
Taylor expanded in beta around inf 42.2%
Final simplification70.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* 0.125 (/ beta i))))
(if (<= beta 5.4e+171)
(- (+ 0.0625 t_0) t_0)
(* i (* (/ (+ i alpha) beta) (/ 1.0 beta))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 5.4e+171) {
tmp = (0.0625 + t_0) - t_0;
} else {
tmp = i * (((i + alpha) / beta) * (1.0 / beta));
}
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 = 0.125d0 * (beta / i)
if (beta <= 5.4d+171) then
tmp = (0.0625d0 + t_0) - t_0
else
tmp = i * (((i + alpha) / beta) * (1.0d0 / beta))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 5.4e+171) {
tmp = (0.0625 + t_0) - t_0;
} else {
tmp = i * (((i + alpha) / beta) * (1.0 / beta));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) tmp = 0 if beta <= 5.4e+171: tmp = (0.0625 + t_0) - t_0 else: tmp = i * (((i + alpha) / beta) * (1.0 / beta)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (beta <= 5.4e+171) tmp = Float64(Float64(0.0625 + t_0) - t_0); else tmp = Float64(i * Float64(Float64(Float64(i + alpha) / beta) * Float64(1.0 / beta))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = 0.125 * (beta / i);
tmp = 0.0;
if (beta <= 5.4e+171)
tmp = (0.0625 + t_0) - t_0;
else
tmp = i * (((i + alpha) / beta) * (1.0 / beta));
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[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.4e+171], N[(N[(0.0625 + t$95$0), $MachinePrecision] - t$95$0), $MachinePrecision], N[(i * N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\beta \leq 5.4 \cdot 10^{+171}:\\
\;\;\;\;\left(0.0625 + t\_0\right) - t\_0\\
\mathbf{else}:\\
\;\;\;\;i \cdot \left(\frac{i + \alpha}{\beta} \cdot \frac{1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 5.3999999999999996e171Initial program 19.9%
associate-/l/16.3%
associate-*l*16.2%
associate-/l*16.3%
Simplified40.7%
Taylor expanded in i around inf 80.5%
Taylor expanded in alpha around 0 76.1%
Taylor expanded in alpha around 0 77.6%
if 5.3999999999999996e171 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified8.9%
Taylor expanded in beta around inf 15.5%
Taylor expanded in beta around inf 22.9%
Taylor expanded in beta around inf 42.2%
Final simplification72.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.1e+163) 0.0625 (* i (* (/ (+ i alpha) beta) (/ 1.0 beta)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.1e+163) {
tmp = 0.0625;
} else {
tmp = i * (((i + alpha) / beta) * (1.0 / beta));
}
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.1d+163) then
tmp = 0.0625d0
else
tmp = i * (((i + alpha) / beta) * (1.0d0 / beta))
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.1e+163) {
tmp = 0.0625;
} else {
tmp = i * (((i + alpha) / beta) * (1.0 / beta));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.1e+163: tmp = 0.0625 else: tmp = i * (((i + alpha) / beta) * (1.0 / beta)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.1e+163) tmp = 0.0625; else tmp = Float64(i * Float64(Float64(Float64(i + alpha) / beta) * Float64(1.0 / beta))); 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.1e+163)
tmp = 0.0625;
else
tmp = i * (((i + alpha) / beta) * (1.0 / beta));
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.1e+163], 0.0625, N[(i * N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1 \cdot 10^{+163}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;i \cdot \left(\frac{i + \alpha}{\beta} \cdot \frac{1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 2.1e163Initial program 20.1%
associate-/l/16.5%
associate-*l*16.4%
associate-/l*16.6%
Simplified41.2%
Taylor expanded in i around inf 77.2%
if 2.1e163 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified8.4%
Taylor expanded in beta around inf 14.6%
Taylor expanded in beta around inf 23.6%
Taylor expanded in beta around inf 41.8%
Final simplification71.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.1e+224) 0.0625 (/ (* 0.125 (- beta (+ beta alpha))) i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.1e+224) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (beta + alpha))) / 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) :: tmp
if (beta <= 1.1d+224) then
tmp = 0.0625d0
else
tmp = (0.125d0 * (beta - (beta + alpha))) / i
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.1e+224) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (beta + alpha))) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.1e+224: tmp = 0.0625 else: tmp = (0.125 * (beta - (beta + alpha))) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.1e+224) tmp = 0.0625; else tmp = Float64(Float64(0.125 * Float64(beta - Float64(beta + alpha))) / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.1e+224)
tmp = 0.0625;
else
tmp = (0.125 * (beta - (beta + alpha))) / 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_] := If[LessEqual[beta, 1.1e+224], 0.0625, N[(N[(0.125 * N[(beta - N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.1 \cdot 10^{+224}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0.125 \cdot \left(\beta - \left(\beta + \alpha\right)\right)}{i}\\
\end{array}
\end{array}
if beta < 1.1e224Initial program 18.2%
associate-/l/14.9%
associate-*l*14.8%
associate-/l*15.0%
Simplified37.5%
Taylor expanded in i around inf 72.6%
if 1.1e224 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified15.8%
Taylor expanded in i around inf 43.4%
Taylor expanded in alpha around 0 43.4%
Taylor expanded in i around 0 31.7%
distribute-lft-out--31.7%
Simplified31.7%
Final simplification69.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 16.8%
associate-/l/13.8%
associate-*l*13.7%
associate-/l*13.8%
Simplified35.9%
Taylor expanded in i around inf 68.4%
Final simplification68.4%
herbie shell --seed 2024077
(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)))