
(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 9 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 3.1e+137) (+ 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.1e+137) {
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.1d+137) 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.1e+137) {
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.1e+137: 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.1e+137) 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.1e+137)
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.1e+137], 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.1 \cdot 10^{+137}:\\
\;\;\;\;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.0999999999999999e137Initial program 19.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified16.9%
Taylor expanded in i around inf
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified81.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6481.8
Simplified81.8%
if 3.0999999999999999e137 < beta Initial program 4.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6432.7
Simplified32.7%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f6478.9
Applied egg-rr78.9%
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f6479.2
Applied egg-rr79.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 8e+137) (+ 0.0625 (/ 0.015625 (* i i))) (/ (* i (/ (+ i alpha) beta)) beta)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8e+137) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i * ((i + alpha) / beta)) / 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 <= 8d+137) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = (i * ((i + alpha) / beta)) / 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 <= 8e+137) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i * ((i + alpha) / beta)) / beta;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 8e+137: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = (i * ((i + alpha) / beta)) / beta return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 8e+137) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(i * Float64(Float64(i + alpha) / beta)) / 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 <= 8e+137)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = (i * ((i + alpha) / beta)) / 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, 8e+137], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8 \cdot 10^{+137}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \frac{i + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 8.0000000000000003e137Initial program 19.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified16.9%
Taylor expanded in i around inf
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified81.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6481.8
Simplified81.8%
if 8.0000000000000003e137 < beta Initial program 4.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6432.7
Simplified32.7%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6454.3
Applied egg-rr54.3%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6479.0
Applied egg-rr79.0%
Final simplification81.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.85e+138) (+ 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 <= 1.85e+138) {
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 <= 1.85d+138) 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 <= 1.85e+138) {
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 <= 1.85e+138: 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 <= 1.85e+138) 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 <= 1.85e+138)
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, 1.85e+138], 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 1.85 \cdot 10^{+138}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 1.8499999999999999e138Initial program 19.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified16.9%
Taylor expanded in i around inf
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified81.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6481.8
Simplified81.8%
if 1.8499999999999999e138 < beta Initial program 4.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6432.7
Simplified32.7%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f6478.9
Applied egg-rr78.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.6e+138) (+ 0.0625 (/ 0.015625 (* i i))) (/ (* i (/ i beta)) beta)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.6e+138) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i * (i / beta)) / 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.6d+138) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = (i * (i / beta)) / 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.6e+138) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i * (i / beta)) / beta;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.6e+138: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = (i * (i / beta)) / beta return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.6e+138) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(i * Float64(i / beta)) / 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.6e+138)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = (i * (i / beta)) / 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.6e+138], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i * N[(i / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.6 \cdot 10^{+138}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \frac{i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.6000000000000001e138Initial program 19.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified16.9%
Taylor expanded in i around inf
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified81.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6481.8
Simplified81.8%
if 1.6000000000000001e138 < beta Initial program 4.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6432.7
Simplified32.7%
Taylor expanded in i around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6433.0
Simplified33.0%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6472.9
Applied egg-rr72.9%
Final simplification80.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.3e+137) (+ 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 <= 2.3e+137) {
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 <= 2.3d+137) 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 <= 2.3e+137) {
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 <= 2.3e+137: 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 <= 2.3e+137) 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 <= 2.3e+137)
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, 2.3e+137], 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 2.3 \cdot 10^{+137}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 2.29999999999999999e137Initial program 19.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified16.9%
Taylor expanded in i around inf
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified81.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6481.8
Simplified81.8%
if 2.29999999999999999e137 < beta Initial program 4.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6432.7
Simplified32.7%
Taylor expanded in i around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6433.0
Simplified33.0%
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6472.8
Applied egg-rr72.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 9.2e+231) (+ 0.0625 (/ 0.015625 (* i i))) (* (/ i beta) (/ alpha beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 9.2e+231) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i / beta) * (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 <= 9.2d+231) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = (i / beta) * (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 <= 9.2e+231) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = (i / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 9.2e+231: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = (i / beta) * (alpha / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 9.2e+231) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(i / beta) * Float64(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 <= 9.2e+231)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = (i / beta) * (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, 9.2e+231], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.2 \cdot 10^{+231}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 9.19999999999999997e231Initial program 18.3%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified15.5%
Taylor expanded in i around inf
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified75.0%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6476.6
Simplified76.6%
if 9.19999999999999997e231 < beta Initial program 0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6438.0
Simplified38.0%
Taylor expanded in i around 0
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6440.2
Simplified40.2%
associate-*r/N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6451.4
Applied egg-rr51.4%
Final simplification74.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.05e+232) (+ 0.0625 (/ 0.015625 (* i i))) (* alpha (/ i (* beta beta)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.05e+232) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = alpha * (i / (beta * 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 <= 2.05d+232) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = alpha * (i / (beta * 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 <= 2.05e+232) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = alpha * (i / (beta * beta));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.05e+232: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = alpha * (i / (beta * beta)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.05e+232) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(alpha * Float64(i / Float64(beta * 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 <= 2.05e+232)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = alpha * (i / (beta * 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, 2.05e+232], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(alpha * N[(i / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.05 \cdot 10^{+232}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\alpha \cdot \frac{i}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.05000000000000001e232Initial program 18.3%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified15.5%
Taylor expanded in i around inf
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified75.0%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6476.6
Simplified76.6%
if 2.05000000000000001e232 < beta Initial program 0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6438.0
Simplified38.0%
Taylor expanded in i around 0
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6440.2
Simplified40.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (+ 0.0625 (/ 0.015625 (* i i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625 + (0.015625 / (i * i));
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0 + (0.015625d0 / (i * i))
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625 + (0.015625 / (i * i));
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625 + (0.015625 / (i * i))
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(0.0625 + Float64(0.015625 / Float64(i * i))) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625 + (0.015625 / (i * i));
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625 + \frac{0.015625}{i \cdot i}
\end{array}
Initial program 16.5%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified14.0%
Taylor expanded in i around inf
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6470.3
Simplified70.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 16.5%
Taylor expanded in i around inf
Simplified70.1%
herbie shell --seed 2024198
(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)))