
(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 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ alpha (+ beta i)))
(t_1 (+ alpha (fma i 2.0 beta)))
(t_2 (fma i 2.0 (+ beta alpha))))
(if (<= beta 1.85e+107)
0.0625
(if (<= beta 1e+137)
(*
(* (fma beta alpha (* i t_0)) (pow t_1 -2.0))
(/ i (/ (+ (pow t_1 2.0) -1.0) t_0)))
(if (<= beta 6.4e+158)
(+
(+ 0.0625 (* 0.0625 (/ (* 2.0 (+ beta alpha)) i)))
(* -0.125 (/ (+ beta alpha) i)))
(* (/ (+ alpha i) (+ t_2 1.0)) (/ i (+ t_2 -1.0))))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = alpha + (beta + i);
double t_1 = alpha + fma(i, 2.0, beta);
double t_2 = fma(i, 2.0, (beta + alpha));
double tmp;
if (beta <= 1.85e+107) {
tmp = 0.0625;
} else if (beta <= 1e+137) {
tmp = (fma(beta, alpha, (i * t_0)) * pow(t_1, -2.0)) * (i / ((pow(t_1, 2.0) + -1.0) / t_0));
} else if (beta <= 6.4e+158) {
tmp = (0.0625 + (0.0625 * ((2.0 * (beta + alpha)) / i))) + (-0.125 * ((beta + alpha) / i));
} else {
tmp = ((alpha + i) / (t_2 + 1.0)) * (i / (t_2 + -1.0));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(alpha + Float64(beta + i)) t_1 = Float64(alpha + fma(i, 2.0, beta)) t_2 = fma(i, 2.0, Float64(beta + alpha)) tmp = 0.0 if (beta <= 1.85e+107) tmp = 0.0625; elseif (beta <= 1e+137) tmp = Float64(Float64(fma(beta, alpha, Float64(i * t_0)) * (t_1 ^ -2.0)) * Float64(i / Float64(Float64((t_1 ^ 2.0) + -1.0) / t_0))); elseif (beta <= 6.4e+158) tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(2.0 * Float64(beta + alpha)) / i))) + Float64(-0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(Float64(alpha + i) / Float64(t_2 + 1.0)) * Float64(i / Float64(t_2 + -1.0))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(alpha + N[(beta + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.85e+107], 0.0625, If[LessEqual[beta, 1e+137], N[(N[(N[(beta * alpha + N[(i * t$95$0), $MachinePrecision]), $MachinePrecision] * N[Power[t$95$1, -2.0], $MachinePrecision]), $MachinePrecision] * N[(i / N[(N[(N[Power[t$95$1, 2.0], $MachinePrecision] + -1.0), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 6.4e+158], N[(N[(0.0625 + N[(0.0625 * N[(N[(2.0 * N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / N[(t$95$2 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(i / N[(t$95$2 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + i\right)\\
t_1 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\
t_2 := \mathsf{fma}\left(i, 2, \beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 1.85 \cdot 10^{+107}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 10^{+137}:\\
\;\;\;\;\left(\mathsf{fma}\left(\beta, \alpha, i \cdot t\_0\right) \cdot {t\_1}^{-2}\right) \cdot \frac{i}{\frac{{t\_1}^{2} + -1}{t\_0}}\\
\mathbf{elif}\;\beta \leq 6.4 \cdot 10^{+158}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + -0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + i}{t\_2 + 1} \cdot \frac{i}{t\_2 + -1}\\
\end{array}
\end{array}
if beta < 1.85e107Initial program 21.7%
associate-/l/19.5%
associate-*l*19.4%
times-frac28.7%
Simplified28.7%
Taylor expanded in i around inf 85.5%
if 1.85e107 < beta < 1e137Initial program 1.1%
associate-/l/0.0%
times-frac41.2%
Simplified41.2%
add-log-exp16.7%
exp-prod25.1%
associate-/l*28.2%
fma-udef28.2%
pow228.2%
+-commutative28.2%
associate-+l+28.2%
Applied egg-rr28.2%
log-pow17.2%
fma-def17.2%
+-commutative17.2%
fma-def17.2%
rem-log-exp41.3%
+-commutative41.3%
Simplified41.3%
if 1e137 < beta < 6.39999999999999989e158Initial program 0.3%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.3%
Simplified0.3%
Taylor expanded in i around inf 59.1%
cancel-sign-sub-inv59.1%
distribute-lft-out59.1%
metadata-eval59.1%
Simplified59.1%
if 6.39999999999999989e158 < beta Initial program 0.0%
Taylor expanded in beta around -inf 23.4%
associate-*r*23.4%
mul-1-neg23.4%
distribute-lft-out23.4%
Simplified23.4%
*-commutative23.4%
difference-of-sqr-123.4%
times-frac76.8%
add-sqr-sqrt0.0%
sqrt-unprod21.2%
mul-1-neg21.2%
mul-1-neg21.2%
sqr-neg21.2%
sqrt-unprod24.4%
add-sqr-sqrt24.4%
+-commutative24.4%
*-commutative24.4%
fma-def24.4%
+-commutative24.4%
Applied egg-rr76.8%
Final simplification81.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma i 2.0 (+ beta alpha))))
(if (<= beta 4e+158)
0.0625
(* (/ (+ alpha i) (+ t_0 1.0)) (/ i (+ t_0 -1.0))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (beta + alpha));
double tmp;
if (beta <= 4e+158) {
tmp = 0.0625;
} else {
tmp = ((alpha + i) / (t_0 + 1.0)) * (i / (t_0 + -1.0));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(beta + alpha)) tmp = 0.0 if (beta <= 4e+158) tmp = 0.0625; else tmp = Float64(Float64(Float64(alpha + i) / Float64(t_0 + 1.0)) * Float64(i / Float64(t_0 + -1.0))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+158], 0.0625, N[(N[(N[(alpha + i), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(i / N[(t$95$0 + -1.0), $MachinePrecision]), $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)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+158}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + i}{t\_0 + 1} \cdot \frac{i}{t\_0 + -1}\\
\end{array}
\end{array}
if beta < 3.99999999999999981e158Initial program 19.8%
associate-/l/17.8%
associate-*l*17.7%
times-frac26.6%
Simplified26.6%
Taylor expanded in i around inf 82.2%
if 3.99999999999999981e158 < beta Initial program 0.0%
Taylor expanded in beta around -inf 23.4%
associate-*r*23.4%
mul-1-neg23.4%
distribute-lft-out23.4%
Simplified23.4%
*-commutative23.4%
difference-of-sqr-123.4%
times-frac76.8%
add-sqr-sqrt0.0%
sqrt-unprod21.2%
mul-1-neg21.2%
mul-1-neg21.2%
sqr-neg21.2%
sqrt-unprod24.4%
add-sqr-sqrt24.4%
+-commutative24.4%
*-commutative24.4%
fma-def24.4%
+-commutative24.4%
Applied egg-rr76.8%
Final simplification81.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 8e+158) 0.0625 (* (/ i beta) (* (+ alpha i) (/ 1.0 beta)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8e+158) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((alpha + i) * (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 <= 8d+158) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((alpha + i) * (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 <= 8e+158) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((alpha + i) * (1.0 / beta));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 8e+158: tmp = 0.0625 else: tmp = (i / beta) * ((alpha + i) * (1.0 / beta)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 8e+158) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) * 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 <= 8e+158)
tmp = 0.0625;
else
tmp = (i / beta) * ((alpha + i) * (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, 8e+158], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(alpha + i), $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 8 \cdot 10^{+158}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \left(\left(\alpha + i\right) \cdot \frac{1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 7.99999999999999962e158Initial program 19.8%
associate-/l/17.8%
associate-*l*17.7%
times-frac26.6%
Simplified26.6%
Taylor expanded in i around inf 82.2%
if 7.99999999999999962e158 < beta Initial program 0.0%
associate-/l/0.0%
times-frac10.7%
Simplified10.7%
Taylor expanded in beta around inf 17.1%
Taylor expanded in beta around inf 74.4%
div-inv74.5%
Applied egg-rr74.5%
+-commutative74.5%
Simplified74.5%
Final simplification80.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7e+158) 0.0625 (* (/ i beta) (/ (+ alpha i) beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7e+158) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((alpha + i) / 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 <= 7d+158) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((alpha + i) / 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 <= 7e+158) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7e+158: tmp = 0.0625 else: tmp = (i / beta) * ((alpha + i) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7e+158) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) / 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 <= 7e+158)
tmp = 0.0625;
else
tmp = (i / beta) * ((alpha + i) / 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, 7e+158], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7 \cdot 10^{+158}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if beta < 7.0000000000000003e158Initial program 19.8%
associate-/l/17.8%
associate-*l*17.7%
times-frac26.6%
Simplified26.6%
Taylor expanded in i around inf 82.2%
if 7.0000000000000003e158 < beta Initial program 0.0%
associate-/l/0.0%
times-frac10.7%
Simplified10.7%
Taylor expanded in beta around inf 17.1%
Taylor expanded in beta around inf 74.4%
Final simplification80.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 6.6e+232) 0.0625 (* (/ i beta) (/ alpha beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6.6e+232) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (alpha / 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 <= 6.6d+232) then
tmp = 0.0625d0
else
tmp = (i / beta) * (alpha / 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 <= 6.6e+232) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 6.6e+232: tmp = 0.0625 else: tmp = (i / beta) * (alpha / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 6.6e+232) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(alpha / 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 <= 6.6e+232)
tmp = 0.0625;
else
tmp = (i / beta) * (alpha / 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, 6.6e+232], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.6 \cdot 10^{+232}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 6.6e232Initial program 18.2%
associate-/l/16.3%
associate-*l*16.3%
times-frac24.5%
Simplified24.5%
Taylor expanded in i around inf 78.5%
if 6.6e232 < beta Initial program 0.0%
associate-/l/0.0%
times-frac6.9%
Simplified6.9%
Taylor expanded in beta around inf 17.2%
Taylor expanded in beta around inf 82.1%
Taylor expanded in alpha around inf 39.6%
Final simplification74.1%
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.2%
associate-/l/14.5%
associate-*l*14.4%
times-frac21.7%
Simplified21.7%
Taylor expanded in i around inf 71.5%
Final simplification71.5%
herbie shell --seed 2024031
(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)))