
(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
(let* ((t_0 (+ beta (* i 2.0))))
(if (<= beta 5.2e+125)
(*
(/ i (+ alpha (+ t_0 1.0)))
(/
(* i (+ 0.25 (/ (* 0.25 (- (* beta 2.0) beta)) i)))
(+ alpha (+ t_0 -1.0))))
(*
(/ (+ i alpha) (+ (+ beta alpha) (+ (* i 2.0) 1.0)))
(/ i (+ (+ beta alpha) (+ (* i 2.0) -1.0)))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = beta + (i * 2.0);
double tmp;
if (beta <= 5.2e+125) {
tmp = (i / (alpha + (t_0 + 1.0))) * ((i * (0.25 + ((0.25 * ((beta * 2.0) - beta)) / i))) / (alpha + (t_0 + -1.0)));
} else {
tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.0) + -1.0)));
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: tmp
t_0 = beta + (i * 2.0d0)
if (beta <= 5.2d+125) then
tmp = (i / (alpha + (t_0 + 1.0d0))) * ((i * (0.25d0 + ((0.25d0 * ((beta * 2.0d0) - beta)) / i))) / (alpha + (t_0 + (-1.0d0))))
else
tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0d0) + 1.0d0))) * (i / ((beta + alpha) + ((i * 2.0d0) + (-1.0d0))))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = beta + (i * 2.0);
double tmp;
if (beta <= 5.2e+125) {
tmp = (i / (alpha + (t_0 + 1.0))) * ((i * (0.25 + ((0.25 * ((beta * 2.0) - beta)) / i))) / (alpha + (t_0 + -1.0)));
} else {
tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.0) + -1.0)));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = beta + (i * 2.0) tmp = 0 if beta <= 5.2e+125: tmp = (i / (alpha + (t_0 + 1.0))) * ((i * (0.25 + ((0.25 * ((beta * 2.0) - beta)) / i))) / (alpha + (t_0 + -1.0))) else: tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.0) + -1.0))) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(beta + Float64(i * 2.0)) tmp = 0.0 if (beta <= 5.2e+125) tmp = Float64(Float64(i / Float64(alpha + Float64(t_0 + 1.0))) * Float64(Float64(i * Float64(0.25 + Float64(Float64(0.25 * Float64(Float64(beta * 2.0) - beta)) / i))) / Float64(alpha + Float64(t_0 + -1.0)))); else tmp = Float64(Float64(Float64(i + alpha) / Float64(Float64(beta + alpha) + Float64(Float64(i * 2.0) + 1.0))) * Float64(i / Float64(Float64(beta + alpha) + Float64(Float64(i * 2.0) + -1.0)))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = beta + (i * 2.0);
tmp = 0.0;
if (beta <= 5.2e+125)
tmp = (i / (alpha + (t_0 + 1.0))) * ((i * (0.25 + ((0.25 * ((beta * 2.0) - beta)) / i))) / (alpha + (t_0 + -1.0)));
else
tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.0) + -1.0)));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.2e+125], N[(N[(i / N[(alpha + N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(0.25 + N[(N[(0.25 * N[(N[(beta * 2.0), $MachinePrecision] - beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + N[(N[(i * 2.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i / N[(N[(beta + alpha), $MachinePrecision] + N[(N[(i * 2.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \beta + i \cdot 2\\
\mathbf{if}\;\beta \leq 5.2 \cdot 10^{+125}:\\
\;\;\;\;\frac{i}{\alpha + \left(t\_0 + 1\right)} \cdot \frac{i \cdot \left(0.25 + \frac{0.25 \cdot \left(\beta \cdot 2 - \beta\right)}{i}\right)}{\alpha + \left(t\_0 + -1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\left(\beta + \alpha\right) + \left(i \cdot 2 + 1\right)} \cdot \frac{i}{\left(\beta + \alpha\right) + \left(i \cdot 2 + -1\right)}\\
\end{array}
\end{array}
if beta < 5.20000000000000006e125Initial program 21.8%
Taylor expanded in i around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate--l+N/A
associate-*r/N/A
associate-*r/N/A
div-subN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
Simplified39.3%
associate-*l*N/A
difference-of-sqr-1N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr80.0%
Taylor expanded in alpha around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f6485.0%
Simplified85.0%
if 5.20000000000000006e125 < beta Initial program 0.2%
Taylor expanded in beta around inf
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6422.9%
Simplified22.9%
*-commutativeN/A
difference-of-sqr-1N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f6465.5%
Applied egg-rr65.5%
Final simplification81.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 4.7e+125)
0.0625
(*
(/ (+ i alpha) (+ (+ beta alpha) (+ (* i 2.0) 1.0)))
(/ i (+ (+ beta alpha) (+ (* i 2.0) -1.0))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.7e+125) {
tmp = 0.0625;
} else {
tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.0) + -1.0)));
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 4.7d+125) then
tmp = 0.0625d0
else
tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0d0) + 1.0d0))) * (i / ((beta + alpha) + ((i * 2.0d0) + (-1.0d0))))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.7e+125) {
tmp = 0.0625;
} else {
tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.0) + -1.0)));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 4.7e+125: tmp = 0.0625 else: tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.0) + -1.0))) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.7e+125) tmp = 0.0625; else tmp = Float64(Float64(Float64(i + alpha) / Float64(Float64(beta + alpha) + Float64(Float64(i * 2.0) + 1.0))) * Float64(i / Float64(Float64(beta + alpha) + Float64(Float64(i * 2.0) + -1.0)))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4.7e+125)
tmp = 0.0625;
else
tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.0) + -1.0)));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 4.7e+125], 0.0625, N[(N[(N[(i + alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + N[(N[(i * 2.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i / N[(N[(beta + alpha), $MachinePrecision] + N[(N[(i * 2.0), $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 4.7 \cdot 10^{+125}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\left(\beta + \alpha\right) + \left(i \cdot 2 + 1\right)} \cdot \frac{i}{\left(\beta + \alpha\right) + \left(i \cdot 2 + -1\right)}\\
\end{array}
\end{array}
if beta < 4.69999999999999972e125Initial program 21.8%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified18.3%
Taylor expanded in i around inf
Simplified79.6%
if 4.69999999999999972e125 < beta Initial program 0.2%
Taylor expanded in beta around inf
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6422.9%
Simplified22.9%
*-commutativeN/A
difference-of-sqr-1N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f6465.5%
Applied egg-rr65.5%
Final simplification77.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.2e+129) 0.0625 (/ (/ (+ i alpha) beta) (/ beta i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.2e+129) {
tmp = 0.0625;
} 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.2d+129) then
tmp = 0.0625d0
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.2e+129) {
tmp = 0.0625;
} 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.2e+129: tmp = 0.0625 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.2e+129) tmp = 0.0625; 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.2e+129)
tmp = 0.0625;
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.2e+129], 0.0625, 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.2 \cdot 10^{+129}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i + \alpha}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 3.2000000000000002e129Initial program 21.5%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified18.1%
Taylor expanded in i around inf
Simplified79.5%
if 3.2000000000000002e129 < beta Initial program 0.2%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6422.2%
Simplified22.2%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6463.3%
Applied egg-rr63.3%
associate-/l*N/A
clear-numN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f6463.8%
Applied egg-rr63.8%
Final simplification77.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.2e+129) 0.0625 (* (/ (+ i alpha) beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.2e+129) {
tmp = 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 <= 4.2d+129) then
tmp = 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 <= 4.2e+129) {
tmp = 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 <= 4.2e+129: tmp = 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 <= 4.2e+129) tmp = 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 <= 4.2e+129)
tmp = 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, 4.2e+129], 0.0625, N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2 \cdot 10^{+129}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 4.19999999999999993e129Initial program 21.5%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified18.1%
Taylor expanded in i around inf
Simplified79.5%
if 4.19999999999999993e129 < beta Initial program 0.2%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6422.2%
Simplified22.2%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f6463.7%
Applied egg-rr63.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 9.8e+129) 0.0625 (/ (* i (/ i beta)) beta)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 9.8e+129) {
tmp = 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 <= 9.8d+129) then
tmp = 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 <= 9.8e+129) {
tmp = 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 <= 9.8e+129: tmp = 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 <= 9.8e+129) tmp = 0.0625; 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 <= 9.8e+129)
tmp = 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, 9.8e+129], 0.0625, 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 9.8 \cdot 10^{+129}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \frac{i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 9.8e129Initial program 21.5%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified18.1%
Taylor expanded in i around inf
Simplified79.5%
if 9.8e129 < beta Initial program 0.2%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6422.2%
Simplified22.2%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6463.3%
Applied egg-rr63.3%
Taylor expanded in i around inf
Simplified61.2%
Final simplification76.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 8e+224) 0.0625 (/ (* alpha (/ i beta)) beta)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8e+224) {
tmp = 0.0625;
} 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 <= 8d+224) then
tmp = 0.0625d0
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 <= 8e+224) {
tmp = 0.0625;
} else {
tmp = (alpha * (i / beta)) / beta;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 8e+224: tmp = 0.0625 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 <= 8e+224) tmp = 0.0625; else tmp = Float64(Float64(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 <= 8e+224)
tmp = 0.0625;
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, 8e+224], 0.0625, N[(N[(alpha * 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 8 \cdot 10^{+224}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha \cdot \frac{i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 7.99999999999999976e224Initial program 19.4%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified16.3%
Taylor expanded in i around inf
Simplified74.9%
if 7.99999999999999976e224 < beta Initial program 0.0%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6432.5%
Simplified32.5%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6468.6%
Applied egg-rr68.6%
Taylor expanded in i around 0
Simplified40.0%
Final simplification72.7%
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+259) 0.0625 (/ 0.0 i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 9.2e+259) {
tmp = 0.0625;
} else {
tmp = 0.0 / 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 <= 9.2d+259) then
tmp = 0.0625d0
else
tmp = 0.0d0 / 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 <= 9.2e+259) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 9.2e+259: tmp = 0.0625 else: tmp = 0.0 / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 9.2e+259) tmp = 0.0625; else tmp = Float64(0.0 / 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 <= 9.2e+259)
tmp = 0.0625;
else
tmp = 0.0 / 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, 9.2e+259], 0.0625, N[(0.0 / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.2 \cdot 10^{+259}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0}{i}\\
\end{array}
\end{array}
if beta < 9.2000000000000004e259Initial program 18.8%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified15.7%
Taylor expanded in i around inf
Simplified73.4%
if 9.2000000000000004e259 < beta Initial program 0.0%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified0.0%
Taylor expanded in alpha around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f640.0%
Simplified0.0%
Taylor expanded in i around inf
cancel-sign-sub-invN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6469.6%
Simplified69.6%
Taylor expanded in alpha around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6469.6%
Simplified69.6%
Taylor expanded in i around 0
distribute-rgt-outN/A
metadata-evalN/A
mul0-rgtN/A
/-lowering-/.f6452.6%
Simplified52.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 18.2%
associate-/l/N/A
/-lowering-/.f64N/A
Simplified15.2%
Taylor expanded in i around inf
Simplified71.8%
herbie shell --seed 2024138
(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)))