
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t_1 \cdot t_1\\
\frac{\frac{t_0 \cdot \left(\beta \cdot \alpha + t_0\right)}{t_2}}{t_2 - 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t_1 \cdot t_1\\
\frac{\frac{t_0 \cdot \left(\beta \cdot \alpha + t_0\right)}{t_2}}{t_2 - 1}
\end{array}
\end{array}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma i 2.0 (+ alpha beta))))
(if (<= alpha 4.3e+222)
(*
(/ (* (/ i (+ beta (* i 2.0))) (+ i beta)) (+ t_0 1.0))
(/ (* i (/ (+ alpha (+ i beta)) t_0)) (+ t_0 -1.0)))
(* (/ i beta) (/ (+ alpha i) beta)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (alpha + beta));
double tmp;
if (alpha <= 4.3e+222) {
tmp = (((i / (beta + (i * 2.0))) * (i + beta)) / (t_0 + 1.0)) * ((i * ((alpha + (i + beta)) / t_0)) / (t_0 + -1.0));
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (alpha <= 4.3e+222) tmp = Float64(Float64(Float64(Float64(i / Float64(beta + Float64(i * 2.0))) * Float64(i + beta)) / Float64(t_0 + 1.0)) * Float64(Float64(i * Float64(Float64(alpha + Float64(i + beta)) / t_0)) / Float64(t_0 + -1.0))); else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) / beta)); 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[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 4.3e+222], N[(N[(N[(N[(i / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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}
t_0 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;\alpha \leq 4.3 \cdot 10^{+222}:\\
\;\;\;\;\frac{\frac{i}{\beta + i \cdot 2} \cdot \left(i + \beta\right)}{t_0 + 1} \cdot \frac{i \cdot \frac{\alpha + \left(i + \beta\right)}{t_0}}{t_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if alpha < 4.2999999999999999e222Initial program 17.6%
add-sqr-sqrt17.6%
+-commutative17.6%
+-commutative17.6%
+-commutative17.6%
fma-udef17.6%
*-commutative17.6%
times-frac34.3%
Applied egg-rr34.3%
Taylor expanded in alpha around 0 31.5%
difference-of-sqr-131.5%
times-frac36.0%
+-commutative36.0%
associate-/l*93.5%
associate-/r/93.5%
*-commutative93.5%
+-commutative93.5%
*-commutative93.5%
fma-udef93.5%
Applied egg-rr93.5%
if 4.2999999999999999e222 < alpha Initial program 0.0%
associate-/r*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 10.7%
Taylor expanded in beta around inf 10.7%
Final simplification85.8%
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 (+ alpha beta))) (t_1 (+ t_0 -1.0)) (t_2 (+ t_0 1.0)))
(if (<= beta 9e+152)
(*
(/
(+
(* (+ alpha beta) 0.25)
(* 0.5 (+ i (* (* (+ alpha beta) -0.25) (/ (+ alpha beta) i)))))
t_2)
(/ (* (/ i (+ beta (* i 2.0))) (+ i beta)) t_1))
(* (/ 1.0 t_2) (/ i (/ t_1 (+ alpha i)))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (alpha + beta));
double t_1 = t_0 + -1.0;
double t_2 = t_0 + 1.0;
double tmp;
if (beta <= 9e+152) {
tmp = ((((alpha + beta) * 0.25) + (0.5 * (i + (((alpha + beta) * -0.25) * ((alpha + beta) / i))))) / t_2) * (((i / (beta + (i * 2.0))) * (i + beta)) / t_1);
} else {
tmp = (1.0 / t_2) * (i / (t_1 / (alpha + i)));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(alpha + beta)) t_1 = Float64(t_0 + -1.0) t_2 = Float64(t_0 + 1.0) tmp = 0.0 if (beta <= 9e+152) tmp = Float64(Float64(Float64(Float64(Float64(alpha + beta) * 0.25) + Float64(0.5 * Float64(i + Float64(Float64(Float64(alpha + beta) * -0.25) * Float64(Float64(alpha + beta) / i))))) / t_2) * Float64(Float64(Float64(i / Float64(beta + Float64(i * 2.0))) * Float64(i + beta)) / t_1)); else tmp = Float64(Float64(1.0 / t_2) * Float64(i / Float64(t_1 / Float64(alpha + i)))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 + -1.0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 + 1.0), $MachinePrecision]}, If[LessEqual[beta, 9e+152], N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * 0.25), $MachinePrecision] + N[(0.5 * N[(i + N[(N[(N[(alpha + beta), $MachinePrecision] * -0.25), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] * N[(N[(N[(i / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i + beta), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$2), $MachinePrecision] * N[(i / N[(t$95$1 / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
t_1 := t_0 + -1\\
t_2 := t_0 + 1\\
\mathbf{if}\;\beta \leq 9 \cdot 10^{+152}:\\
\;\;\;\;\frac{\left(\alpha + \beta\right) \cdot 0.25 + 0.5 \cdot \left(i + \left(\left(\alpha + \beta\right) \cdot -0.25\right) \cdot \frac{\alpha + \beta}{i}\right)}{t_2} \cdot \frac{\frac{i}{\beta + i \cdot 2} \cdot \left(i + \beta\right)}{t_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t_2} \cdot \frac{i}{\frac{t_1}{\alpha + i}}\\
\end{array}
\end{array}
if beta < 9.0000000000000002e152Initial program 19.7%
add-sqr-sqrt19.7%
+-commutative19.7%
+-commutative19.7%
+-commutative19.7%
fma-udef19.7%
*-commutative19.7%
times-frac35.7%
Applied egg-rr35.7%
Taylor expanded in alpha around 0 34.5%
Taylor expanded in i around -inf 29.2%
mul-1-neg29.2%
distribute-rgt-out--29.2%
metadata-eval29.2%
distribute-lft-out29.2%
associate-/l*29.2%
distribute-rgt-out--29.2%
metadata-eval29.2%
Simplified29.2%
Applied egg-rr82.1%
if 9.0000000000000002e152 < beta Initial program 0.0%
Taylor expanded in beta around inf 28.7%
*-un-lft-identity28.7%
difference-of-sqr-128.7%
times-frac47.0%
+-commutative47.0%
*-commutative47.0%
fma-udef47.0%
+-commutative47.0%
+-commutative47.0%
*-commutative47.0%
fma-udef47.0%
sub-neg47.0%
metadata-eval47.0%
Applied egg-rr47.0%
associate-/l*78.2%
+-commutative78.2%
Simplified78.2%
Final simplification81.3%
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 (+ alpha beta))))
(if (<= beta 3.45e+140)
(* 0.25 (* (/ i t_0) (/ (+ i beta) (+ beta (* i 2.0)))))
(* (/ 1.0 (+ t_0 1.0)) (/ i (/ (+ t_0 -1.0) (+ alpha i)))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (alpha + beta));
double tmp;
if (beta <= 3.45e+140) {
tmp = 0.25 * ((i / t_0) * ((i + beta) / (beta + (i * 2.0))));
} else {
tmp = (1.0 / (t_0 + 1.0)) * (i / ((t_0 + -1.0) / (alpha + i)));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (beta <= 3.45e+140) tmp = Float64(0.25 * Float64(Float64(i / t_0) * Float64(Float64(i + beta) / Float64(beta + Float64(i * 2.0))))); else tmp = Float64(Float64(1.0 / Float64(t_0 + 1.0)) * Float64(i / Float64(Float64(t_0 + -1.0) / Float64(alpha + i)))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.45e+140], N[(0.25 * N[(N[(i / t$95$0), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(i / N[(N[(t$95$0 + -1.0), $MachinePrecision] / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 3.45 \cdot 10^{+140}:\\
\;\;\;\;0.25 \cdot \left(\frac{i}{t_0} \cdot \frac{i + \beta}{\beta + i \cdot 2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t_0 + 1} \cdot \frac{i}{\frac{t_0 + -1}{\alpha + i}}\\
\end{array}
\end{array}
if beta < 3.4500000000000001e140Initial program 19.6%
associate-/r*17.8%
times-frac35.5%
Simplified35.6%
Taylor expanded in i around inf 82.5%
Taylor expanded in alpha around 0 82.2%
if 3.4500000000000001e140 < beta Initial program 1.9%
Taylor expanded in beta around inf 28.2%
*-un-lft-identity28.2%
difference-of-sqr-128.2%
times-frac45.0%
+-commutative45.0%
*-commutative45.0%
fma-udef45.0%
+-commutative45.0%
+-commutative45.0%
*-commutative45.0%
fma-udef45.0%
sub-neg45.0%
metadata-eval45.0%
Applied egg-rr45.0%
associate-/l*74.0%
+-commutative74.0%
Simplified74.0%
Final simplification80.5%
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 (+ alpha beta))))
(if (<= beta 1.55e+140)
(* 0.25 (* (/ i t_0) (/ (+ i beta) (+ beta (* i 2.0)))))
(/ (* i (/ (+ alpha i) (+ t_0 1.0))) (+ t_0 -1.0)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (alpha + beta));
double tmp;
if (beta <= 1.55e+140) {
tmp = 0.25 * ((i / t_0) * ((i + beta) / (beta + (i * 2.0))));
} else {
tmp = (i * ((alpha + i) / (t_0 + 1.0))) / (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(alpha + beta)) tmp = 0.0 if (beta <= 1.55e+140) tmp = Float64(0.25 * Float64(Float64(i / t_0) * Float64(Float64(i + beta) / Float64(beta + Float64(i * 2.0))))); else tmp = Float64(Float64(i * Float64(Float64(alpha + i) / Float64(t_0 + 1.0))) / 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[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.55e+140], N[(0.25 * N[(N[(i / t$95$0), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i * N[(N[(alpha + i), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 1.55 \cdot 10^{+140}:\\
\;\;\;\;0.25 \cdot \left(\frac{i}{t_0} \cdot \frac{i + \beta}{\beta + i \cdot 2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \frac{\alpha + i}{t_0 + 1}}{t_0 + -1}\\
\end{array}
\end{array}
if beta < 1.55e140Initial program 19.6%
associate-/r*17.8%
times-frac35.5%
Simplified35.6%
Taylor expanded in i around inf 82.5%
Taylor expanded in alpha around 0 82.2%
if 1.55e140 < beta Initial program 1.9%
Taylor expanded in beta around inf 28.2%
*-commutative28.2%
difference-of-sqr-128.2%
times-frac74.0%
+-commutative74.0%
*-commutative74.0%
fma-udef74.0%
+-commutative74.0%
+-commutative74.0%
*-commutative74.0%
fma-udef74.0%
sub-neg74.0%
metadata-eval74.0%
Applied egg-rr74.0%
associate-*r/74.0%
+-commutative74.0%
Simplified74.0%
Final simplification80.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ beta (* i 2.0))))
(if (<= beta 1.6e+154)
(* 0.25 (* (/ i (fma i 2.0 (+ alpha beta))) (/ (+ i beta) t_0)))
(/ (/ (+ alpha i) beta) (/ t_0 i)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = beta + (i * 2.0);
double tmp;
if (beta <= 1.6e+154) {
tmp = 0.25 * ((i / fma(i, 2.0, (alpha + beta))) * ((i + beta) / t_0));
} else {
tmp = ((alpha + i) / beta) / (t_0 / i);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(beta + Float64(i * 2.0)) tmp = 0.0 if (beta <= 1.6e+154) tmp = Float64(0.25 * Float64(Float64(i / fma(i, 2.0, Float64(alpha + beta))) * Float64(Float64(i + beta) / t_0))); else tmp = Float64(Float64(Float64(alpha + i) / beta) / Float64(t_0 / i)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.6e+154], N[(0.25 * N[(N[(i / N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] / N[(t$95$0 / i), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \beta + i \cdot 2\\
\mathbf{if}\;\beta \leq 1.6 \cdot 10^{+154}:\\
\;\;\;\;0.25 \cdot \left(\frac{i}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)} \cdot \frac{i + \beta}{t_0}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + i}{\beta}}{\frac{t_0}{i}}\\
\end{array}
\end{array}
if beta < 1.6e154Initial program 19.7%
associate-/r*17.4%
times-frac35.6%
Simplified35.6%
Taylor expanded in i around inf 82.3%
Taylor expanded in alpha around 0 82.0%
if 1.6e154 < beta Initial program 0.0%
associate-/r*0.0%
times-frac11.3%
Simplified11.3%
Taylor expanded in beta around inf 76.5%
Taylor expanded in i around 0 76.5%
*-rgt-identity76.5%
clear-num76.5%
associate-*l/76.5%
*-un-lft-identity76.5%
+-commutative76.5%
Applied egg-rr76.5%
Taylor expanded in alpha around 0 76.4%
*-commutative76.4%
Simplified76.4%
Final simplification80.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.5e+154) 0.0625 (/ (/ (+ alpha i) beta) (/ (+ beta (* i 2.0)) i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.5e+154) {
tmp = 0.0625;
} else {
tmp = ((alpha + i) / beta) / ((beta + (i * 2.0)) / i);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.5d+154) then
tmp = 0.0625d0
else
tmp = ((alpha + i) / beta) / ((beta + (i * 2.0d0)) / 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.5e+154) {
tmp = 0.0625;
} else {
tmp = ((alpha + i) / beta) / ((beta + (i * 2.0)) / i);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.5e+154: tmp = 0.0625 else: tmp = ((alpha + i) / beta) / ((beta + (i * 2.0)) / i) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.5e+154) tmp = 0.0625; else tmp = Float64(Float64(Float64(alpha + i) / beta) / Float64(Float64(beta + Float64(i * 2.0)) / 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.5e+154)
tmp = 0.0625;
else
tmp = ((alpha + i) / beta) / ((beta + (i * 2.0)) / i);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.5e+154], 0.0625, N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.5 \cdot 10^{+154}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + i}{\beta}}{\frac{\beta + i \cdot 2}{i}}\\
\end{array}
\end{array}
if beta < 1.50000000000000013e154Initial program 19.7%
associate-/r*17.4%
times-frac35.6%
Simplified35.6%
Taylor expanded in i around inf 81.9%
if 1.50000000000000013e154 < beta Initial program 0.0%
associate-/r*0.0%
times-frac11.3%
Simplified11.3%
Taylor expanded in beta around inf 76.5%
Taylor expanded in i around 0 76.5%
*-rgt-identity76.5%
clear-num76.5%
associate-*l/76.5%
*-un-lft-identity76.5%
+-commutative76.5%
Applied egg-rr76.5%
Taylor expanded in alpha around 0 76.4%
*-commutative76.4%
Simplified76.4%
Final simplification80.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.8e+154) 0.0625 (* (/ i beta) (/ (+ alpha i) beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.8e+154) {
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 <= 4.8d+154) 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 <= 4.8e+154) {
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 <= 4.8e+154: 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 <= 4.8e+154) 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 <= 4.8e+154)
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, 4.8e+154], 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 4.8 \cdot 10^{+154}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if beta < 4.8000000000000003e154Initial program 19.7%
associate-/r*17.4%
times-frac35.6%
Simplified35.6%
Taylor expanded in i around inf 81.9%
if 4.8000000000000003e154 < beta Initial program 0.0%
associate-/r*0.0%
times-frac11.3%
Simplified11.3%
Taylor expanded in beta around inf 76.5%
Taylor expanded in beta around inf 76.2%
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.5e+151) 0.0625 (/ (/ (+ alpha i) beta) (/ beta i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6.5e+151) {
tmp = 0.0625;
} else {
tmp = ((alpha + i) / beta) / (beta / i);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 6.5d+151) then
tmp = 0.0625d0
else
tmp = ((alpha + i) / beta) / (beta / 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 <= 6.5e+151) {
tmp = 0.0625;
} else {
tmp = ((alpha + i) / beta) / (beta / i);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 6.5e+151: tmp = 0.0625 else: tmp = ((alpha + i) / beta) / (beta / i) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 6.5e+151) tmp = 0.0625; else tmp = Float64(Float64(Float64(alpha + i) / beta) / Float64(beta / 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 <= 6.5e+151)
tmp = 0.0625;
else
tmp = ((alpha + i) / beta) / (beta / i);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 6.5e+151], 0.0625, N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5 \cdot 10^{+151}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + i}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 6.5000000000000002e151Initial program 19.7%
associate-/r*17.4%
times-frac35.6%
Simplified35.6%
Taylor expanded in i around inf 81.9%
if 6.5000000000000002e151 < beta Initial program 0.0%
associate-/r*0.0%
times-frac11.3%
Simplified11.3%
Taylor expanded in beta around inf 76.5%
Taylor expanded in i around 0 76.5%
*-rgt-identity76.5%
clear-num76.5%
associate-*l/76.5%
*-un-lft-identity76.5%
+-commutative76.5%
Applied egg-rr76.5%
Taylor expanded in beta around inf 76.2%
Final simplification80.8%
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.0%
associate-/r*14.1%
times-frac31.1%
Simplified31.1%
Taylor expanded in i around inf 70.1%
Final simplification70.1%
herbie shell --seed 2023336
(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)))