
(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
(if (<= beta 7.5e+111)
(+
0.0625
(-
(* 0.0625 (/ (* beta beta) (* i i)))
(*
0.00390625
(/ (+ (* 4.0 (+ (* beta beta) -1.0)) (* (* beta beta) 20.0)) (* i i)))))
(* (/ i (+ (+ beta alpha) (* i 2.0))) (/ (+ i alpha) beta))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.5e+111) {
tmp = 0.0625 + ((0.0625 * ((beta * beta) / (i * i))) - (0.00390625 * (((4.0 * ((beta * beta) + -1.0)) + ((beta * beta) * 20.0)) / (i * i))));
} else {
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + 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 <= 7.5d+111) then
tmp = 0.0625d0 + ((0.0625d0 * ((beta * beta) / (i * i))) - (0.00390625d0 * (((4.0d0 * ((beta * beta) + (-1.0d0))) + ((beta * beta) * 20.0d0)) / (i * i))))
else
tmp = (i / ((beta + alpha) + (i * 2.0d0))) * ((i + 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 <= 7.5e+111) {
tmp = 0.0625 + ((0.0625 * ((beta * beta) / (i * i))) - (0.00390625 * (((4.0 * ((beta * beta) + -1.0)) + ((beta * beta) * 20.0)) / (i * i))));
} else {
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7.5e+111: tmp = 0.0625 + ((0.0625 * ((beta * beta) / (i * i))) - (0.00390625 * (((4.0 * ((beta * beta) + -1.0)) + ((beta * beta) * 20.0)) / (i * i)))) else: tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + alpha) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7.5e+111) tmp = Float64(0.0625 + Float64(Float64(0.0625 * Float64(Float64(beta * beta) / Float64(i * i))) - Float64(0.00390625 * Float64(Float64(Float64(4.0 * Float64(Float64(beta * beta) + -1.0)) + Float64(Float64(beta * beta) * 20.0)) / Float64(i * i))))); else tmp = Float64(Float64(i / Float64(Float64(beta + alpha) + Float64(i * 2.0))) * Float64(Float64(i + 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 <= 7.5e+111)
tmp = 0.0625 + ((0.0625 * ((beta * beta) / (i * i))) - (0.00390625 * (((4.0 * ((beta * beta) + -1.0)) + ((beta * beta) * 20.0)) / (i * i))));
else
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + 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, 7.5e+111], N[(0.0625 + N[(N[(0.0625 * N[(N[(beta * beta), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.00390625 * N[(N[(N[(4.0 * N[(N[(beta * beta), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(beta * beta), $MachinePrecision] * 20.0), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.5 \cdot 10^{+111}:\\
\;\;\;\;0.0625 + \left(0.0625 \cdot \frac{\beta \cdot \beta}{i \cdot i} - 0.00390625 \cdot \frac{4 \cdot \left(\beta \cdot \beta + -1\right) + \left(\beta \cdot \beta\right) \cdot 20}{i \cdot i}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\left(\beta + \alpha\right) + i \cdot 2} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 7.49999999999999948e111Initial program 20.3%
associate-/l/18.1%
associate-/l*21.6%
+-commutative21.6%
Simplified21.6%
Taylor expanded in alpha around 0 17.8%
times-frac43.3%
unpow243.3%
unpow243.3%
unpow243.3%
sub-neg43.3%
unpow243.3%
metadata-eval43.3%
Simplified43.3%
Taylor expanded in i around inf 82.8%
associate--l+82.8%
unpow282.8%
unpow282.8%
sub-neg82.8%
unpow282.8%
metadata-eval82.8%
distribute-rgt-out82.8%
unpow282.8%
metadata-eval82.8%
unpow282.8%
Simplified82.8%
if 7.49999999999999948e111 < beta Initial program 2.5%
associate-/l/0.1%
associate-/l*3.6%
+-commutative3.6%
Simplified3.6%
associate-*r/0.1%
+-commutative0.1%
fma-undefine0.1%
+-commutative0.1%
*-commutative0.1%
+-commutative0.1%
associate-*l*0.1%
associate-*l*0.1%
times-frac0.1%
Applied egg-rr0.1%
+-commutative0.1%
associate-+l+0.1%
*-commutative0.1%
associate-/l*3.6%
+-commutative3.6%
*-commutative3.6%
Simplified3.6%
Taylor expanded in beta around inf 57.7%
Final simplification78.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 (/ (+ beta (* i 2.0)) i)))
(if (<= beta 1e+117)
(* (/ 1.0 (* t_0 t_0)) (- 0.25 (/ (* beta -0.25) i)))
(* (/ i (+ (+ beta alpha) (* i 2.0))) (/ (+ i alpha) beta)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + (i * 2.0)) / i;
double tmp;
if (beta <= 1e+117) {
tmp = (1.0 / (t_0 * t_0)) * (0.25 - ((beta * -0.25) / i));
} else {
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + 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) :: t_0
real(8) :: tmp
t_0 = (beta + (i * 2.0d0)) / i
if (beta <= 1d+117) then
tmp = (1.0d0 / (t_0 * t_0)) * (0.25d0 - ((beta * (-0.25d0)) / i))
else
tmp = (i / ((beta + alpha) + (i * 2.0d0))) * ((i + alpha) / 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 = (beta + (i * 2.0)) / i;
double tmp;
if (beta <= 1e+117) {
tmp = (1.0 / (t_0 * t_0)) * (0.25 - ((beta * -0.25) / i));
} else {
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + (i * 2.0)) / i tmp = 0 if beta <= 1e+117: tmp = (1.0 / (t_0 * t_0)) * (0.25 - ((beta * -0.25) / i)) else: tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + alpha) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + Float64(i * 2.0)) / i) tmp = 0.0 if (beta <= 1e+117) tmp = Float64(Float64(1.0 / Float64(t_0 * t_0)) * Float64(0.25 - Float64(Float64(beta * -0.25) / i))); else tmp = Float64(Float64(i / Float64(Float64(beta + alpha) + Float64(i * 2.0))) * Float64(Float64(i + alpha) / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + (i * 2.0)) / i;
tmp = 0.0;
if (beta <= 1e+117)
tmp = (1.0 / (t_0 * t_0)) * (0.25 - ((beta * -0.25) / i));
else
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + 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_] := Block[{t$95$0 = N[(N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]}, If[LessEqual[beta, 1e+117], N[(N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(0.25 - N[(N[(beta * -0.25), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \frac{\beta + i \cdot 2}{i}\\
\mathbf{if}\;\beta \leq 10^{+117}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0} \cdot \left(0.25 - \frac{\beta \cdot -0.25}{i}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\left(\beta + \alpha\right) + i \cdot 2} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 1.00000000000000005e117Initial program 20.0%
associate-/l/17.9%
associate-/l*21.3%
+-commutative21.3%
Simplified21.3%
Taylor expanded in alpha around 0 17.6%
times-frac42.7%
unpow242.7%
unpow242.7%
unpow242.7%
sub-neg42.7%
unpow242.7%
metadata-eval42.7%
Simplified42.7%
Taylor expanded in i around -inf 41.1%
distribute-rgt-out--41.1%
metadata-eval41.1%
Simplified41.1%
clear-num41.1%
Applied egg-rr41.1%
times-frac82.2%
Simplified82.2%
if 1.00000000000000005e117 < beta Initial program 2.6%
associate-/l/0.1%
associate-/l*3.9%
+-commutative3.9%
Simplified3.9%
associate-*r/0.1%
+-commutative0.1%
fma-undefine0.1%
+-commutative0.1%
*-commutative0.1%
+-commutative0.1%
associate-*l*0.1%
associate-*l*0.1%
times-frac0.1%
Applied egg-rr0.1%
+-commutative0.1%
associate-+l+0.1%
*-commutative0.1%
associate-/l*3.9%
+-commutative3.9%
*-commutative3.9%
Simplified3.9%
Taylor expanded in beta around inf 61.3%
Final simplification78.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (/ i (+ beta (* i 2.0)))))
(if (<= beta 5.7e+115)
(* t_0 (* (+ 0.25 (* 0.25 (/ beta i))) t_0))
(* (/ i (+ (+ beta alpha) (* i 2.0))) (/ (+ i alpha) beta)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = i / (beta + (i * 2.0));
double tmp;
if (beta <= 5.7e+115) {
tmp = t_0 * ((0.25 + (0.25 * (beta / i))) * t_0);
} else {
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + 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) :: t_0
real(8) :: tmp
t_0 = i / (beta + (i * 2.0d0))
if (beta <= 5.7d+115) then
tmp = t_0 * ((0.25d0 + (0.25d0 * (beta / i))) * t_0)
else
tmp = (i / ((beta + alpha) + (i * 2.0d0))) * ((i + alpha) / 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 = i / (beta + (i * 2.0));
double tmp;
if (beta <= 5.7e+115) {
tmp = t_0 * ((0.25 + (0.25 * (beta / i))) * t_0);
} else {
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = i / (beta + (i * 2.0)) tmp = 0 if beta <= 5.7e+115: tmp = t_0 * ((0.25 + (0.25 * (beta / i))) * t_0) else: tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + alpha) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(i / Float64(beta + Float64(i * 2.0))) tmp = 0.0 if (beta <= 5.7e+115) tmp = Float64(t_0 * Float64(Float64(0.25 + Float64(0.25 * Float64(beta / i))) * t_0)); else tmp = Float64(Float64(i / Float64(Float64(beta + alpha) + Float64(i * 2.0))) * Float64(Float64(i + alpha) / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = i / (beta + (i * 2.0));
tmp = 0.0;
if (beta <= 5.7e+115)
tmp = t_0 * ((0.25 + (0.25 * (beta / i))) * t_0);
else
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + 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_] := Block[{t$95$0 = N[(i / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.7e+115], N[(t$95$0 * N[(N[(0.25 + N[(0.25 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(i / N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \frac{i}{\beta + i \cdot 2}\\
\mathbf{if}\;\beta \leq 5.7 \cdot 10^{+115}:\\
\;\;\;\;t\_0 \cdot \left(\left(0.25 + 0.25 \cdot \frac{\beta}{i}\right) \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\left(\beta + \alpha\right) + i \cdot 2} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 5.69999999999999965e115Initial program 20.1%
associate-/l/17.9%
associate-/l*21.4%
+-commutative21.4%
Simplified21.4%
Taylor expanded in alpha around 0 17.7%
times-frac42.9%
unpow242.9%
unpow242.9%
unpow242.9%
sub-neg42.9%
unpow242.9%
metadata-eval42.9%
Simplified42.9%
Taylor expanded in i around -inf 41.3%
distribute-rgt-out--41.3%
metadata-eval41.3%
Simplified41.3%
distribute-lft-in41.3%
times-frac41.3%
*-commutative41.3%
*-commutative41.3%
times-frac82.5%
*-commutative82.5%
*-commutative82.5%
associate-/l*82.5%
Applied egg-rr82.5%
distribute-lft-in82.5%
*-commutative82.5%
associate-*r*82.5%
mul-1-neg82.5%
associate-*r/82.5%
*-commutative82.5%
associate-*r/82.5%
distribute-lft-neg-in82.5%
metadata-eval82.5%
*-commutative82.5%
Simplified82.5%
if 5.69999999999999965e115 < beta Initial program 2.6%
associate-/l/0.1%
associate-/l*3.8%
+-commutative3.8%
Simplified3.8%
associate-*r/0.1%
+-commutative0.1%
fma-undefine0.1%
+-commutative0.1%
*-commutative0.1%
+-commutative0.1%
associate-*l*0.1%
associate-*l*0.1%
times-frac0.1%
Applied egg-rr0.1%
+-commutative0.1%
associate-+l+0.1%
*-commutative0.1%
associate-/l*3.8%
+-commutative3.8%
*-commutative3.8%
Simplified3.8%
Taylor expanded in beta around inf 60.0%
Final simplification78.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7.5e+111) 0.0625 (* (/ i (+ (+ beta alpha) (* i 2.0))) (/ (+ i alpha) beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.5e+111) {
tmp = 0.0625;
} else {
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + 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 <= 7.5d+111) then
tmp = 0.0625d0
else
tmp = (i / ((beta + alpha) + (i * 2.0d0))) * ((i + 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 <= 7.5e+111) {
tmp = 0.0625;
} else {
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7.5e+111: tmp = 0.0625 else: tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + alpha) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7.5e+111) tmp = 0.0625; else tmp = Float64(Float64(i / Float64(Float64(beta + alpha) + Float64(i * 2.0))) * Float64(Float64(i + 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 <= 7.5e+111)
tmp = 0.0625;
else
tmp = (i / ((beta + alpha) + (i * 2.0))) * ((i + 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, 7.5e+111], 0.0625, N[(N[(i / N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.5 \cdot 10^{+111}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\left(\beta + \alpha\right) + i \cdot 2} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 7.49999999999999948e111Initial program 20.3%
associate-/l/18.1%
associate-/l*21.6%
+-commutative21.6%
Simplified21.6%
Taylor expanded in i around inf 82.7%
if 7.49999999999999948e111 < beta Initial program 2.5%
associate-/l/0.1%
associate-/l*3.6%
+-commutative3.6%
Simplified3.6%
associate-*r/0.1%
+-commutative0.1%
fma-undefine0.1%
+-commutative0.1%
*-commutative0.1%
+-commutative0.1%
associate-*l*0.1%
associate-*l*0.1%
times-frac0.1%
Applied egg-rr0.1%
+-commutative0.1%
associate-+l+0.1%
*-commutative0.1%
associate-/l*3.6%
+-commutative3.6%
*-commutative3.6%
Simplified3.6%
Taylor expanded in beta around inf 57.7%
Final simplification78.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 5.8e+116) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.8e+116) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (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 <= 5.8d+116) then
tmp = 0.0625d0
else
tmp = (i / beta) * (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 <= 5.8e+116) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 5.8e+116: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 5.8e+116) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(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 <= 5.8e+116)
tmp = 0.0625;
else
tmp = (i / beta) * (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, 5.8e+116], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.8 \cdot 10^{+116}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 5.8000000000000003e116Initial program 20.0%
associate-/l/17.9%
associate-/l*21.3%
+-commutative21.3%
Simplified21.3%
Taylor expanded in i around inf 82.2%
if 5.8000000000000003e116 < beta Initial program 2.6%
associate-/l/0.1%
associate-/l*3.9%
+-commutative3.9%
Simplified3.9%
Taylor expanded in alpha around 0 0.1%
times-frac16.3%
unpow216.3%
unpow216.3%
unpow216.3%
sub-neg16.3%
unpow216.3%
metadata-eval16.3%
Simplified16.3%
Taylor expanded in beta around -inf 32.1%
distribute-rgt-out--32.1%
metadata-eval32.1%
Simplified32.1%
Taylor expanded in i around 0 32.4%
unpow232.4%
unpow232.4%
times-frac56.7%
Simplified56.7%
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 17.1%
associate-/l/14.9%
associate-/l*18.3%
+-commutative18.3%
Simplified18.3%
Taylor expanded in i around inf 72.9%
herbie shell --seed 2024098
(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)))