
(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 5 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 2.1e+106)
(- 0.0625 (* 0.125 (/ alpha i)))
(/
1.0
(+
4.0
(*
beta
(+
(fma 2.0 (/ alpha (* i (+ alpha i))) (/ 4.0 (+ alpha i)))
(/ (/ beta i) (+ alpha i))))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.1e+106) {
tmp = 0.0625 - (0.125 * (alpha / i));
} else {
tmp = 1.0 / (4.0 + (beta * (fma(2.0, (alpha / (i * (alpha + i))), (4.0 / (alpha + i))) + ((beta / i) / (alpha + i)))));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.1e+106) tmp = Float64(0.0625 - Float64(0.125 * Float64(alpha / i))); else tmp = Float64(1.0 / Float64(4.0 + Float64(beta * Float64(fma(2.0, Float64(alpha / Float64(i * Float64(alpha + i))), Float64(4.0 / Float64(alpha + i))) + Float64(Float64(beta / i) / 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_] := If[LessEqual[beta, 2.1e+106], N[(0.0625 - N[(0.125 * N[(alpha / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(4.0 + N[(beta * N[(N[(2.0 * N[(alpha / N[(i * N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(4.0 / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(beta / i), $MachinePrecision] / N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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^{+106}:\\
\;\;\;\;0.0625 - 0.125 \cdot \frac{\alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{4 + \beta \cdot \left(\mathsf{fma}\left(2, \frac{\alpha}{i \cdot \left(\alpha + i\right)}, \frac{4}{\alpha + i}\right) + \frac{\frac{\beta}{i}}{\alpha + i}\right)}\\
\end{array}
\end{array}
if beta < 2.10000000000000005e106Initial program 18.2%
associate-/l/15.5%
associate-*l*15.4%
associate-/l*15.6%
Simplified39.8%
Taylor expanded in i around inf 83.6%
Taylor expanded in alpha around 0 80.8%
Taylor expanded in beta around 0 80.8%
if 2.10000000000000005e106 < beta Initial program 1.7%
Taylor expanded in beta around -inf 28.2%
associate-*r*28.2%
mul-1-neg28.2%
distribute-lft-out28.2%
Simplified28.2%
clear-num28.2%
inv-pow28.2%
sub-neg28.2%
pow228.2%
associate-+l+28.2%
+-commutative28.2%
fma-define28.2%
metadata-eval28.2%
mul-1-neg28.2%
Applied egg-rr28.2%
unpow-128.2%
+-commutative28.2%
Simplified28.2%
Taylor expanded in beta around 0 41.8%
associate--l+41.8%
associate-+r+41.8%
fma-define41.8%
associate-*r/41.8%
metadata-eval41.8%
associate-/r*41.8%
div-sub41.8%
sub-neg41.8%
metadata-eval41.8%
Simplified41.8%
Taylor expanded in i around inf 66.4%
Final simplification77.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.7e+136) 0.0625 (* (/ i beta) (/ (+ alpha i) (fma i 2.0 (+ beta alpha))))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.7e+136) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((alpha + i) / 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 <= 2.7e+136) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) / 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, 2.7e+136], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(alpha + i), $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 2.7 \cdot 10^{+136}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\mathsf{fma}\left(i, 2, \beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 2.7000000000000002e136Initial program 17.8%
associate-/l/14.8%
associate-*l*14.7%
associate-/l*14.9%
Simplified39.8%
Taylor expanded in i around inf 79.6%
if 2.7000000000000002e136 < beta Initial program 0.1%
associate-/l/0.0%
times-frac12.6%
Simplified12.6%
Taylor expanded in beta around inf 22.5%
Taylor expanded in beta around inf 68.4%
Final simplification77.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.7e+138) 0.0625 (* (/ i beta) (/ (+ alpha i) beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.7e+138) {
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 <= 1.7d+138) 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 <= 1.7e+138) {
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 <= 1.7e+138: 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 <= 1.7e+138) 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 <= 1.7e+138)
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, 1.7e+138], 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 1.7 \cdot 10^{+138}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if beta < 1.70000000000000006e138Initial program 17.8%
associate-/l/14.8%
associate-*l*14.7%
associate-/l*14.9%
Simplified39.8%
Taylor expanded in i around inf 79.6%
if 1.70000000000000006e138 < beta Initial program 0.1%
associate-/l/0.0%
times-frac12.6%
Simplified12.6%
Taylor expanded in beta around inf 22.5%
Taylor expanded in beta around inf 41.2%
Taylor expanded in beta around inf 67.9%
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+242) 0.0625 (/ 0.0 i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 5.8e+242) {
tmp = 0.0625;
} else {
tmp = 0.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 <= 5.8d+242) then
tmp = 0.0625d0
else
tmp = 0.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 <= 5.8e+242) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 5.8e+242: tmp = 0.0625 else: tmp = 0.0 / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 5.8e+242) tmp = 0.0625; else tmp = Float64(0.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 <= 5.8e+242)
tmp = 0.0625;
else
tmp = 0.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, 5.8e+242], 0.0625, N[(0.0 / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.8 \cdot 10^{+242}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0}{i}\\
\end{array}
\end{array}
if beta < 5.79999999999999994e242Initial program 15.4%
associate-/l/12.8%
associate-*l*12.7%
associate-/l*12.9%
Simplified35.9%
Taylor expanded in i around inf 73.6%
if 5.79999999999999994e242 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified14.8%
Taylor expanded in i around inf 49.7%
Taylor expanded in i around 0 49.7%
Taylor expanded in i around 0 37.8%
distribute-lft-in37.8%
associate-*r*37.8%
metadata-eval37.8%
+-inverses37.8%
Simplified37.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 13.8%
associate-/l/11.4%
associate-*l*11.4%
associate-/l*11.5%
Simplified33.6%
Taylor expanded in i around inf 67.5%
herbie shell --seed 2024092
(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)))