
(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 (* i (+ i (+ alpha beta))))
(t_3 (pow (fma 2.0 i beta) 2.0)))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(* i (* (+ i beta) (/ 1.0 (* t_3 (/ (+ t_3 -1.0) (* i (+ i beta)))))))
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(* 0.125 (/ (+ alpha beta) i))))))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 = pow(fma(2.0, i, beta), 2.0);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = i * ((i + beta) * (1.0 / (t_3 * ((t_3 + -1.0) / (i * (i + beta))))));
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i));
}
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 = fma(2.0, i, beta) ^ 2.0 tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(i * Float64(Float64(i + beta) * Float64(1.0 / Float64(t_3 * Float64(Float64(t_3 + -1.0) / Float64(i * Float64(i + beta))))))); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(Float64(alpha + beta) / i))); 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[(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[Power[N[(2.0 * i + beta), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[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], Infinity], N[(i * N[(N[(i + beta), $MachinePrecision] * N[(1.0 / N[(t$95$3 * N[(N[(t$95$3 + -1.0), $MachinePrecision] / N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $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 := {\left(\mathsf{fma}\left(2, i, \beta\right)\right)}^{2}\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\
\;\;\;\;i \cdot \left(\left(i + \beta\right) \cdot \frac{1}{t\_3 \cdot \frac{t\_3 + -1}{i \cdot \left(i + \beta\right)}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\alpha + \beta}{i}\\
\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))) < +inf.0Initial program 50.1%
associate-/l/42.2%
associate-/l*43.9%
+-commutative43.9%
+-commutative43.9%
+-commutative43.9%
associate-+l+43.9%
+-commutative43.9%
associate-*l*43.7%
Simplified43.7%
Taylor expanded in alpha around 0 40.8%
Taylor expanded in alpha around 0 41.7%
clear-num41.8%
inv-pow41.8%
+-commutative41.8%
fma-define41.8%
sub-neg41.8%
+-commutative41.8%
fma-define41.8%
metadata-eval41.8%
Applied egg-rr41.8%
unpow-141.8%
associate-/l*88.9%
+-commutative88.9%
Simplified88.9%
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 #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.0%
associate-/l/0.0%
associate-/l*5.9%
+-commutative5.9%
+-commutative5.9%
+-commutative5.9%
associate-+l+5.9%
+-commutative5.9%
associate-*l*5.9%
Simplified5.9%
Taylor expanded in i around inf 75.6%
Taylor expanded in i around 0 75.6%
div-sub75.6%
distribute-lft-out75.6%
distribute-lft-out75.6%
Applied egg-rr75.6%
distribute-lft-in75.6%
associate-*r*75.6%
metadata-eval75.6%
associate-*r/75.6%
Simplified75.6%
Final simplification80.1%
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)))
(if (<= (/ t_3 (+ t_1 -1.0)) 0.1)
(/ t_3 (+ -1.0 (* t_0 (+ (* i 2.0) (pow (cbrt (+ alpha beta)) 3.0)))))
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(* 0.125 (/ (+ alpha beta) i))))))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;
double tmp;
if ((t_3 / (t_1 + -1.0)) <= 0.1) {
tmp = t_3 / (-1.0 + (t_0 * ((i * 2.0) + pow(cbrt((alpha + beta)), 3.0))));
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
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;
double tmp;
if ((t_3 / (t_1 + -1.0)) <= 0.1) {
tmp = t_3 / (-1.0 + (t_0 * ((i * 2.0) + Math.pow(Math.cbrt((alpha + beta)), 3.0))));
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i));
}
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(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) tmp = 0.0 if (Float64(t_3 / Float64(t_1 + -1.0)) <= 0.1) tmp = Float64(t_3 / Float64(-1.0 + Float64(t_0 * Float64(Float64(i * 2.0) + (cbrt(Float64(alpha + beta)) ^ 3.0))))); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(Float64(alpha + beta) / i))); 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[(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[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[N[(t$95$3 / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], 0.1], N[(t$95$3 / N[(-1.0 + N[(t$95$0 * N[(N[(i * 2.0), $MachinePrecision] + N[Power[N[Power[N[(alpha + beta), $MachinePrecision], 1/3], $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $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{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}\\
\mathbf{if}\;\frac{t\_3}{t\_1 + -1} \leq 0.1:\\
\;\;\;\;\frac{t\_3}{-1 + t\_0 \cdot \left(i \cdot 2 + {\left(\sqrt[3]{\alpha + \beta}\right)}^{3}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\alpha + \beta}{i}\\
\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.5%
add-cube-cbrt99.5%
pow399.6%
Applied egg-rr99.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.6%
associate-/l/0.0%
associate-/l*5.4%
+-commutative5.4%
+-commutative5.4%
+-commutative5.4%
associate-+l+5.4%
+-commutative5.4%
associate-*l*5.4%
Simplified5.4%
Taylor expanded in i around inf 77.8%
Taylor expanded in i around 0 77.8%
div-sub77.8%
distribute-lft-out77.8%
distribute-lft-out77.8%
Applied egg-rr77.8%
distribute-lft-in77.8%
associate-*r*77.8%
metadata-eval77.8%
associate-*r/77.8%
Simplified77.8%
Final simplification81.4%
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 (* i (+ i beta))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) 0.1)
(/ (/ (* t_4 (+ (* alpha beta) t_4)) t_1) t_2)
(-
(/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
(* 0.125 (/ (+ alpha beta) i))))))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 = i * (i + beta);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1) {
tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / 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) :: 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 = i * (i + beta)
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1d0) then
tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2
else
tmp = (((i * 0.0625d0) + ((alpha + beta) * 0.125d0)) / i) - (0.125d0 * ((alpha + beta) / i))
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 = i * (i + beta);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1) {
tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2;
} else {
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i));
}
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 = i * (i + beta) tmp = 0 if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1: tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2 else: tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i)) 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(i * Float64(i + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= 0.1) tmp = Float64(Float64(Float64(t_4 * Float64(Float64(alpha * beta) + t_4)) / t_1) / t_2); else tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(Float64(alpha + beta) / i))); 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 = i * (i + beta);
tmp = 0.0;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= 0.1)
tmp = ((t_4 * ((alpha * beta) + t_4)) / t_1) / t_2;
else
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / 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_] := 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[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], 0.1], N[(N[(N[(t$95$4 * N[(N[(alpha * beta), $MachinePrecision] + t$95$4), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $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 := i \cdot \left(i + \beta\right)\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq 0.1:\\
\;\;\;\;\frac{\frac{t\_4 \cdot \left(\alpha \cdot \beta + t\_4\right)}{t\_1}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\alpha + \beta}{i}\\
\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.5%
Taylor expanded in alpha around inf 97.3%
Taylor expanded in alpha around 0 89.4%
Taylor expanded in alpha around 0 89.2%
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.6%
associate-/l/0.0%
associate-/l*5.4%
+-commutative5.4%
+-commutative5.4%
+-commutative5.4%
associate-+l+5.4%
+-commutative5.4%
associate-*l*5.4%
Simplified5.4%
Taylor expanded in i around inf 77.8%
Taylor expanded in i around 0 77.8%
div-sub77.8%
distribute-lft-out77.8%
distribute-lft-out77.8%
Applied egg-rr77.8%
distribute-lft-in77.8%
associate-*r*77.8%
metadata-eval77.8%
associate-*r/77.8%
Simplified77.8%
Final simplification79.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i) (* 0.125 (/ (+ alpha beta) i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / 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) + ((alpha + beta) * 0.125d0)) / i) - (0.125d0 * ((alpha + beta) / i))
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i));
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i))
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(Float64(alpha + beta) / i))) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / 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[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\alpha + \beta}{i}
\end{array}
Initial program 17.2%
associate-/l/14.5%
associate-/l*18.9%
+-commutative18.9%
+-commutative18.9%
+-commutative18.9%
associate-+l+18.9%
+-commutative18.9%
associate-*l*18.9%
Simplified18.9%
Taylor expanded in i around inf 77.3%
Taylor expanded in i around 0 77.3%
div-sub77.3%
distribute-lft-out77.3%
distribute-lft-out77.3%
Applied egg-rr77.3%
distribute-lft-in77.3%
associate-*r*77.3%
metadata-eval77.3%
associate-*r/77.3%
Simplified77.3%
Final simplification77.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.3e+251) 0.0625 (/ (+ (* (+ alpha beta) 0.125) (* (+ alpha beta) -0.125)) i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.3e+251) {
tmp = 0.0625;
} else {
tmp = (((alpha + beta) * 0.125) + ((alpha + beta) * -0.125)) / 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 <= 2.3d+251) then
tmp = 0.0625d0
else
tmp = (((alpha + beta) * 0.125d0) + ((alpha + beta) * (-0.125d0))) / 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 <= 2.3e+251) {
tmp = 0.0625;
} else {
tmp = (((alpha + beta) * 0.125) + ((alpha + beta) * -0.125)) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.3e+251: tmp = 0.0625 else: tmp = (((alpha + beta) * 0.125) + ((alpha + beta) * -0.125)) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.3e+251) tmp = 0.0625; else tmp = Float64(Float64(Float64(Float64(alpha + beta) * 0.125) + Float64(Float64(alpha + beta) * -0.125)) / 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 <= 2.3e+251)
tmp = 0.0625;
else
tmp = (((alpha + beta) * 0.125) + ((alpha + beta) * -0.125)) / 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, 2.3e+251], 0.0625, N[(N[(N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.3 \cdot 10^{+251}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\alpha + \beta\right) \cdot 0.125 + \left(\alpha + \beta\right) \cdot -0.125}{i}\\
\end{array}
\end{array}
if beta < 2.29999999999999988e251Initial program 18.5%
associate-/l/15.5%
associate-/l*19.9%
+-commutative19.9%
+-commutative19.9%
+-commutative19.9%
associate-+l+19.9%
+-commutative19.9%
associate-*l*19.8%
Simplified19.8%
Taylor expanded in i around inf 76.2%
if 2.29999999999999988e251 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*5.9%
+-commutative5.9%
+-commutative5.9%
+-commutative5.9%
associate-+l+5.9%
+-commutative5.9%
associate-*l*5.9%
Simplified5.9%
Taylor expanded in i around inf 32.9%
Taylor expanded in i around 0 32.9%
cancel-sign-sub-inv32.9%
distribute-lft-in32.9%
associate-*r*32.9%
metadata-eval32.9%
metadata-eval32.9%
*-commutative32.9%
Simplified32.9%
Final simplification73.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i) (/ (* beta 0.125) i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((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) + ((alpha + beta) * 0.125d0)) / i) - ((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) + ((alpha + beta) * 0.125)) / i) - ((beta * 0.125) / i);
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((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(Float64(alpha + beta) * 0.125)) / i) - Float64(Float64(beta * 0.125) / i)) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - ((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[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(N[(beta * 0.125), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - \frac{\beta \cdot 0.125}{i}
\end{array}
Initial program 17.2%
associate-/l/14.5%
associate-/l*18.9%
+-commutative18.9%
+-commutative18.9%
+-commutative18.9%
associate-+l+18.9%
+-commutative18.9%
associate-*l*18.9%
Simplified18.9%
Taylor expanded in i around inf 77.3%
Taylor expanded in i around 0 77.3%
div-sub77.3%
distribute-lft-out77.3%
distribute-lft-out77.3%
Applied egg-rr77.3%
distribute-lft-in77.3%
associate-*r*77.3%
metadata-eval77.3%
associate-*r/77.3%
Simplified77.3%
Taylor expanded in alpha around 0 74.5%
associate-*r/74.5%
Simplified74.5%
Final simplification74.5%
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 17.2%
associate-/l/14.5%
associate-/l*18.9%
+-commutative18.9%
+-commutative18.9%
+-commutative18.9%
associate-+l+18.9%
+-commutative18.9%
associate-*l*18.9%
Simplified18.9%
Taylor expanded in i around inf 77.3%
Taylor expanded in i around 0 77.3%
Taylor expanded in alpha around 0 74.3%
*-commutative74.3%
Simplified74.3%
Final simplification74.3%
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.2%
associate-/l/14.5%
associate-/l*18.9%
+-commutative18.9%
+-commutative18.9%
+-commutative18.9%
associate-+l+18.9%
+-commutative18.9%
associate-*l*18.9%
Simplified18.9%
Taylor expanded in i around inf 71.5%
herbie shell --seed 2024181
(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)))