
(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 and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ i beta))))
(if (<= i 9e+125)
(/
(*
(/ (* i (+ i (+ alpha beta))) (fma i 2.0 (+ alpha beta)))
(/ t_0 (+ beta (* i 2.0))))
(+ (+ (* beta beta) (* 4.0 t_0)) -1.0))
0.0625)))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = i * (i + beta);
double tmp;
if (i <= 9e+125) {
tmp = (((i * (i + (alpha + beta))) / fma(i, 2.0, (alpha + beta))) * (t_0 / (beta + (i * 2.0)))) / (((beta * beta) + (4.0 * t_0)) + -1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(i * Float64(i + beta)) tmp = 0.0 if (i <= 9e+125) tmp = Float64(Float64(Float64(Float64(i * Float64(i + Float64(alpha + beta))) / fma(i, 2.0, Float64(alpha + beta))) * Float64(t_0 / Float64(beta + Float64(i * 2.0)))) / Float64(Float64(Float64(beta * beta) + Float64(4.0 * t_0)) + -1.0)); else tmp = 0.0625; end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 9e+125], N[(N[(N[(N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta * beta), $MachinePrecision] + N[(4.0 * t$95$0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := i \cdot \left(i + \beta\right)\\
\mathbf{if}\;i \leq 9 \cdot 10^{+125}:\\
\;\;\;\;\frac{\frac{i \cdot \left(i + \left(\alpha + \beta\right)\right)}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)} \cdot \frac{t_0}{\beta + i \cdot 2}}{\left(\beta \cdot \beta + 4 \cdot t_0\right) + -1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 9.0000000000000001e125Initial program 35.8%
times-frac78.4%
+-commutative78.4%
+-commutative78.4%
*-commutative78.4%
fma-def78.4%
+-commutative78.4%
+-commutative78.4%
*-commutative78.4%
fma-udef78.4%
+-commutative78.4%
*-commutative78.4%
fma-def78.4%
Applied egg-rr78.4%
Taylor expanded in alpha around 0 74.6%
Taylor expanded in beta around -inf 74.6%
unpow274.6%
Simplified74.6%
Taylor expanded in alpha around 0 67.7%
distribute-lft-out67.7%
unpow267.7%
distribute-rgt-out67.7%
+-commutative67.7%
Simplified67.7%
if 9.0000000000000001e125 < i Initial program 0.4%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.4%
Simplified13.7%
Taylor expanded in i around inf 84.2%
Final simplification77.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))) (if (<= i 2.8e+127) (/ (* (* i i) 0.25) (+ (* t_0 t_0) -1.0)) 0.0625)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double tmp;
if (i <= 2.8e+127) {
tmp = ((i * i) * 0.25) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
NOTE: alpha and beta 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 = (alpha + beta) + (i * 2.0d0)
if (i <= 2.8d+127) then
tmp = ((i * i) * 0.25d0) / ((t_0 * t_0) + (-1.0d0))
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double tmp;
if (i <= 2.8e+127) {
tmp = ((i * i) * 0.25) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) tmp = 0 if i <= 2.8e+127: tmp = ((i * i) * 0.25) / ((t_0 * t_0) + -1.0) else: tmp = 0.0625 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) tmp = 0.0 if (i <= 2.8e+127) tmp = Float64(Float64(Float64(i * i) * 0.25) / Float64(Float64(t_0 * t_0) + -1.0)); else tmp = 0.0625; end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
tmp = 0.0;
if (i <= 2.8e+127)
tmp = ((i * i) * 0.25) / ((t_0 * t_0) + -1.0);
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 2.8e+127], N[(N[(N[(i * i), $MachinePrecision] * 0.25), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
\mathbf{if}\;i \leq 2.8 \cdot 10^{+127}:\\
\;\;\;\;\frac{\left(i \cdot i\right) \cdot 0.25}{t_0 \cdot t_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 2.8000000000000002e127Initial program 35.2%
Taylor expanded in i around inf 71.7%
*-commutative71.7%
unpow271.8%
Simplified71.8%
if 2.8000000000000002e127 < i Initial program 0.4%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.4%
Simplified13.2%
Taylor expanded in i around inf 84.6%
Final simplification79.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 3.2e+129)
0.0625
(if (or (<= beta 4.1e+168) (not (<= beta 3.3e+186)))
(* i (/ (/ i beta) beta))
0.0625)))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.2e+129) {
tmp = 0.0625;
} else if ((beta <= 4.1e+168) || !(beta <= 3.3e+186)) {
tmp = i * ((i / beta) / beta);
} else {
tmp = 0.0625;
}
return tmp;
}
NOTE: alpha and beta 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 <= 3.2d+129) then
tmp = 0.0625d0
else if ((beta <= 4.1d+168) .or. (.not. (beta <= 3.3d+186))) then
tmp = i * ((i / beta) / beta)
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.2e+129) {
tmp = 0.0625;
} else if ((beta <= 4.1e+168) || !(beta <= 3.3e+186)) {
tmp = i * ((i / beta) / beta);
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 3.2e+129: tmp = 0.0625 elif (beta <= 4.1e+168) or not (beta <= 3.3e+186): tmp = i * ((i / beta) / beta) else: tmp = 0.0625 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.2e+129) tmp = 0.0625; elseif ((beta <= 4.1e+168) || !(beta <= 3.3e+186)) tmp = Float64(i * Float64(Float64(i / beta) / beta)); else tmp = 0.0625; end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.2e+129)
tmp = 0.0625;
elseif ((beta <= 4.1e+168) || ~((beta <= 3.3e+186)))
tmp = i * ((i / beta) / beta);
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 3.2e+129], 0.0625, If[Or[LessEqual[beta, 4.1e+168], N[Not[LessEqual[beta, 3.3e+186]], $MachinePrecision]], N[(i * N[(N[(i / beta), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2 \cdot 10^{+129}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 4.1 \cdot 10^{+168} \lor \neg \left(\beta \leq 3.3 \cdot 10^{+186}\right):\\
\;\;\;\;i \cdot \frac{\frac{i}{\beta}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if beta < 3.2000000000000002e129 or 4.1000000000000003e168 < beta < 3.30000000000000023e186Initial program 17.3%
associate-/l/15.6%
associate-*l*15.6%
times-frac25.2%
Simplified42.7%
Taylor expanded in i around inf 79.3%
if 3.2000000000000002e129 < beta < 4.1000000000000003e168 or 3.30000000000000023e186 < beta Initial program 0.3%
times-frac23.0%
+-commutative23.0%
+-commutative23.0%
*-commutative23.0%
fma-def23.0%
+-commutative23.0%
+-commutative23.0%
*-commutative23.0%
fma-udef23.0%
+-commutative23.0%
*-commutative23.0%
fma-def23.0%
Applied egg-rr23.0%
Taylor expanded in alpha around 0 23.4%
Taylor expanded in beta around -inf 23.4%
unpow223.4%
Simplified23.4%
Taylor expanded in beta around inf 35.2%
unpow235.2%
associate-*r/36.5%
unpow236.5%
associate-/r*52.8%
Simplified52.8%
Final simplification75.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.2e+236) 0.0625 (* i (/ i (* beta beta)))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.2e+236) {
tmp = 0.0625;
} else {
tmp = i * (i / (beta * beta));
}
return tmp;
}
NOTE: alpha and beta 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.2d+236) then
tmp = 0.0625d0
else
tmp = i * (i / (beta * beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.2e+236) {
tmp = 0.0625;
} else {
tmp = i * (i / (beta * beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 1.2e+236: tmp = 0.0625 else: tmp = i * (i / (beta * beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.2e+236) tmp = 0.0625; else tmp = Float64(i * Float64(i / Float64(beta * beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.2e+236)
tmp = 0.0625;
else
tmp = i * (i / (beta * beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.2e+236], 0.0625, N[(i * N[(i / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.2 \cdot 10^{+236}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;i \cdot \frac{i}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 1.20000000000000006e236Initial program 15.8%
associate-/l/14.3%
associate-*l*14.3%
times-frac23.9%
Simplified41.6%
Taylor expanded in i around inf 75.8%
if 1.20000000000000006e236 < beta Initial program 0.0%
times-frac15.8%
+-commutative15.8%
+-commutative15.8%
*-commutative15.8%
fma-def15.8%
+-commutative15.8%
+-commutative15.8%
*-commutative15.8%
fma-udef15.8%
+-commutative15.8%
*-commutative15.8%
fma-def15.8%
Applied egg-rr15.8%
Taylor expanded in alpha around 0 16.2%
Taylor expanded in beta around inf 39.1%
unpow239.1%
associate-*r/40.4%
unpow240.4%
Simplified40.4%
Final simplification73.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha and beta 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;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return 0.0625
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return 0.0625 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.0625
\end{array}
Initial program 14.7%
associate-/l/13.3%
associate-*l*13.2%
times-frac22.1%
Simplified39.7%
Taylor expanded in i around inf 71.3%
Final simplification71.3%
herbie shell --seed 2023189
(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)))