
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 1.35e+119)
(+ (/ 0.015625 (* i i)) 0.0625)
(*
(/ (+ 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 <= 1.35e+119) {
tmp = (0.015625 / (i * i)) + 0.0625;
} 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 <= 1.35e+119) tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); 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, 1.35e+119], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $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 1.35 \cdot 10^{+119}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\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 < 1.3499999999999999e119Initial program 21.7%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Simplified17.9%
Taylor expanded in i around inf
cancel-sign-sub-invN/A
lower-+.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
Simplified78.2%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6478.3
Simplified78.3%
if 1.3499999999999999e119 < beta Initial program 1.8%
Taylor expanded in beta around inf
lower-*.f64N/A
lower-+.f6431.1
Simplified31.1%
Applied egg-rr69.3%
Final simplification76.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.9e+119) (+ (/ 0.015625 (* i i)) 0.0625) (* (/ i (+ 1.0 (+ beta alpha))) (/ (+ i alpha) beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.9e+119) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = (i / (1.0 + (beta + alpha))) * ((i + alpha) / beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 2.9d+119) then
tmp = (0.015625d0 / (i * i)) + 0.0625d0
else
tmp = (i / (1.0d0 + (beta + alpha))) * ((i + alpha) / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.9e+119) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = (i / (1.0 + (beta + alpha))) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.9e+119: tmp = (0.015625 / (i * i)) + 0.0625 else: tmp = (i / (1.0 + (beta + alpha))) * ((i + alpha) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.9e+119) tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); else tmp = Float64(Float64(i / Float64(1.0 + Float64(beta + alpha))) * Float64(Float64(i + alpha) / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2.9e+119)
tmp = (0.015625 / (i * i)) + 0.0625;
else
tmp = (i / (1.0 + (beta + alpha))) * ((i + alpha) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 2.9e+119], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision], N[(N[(i / N[(1.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9 \cdot 10^{+119}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{1 + \left(\beta + \alpha\right)} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 2.90000000000000007e119Initial program 21.7%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Simplified17.9%
Taylor expanded in i around inf
cancel-sign-sub-invN/A
lower-+.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
Simplified78.2%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6478.3
Simplified78.3%
if 2.90000000000000007e119 < beta Initial program 1.8%
Applied egg-rr30.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6431.2
Simplified31.2%
Taylor expanded in i around 0
lower-/.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6466.5
Simplified66.5%
Final simplification75.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.9e+119) (+ (/ 0.015625 (* i i)) 0.0625) (* (/ (+ i alpha) beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.9e+119) {
tmp = (0.015625 / (i * i)) + 0.0625;
} 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 <= 2.9d+119) then
tmp = (0.015625d0 / (i * i)) + 0.0625d0
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 <= 2.9e+119) {
tmp = (0.015625 / (i * i)) + 0.0625;
} 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 <= 2.9e+119: tmp = (0.015625 / (i * i)) + 0.0625 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 <= 2.9e+119) tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); 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 <= 2.9e+119)
tmp = (0.015625 / (i * i)) + 0.0625;
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, 2.9e+119], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $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 2.9 \cdot 10^{+119}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 2.90000000000000007e119Initial program 21.7%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Simplified17.9%
Taylor expanded in i around inf
cancel-sign-sub-invN/A
lower-+.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
Simplified78.2%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6478.3
Simplified78.3%
if 2.90000000000000007e119 < beta Initial program 1.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6431.3
Simplified31.3%
lift-+.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6466.4
Applied egg-rr66.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.9e+119) (+ (/ 0.015625 (* i i)) 0.0625) (/ (/ (* i i) beta) beta)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.9e+119) {
tmp = (0.015625 / (i * i)) + 0.0625;
} 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 <= 2.9d+119) then
tmp = (0.015625d0 / (i * i)) + 0.0625d0
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 <= 2.9e+119) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = ((i * i) / beta) / beta;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.9e+119: tmp = (0.015625 / (i * i)) + 0.0625 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 <= 2.9e+119) tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); else tmp = Float64(Float64(Float64(i * 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 <= 2.9e+119)
tmp = (0.015625 / (i * i)) + 0.0625;
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, 2.9e+119], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision], N[(N[(N[(i * i), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9 \cdot 10^{+119}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i \cdot i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.90000000000000007e119Initial program 21.7%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Simplified17.9%
Taylor expanded in i around inf
cancel-sign-sub-invN/A
lower-+.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
Simplified78.2%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6478.3
Simplified78.3%
if 2.90000000000000007e119 < beta Initial program 1.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6431.3
Simplified31.3%
lift-+.f64N/A
times-fracN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6466.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6466.4
Applied egg-rr66.4%
Taylor expanded in i around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6450.9
Simplified50.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7.2e+239) (+ (/ 0.015625 (* i i)) 0.0625) (* (/ i beta) (/ alpha beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.2e+239) {
tmp = (0.015625 / (i * i)) + 0.0625;
} 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 <= 7.2d+239) then
tmp = (0.015625d0 / (i * i)) + 0.0625d0
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 <= 7.2e+239) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = (i / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7.2e+239: tmp = (0.015625 / (i * i)) + 0.0625 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 <= 7.2e+239) tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); 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 <= 7.2e+239)
tmp = (0.015625 / (i * i)) + 0.0625;
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, 7.2e+239], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $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 7.2 \cdot 10^{+239}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 7.2e239Initial program 18.5%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Simplified14.9%
Taylor expanded in i around inf
cancel-sign-sub-invN/A
lower-+.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
Simplified66.4%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6471.0
Simplified71.0%
if 7.2e239 < beta Initial program 0.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6462.4
Simplified62.4%
Taylor expanded in i around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6463.1
Simplified63.1%
*-commutativeN/A
times-fracN/A
lift-/.f64N/A
lower-*.f64N/A
lower-/.f6463.9
Applied egg-rr63.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.16e+241) (+ (/ 0.015625 (* i i)) 0.0625) (* i (/ i (* beta beta)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.16e+241) {
tmp = (0.015625 / (i * i)) + 0.0625;
} 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.16d+241) then
tmp = (0.015625d0 / (i * i)) + 0.0625d0
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.16e+241) {
tmp = (0.015625 / (i * i)) + 0.0625;
} 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.16e+241: tmp = (0.015625 / (i * i)) + 0.0625 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.16e+241) tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); else tmp = Float64(i * 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.16e+241)
tmp = (0.015625 / (i * i)) + 0.0625;
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.16e+241], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision], N[(i * 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.16 \cdot 10^{+241}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\mathbf{else}:\\
\;\;\;\;i \cdot \frac{i}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 1.15999999999999999e241Initial program 18.5%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Simplified14.9%
Taylor expanded in i around inf
cancel-sign-sub-invN/A
lower-+.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
Simplified66.4%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6471.0
Simplified71.0%
if 1.15999999999999999e241 < beta Initial program 0.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6462.4
Simplified62.4%
lift-+.f64N/A
times-fracN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied egg-rr99.8%
lift-/.f64N/A
lift-+.f64N/A
associate-/l*N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
clear-numN/A
clear-numN/A
frac-timesN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lift-+.f6499.7
Applied egg-rr99.7%
Taylor expanded in i around inf
unpow2N/A
associate-*r/N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6463.4
Simplified63.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (+ (/ 0.015625 (* i i)) 0.0625))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.015625 / (i * i)) + 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.015625d0 / (i * i)) + 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (0.015625 / (i * i)) + 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.015625 / (i * i)) + 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(0.015625 / Float64(i * i)) + 0.0625) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (0.015625 / (i * i)) + 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\frac{0.015625}{i \cdot i} + 0.0625
\end{array}
Initial program 17.2%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Simplified13.9%
Taylor expanded in i around inf
cancel-sign-sub-invN/A
lower-+.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-/.f64N/A
Simplified61.7%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6466.2
Simplified66.2%
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.2%
Taylor expanded in i around inf
Simplified65.9%
herbie shell --seed 2024207
(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)))