
(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 8 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 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* i (+ i (+ alpha beta))))
(t_4 (* t_3 (+ t_3 (* alpha beta)))))
(if (<= (/ (/ t_4 t_1) t_2) 0.1)
(/ (/ t_4 (* t_0 (* i (+ 2.0 (+ (/ beta i) (/ alpha i)))))) t_2)
(-
(+ 0.0625 (* 0.0625 (+ 1.0 (+ (* 2.0 (/ (+ alpha beta) i)) -1.0))))
(* (/ beta i) 0.125)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double t_4 = t_3 * (t_3 + (alpha * beta));
double tmp;
if (((t_4 / t_1) / t_2) <= 0.1) {
tmp = (t_4 / (t_0 * (i * (2.0 + ((beta / i) + (alpha / i)))))) / t_2;
} else {
tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125);
}
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) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: tmp
t_0 = (alpha + beta) + (i * 2.0d0)
t_1 = t_0 * t_0
t_2 = t_1 + (-1.0d0)
t_3 = i * (i + (alpha + beta))
t_4 = t_3 * (t_3 + (alpha * beta))
if (((t_4 / t_1) / t_2) <= 0.1d0) then
tmp = (t_4 / (t_0 * (i * (2.0d0 + ((beta / i) + (alpha / i)))))) / t_2
else
tmp = (0.0625d0 + (0.0625d0 * (1.0d0 + ((2.0d0 * ((alpha + beta) / i)) + (-1.0d0))))) - ((beta / i) * 0.125d0)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = i * (i + (alpha + beta));
double t_4 = t_3 * (t_3 + (alpha * beta));
double tmp;
if (((t_4 / t_1) / t_2) <= 0.1) {
tmp = (t_4 / (t_0 * (i * (2.0 + ((beta / i) + (alpha / i)))))) / t_2;
} else {
tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = t_1 + -1.0 t_3 = i * (i + (alpha + beta)) t_4 = t_3 * (t_3 + (alpha * beta)) tmp = 0 if ((t_4 / t_1) / t_2) <= 0.1: tmp = (t_4 / (t_0 * (i * (2.0 + ((beta / i) + (alpha / i)))))) / t_2 else: tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) t_4 = Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) tmp = 0.0 if (Float64(Float64(t_4 / t_1) / t_2) <= 0.1) tmp = Float64(Float64(t_4 / Float64(t_0 * Float64(i * Float64(2.0 + Float64(Float64(beta / i) + Float64(alpha / i)))))) / t_2); else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(1.0 + Float64(Float64(2.0 * Float64(Float64(alpha + beta) / i)) + -1.0)))) - Float64(Float64(beta / i) * 0.125)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = t_1 + -1.0;
t_3 = i * (i + (alpha + beta));
t_4 = t_3 * (t_3 + (alpha * beta));
tmp = 0.0;
if (((t_4 / t_1) / t_2) <= 0.1)
tmp = (t_4 / (t_0 * (i * (2.0 + ((beta / i) + (alpha / i)))))) / t_2;
else
tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125);
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[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$4 / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], 0.1], N[(N[(t$95$4 / N[(t$95$0 * N[(i * N[(2.0 + N[(N[(beta / i), $MachinePrecision] + N[(alpha / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(0.0625 * N[(1.0 + N[(N[(2.0 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_4 := t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)\\
\mathbf{if}\;\frac{\frac{t\_4}{t\_1}}{t\_2} \leq 0.1:\\
\;\;\;\;\frac{\frac{t\_4}{t\_0 \cdot \left(i \cdot \left(2 + \left(\frac{\beta}{i} + \frac{\alpha}{i}\right)\right)\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \left(1 + \left(2 \cdot \frac{\alpha + \beta}{i} + -1\right)\right)\right) - \frac{\beta}{i} \cdot 0.125\\
\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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 0.10000000000000001Initial program 99.6%
add-cbrt-cube99.5%
pow1/373.3%
pow373.3%
Applied egg-rr73.3%
Taylor expanded in i around inf 99.6%
+-commutative99.6%
Simplified99.6%
if 0.10000000000000001 < (/.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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.8%
associate-/l/0.0%
associate-/l*3.9%
+-commutative3.9%
+-commutative3.9%
+-commutative3.9%
associate-+l+3.9%
+-commutative3.9%
associate-*l*3.9%
Simplified3.9%
Taylor expanded in i around inf 78.7%
div-inv77.2%
distribute-lft-out77.2%
Applied egg-rr77.2%
div-inv78.7%
expm1-log1p-u71.1%
expm1-undefine71.1%
log1p-expm1-u71.1%
log1p-undefine71.1%
rem-exp-log71.1%
expm1-log1p-u78.7%
associate-/l*78.7%
Applied egg-rr78.7%
associate--l+78.7%
Simplified78.7%
Taylor expanded in alpha around 0 74.4%
Final simplification77.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 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ alpha beta))))
(t_3 (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0))))
(if (<= t_3 0.1)
t_3
(-
(+ 0.0625 (* 0.0625 (+ 1.0 (+ (* 2.0 (/ (+ alpha beta) i)) -1.0))))
(* (/ beta i) 0.125)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (alpha + beta));
double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125);
}
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) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_0 = (alpha + beta) + (i * 2.0d0)
t_1 = t_0 * t_0
t_2 = i * (i + (alpha + beta))
t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + (-1.0d0))
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (0.0625d0 + (0.0625d0 * (1.0d0 + ((2.0d0 * ((alpha + beta) / i)) + (-1.0d0))))) - ((beta / i) * 0.125d0)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (alpha + beta));
double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (alpha + beta)) t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(1.0 + Float64(Float64(2.0 * Float64(Float64(alpha + beta) / i)) + -1.0)))) - Float64(Float64(beta / i) * 0.125)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (alpha + beta));
t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125);
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[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.0625 + N[(0.0625 * N[(1.0 + N[(N[(2.0 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := \frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1}\\
\mathbf{if}\;t\_3 \leq 0.1:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \left(1 + \left(2 \cdot \frac{\alpha + \beta}{i} + -1\right)\right)\right) - \frac{\beta}{i} \cdot 0.125\\
\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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 0.10000000000000001Initial program 99.6%
if 0.10000000000000001 < (/.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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.8%
associate-/l/0.0%
associate-/l*3.9%
+-commutative3.9%
+-commutative3.9%
+-commutative3.9%
associate-+l+3.9%
+-commutative3.9%
associate-*l*3.9%
Simplified3.9%
Taylor expanded in i around inf 78.7%
div-inv77.2%
distribute-lft-out77.2%
Applied egg-rr77.2%
div-inv78.7%
expm1-log1p-u71.1%
expm1-undefine71.1%
log1p-expm1-u71.1%
log1p-undefine71.1%
rem-exp-log71.1%
expm1-log1p-u78.7%
associate-/l*78.7%
Applied egg-rr78.7%
associate--l+78.7%
Simplified78.7%
Taylor expanded in alpha around 0 74.4%
Final simplification77.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 (/ (+ alpha beta) i))) (- (+ 0.0625 (* 0.0625 (+ 1.0 (+ (* 2.0 t_0) -1.0)))) (* t_0 0.125))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) / i;
return (0.0625 + (0.0625 * (1.0 + ((2.0 * t_0) + -1.0)))) - (t_0 * 0.125);
}
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
t_0 = (alpha + beta) / i
code = (0.0625d0 + (0.0625d0 * (1.0d0 + ((2.0d0 * t_0) + (-1.0d0))))) - (t_0 * 0.125d0)
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) / i;
return (0.0625 + (0.0625 * (1.0 + ((2.0 * t_0) + -1.0)))) - (t_0 * 0.125);
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) / i return (0.0625 + (0.0625 * (1.0 + ((2.0 * t_0) + -1.0)))) - (t_0 * 0.125)
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) / i) return Float64(Float64(0.0625 + Float64(0.0625 * Float64(1.0 + Float64(Float64(2.0 * t_0) + -1.0)))) - Float64(t_0 * 0.125)) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
t_0 = (alpha + beta) / i;
tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * t_0) + -1.0)))) - (t_0 * 0.125);
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[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]}, N[(N[(0.0625 + N[(0.0625 * N[(1.0 + N[(N[(2.0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(t$95$0 * 0.125), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \frac{\alpha + \beta}{i}\\
\left(0.0625 + 0.0625 \cdot \left(1 + \left(2 \cdot t\_0 + -1\right)\right)\right) - t\_0 \cdot 0.125
\end{array}
\end{array}
Initial program 14.3%
associate-/l/12.9%
associate-/l*16.2%
+-commutative16.2%
+-commutative16.2%
+-commutative16.2%
associate-+l+16.2%
+-commutative16.2%
associate-*l*16.2%
Simplified16.2%
Taylor expanded in i around inf 79.6%
div-inv78.3%
distribute-lft-out78.3%
Applied egg-rr78.3%
div-inv79.6%
expm1-log1p-u73.0%
expm1-undefine73.0%
log1p-expm1-u73.0%
log1p-undefine73.0%
rem-exp-log73.0%
expm1-log1p-u79.6%
associate-/l*79.6%
Applied egg-rr79.6%
associate--l+79.6%
Simplified79.6%
Final simplification79.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (+ 0.0625 (* 0.0625 (+ 1.0 (+ (* 2.0 (/ (+ alpha beta) i)) -1.0)))) (* (/ beta i) 0.125)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125);
}
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 + (0.0625d0 * (1.0d0 + ((2.0d0 * ((alpha + beta) / i)) + (-1.0d0))))) - ((beta / i) * 0.125d0)
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125);
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125)
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(0.0625 * Float64(1.0 + Float64(Float64(2.0 * Float64(Float64(alpha + beta) / i)) + -1.0)))) - Float64(Float64(beta / i) * 0.125)) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (0.0625 + (0.0625 * (1.0 + ((2.0 * ((alpha + beta) / i)) + -1.0)))) - ((beta / i) * 0.125);
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.0625 + N[(0.0625 * N[(1.0 + N[(N[(2.0 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\left(0.0625 + 0.0625 \cdot \left(1 + \left(2 \cdot \frac{\alpha + \beta}{i} + -1\right)\right)\right) - \frac{\beta}{i} \cdot 0.125
\end{array}
Initial program 14.3%
associate-/l/12.9%
associate-/l*16.2%
+-commutative16.2%
+-commutative16.2%
+-commutative16.2%
associate-+l+16.2%
+-commutative16.2%
associate-*l*16.2%
Simplified16.2%
Taylor expanded in i around inf 79.6%
div-inv78.3%
distribute-lft-out78.3%
Applied egg-rr78.3%
div-inv79.6%
expm1-log1p-u73.0%
expm1-undefine73.0%
log1p-expm1-u73.0%
log1p-undefine73.0%
rem-exp-log73.0%
expm1-log1p-u79.6%
associate-/l*79.6%
Applied egg-rr79.6%
associate--l+79.6%
Simplified79.6%
Taylor expanded in alpha around 0 75.8%
Final simplification75.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (/ (- (+ (* i 0.0625) (* beta 0.125)) (* (+ alpha beta) 0.125)) i))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
}
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 = (((i * 0.0625d0) + (beta * 0.125d0)) - ((alpha + beta) * 0.125d0)) / i
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(Float64(alpha + beta) * 0.125)) / i) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] - N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i}
\end{array}
Initial program 14.3%
associate-/l/12.9%
associate-/l*16.2%
+-commutative16.2%
+-commutative16.2%
+-commutative16.2%
associate-+l+16.2%
+-commutative16.2%
associate-*l*16.2%
Simplified16.2%
Taylor expanded in i around inf 79.6%
Taylor expanded in i around 0 79.6%
Taylor expanded in alpha around 0 75.5%
*-commutative75.5%
Simplified75.5%
Final simplification75.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (+ 0.0625 (* (/ beta i) 0.125)) (* (/ (+ alpha beta) i) 0.125)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.0625 + ((beta / i) * 0.125)) - (((alpha + beta) / i) * 0.125);
}
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 + ((beta / i) * 0.125d0)) - (((alpha + beta) / i) * 0.125d0)
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (0.0625 + ((beta / i) * 0.125)) - (((alpha + beta) / i) * 0.125);
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.0625 + ((beta / i) * 0.125)) - (((alpha + beta) / i) * 0.125)
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(Float64(beta / i) * 0.125)) - Float64(Float64(Float64(alpha + beta) / i) * 0.125)) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (0.0625 + ((beta / i) * 0.125)) - (((alpha + beta) / i) * 0.125);
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\left(0.0625 + \frac{\beta}{i} \cdot 0.125\right) - \frac{\alpha + \beta}{i} \cdot 0.125
\end{array}
Initial program 14.3%
associate-/l/12.9%
associate-/l*16.2%
+-commutative16.2%
+-commutative16.2%
+-commutative16.2%
associate-+l+16.2%
+-commutative16.2%
associate-*l*16.2%
Simplified16.2%
Taylor expanded in i around inf 79.6%
Taylor expanded in alpha around 0 75.5%
Final simplification75.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.9e+217) 0.0625 0.0))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.9e+217) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
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.9d+217) then
tmp = 0.0625d0
else
tmp = 0.0d0
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.9e+217) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.9e+217: tmp = 0.0625 else: tmp = 0.0 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.9e+217) tmp = 0.0625; else tmp = 0.0; 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.9e+217)
tmp = 0.0625;
else
tmp = 0.0;
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.9e+217], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.9 \cdot 10^{+217}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 1.90000000000000001e217Initial program 15.7%
associate-/l/14.2%
associate-/l*16.9%
+-commutative16.9%
+-commutative16.9%
+-commutative16.9%
associate-+l+16.9%
+-commutative16.9%
associate-*l*16.9%
Simplified16.9%
Taylor expanded in i around inf 79.0%
if 1.90000000000000001e217 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*9.1%
+-commutative9.1%
+-commutative9.1%
+-commutative9.1%
associate-+l+9.1%
+-commutative9.1%
associate-*l*9.1%
Simplified9.1%
Taylor expanded in i around inf 47.2%
Taylor expanded in i around 0 47.2%
Taylor expanded in i around 0 34.2%
div-sub34.2%
distribute-lft-in34.2%
associate-*r*34.2%
metadata-eval34.2%
associate-*r/34.2%
associate-*r/34.2%
+-inverses34.2%
Simplified34.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0;
}
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.0d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0
\end{array}
Initial program 14.3%
associate-/l/12.9%
associate-/l*16.2%
+-commutative16.2%
+-commutative16.2%
+-commutative16.2%
associate-+l+16.2%
+-commutative16.2%
associate-*l*16.2%
Simplified16.2%
Taylor expanded in i around inf 79.6%
Taylor expanded in i around 0 79.6%
Taylor expanded in i around 0 9.6%
div-sub9.6%
distribute-lft-in9.6%
associate-*r*9.6%
metadata-eval9.6%
associate-*r/9.6%
associate-*r/9.6%
+-inverses9.6%
Simplified9.6%
herbie shell --seed 2024179
(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)))