
(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
(let* ((t_0 (* 0.125 (/ beta i)))
(t_1 (/ beta (sqrt (+ i alpha))))
(t_2 (+ (* i 2.0) (+ beta alpha))))
(if (<= beta 5.8e+71)
0.0625
(if (<= beta 2.25e+91)
(/
(*
(/ (* i (+ beta i)) (+ beta (* i 2.0)))
(/ i (/ (+ beta (fma i 2.0 alpha)) (+ (+ beta i) alpha))))
(+ (* t_2 t_2) -1.0))
(if (<= beta 1.56e+218)
(- (+ 0.0625 t_0) t_0)
(* (/ 1.0 t_1) (/ i t_1)))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double t_1 = beta / sqrt((i + alpha));
double t_2 = (i * 2.0) + (beta + alpha);
double tmp;
if (beta <= 5.8e+71) {
tmp = 0.0625;
} else if (beta <= 2.25e+91) {
tmp = (((i * (beta + i)) / (beta + (i * 2.0))) * (i / ((beta + fma(i, 2.0, alpha)) / ((beta + i) + alpha)))) / ((t_2 * t_2) + -1.0);
} else if (beta <= 1.56e+218) {
tmp = (0.0625 + t_0) - t_0;
} else {
tmp = (1.0 / t_1) * (i / t_1);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) t_1 = Float64(beta / sqrt(Float64(i + alpha))) t_2 = Float64(Float64(i * 2.0) + Float64(beta + alpha)) tmp = 0.0 if (beta <= 5.8e+71) tmp = 0.0625; elseif (beta <= 2.25e+91) tmp = Float64(Float64(Float64(Float64(i * Float64(beta + i)) / Float64(beta + Float64(i * 2.0))) * Float64(i / Float64(Float64(beta + fma(i, 2.0, alpha)) / Float64(Float64(beta + i) + alpha)))) / Float64(Float64(t_2 * t_2) + -1.0)); elseif (beta <= 1.56e+218) tmp = Float64(Float64(0.0625 + t_0) - t_0); else tmp = Float64(Float64(1.0 / t_1) * Float64(i / t_1)); 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[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(beta / N[Sqrt[N[(i + alpha), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(i * 2.0), $MachinePrecision] + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.8e+71], 0.0625, If[LessEqual[beta, 2.25e+91], N[(N[(N[(N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i / N[(N[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + i), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$2 * t$95$2), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.56e+218], N[(N[(0.0625 + t$95$0), $MachinePrecision] - t$95$0), $MachinePrecision], N[(N[(1.0 / t$95$1), $MachinePrecision] * N[(i / t$95$1), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
t_1 := \frac{\beta}{\sqrt{i + \alpha}}\\
t_2 := i \cdot 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 5.8 \cdot 10^{+71}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 2.25 \cdot 10^{+91}:\\
\;\;\;\;\frac{\frac{i \cdot \left(\beta + i\right)}{\beta + i \cdot 2} \cdot \frac{i}{\frac{\beta + \mathsf{fma}\left(i, 2, \alpha\right)}{\left(\beta + i\right) + \alpha}}}{t_2 \cdot t_2 + -1}\\
\mathbf{elif}\;\beta \leq 1.56 \cdot 10^{+218}:\\
\;\;\;\;\left(0.0625 + t_0\right) - t_0\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t_1} \cdot \frac{i}{t_1}\\
\end{array}
\end{array}
if beta < 5.80000000000000014e71Initial program 20.3%
associate-/l/18.6%
associate-*l*18.6%
times-frac28.4%
Simplified28.4%
Taylor expanded in i around inf 82.1%
if 5.80000000000000014e71 < beta < 2.25e91Initial program 34.2%
times-frac66.3%
associate-+l+66.3%
+-commutative66.3%
*-commutative66.3%
associate-+r+66.3%
+-commutative66.3%
fma-def66.3%
+-commutative66.3%
+-commutative66.3%
*-commutative66.3%
fma-udef66.3%
+-commutative66.3%
associate-+l+66.3%
*-commutative66.3%
+-commutative66.3%
*-commutative66.3%
associate-+r+66.3%
+-commutative66.3%
fma-def66.3%
Applied egg-rr66.3%
*-commutative66.3%
*-commutative66.3%
associate-/l*66.3%
Simplified66.3%
Taylor expanded in alpha around 0 77.4%
if 2.25e91 < beta < 1.55999999999999997e218Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac2.8%
Simplified2.8%
Taylor expanded in i around inf 60.8%
Taylor expanded in alpha around 0 60.0%
Taylor expanded in i around 0 60.0%
Taylor expanded in alpha around 0 60.8%
if 1.55999999999999997e218 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 42.0%
associate-/l*43.7%
Simplified43.7%
add-sqr-sqrt43.7%
pow243.7%
+-commutative43.7%
Applied egg-rr43.7%
*-un-lft-identity43.7%
unpow243.7%
times-frac43.7%
sqrt-div43.7%
unpow243.7%
sqrt-prod43.7%
add-sqr-sqrt43.7%
sqrt-div43.7%
unpow243.7%
sqrt-prod87.8%
add-sqr-sqrt88.0%
Applied egg-rr88.0%
Final simplification79.6%
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 2.0) (+ beta alpha)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* 0.125 (/ beta i)))
(t_4 (* i (+ i (+ beta alpha)))))
(if (<= (/ (/ (* t_4 (+ t_4 (* beta alpha))) t_1) t_2) INFINITY)
(/
(*
(/ (* i (+ beta i)) (+ beta (* i 2.0)))
(/ i (/ (+ beta (fma i 2.0 alpha)) (+ (+ beta i) alpha))))
t_2)
(- (+ 0.0625 t_3) t_3))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (i * 2.0) + (beta + alpha);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = 0.125 * (beta / i);
double t_4 = i * (i + (beta + alpha));
double tmp;
if ((((t_4 * (t_4 + (beta * alpha))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (((i * (beta + i)) / (beta + (i * 2.0))) * (i / ((beta + fma(i, 2.0, alpha)) / ((beta + i) + alpha)))) / t_2;
} else {
tmp = (0.0625 + t_3) - t_3;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(i * 2.0) + Float64(beta + alpha)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(0.125 * Float64(beta / i)) t_4 = Float64(i * Float64(i + Float64(beta + alpha))) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(beta * alpha))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(Float64(Float64(i * Float64(beta + i)) / Float64(beta + Float64(i * 2.0))) * Float64(i / Float64(Float64(beta + fma(i, 2.0, alpha)) / Float64(Float64(beta + i) + alpha)))) / t_2); else tmp = Float64(Float64(0.0625 + t_3) - t_3); 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[(N[(i * 2.0), $MachinePrecision] + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i / N[(N[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + i), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + t$95$3), $MachinePrecision] - t$95$3), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := i \cdot 2 + \left(\beta + \alpha\right)\\
t_1 := t_0 \cdot t_0\\
t_2 := t_1 + -1\\
t_3 := 0.125 \cdot \frac{\beta}{i}\\
t_4 := i \cdot \left(i + \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\frac{\frac{t_4 \cdot \left(t_4 + \beta \cdot \alpha\right)}{t_1}}{t_2} \leq \infty:\\
\;\;\;\;\frac{\frac{i \cdot \left(\beta + i\right)}{\beta + i \cdot 2} \cdot \frac{i}{\frac{\beta + \mathsf{fma}\left(i, 2, \alpha\right)}{\left(\beta + i\right) + \alpha}}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_3\right) - t_3\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 47.4%
times-frac99.7%
associate-+l+99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
+-commutative99.7%
+-commutative99.7%
*-commutative99.7%
fma-udef99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
Applied egg-rr99.7%
*-commutative99.7%
*-commutative99.7%
associate-/l*99.7%
Simplified99.7%
Taylor expanded in alpha around 0 91.3%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 76.2%
Taylor expanded in alpha around 0 70.9%
Taylor expanded in i around 0 70.9%
Taylor expanded in alpha around 0 72.3%
Final simplification78.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 (* 0.125 (/ beta i)))) (if (<= beta 1.56e+218) (- (+ 0.0625 t_0) t_0) (* (/ i beta) (/ i beta)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 1.56e+218) {
tmp = (0.0625 + t_0) - t_0;
} 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) :: t_0
real(8) :: tmp
t_0 = 0.125d0 * (beta / i)
if (beta <= 1.56d+218) then
tmp = (0.0625d0 + t_0) - t_0
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 t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 1.56e+218) {
tmp = (0.0625 + t_0) - t_0;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) tmp = 0 if beta <= 1.56e+218: tmp = (0.0625 + t_0) - t_0 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (beta <= 1.56e+218) tmp = Float64(Float64(0.0625 + t_0) - t_0); 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)
t_0 = 0.125 * (beta / i);
tmp = 0.0;
if (beta <= 1.56e+218)
tmp = (0.0625 + t_0) - t_0;
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_] := Block[{t$95$0 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.56e+218], N[(N[(0.0625 + t$95$0), $MachinePrecision] - t$95$0), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\beta \leq 1.56 \cdot 10^{+218}:\\
\;\;\;\;\left(0.0625 + t_0\right) - t_0\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 1.55999999999999997e218Initial program 17.8%
associate-/l/15.6%
associate-*l*15.5%
times-frac25.6%
Simplified25.6%
Taylor expanded in i around inf 81.2%
Taylor expanded in alpha around 0 76.5%
Taylor expanded in i around 0 76.5%
Taylor expanded in alpha around 0 77.9%
if 1.55999999999999997e218 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 42.0%
associate-/l*43.7%
Simplified43.7%
Taylor expanded in alpha around 0 43.7%
add-sqr-sqrt43.7%
add-sqr-sqrt43.7%
times-frac43.7%
sqrt-div43.7%
unpow243.7%
sqrt-prod43.7%
add-sqr-sqrt43.7%
associate-/l*43.7%
add-sqr-sqrt43.7%
sqrt-div43.7%
unpow243.7%
sqrt-prod80.1%
add-sqr-sqrt80.1%
associate-/l*80.2%
add-sqr-sqrt80.4%
Applied egg-rr80.4%
Final simplification78.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.56e+218) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.56e+218) {
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 <= 1.56d+218) 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 <= 1.56e+218) {
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 <= 1.56e+218: 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 <= 1.56e+218) 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 <= 1.56e+218)
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, 1.56e+218], 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 1.56 \cdot 10^{+218}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 1.55999999999999997e218Initial program 17.8%
associate-/l/15.6%
associate-*l*15.5%
times-frac25.6%
Simplified25.6%
Taylor expanded in i around inf 77.4%
if 1.55999999999999997e218 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 42.0%
associate-/l*43.7%
Simplified43.7%
Taylor expanded in alpha around 0 43.7%
add-sqr-sqrt43.7%
add-sqr-sqrt43.7%
times-frac43.7%
sqrt-div43.7%
unpow243.7%
sqrt-prod43.7%
add-sqr-sqrt43.7%
associate-/l*43.7%
add-sqr-sqrt43.7%
sqrt-div43.7%
unpow243.7%
sqrt-prod80.1%
add-sqr-sqrt80.1%
associate-/l*80.2%
add-sqr-sqrt80.4%
Applied egg-rr80.4%
Final simplification77.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 16.1%
associate-/l/14.1%
associate-*l*14.0%
times-frac23.2%
Simplified23.2%
Taylor expanded in i around inf 71.5%
Final simplification71.5%
herbie shell --seed 2024021
(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)))