
(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 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 (<= beta 2.2e+93)
0.0625
(if (<= beta 5e+119)
(/
(*
(/ (* i (+ alpha (+ i beta))) (fma i 2.0 (+ alpha beta)))
(/ (* i (+ i beta)) (+ beta (* i 2.0))))
(+ (* t_0 t_0) -1.0))
(if (<= beta 3.5e+167)
0.0625
(pow (* (/ (sqrt i) beta) (sqrt (+ i alpha))) 2.0))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double tmp;
if (beta <= 2.2e+93) {
tmp = 0.0625;
} else if (beta <= 5e+119) {
tmp = (((i * (alpha + (i + beta))) / fma(i, 2.0, (alpha + beta))) * ((i * (i + beta)) / (beta + (i * 2.0)))) / ((t_0 * t_0) + -1.0);
} else if (beta <= 3.5e+167) {
tmp = 0.0625;
} else {
tmp = pow(((sqrt(i) / beta) * sqrt((i + alpha))), 2.0);
}
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 (beta <= 2.2e+93) tmp = 0.0625; elseif (beta <= 5e+119) tmp = Float64(Float64(Float64(Float64(i * Float64(alpha + Float64(i + beta))) / fma(i, 2.0, Float64(alpha + beta))) * Float64(Float64(i * Float64(i + beta)) / Float64(beta + Float64(i * 2.0)))) / Float64(Float64(t_0 * t_0) + -1.0)); elseif (beta <= 3.5e+167) tmp = 0.0625; else tmp = Float64(Float64(sqrt(i) / beta) * sqrt(Float64(i + alpha))) ^ 2.0; 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[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.2e+93], 0.0625, If[LessEqual[beta, 5e+119], N[(N[(N[(N[(i * N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.5e+167], 0.0625, N[Power[N[(N[(N[Sqrt[i], $MachinePrecision] / beta), $MachinePrecision] * N[Sqrt[N[(i + alpha), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
\mathbf{if}\;\beta \leq 2.2 \cdot 10^{+93}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 5 \cdot 10^{+119}:\\
\;\;\;\;\frac{\frac{i \cdot \left(\alpha + \left(i + \beta\right)\right)}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)} \cdot \frac{i \cdot \left(i + \beta\right)}{\beta + i \cdot 2}}{t_0 \cdot t_0 + -1}\\
\mathbf{elif}\;\beta \leq 3.5 \cdot 10^{+167}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\sqrt{i}}{\beta} \cdot \sqrt{i + \alpha}\right)}^{2}\\
\end{array}
\end{array}
if beta < 2.20000000000000021e93 or 4.9999999999999999e119 < beta < 3.49999999999999987e167Initial program 18.5%
associate-/l/16.0%
associate-*l*15.9%
times-frac23.8%
Simplified42.7%
Taylor expanded in i around inf 79.8%
if 2.20000000000000021e93 < beta < 4.9999999999999999e119Initial program 26.5%
times-frac86.9%
associate-+l+86.9%
+-commutative86.9%
*-commutative86.9%
fma-def86.9%
*-commutative86.9%
fma-def86.9%
associate-+l+86.9%
+-commutative86.9%
*-commutative86.9%
fma-def86.9%
Applied egg-rr86.9%
+-commutative86.9%
+-commutative86.9%
+-commutative86.9%
+-commutative86.9%
Simplified86.9%
Taylor expanded in alpha around 0 75.7%
if 3.49999999999999987e167 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified6.0%
Taylor expanded in beta around inf 30.0%
associate-/l*32.1%
+-commutative32.1%
Simplified32.1%
div-inv32.1%
+-commutative32.1%
Applied egg-rr32.1%
add-sqr-sqrt32.1%
pow232.1%
un-div-inv32.1%
sqrt-div32.1%
sqrt-div32.1%
unpow232.1%
sqrt-prod77.1%
add-sqr-sqrt77.3%
+-commutative77.3%
Applied egg-rr77.3%
associate-/r/77.4%
+-commutative77.4%
Simplified77.4%
Final simplification79.3%
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)))
(t_1 (* t_0 t_0))
(t_2 (* 0.125 (/ beta i)))
(t_3 (+ t_1 -1.0))
(t_4 (* i (+ i (+ alpha beta))))
(t_5 (* i (+ alpha (+ i beta))))
(t_6 (fma i 2.0 (+ alpha beta))))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_3) INFINITY)
(/ (* (/ t_5 t_6) (/ (fma alpha beta t_5) t_6)) t_3)
(- (+ 0.0625 t_2) t_2))))assert(alpha < beta);
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 = 0.125 * (beta / i);
double t_3 = t_1 + -1.0;
double t_4 = i * (i + (alpha + beta));
double t_5 = i * (alpha + (i + beta));
double t_6 = fma(i, 2.0, (alpha + beta));
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_3) <= ((double) INFINITY)) {
tmp = ((t_5 / t_6) * (fma(alpha, beta, t_5) / t_6)) / t_3;
} else {
tmp = (0.0625 + t_2) - t_2;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) 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(0.125 * Float64(beta / i)) t_3 = Float64(t_1 + -1.0) t_4 = Float64(i * Float64(i + Float64(alpha + beta))) t_5 = Float64(i * Float64(alpha + Float64(i + beta))) t_6 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_3) <= Inf) tmp = Float64(Float64(Float64(t_5 / t_6) * Float64(fma(alpha, beta, t_5) / t_6)) / t_3); else tmp = Float64(Float64(0.0625 + t_2) - t_2); 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[(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[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(i * N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$3), $MachinePrecision], Infinity], N[(N[(N[(t$95$5 / t$95$6), $MachinePrecision] * N[(N[(alpha * beta + t$95$5), $MachinePrecision] / t$95$6), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[(0.0625 + t$95$2), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := 0.125 \cdot \frac{\beta}{i}\\
t_3 := t_1 + -1\\
t_4 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_5 := i \cdot \left(\alpha + \left(i + \beta\right)\right)\\
t_6 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;\frac{\frac{t_4 \cdot \left(t_4 + \alpha \cdot \beta\right)}{t_1}}{t_3} \leq \infty:\\
\;\;\;\;\frac{\frac{t_5}{t_6} \cdot \frac{\mathsf{fma}\left(\alpha, \beta, t_5\right)}{t_6}}{t_3}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_2\right) - t_2\\
\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 44.5%
times-frac99.7%
associate-+l+99.7%
+-commutative99.7%
*-commutative99.7%
fma-def99.7%
*-commutative99.7%
fma-def99.7%
associate-+l+99.7%
+-commutative99.7%
*-commutative99.7%
fma-def99.7%
Applied egg-rr99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
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%
Simplified4.6%
Taylor expanded in i around inf 78.1%
Taylor expanded in alpha around 0 70.0%
Taylor expanded in alpha around 0 71.3%
Final simplification81.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)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ alpha beta))))
(t_3 (+ t_1 -1.0))
(t_4 (* 0.125 (/ beta i))))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) t_3) INFINITY)
(/
(*
(/ (* i (+ alpha (+ i beta))) (fma i 2.0 (+ alpha beta)))
(/ (* i (+ i beta)) (+ beta (* i 2.0))))
t_3)
(- (+ 0.0625 t_4) t_4))))assert(alpha < beta);
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_1 + -1.0;
double t_4 = 0.125 * (beta / i);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / t_3) <= ((double) INFINITY)) {
tmp = (((i * (alpha + (i + beta))) / fma(i, 2.0, (alpha + beta))) * ((i * (i + beta)) / (beta + (i * 2.0)))) / t_3;
} else {
tmp = (0.0625 + t_4) - t_4;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) 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(t_1 + -1.0) t_4 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / t_3) <= Inf) tmp = Float64(Float64(Float64(Float64(i * Float64(alpha + Float64(i + beta))) / fma(i, 2.0, Float64(alpha + beta))) * Float64(Float64(i * Float64(i + beta)) / Float64(beta + Float64(i * 2.0)))) / t_3); else tmp = Float64(Float64(0.0625 + t_4) - t_4); 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[(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[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$4 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$3), $MachinePrecision], Infinity], N[(N[(N[(N[(i * N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[(0.0625 + t$95$4), $MachinePrecision] - t$95$4), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\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 := t_1 + -1\\
t_4 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_3} \leq \infty:\\
\;\;\;\;\frac{\frac{i \cdot \left(\alpha + \left(i + \beta\right)\right)}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)} \cdot \frac{i \cdot \left(i + \beta\right)}{\beta + i \cdot 2}}{t_3}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_4\right) - t_4\\
\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 44.5%
times-frac99.7%
associate-+l+99.7%
+-commutative99.7%
*-commutative99.7%
fma-def99.7%
*-commutative99.7%
fma-def99.7%
associate-+l+99.7%
+-commutative99.7%
*-commutative99.7%
fma-def99.7%
Applied egg-rr99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 89.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 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%
Simplified4.6%
Taylor expanded in i around inf 78.1%
Taylor expanded in alpha around 0 70.0%
Taylor expanded in alpha around 0 71.3%
Final simplification78.1%
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)))
(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)))
(t_4 (* 0.125 (/ beta i))))
(if (<= t_3 0.1) t_3 (- (+ 0.0625 t_4) t_4))))assert(alpha < beta);
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 t_4 = 0.125 * (beta / i);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + t_4) - t_4;
}
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) :: 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 = i * (i + (alpha + beta))
t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + (-1.0d0))
t_4 = 0.125d0 * (beta / i)
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (0.0625d0 + t_4) - t_4
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 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 t_4 = 0.125 * (beta / i);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + t_4) - t_4;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) 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) t_4 = 0.125 * (beta / i) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (0.0625 + t_4) - t_4 return tmp
alpha, beta = sort([alpha, beta]) 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)) t_4 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(0.0625 + t_4) - t_4); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
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);
t_4 = 0.125 * (beta / i);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (0.0625 + t_4) - t_4;
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]}, 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]}, Block[{t$95$4 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.0625 + t$95$4), $MachinePrecision] - t$95$4), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\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}\\
t_4 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;t_3 \leq 0.1:\\
\;\;\;\;t_3\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_4\right) - t_4\\
\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)) < 0.10000000000000001Initial program 99.5%
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 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.7%
associate-/l/0.0%
associate-*l*0.0%
times-frac6.5%
Simplified27.9%
Taylor expanded in i around inf 78.2%
Taylor expanded in alpha around 0 72.1%
Taylor expanded in alpha around 0 73.2%
Final simplification77.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 6.4e+93)
0.0625
(if (or (<= beta 2.85e+119) (not (<= beta 4.3e+167)))
(* i (/ 1.0 (* beta (/ beta (+ i alpha)))))
0.0625)))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6.4e+93) {
tmp = 0.0625;
} else if ((beta <= 2.85e+119) || !(beta <= 4.3e+167)) {
tmp = i * (1.0 / (beta * (beta / (i + alpha))));
} 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 <= 6.4d+93) then
tmp = 0.0625d0
else if ((beta <= 2.85d+119) .or. (.not. (beta <= 4.3d+167))) then
tmp = i * (1.0d0 / (beta * (beta / (i + alpha))))
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 <= 6.4e+93) {
tmp = 0.0625;
} else if ((beta <= 2.85e+119) || !(beta <= 4.3e+167)) {
tmp = i * (1.0 / (beta * (beta / (i + alpha))));
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 6.4e+93: tmp = 0.0625 elif (beta <= 2.85e+119) or not (beta <= 4.3e+167): tmp = i * (1.0 / (beta * (beta / (i + alpha)))) else: tmp = 0.0625 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 6.4e+93) tmp = 0.0625; elseif ((beta <= 2.85e+119) || !(beta <= 4.3e+167)) tmp = Float64(i * Float64(1.0 / Float64(beta * Float64(beta / Float64(i + alpha))))); 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 <= 6.4e+93)
tmp = 0.0625;
elseif ((beta <= 2.85e+119) || ~((beta <= 4.3e+167)))
tmp = i * (1.0 / (beta * (beta / (i + alpha))));
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, 6.4e+93], 0.0625, If[Or[LessEqual[beta, 2.85e+119], N[Not[LessEqual[beta, 4.3e+167]], $MachinePrecision]], N[(i * N[(1.0 / N[(beta * N[(beta / N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.4 \cdot 10^{+93}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 2.85 \cdot 10^{+119} \lor \neg \left(\beta \leq 4.3 \cdot 10^{+167}\right):\\
\;\;\;\;i \cdot \frac{1}{\beta \cdot \frac{\beta}{i + \alpha}}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if beta < 6.4000000000000003e93 or 2.8500000000000001e119 < beta < 4.3000000000000002e167Initial program 18.5%
associate-/l/16.0%
associate-*l*15.9%
times-frac23.8%
Simplified42.7%
Taylor expanded in i around inf 79.8%
if 6.4000000000000003e93 < beta < 2.8500000000000001e119 or 4.3000000000000002e167 < beta Initial program 4.9%
associate-/l/0.2%
associate-*l*0.2%
times-frac7.1%
Simplified21.1%
Taylor expanded in beta around inf 36.2%
associate-/l*37.9%
+-commutative37.9%
Simplified37.9%
div-inv37.9%
+-commutative37.9%
Applied egg-rr37.9%
unpow237.9%
*-un-lft-identity37.9%
times-frac49.4%
+-commutative49.4%
Applied egg-rr49.4%
Final simplification74.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* 0.125 (/ beta i))))
(if (<= i 420000000.0)
(* i (/ 1.0 (* beta (/ beta (+ i alpha)))))
(- (+ 0.0625 t_0) t_0))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (i <= 420000000.0) {
tmp = i * (1.0 / (beta * (beta / (i + alpha))));
} else {
tmp = (0.0625 + t_0) - t_0;
}
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 = 0.125d0 * (beta / i)
if (i <= 420000000.0d0) then
tmp = i * (1.0d0 / (beta * (beta / (i + alpha))))
else
tmp = (0.0625d0 + t_0) - t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (i <= 420000000.0) {
tmp = i * (1.0 / (beta * (beta / (i + alpha))));
} else {
tmp = (0.0625 + t_0) - t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) tmp = 0 if i <= 420000000.0: tmp = i * (1.0 / (beta * (beta / (i + alpha)))) else: tmp = (0.0625 + t_0) - t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (i <= 420000000.0) tmp = Float64(i * Float64(1.0 / Float64(beta * Float64(beta / Float64(i + alpha))))); else tmp = Float64(Float64(0.0625 + t_0) - t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = 0.125 * (beta / i);
tmp = 0.0;
if (i <= 420000000.0)
tmp = i * (1.0 / (beta * (beta / (i + alpha))));
else
tmp = (0.0625 + t_0) - t_0;
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[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 420000000.0], N[(i * N[(1.0 / N[(beta * N[(beta / N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + t$95$0), $MachinePrecision] - t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;i \leq 420000000:\\
\;\;\;\;i \cdot \frac{1}{\beta \cdot \frac{\beta}{i + \alpha}}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_0\right) - t_0\\
\end{array}
\end{array}
if i < 4.2e8Initial program 72.4%
associate-/l/63.7%
associate-*l*63.5%
times-frac72.0%
Simplified82.1%
Taylor expanded in beta around inf 47.6%
associate-/l*47.6%
+-commutative47.6%
Simplified47.6%
div-inv47.6%
+-commutative47.6%
Applied egg-rr47.6%
unpow247.6%
*-un-lft-identity47.6%
times-frac47.6%
+-commutative47.6%
Applied egg-rr47.6%
if 4.2e8 < i Initial program 13.7%
associate-/l/11.1%
associate-*l*11.0%
times-frac18.7%
Simplified37.1%
Taylor expanded in i around inf 78.8%
Taylor expanded in alpha around 0 73.4%
Taylor expanded in alpha around 0 74.4%
Final simplification73.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 8.7e+223) 0.0625 (/ (* 0.125 (- beta (+ alpha beta))) i)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8.7e+223) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (alpha + beta))) / i;
}
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 <= 8.7d+223) then
tmp = 0.0625d0
else
tmp = (0.125d0 * (beta - (alpha + beta))) / i
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8.7e+223) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (alpha + beta))) / i;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 8.7e+223: tmp = 0.0625 else: tmp = (0.125 * (beta - (alpha + beta))) / i return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 8.7e+223) tmp = 0.0625; else tmp = Float64(Float64(0.125 * Float64(beta - Float64(alpha + beta))) / i); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 8.7e+223)
tmp = 0.0625;
else
tmp = (0.125 * (beta - (alpha + beta))) / i;
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, 8.7e+223], 0.0625, N[(N[(0.125 * N[(beta - N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.7 \cdot 10^{+223}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0.125 \cdot \left(\beta - \left(\alpha + \beta\right)\right)}{i}\\
\end{array}
\end{array}
if beta < 8.7000000000000001e223Initial program 17.9%
associate-/l/14.7%
associate-*l*14.6%
times-frac23.2%
Simplified42.2%
Taylor expanded in i around inf 75.4%
if 8.7000000000000001e223 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified8.3%
Taylor expanded in i around inf 45.6%
Taylor expanded in alpha around 0 45.1%
Taylor expanded in i around 0 41.0%
distribute-lft-out--41.0%
Simplified41.0%
Final simplification72.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 16.2%
associate-/l/13.4%
associate-*l*13.3%
times-frac21.0%
Simplified39.1%
Taylor expanded in i around inf 69.0%
Final simplification69.0%
herbie shell --seed 2023306
(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)))