
(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 7 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 (+ beta (* i 2.0))))
(if (<= beta 4.3e+148)
(*
(/ (+ i (+ beta alpha)) (+ alpha (+ t_0 1.0)))
(/ (* i 0.25) (+ alpha (+ t_0 -1.0))))
(/ (/ (+ i alpha) beta) (/ beta i)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = beta + (i * 2.0);
double tmp;
if (beta <= 4.3e+148) {
tmp = ((i + (beta + alpha)) / (alpha + (t_0 + 1.0))) * ((i * 0.25) / (alpha + (t_0 + -1.0)));
} else {
tmp = ((i + alpha) / beta) / (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) :: tmp
t_0 = beta + (i * 2.0d0)
if (beta <= 4.3d+148) then
tmp = ((i + (beta + alpha)) / (alpha + (t_0 + 1.0d0))) * ((i * 0.25d0) / (alpha + (t_0 + (-1.0d0))))
else
tmp = ((i + alpha) / beta) / (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 = beta + (i * 2.0);
double tmp;
if (beta <= 4.3e+148) {
tmp = ((i + (beta + alpha)) / (alpha + (t_0 + 1.0))) * ((i * 0.25) / (alpha + (t_0 + -1.0)));
} else {
tmp = ((i + alpha) / beta) / (beta / i);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = beta + (i * 2.0) tmp = 0 if beta <= 4.3e+148: tmp = ((i + (beta + alpha)) / (alpha + (t_0 + 1.0))) * ((i * 0.25) / (alpha + (t_0 + -1.0))) else: tmp = ((i + alpha) / beta) / (beta / i) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(beta + Float64(i * 2.0)) tmp = 0.0 if (beta <= 4.3e+148) tmp = Float64(Float64(Float64(i + Float64(beta + alpha)) / Float64(alpha + Float64(t_0 + 1.0))) * Float64(Float64(i * 0.25) / Float64(alpha + Float64(t_0 + -1.0)))); else tmp = Float64(Float64(Float64(i + alpha) / beta) / Float64(beta / i)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = beta + (i * 2.0);
tmp = 0.0;
if (beta <= 4.3e+148)
tmp = ((i + (beta + alpha)) / (alpha + (t_0 + 1.0))) * ((i * 0.25) / (alpha + (t_0 + -1.0)));
else
tmp = ((i + alpha) / beta) / (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[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.3e+148], N[(N[(N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * 0.25), $MachinePrecision] / N[(alpha + N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \beta + i \cdot 2\\
\mathbf{if}\;\beta \leq 4.3 \cdot 10^{+148}:\\
\;\;\;\;\frac{i + \left(\beta + \alpha\right)}{\alpha + \left(t\_0 + 1\right)} \cdot \frac{i \cdot 0.25}{\alpha + \left(t\_0 + -1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i + \alpha}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 4.3000000000000002e148Initial program 22.4%
associate-/l*N/A
*-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Applied egg-rr45.7%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f6439.8%
Simplified39.8%
difference-of-sqr-1N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Applied egg-rr83.1%
if 4.3000000000000002e148 < beta Initial program 0.1%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6419.2%
Simplified19.2%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6466.4%
Applied egg-rr66.4%
associate-/l*N/A
clear-numN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f6466.7%
Applied egg-rr66.7%
Final simplification79.9%
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+148) (+ 0.0625 (/ 0.015625 (* i i))) (/ (/ (+ i alpha) beta) (/ beta i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.8e+148) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = ((i + alpha) / beta) / (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) :: tmp
if (beta <= 3.8d+148) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = ((i + alpha) / beta) / (beta / 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 <= 3.8e+148) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = ((i + alpha) / beta) / (beta / i);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3.8e+148: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = ((i + alpha) / beta) / (beta / i) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.8e+148) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(Float64(i + alpha) / beta) / Float64(beta / 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 <= 3.8e+148)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = ((i + alpha) / beta) / (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_] := If[LessEqual[beta, 3.8e+148], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.8 \cdot 10^{+148}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i + \alpha}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 3.7999999999999998e148Initial program 22.4%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6440.6%
Simplified40.6%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6438.7%
Simplified38.7%
Taylor expanded in i around inf
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6482.6%
Simplified82.6%
if 3.7999999999999998e148 < beta Initial program 0.1%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6419.2%
Simplified19.2%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6466.4%
Applied egg-rr66.4%
associate-/l*N/A
clear-numN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f6466.7%
Applied egg-rr66.7%
Final simplification79.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.1e+148) (+ 0.0625 (/ 0.015625 (* i i))) (* (/ (+ i alpha) beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.1e+148) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = ((i + alpha) / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 4.1d+148) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = ((i + alpha) / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.1e+148) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = ((i + alpha) / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 4.1e+148: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = ((i + alpha) / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.1e+148) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(Float64(i + alpha) / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4.1e+148)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = ((i + alpha) / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 4.1e+148], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.1 \cdot 10^{+148}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 4.0999999999999998e148Initial program 22.4%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6440.6%
Simplified40.6%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6438.7%
Simplified38.7%
Taylor expanded in i around inf
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6482.6%
Simplified82.6%
if 4.0999999999999998e148 < beta Initial program 0.1%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6419.2%
Simplified19.2%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f6466.6%
Applied egg-rr66.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.1e+148) (+ 0.0625 (/ 0.015625 (* i i))) (/ (/ i beta) (/ beta i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.1e+148) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i / beta) / (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) :: tmp
if (beta <= 4.1d+148) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = (i / beta) / (beta / 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 <= 4.1e+148) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i / beta) / (beta / i);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 4.1e+148: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = (i / beta) / (beta / i) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.1e+148) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(i / beta) / Float64(beta / 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 <= 4.1e+148)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = (i / beta) / (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_] := If[LessEqual[beta, 4.1e+148], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.1 \cdot 10^{+148}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 4.0999999999999998e148Initial program 22.4%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6440.6%
Simplified40.6%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6438.7%
Simplified38.7%
Taylor expanded in i around inf
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6482.6%
Simplified82.6%
if 4.0999999999999998e148 < beta Initial program 0.1%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6419.2%
Simplified19.2%
Taylor expanded in i around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6419.4%
Simplified19.4%
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.8%
Applied egg-rr60.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.5e+148) (+ 0.0625 (/ 0.015625 (* i i))) (* (/ i beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.5e+148) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 4.5d+148) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.5e+148) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 4.5e+148: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.5e+148) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4.5e+148)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 4.5e+148], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5 \cdot 10^{+148}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 4.49999999999999994e148Initial program 22.4%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6440.6%
Simplified40.6%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6438.7%
Simplified38.7%
Taylor expanded in i around inf
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6482.6%
Simplified82.6%
if 4.49999999999999994e148 < beta Initial program 0.1%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6419.2%
Simplified19.2%
Taylor expanded in i around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6419.4%
Simplified19.4%
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7%
Applied egg-rr60.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2e+148) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2e+148) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 2d+148) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2e+148) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2e+148: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2e+148) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2e+148)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 2e+148], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2 \cdot 10^{+148}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 2.0000000000000001e148Initial program 22.4%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified19.0%
Taylor expanded in i around inf
Simplified82.3%
if 2.0000000000000001e148 < beta Initial program 0.1%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6419.2%
Simplified19.2%
Taylor expanded in i around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6419.4%
Simplified19.4%
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7%
Applied egg-rr60.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 18.1%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified15.3%
Taylor expanded in i around inf
Simplified71.8%
herbie shell --seed 2024145
(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)))