
(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 (if (<= beta 1.3e+134) 0.0625 (pow (/ (* (sqrt (+ i alpha)) (sqrt i)) beta) 2.0)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.3e+134) {
tmp = 0.0625;
} else {
tmp = pow(((sqrt((i + alpha)) * sqrt(i)) / beta), 2.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.3d+134) then
tmp = 0.0625d0
else
tmp = ((sqrt((i + alpha)) * sqrt(i)) / beta) ** 2.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.3e+134) {
tmp = 0.0625;
} else {
tmp = Math.pow(((Math.sqrt((i + alpha)) * Math.sqrt(i)) / beta), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.3e+134: tmp = 0.0625 else: tmp = math.pow(((math.sqrt((i + alpha)) * math.sqrt(i)) / beta), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.3e+134) tmp = 0.0625; else tmp = Float64(Float64(sqrt(Float64(i + alpha)) * sqrt(i)) / beta) ^ 2.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.3e+134)
tmp = 0.0625;
else
tmp = ((sqrt((i + alpha)) * sqrt(i)) / beta) ^ 2.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.3e+134], 0.0625, N[Power[N[(N[(N[Sqrt[N[(i + alpha), $MachinePrecision]], $MachinePrecision] * N[Sqrt[i], $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision], 2.0], $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+134}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\sqrt{i + \alpha} \cdot \sqrt{i}}{\beta}\right)}^{2}\\
\end{array}
\end{array}
if beta < 1.3000000000000001e134Initial program 17.5%
associate-/l/14.7%
associate-/l*16.4%
+-commutative16.4%
+-commutative16.4%
+-commutative16.4%
associate-+l+16.4%
+-commutative16.4%
associate-*l*16.4%
Simplified16.4%
Taylor expanded in i around inf 80.8%
if 1.3000000000000001e134 < beta Initial program 2.1%
associate-/l/0.2%
associate-/l*10.2%
+-commutative10.2%
+-commutative10.2%
+-commutative10.2%
associate-+l+10.2%
+-commutative10.2%
associate-*l*10.2%
Simplified10.2%
Taylor expanded in beta around inf 22.1%
associate-/l*24.2%
Simplified24.2%
add-sqr-sqrt24.2%
pow224.2%
associate-*r/22.1%
sqrt-div22.0%
sqrt-pow142.7%
metadata-eval42.7%
pow142.7%
Applied egg-rr42.7%
*-commutative42.7%
sqrt-prod64.8%
+-commutative64.8%
Applied egg-rr64.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 (+ (+ beta alpha) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ beta alpha))))
(t_3 (/ (/ (* t_2 (+ t_2 (* beta alpha))) t_1) (+ t_1 -1.0))))
(if (<= t_3 0.1)
t_3
(- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ beta alpha) i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / 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) :: tmp
t_0 = (beta + alpha) + (i * 2.0d0)
t_1 = t_0 * t_0
t_2 = i * (i + (beta + alpha))
t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + (-1.0d0))
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (0.0625d0 + (0.125d0 * (beta / i))) - (0.125d0 * ((beta + alpha) / 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 = (beta + alpha) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + alpha) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (beta + alpha)) t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(beta + alpha))) t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(beta * alpha))) / 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.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (beta + alpha));
t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / 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[(beta + alpha), $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[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 * N[(t$95$2 + N[(beta * alpha), $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.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\beta + \alpha\right)\right)\\
t_3 := \frac{\frac{t\_2 \cdot \left(t\_2 + \beta \cdot \alpha\right)}{t\_1}}{t\_1 + -1}\\
\mathbf{if}\;t\_3 \leq 0.1:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{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.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*4.0%
+-commutative4.0%
+-commutative4.0%
+-commutative4.0%
associate-+l+4.0%
+-commutative4.0%
associate-*l*4.0%
Simplified4.0%
Taylor expanded in i around inf 75.6%
Taylor expanded in alpha around 0 71.5%
Final simplification75.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.3e+134) 0.0625 (pow (/ i beta) 2.0)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.3e+134) {
tmp = 0.0625;
} else {
tmp = pow((i / beta), 2.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.3d+134) then
tmp = 0.0625d0
else
tmp = (i / beta) ** 2.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.3e+134) {
tmp = 0.0625;
} else {
tmp = Math.pow((i / beta), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.3e+134: tmp = 0.0625 else: tmp = math.pow((i / beta), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.3e+134) tmp = 0.0625; else tmp = Float64(i / beta) ^ 2.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.3e+134)
tmp = 0.0625;
else
tmp = (i / beta) ^ 2.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.3e+134], 0.0625, N[Power[N[(i / beta), $MachinePrecision], 2.0], $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+134}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{i}{\beta}\right)}^{2}\\
\end{array}
\end{array}
if beta < 1.3000000000000001e134Initial program 17.5%
associate-/l/14.7%
associate-/l*16.4%
+-commutative16.4%
+-commutative16.4%
+-commutative16.4%
associate-+l+16.4%
+-commutative16.4%
associate-*l*16.4%
Simplified16.4%
Taylor expanded in i around inf 80.8%
if 1.3000000000000001e134 < beta Initial program 2.1%
associate-/l/0.2%
associate-/l*10.2%
+-commutative10.2%
+-commutative10.2%
+-commutative10.2%
associate-+l+10.2%
+-commutative10.2%
associate-*l*10.2%
Simplified10.2%
Taylor expanded in beta around inf 22.1%
associate-/l*24.2%
Simplified24.2%
add-sqr-sqrt24.2%
pow224.2%
associate-*r/22.1%
sqrt-div22.0%
sqrt-pow142.7%
metadata-eval42.7%
pow142.7%
Applied egg-rr42.7%
Taylor expanded in i around inf 57.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 1.3e+134)
0.0625
(if (<= beta 8e+213)
(/ 1.0 (/ beta (/ (* i (+ i alpha)) beta)))
(- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ beta alpha) i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.3e+134) {
tmp = 0.0625;
} else if (beta <= 8e+213) {
tmp = 1.0 / (beta / ((i * (i + alpha)) / beta));
} else {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / 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 <= 1.3d+134) then
tmp = 0.0625d0
else if (beta <= 8d+213) then
tmp = 1.0d0 / (beta / ((i * (i + alpha)) / beta))
else
tmp = (0.0625d0 + (0.125d0 * (beta / i))) - (0.125d0 * ((beta + alpha) / 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 <= 1.3e+134) {
tmp = 0.0625;
} else if (beta <= 8e+213) {
tmp = 1.0 / (beta / ((i * (i + alpha)) / beta));
} else {
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.3e+134: tmp = 0.0625 elif beta <= 8e+213: tmp = 1.0 / (beta / ((i * (i + alpha)) / beta)) else: tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.3e+134) tmp = 0.0625; elseif (beta <= 8e+213) tmp = Float64(1.0 / Float64(beta / Float64(Float64(i * Float64(i + alpha)) / beta))); else tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / 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 <= 1.3e+134)
tmp = 0.0625;
elseif (beta <= 8e+213)
tmp = 1.0 / (beta / ((i * (i + alpha)) / beta));
else
tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((beta + alpha) / 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, 1.3e+134], 0.0625, If[LessEqual[beta, 8e+213], N[(1.0 / N[(beta / N[(N[(i * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+134}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 8 \cdot 10^{+213}:\\
\;\;\;\;\frac{1}{\frac{\beta}{\frac{i \cdot \left(i + \alpha\right)}{\beta}}}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\end{array}
\end{array}
if beta < 1.3000000000000001e134Initial program 17.5%
associate-/l/14.7%
associate-/l*16.4%
+-commutative16.4%
+-commutative16.4%
+-commutative16.4%
associate-+l+16.4%
+-commutative16.4%
associate-*l*16.4%
Simplified16.4%
Taylor expanded in i around inf 80.8%
if 1.3000000000000001e134 < beta < 7.99999999999999987e213Initial program 4.4%
associate-/l/0.3%
associate-/l*8.8%
+-commutative8.8%
+-commutative8.8%
+-commutative8.8%
associate-+l+8.8%
+-commutative8.8%
associate-*l*8.8%
Simplified8.8%
Taylor expanded in beta around inf 25.5%
associate-/l*26.5%
Simplified26.5%
add-sqr-sqrt26.6%
pow226.6%
associate-*r/25.5%
sqrt-div25.4%
sqrt-pow157.9%
metadata-eval57.9%
pow157.9%
Applied egg-rr57.9%
unpow257.9%
clear-num57.9%
clear-num57.9%
frac-times56.6%
metadata-eval56.6%
+-commutative56.6%
+-commutative56.6%
Applied egg-rr56.6%
clear-num56.6%
frac-times56.7%
*-un-lft-identity56.7%
+-commutative56.7%
+-commutative56.7%
Applied egg-rr56.7%
associate-*l/56.5%
rem-square-sqrt56.7%
Simplified56.7%
if 7.99999999999999987e213 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*11.5%
+-commutative11.5%
+-commutative11.5%
+-commutative11.5%
associate-+l+11.5%
+-commutative11.5%
associate-*l*11.5%
Simplified11.5%
Taylor expanded in i around inf 44.1%
Taylor expanded in alpha around 0 42.3%
Final simplification74.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 1.3e+134)
0.0625
(if (<= beta 3.6e+212)
(/ 1.0 (/ beta (/ (* i (+ i alpha)) beta)))
(/ (- (+ (* 0.0625 i) (* beta 0.125)) (* beta 0.125)) i))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.3e+134) {
tmp = 0.0625;
} else if (beta <= 3.6e+212) {
tmp = 1.0 / (beta / ((i * (i + alpha)) / beta));
} else {
tmp = (((0.0625 * i) + (beta * 0.125)) - (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 <= 1.3d+134) then
tmp = 0.0625d0
else if (beta <= 3.6d+212) then
tmp = 1.0d0 / (beta / ((i * (i + alpha)) / beta))
else
tmp = (((0.0625d0 * i) + (beta * 0.125d0)) - (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 <= 1.3e+134) {
tmp = 0.0625;
} else if (beta <= 3.6e+212) {
tmp = 1.0 / (beta / ((i * (i + alpha)) / beta));
} else {
tmp = (((0.0625 * i) + (beta * 0.125)) - (beta * 0.125)) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.3e+134: tmp = 0.0625 elif beta <= 3.6e+212: tmp = 1.0 / (beta / ((i * (i + alpha)) / beta)) else: tmp = (((0.0625 * i) + (beta * 0.125)) - (beta * 0.125)) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.3e+134) tmp = 0.0625; elseif (beta <= 3.6e+212) tmp = Float64(1.0 / Float64(beta / Float64(Float64(i * Float64(i + alpha)) / beta))); else tmp = Float64(Float64(Float64(Float64(0.0625 * i) + Float64(beta * 0.125)) - Float64(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 <= 1.3e+134)
tmp = 0.0625;
elseif (beta <= 3.6e+212)
tmp = 1.0 / (beta / ((i * (i + alpha)) / beta));
else
tmp = (((0.0625 * i) + (beta * 0.125)) - (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, 1.3e+134], 0.0625, If[LessEqual[beta, 3.6e+212], N[(1.0 / N[(beta / N[(N[(i * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(0.0625 * i), $MachinePrecision] + N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] - N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+134}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 3.6 \cdot 10^{+212}:\\
\;\;\;\;\frac{1}{\frac{\beta}{\frac{i \cdot \left(i + \alpha\right)}{\beta}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(0.0625 \cdot i + \beta \cdot 0.125\right) - \beta \cdot 0.125}{i}\\
\end{array}
\end{array}
if beta < 1.3000000000000001e134Initial program 17.5%
associate-/l/14.7%
associate-/l*16.4%
+-commutative16.4%
+-commutative16.4%
+-commutative16.4%
associate-+l+16.4%
+-commutative16.4%
associate-*l*16.4%
Simplified16.4%
Taylor expanded in i around inf 80.8%
if 1.3000000000000001e134 < beta < 3.6e212Initial program 4.4%
associate-/l/0.3%
associate-/l*8.8%
+-commutative8.8%
+-commutative8.8%
+-commutative8.8%
associate-+l+8.8%
+-commutative8.8%
associate-*l*8.8%
Simplified8.8%
Taylor expanded in beta around inf 25.5%
associate-/l*26.5%
Simplified26.5%
add-sqr-sqrt26.6%
pow226.6%
associate-*r/25.5%
sqrt-div25.4%
sqrt-pow157.9%
metadata-eval57.9%
pow157.9%
Applied egg-rr57.9%
unpow257.9%
clear-num57.9%
clear-num57.9%
frac-times56.6%
metadata-eval56.6%
+-commutative56.6%
+-commutative56.6%
Applied egg-rr56.6%
clear-num56.6%
frac-times56.7%
*-un-lft-identity56.7%
+-commutative56.7%
+-commutative56.7%
Applied egg-rr56.7%
associate-*l/56.5%
rem-square-sqrt56.7%
Simplified56.7%
if 3.6e212 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*11.5%
+-commutative11.5%
+-commutative11.5%
+-commutative11.5%
associate-+l+11.5%
+-commutative11.5%
associate-*l*11.5%
Simplified11.5%
Taylor expanded in i around inf 44.1%
Taylor expanded in alpha around 0 42.3%
Taylor expanded in i around 0 42.3%
Taylor expanded in alpha around 0 44.1%
Final simplification74.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.25e+134) 0.0625 (/ 1.0 (/ beta (/ (* i (+ i alpha)) beta)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.25e+134) {
tmp = 0.0625;
} else {
tmp = 1.0 / (beta / ((i * (i + alpha)) / beta));
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.25d+134) then
tmp = 0.0625d0
else
tmp = 1.0d0 / (beta / ((i * (i + alpha)) / beta))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.25e+134) {
tmp = 0.0625;
} else {
tmp = 1.0 / (beta / ((i * (i + alpha)) / beta));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.25e+134: tmp = 0.0625 else: tmp = 1.0 / (beta / ((i * (i + alpha)) / beta)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.25e+134) tmp = 0.0625; else tmp = Float64(1.0 / Float64(beta / Float64(Float64(i * Float64(i + alpha)) / beta))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.25e+134)
tmp = 0.0625;
else
tmp = 1.0 / (beta / ((i * (i + alpha)) / beta));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.25e+134], 0.0625, N[(1.0 / N[(beta / N[(N[(i * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.25 \cdot 10^{+134}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{\beta}{\frac{i \cdot \left(i + \alpha\right)}{\beta}}}\\
\end{array}
\end{array}
if beta < 1.24999999999999995e134Initial program 17.5%
associate-/l/14.7%
associate-/l*16.4%
+-commutative16.4%
+-commutative16.4%
+-commutative16.4%
associate-+l+16.4%
+-commutative16.4%
associate-*l*16.4%
Simplified16.4%
Taylor expanded in i around inf 80.8%
if 1.24999999999999995e134 < beta Initial program 2.1%
associate-/l/0.2%
associate-/l*10.2%
+-commutative10.2%
+-commutative10.2%
+-commutative10.2%
associate-+l+10.2%
+-commutative10.2%
associate-*l*10.2%
Simplified10.2%
Taylor expanded in beta around inf 22.1%
associate-/l*24.2%
Simplified24.2%
add-sqr-sqrt24.2%
pow224.2%
associate-*r/22.1%
sqrt-div22.0%
sqrt-pow142.7%
metadata-eval42.7%
pow142.7%
Applied egg-rr42.7%
unpow242.7%
clear-num42.8%
clear-num42.7%
frac-times41.6%
metadata-eval41.6%
+-commutative41.6%
+-commutative41.6%
Applied egg-rr41.6%
clear-num41.5%
frac-times41.6%
*-un-lft-identity41.6%
+-commutative41.6%
+-commutative41.6%
Applied egg-rr41.6%
associate-*l/41.5%
rem-square-sqrt41.6%
Simplified41.6%
Final simplification73.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.8e+232) 0.0625 0.0))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.8e+232) {
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 <= 3.8d+232) 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 <= 3.8e+232) {
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 <= 3.8e+232: 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 <= 3.8e+232) 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 <= 3.8e+232)
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, 3.8e+232], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.8 \cdot 10^{+232}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 3.8000000000000001e232Initial program 15.7%
associate-/l/12.8%
associate-/l*15.2%
+-commutative15.2%
+-commutative15.2%
+-commutative15.2%
associate-+l+15.2%
+-commutative15.2%
associate-*l*15.1%
Simplified15.1%
Taylor expanded in i around inf 74.6%
if 3.8000000000000001e232 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*15.8%
+-commutative15.8%
+-commutative15.8%
+-commutative15.8%
associate-+l+15.8%
+-commutative15.8%
associate-*l*15.8%
Simplified15.8%
Taylor expanded in i around inf 43.6%
Taylor expanded in i around 0 28.7%
div-sub28.7%
distribute-lft-in28.7%
associate-*r*28.7%
metadata-eval28.7%
associate-*r/28.7%
associate-*r/28.7%
+-inverses28.7%
Simplified28.7%
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.5%
associate-/l/11.8%
associate-/l*15.2%
+-commutative15.2%
+-commutative15.2%
+-commutative15.2%
associate-+l+15.2%
+-commutative15.2%
associate-*l*15.2%
Simplified15.2%
Taylor expanded in i around inf 75.5%
Taylor expanded in i around 0 8.5%
div-sub8.5%
distribute-lft-in8.5%
associate-*r*8.5%
metadata-eval8.5%
associate-*r/8.5%
associate-*r/8.5%
+-inverses8.5%
Simplified8.5%
herbie shell --seed 2024180
(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)))