
(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 11 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 2.08e+71)
(+ 0.0625 (/ 0.015625 (* i i)))
(*
(/ (+ i alpha) (+ alpha (+ (fma i 2.0 beta) 1.0)))
(/ i (+ alpha (+ (fma i 2.0 beta) -1.0))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.08e+71) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = ((i + alpha) / (alpha + (fma(i, 2.0, beta) + 1.0))) * (i / (alpha + (fma(i, 2.0, beta) + -1.0)));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.08e+71) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(Float64(i + alpha) / Float64(alpha + Float64(fma(i, 2.0, beta) + 1.0))) * Float64(i / Float64(alpha + Float64(fma(i, 2.0, beta) + -1.0)))); end return 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.08e+71], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / N[(alpha + N[(N[(i * 2.0 + beta), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i / N[(alpha + N[(N[(i * 2.0 + beta), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.08 \cdot 10^{+71}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\alpha + \left(\mathsf{fma}\left(i, 2, \beta\right) + 1\right)} \cdot \frac{i}{\alpha + \left(\mathsf{fma}\left(i, 2, \beta\right) + -1\right)}\\
\end{array}
\end{array}
if beta < 2.08e71Initial program 22.6%
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.7%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6414.8
Simplified14.8%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6473.5
Simplified73.5%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6473.7
Simplified73.7%
if 2.08e71 < beta Initial program 3.3%
Taylor expanded in beta around inf
*-lowering-*.f64N/A
+-lowering-+.f6423.1
Simplified23.1%
*-commutativeN/A
pow2N/A
associate-+l+N/A
*-commutativeN/A
+-commutativeN/A
pow2N/A
difference-of-sqr-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr59.7%
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+163) (+ 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 <= 1.6e+163) {
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 <= 1.6d+163) 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 <= 1.6e+163) {
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 <= 1.6e+163: 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 <= 1.6e+163) 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 <= 1.6e+163)
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, 1.6e+163], 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 1.6 \cdot 10^{+163}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i + \alpha}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 1.5999999999999999e163Initial program 20.8%
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.3%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6413.1
Simplified13.1%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6471.4
Simplified71.4%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6472.2
Simplified72.2%
if 1.5999999999999999e163 < beta Initial program 0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6416.3
Simplified16.3%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6469.1
Applied egg-rr69.1%
associate-/l*N/A
clear-numN/A
metadata-evalN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f6469.3
Applied egg-rr69.3%
Final simplification71.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3e+163) (+ 0.0625 (/ 0.015625 (* i i))) (/ (* (+ i alpha) (/ i beta)) beta)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3e+163) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = ((i + 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 <= 3d+163) then
tmp = 0.0625d0 + (0.015625d0 / (i * i))
else
tmp = ((i + 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 <= 3e+163) {
tmp = 0.0625 + (0.015625 / (i * i));
} else {
tmp = ((i + alpha) * (i / beta)) / beta;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3e+163: tmp = 0.0625 + (0.015625 / (i * i)) else: tmp = ((i + alpha) * (i / beta)) / beta return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3e+163) tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); else tmp = Float64(Float64(Float64(i + alpha) * 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 <= 3e+163)
tmp = 0.0625 + (0.015625 / (i * i));
else
tmp = ((i + 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, 3e+163], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] * 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 3 \cdot 10^{+163}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(i + \alpha\right) \cdot \frac{i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.00000000000000013e163Initial program 20.8%
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.3%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6413.1
Simplified13.1%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6471.4
Simplified71.4%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6472.2
Simplified72.2%
if 3.00000000000000013e163 < beta Initial program 0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6416.3
Simplified16.3%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6469.1
Applied egg-rr69.1%
Final simplification71.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 6.8e+163) (+ 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 <= 6.8e+163) {
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 <= 6.8d+163) 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 <= 6.8e+163) {
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 <= 6.8e+163: 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 <= 6.8e+163) 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 <= 6.8e+163)
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, 6.8e+163], 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 6.8 \cdot 10^{+163}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 6.8000000000000002e163Initial program 20.8%
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.3%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6413.1
Simplified13.1%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6471.4
Simplified71.4%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6472.2
Simplified72.2%
if 6.8000000000000002e163 < beta Initial program 0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6416.3
Simplified16.3%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f6469.2
Applied egg-rr69.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.3e+164) (+ 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 <= 4.3e+164) {
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 <= 4.3d+164) 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 <= 4.3e+164) {
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 <= 4.3e+164: 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 <= 4.3e+164) 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 <= 4.3e+164)
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, 4.3e+164], 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 4.3 \cdot 10^{+164}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \frac{i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.3e164Initial program 20.8%
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.3%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6413.1
Simplified13.1%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6471.4
Simplified71.4%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6472.2
Simplified72.2%
if 4.3e164 < beta Initial program 0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6416.3
Simplified16.3%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6469.1
Applied egg-rr69.1%
Taylor expanded in i around inf
Simplified69.1%
Final simplification71.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= i 1.85e+35) (/ (* i (+ i alpha)) (* beta beta)) (+ 0.0625 (/ 0.015625 (* i i)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (i <= 1.85e+35) {
tmp = (i * (i + alpha)) / (beta * beta);
} else {
tmp = 0.0625 + (0.015625 / (i * 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 (i <= 1.85d+35) then
tmp = (i * (i + alpha)) / (beta * beta)
else
tmp = 0.0625d0 + (0.015625d0 / (i * 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 (i <= 1.85e+35) {
tmp = (i * (i + alpha)) / (beta * beta);
} else {
tmp = 0.0625 + (0.015625 / (i * i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if i <= 1.85e+35: tmp = (i * (i + alpha)) / (beta * beta) else: tmp = 0.0625 + (0.015625 / (i * i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (i <= 1.85e+35) tmp = Float64(Float64(i * Float64(i + alpha)) / Float64(beta * beta)); else tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (i <= 1.85e+35)
tmp = (i * (i + alpha)) / (beta * beta);
else
tmp = 0.0625 + (0.015625 / (i * 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[i, 1.85e+35], N[(N[(i * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;i \leq 1.85 \cdot 10^{+35}:\\
\;\;\;\;\frac{i \cdot \left(i + \alpha\right)}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\end{array}
\end{array}
if i < 1.85e35Initial program 62.9%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6425.5
Simplified25.5%
if 1.85e35 < i Initial program 11.6%
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
Simplified9.3%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f648.9
Simplified8.9%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6465.4
Simplified65.4%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6471.0
Simplified71.0%
Final simplification65.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= i 1.4e+35) (* i (/ (+ i alpha) (* beta beta))) (+ 0.0625 (/ 0.015625 (* i i)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (i <= 1.4e+35) {
tmp = i * ((i + alpha) / (beta * beta));
} else {
tmp = 0.0625 + (0.015625 / (i * 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 (i <= 1.4d+35) then
tmp = i * ((i + alpha) / (beta * beta))
else
tmp = 0.0625d0 + (0.015625d0 / (i * 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 (i <= 1.4e+35) {
tmp = i * ((i + alpha) / (beta * beta));
} else {
tmp = 0.0625 + (0.015625 / (i * i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if i <= 1.4e+35: tmp = i * ((i + alpha) / (beta * beta)) else: tmp = 0.0625 + (0.015625 / (i * i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (i <= 1.4e+35) tmp = Float64(i * Float64(Float64(i + alpha) / Float64(beta * beta))); else tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (i <= 1.4e+35)
tmp = i * ((i + alpha) / (beta * beta));
else
tmp = 0.0625 + (0.015625 / (i * 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[i, 1.4e+35], N[(i * N[(N[(i + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;i \leq 1.4 \cdot 10^{+35}:\\
\;\;\;\;i \cdot \frac{i + \alpha}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\end{array}
\end{array}
if i < 1.39999999999999999e35Initial program 62.9%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6425.5
Simplified25.5%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f6425.5
Applied egg-rr25.5%
if 1.39999999999999999e35 < i Initial program 11.6%
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
Simplified9.3%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f648.9
Simplified8.9%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6465.4
Simplified65.4%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6471.0
Simplified71.0%
Final simplification65.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= i 1.55e+35) (/ (* i i) (* beta beta)) (+ 0.0625 (/ 0.015625 (* i i)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (i <= 1.55e+35) {
tmp = (i * i) / (beta * beta);
} else {
tmp = 0.0625 + (0.015625 / (i * 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 (i <= 1.55d+35) then
tmp = (i * i) / (beta * beta)
else
tmp = 0.0625d0 + (0.015625d0 / (i * 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 (i <= 1.55e+35) {
tmp = (i * i) / (beta * beta);
} else {
tmp = 0.0625 + (0.015625 / (i * i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if i <= 1.55e+35: tmp = (i * i) / (beta * beta) else: tmp = 0.0625 + (0.015625 / (i * i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (i <= 1.55e+35) tmp = Float64(Float64(i * i) / Float64(beta * beta)); else tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (i <= 1.55e+35)
tmp = (i * i) / (beta * beta);
else
tmp = 0.0625 + (0.015625 / (i * 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[i, 1.55e+35], N[(N[(i * i), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;i \leq 1.55 \cdot 10^{+35}:\\
\;\;\;\;\frac{i \cdot i}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\end{array}
\end{array}
if i < 1.54999999999999993e35Initial program 62.9%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6425.5
Simplified25.5%
Taylor expanded in i around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6423.5
Simplified23.5%
if 1.54999999999999993e35 < i Initial program 11.6%
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
Simplified9.3%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f648.9
Simplified8.9%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6465.4
Simplified65.4%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6471.0
Simplified71.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.4e+264) (+ 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 <= 1.4e+264) {
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 <= 1.4d+264) 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 <= 1.4e+264) {
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 <= 1.4e+264: 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 <= 1.4e+264) 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 <= 1.4e+264)
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, 1.4e+264], 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 1.4 \cdot 10^{+264}:\\
\;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\
\mathbf{else}:\\
\;\;\;\;\alpha \cdot \frac{i}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 1.39999999999999999e264Initial program 18.4%
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
Simplified12.6%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6411.6
Simplified11.6%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6463.0
Simplified63.0%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6468.1
Simplified68.1%
if 1.39999999999999999e264 < beta Initial program 0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6410.8
Simplified10.8%
Taylor expanded in i around 0
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6415.0
Simplified15.0%
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 17.6%
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
Simplified12.1%
Taylor expanded in beta around 0
distribute-lft-outN/A
unpow2N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6411.1
Simplified11.1%
Taylor expanded in i around inf
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6460.6
Simplified60.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6465.6
Simplified65.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 17.6%
Taylor expanded in i around inf
Simplified65.6%
herbie shell --seed 2024196
(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)))