
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 26 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 4e+150)
(/ (/ (+ alpha (fma (+ alpha 1.0) beta 1.0)) t_1) (* t_1 t_0))
(*
(/
(+
(+ 1.0 (+ (+ alpha (/ 1.0 beta)) (/ alpha beta)))
(* (/ (+ alpha 2.0) beta) (- -1.0 alpha)))
t_0)
(/ 1.0 t_1)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4e+150) {
tmp = ((alpha + fma((alpha + 1.0), beta, 1.0)) / t_1) / (t_1 * t_0);
} else {
tmp = (((1.0 + ((alpha + (1.0 / beta)) + (alpha / beta))) + (((alpha + 2.0) / beta) * (-1.0 - alpha))) / t_0) * (1.0 / t_1);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 4e+150) tmp = Float64(Float64(Float64(alpha + fma(Float64(alpha + 1.0), beta, 1.0)) / t_1) / Float64(t_1 * t_0)); else tmp = Float64(Float64(Float64(Float64(1.0 + Float64(Float64(alpha + Float64(1.0 / beta)) + Float64(alpha / beta))) + Float64(Float64(Float64(alpha + 2.0) / beta) * Float64(-1.0 - alpha))) / t_0) * Float64(1.0 / t_1)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+150], N[(N[(N[(alpha + N[(N[(alpha + 1.0), $MachinePrecision] * beta + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + N[(N[(alpha + N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+150}:\\
\;\;\;\;\frac{\frac{\alpha + \mathsf{fma}\left(\alpha + 1, \beta, 1\right)}{t\_1}}{t\_1 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \left(\left(\alpha + \frac{1}{\beta}\right) + \frac{\alpha}{\beta}\right)\right) + \frac{\alpha + 2}{\beta} \cdot \left(-1 - \alpha\right)}{t\_0} \cdot \frac{1}{t\_1}\\
\end{array}
\end{array}
if beta < 3.99999999999999992e150Initial program 98.4%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
accelerator-lowering-fma.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
Applied egg-rr97.0%
if 3.99999999999999992e150 < beta Initial program 84.7%
div-invN/A
frac-timesN/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr84.7%
Taylor expanded in beta around inf
--lowering--.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f6492.5%
Simplified92.5%
Final simplification96.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (/ (+ alpha 1.0) beta)) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 3.5e+150)
(/
(/ (+ alpha (fma (+ alpha 1.0) beta 1.0)) t_1)
(* t_1 (+ alpha (+ beta 3.0))))
(/
(/ (+ (+ alpha 1.0) (+ t_0 (* (fma alpha -2.0 -4.0) t_0))) beta)
(+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / beta;
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.5e+150) {
tmp = ((alpha + fma((alpha + 1.0), beta, 1.0)) / t_1) / (t_1 * (alpha + (beta + 3.0)));
} else {
tmp = (((alpha + 1.0) + (t_0 + (fma(alpha, -2.0, -4.0) * t_0))) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 1.0) / beta) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3.5e+150) tmp = Float64(Float64(Float64(alpha + fma(Float64(alpha + 1.0), beta, 1.0)) / t_1) / Float64(t_1 * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(alpha + 1.0) + Float64(t_0 + Float64(fma(alpha, -2.0, -4.0) * t_0))) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.5e+150], N[(N[(N[(alpha + N[(N[(alpha + 1.0), $MachinePrecision] * beta + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] + N[(t$95$0 + N[(N[(alpha * -2.0 + -4.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{\alpha + 1}{\beta}\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 3.5 \cdot 10^{+150}:\\
\;\;\;\;\frac{\frac{\alpha + \mathsf{fma}\left(\alpha + 1, \beta, 1\right)}{t\_1}}{t\_1 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(\alpha + 1\right) + \left(t\_0 + \mathsf{fma}\left(\alpha, -2, -4\right) \cdot t\_0\right)}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 3.49999999999999984e150Initial program 98.4%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
accelerator-lowering-fma.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
Applied egg-rr97.0%
if 3.49999999999999984e150 < beta Initial program 84.7%
Taylor expanded in beta around -inf
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified89.0%
div-subN/A
--lowering--.f64N/A
sub0-negN/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
distribute-neg-inN/A
metadata-evalN/A
sub-negN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
associate-/l*N/A
sub-negN/A
metadata-evalN/A
distribute-neg-inN/A
sub0-negN/A
frac-2negN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6492.4%
Applied egg-rr92.4%
Final simplification96.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 4e+150)
(/ (/ (+ alpha (fma (+ alpha 1.0) beta 1.0)) t_1) (* t_1 t_0))
(* (/ 1.0 t_1) (/ (+ alpha 1.0) t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4e+150) {
tmp = ((alpha + fma((alpha + 1.0), beta, 1.0)) / t_1) / (t_1 * t_0);
} else {
tmp = (1.0 / t_1) * ((alpha + 1.0) / t_0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 4e+150) tmp = Float64(Float64(Float64(alpha + fma(Float64(alpha + 1.0), beta, 1.0)) / t_1) / Float64(t_1 * t_0)); else tmp = Float64(Float64(1.0 / t_1) * Float64(Float64(alpha + 1.0) / t_0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+150], N[(N[(N[(alpha + N[(N[(alpha + 1.0), $MachinePrecision] * beta + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$1), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+150}:\\
\;\;\;\;\frac{\frac{\alpha + \mathsf{fma}\left(\alpha + 1, \beta, 1\right)}{t\_1}}{t\_1 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_1} \cdot \frac{\alpha + 1}{t\_0}\\
\end{array}
\end{array}
if beta < 3.99999999999999992e150Initial program 98.4%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
accelerator-lowering-fma.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
Applied egg-rr97.0%
if 3.99999999999999992e150 < beta Initial program 84.7%
div-invN/A
frac-timesN/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr84.7%
Taylor expanded in beta around inf
+-lowering-+.f6492.5%
Simplified92.5%
Final simplification96.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 3.4e+17)
(*
(/ 1.0 (* t_1 (* t_1 (+ alpha (+ beta 3.0)))))
(+ alpha (fma beta (+ alpha 1.0) 1.0)))
(/ (/ (+ alpha 1.0) t_0) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.4e+17) {
tmp = (1.0 / (t_1 * (t_1 * (alpha + (beta + 3.0))))) * (alpha + fma(beta, (alpha + 1.0), 1.0));
} else {
tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3.4e+17) tmp = Float64(Float64(1.0 / Float64(t_1 * Float64(t_1 * Float64(alpha + Float64(beta + 3.0))))) * Float64(alpha + fma(beta, Float64(alpha + 1.0), 1.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(1.0 + t_0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.4e+17], N[(N[(1.0 / N[(t$95$1 * N[(t$95$1 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta * N[(alpha + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 3.4 \cdot 10^{+17}:\\
\;\;\;\;\frac{1}{t\_1 \cdot \left(t\_1 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)} \cdot \left(\alpha + \mathsf{fma}\left(\beta, \alpha + 1, 1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{1 + t\_0}\\
\end{array}
\end{array}
if beta < 3.4e17Initial program 99.8%
div-invN/A
frac-timesN/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
associate-/l/N/A
*-commutativeN/A
frac-timesN/A
associate-*r/N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr93.4%
if 3.4e17 < beta Initial program 87.6%
Taylor expanded in beta around inf
+-lowering-+.f6487.6%
Simplified87.6%
Final simplification91.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.1e-70)
(/ (+ alpha 1.0) (* (fma alpha (+ alpha 4.0) 4.0) (+ alpha 3.0)))
(if (<= beta 1e+46)
(/
(/ (+ beta 1.0) (+ beta 2.0))
(* (+ alpha (+ beta 2.0)) (+ alpha (+ beta 3.0))))
(/ (/ (- -1.0 alpha) beta) (- -1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1e-70) {
tmp = (alpha + 1.0) / (fma(alpha, (alpha + 4.0), 4.0) * (alpha + 3.0));
} else if (beta <= 1e+46) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (alpha + (beta + 3.0)));
} else {
tmp = ((-1.0 - alpha) / beta) / (-1.0 - (2.0 + (beta + alpha)));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1e-70) tmp = Float64(Float64(alpha + 1.0) / Float64(fma(alpha, Float64(alpha + 4.0), 4.0) * Float64(alpha + 3.0))); elseif (beta <= 1e+46) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(-1.0 - alpha) / beta) / Float64(-1.0 - Float64(2.0 + Float64(beta + alpha)))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1e-70], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha * N[(alpha + 4.0), $MachinePrecision] + 4.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1e+46], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(-1.0 - N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1 \cdot 10^{-70}:\\
\;\;\;\;\frac{\alpha + 1}{\mathsf{fma}\left(\alpha, \alpha + 4, 4\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{elif}\;\beta \leq 10^{+46}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1 - \alpha}{\beta}}{-1 - \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 2.1000000000000001e-70Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6494.6%
Simplified94.6%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
+-lowering-+.f6494.7%
Simplified94.7%
if 2.1000000000000001e-70 < beta < 9.9999999999999999e45Initial program 99.6%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
accelerator-lowering-fma.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
Applied egg-rr95.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6474.3%
Simplified74.3%
if 9.9999999999999999e45 < beta Initial program 87.1%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6486.8%
Simplified86.8%
Final simplification89.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 1.15e+18)
(/
(+ alpha (fma (+ alpha 1.0) beta 1.0))
(* t_1 (* t_1 (+ alpha (+ beta 3.0)))))
(/ (/ (+ alpha 1.0) t_0) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.15e+18) {
tmp = (alpha + fma((alpha + 1.0), beta, 1.0)) / (t_1 * (t_1 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.15e+18) tmp = Float64(Float64(alpha + fma(Float64(alpha + 1.0), beta, 1.0)) / Float64(t_1 * Float64(t_1 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(1.0 + t_0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.15e+18], N[(N[(alpha + N[(N[(alpha + 1.0), $MachinePrecision] * beta + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * N[(t$95$1 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.15 \cdot 10^{+18}:\\
\;\;\;\;\frac{\alpha + \mathsf{fma}\left(\alpha + 1, \beta, 1\right)}{t\_1 \cdot \left(t\_1 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{1 + t\_0}\\
\end{array}
\end{array}
if beta < 1.15e18Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
accelerator-lowering-fma.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
Applied egg-rr93.4%
if 1.15e18 < beta Initial program 87.6%
Taylor expanded in beta around inf
+-lowering-+.f6487.6%
Simplified87.6%
Final simplification91.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))) (t_1 (+ 1.0 t_0)))
(if (<= beta 1.68e-7)
(/ (/ (+ alpha 1.0) (* (+ alpha 2.0) (+ alpha 2.0))) t_1)
(if (<= beta 1e+46)
(/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))
(/ (/ (+ alpha 1.0) t_0) t_1)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = 1.0 + t_0;
double tmp;
if (beta <= 1.68e-7) {
tmp = ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 2.0))) / t_1;
} else if (beta <= 1e+46) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 2.0d0 + (beta + alpha)
t_1 = 1.0d0 + t_0
if (beta <= 1.68d-7) then
tmp = ((alpha + 1.0d0) / ((alpha + 2.0d0) * (alpha + 2.0d0))) / t_1
else if (beta <= 1d+46) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((alpha + 1.0d0) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = 1.0 + t_0;
double tmp;
if (beta <= 1.68e-7) {
tmp = ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 2.0))) / t_1;
} else if (beta <= 1e+46) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) t_1 = 1.0 + t_0 tmp = 0 if beta <= 1.68e-7: tmp = ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 2.0))) / t_1 elif beta <= 1e+46: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((alpha + 1.0) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) t_1 = Float64(1.0 + t_0) tmp = 0.0 if (beta <= 1.68e-7) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0))) / t_1); elseif (beta <= 1e+46) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
t_1 = 1.0 + t_0;
tmp = 0.0;
if (beta <= 1.68e-7)
tmp = ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 2.0))) / t_1;
elseif (beta <= 1e+46)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((alpha + 1.0) / t_0) / t_1;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + t$95$0), $MachinePrecision]}, If[LessEqual[beta, 1.68e-7], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[beta, 1e+46], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
t_1 := 1 + t\_0\\
\mathbf{if}\;\beta \leq 1.68 \cdot 10^{-7}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)}}{t\_1}\\
\mathbf{elif}\;\beta \leq 10^{+46}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 1.67999999999999996e-7Initial program 99.9%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6498.6%
Simplified98.6%
if 1.67999999999999996e-7 < beta < 9.9999999999999999e45Initial program 99.1%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
accelerator-lowering-fma.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
Applied egg-rr99.5%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6470.8%
Simplified70.8%
Taylor expanded in alpha around 0
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.9%
Simplified67.9%
if 9.9999999999999999e45 < beta Initial program 87.1%
Taylor expanded in beta around inf
+-lowering-+.f6487.1%
Simplified87.1%
Final simplification93.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))))
(if (<= beta 1.8e-7)
(/ (/ (+ alpha 1.0) (* (+ alpha 2.0) (+ alpha 2.0))) (+ 1.0 t_0))
(if (<= beta 3e+46)
(/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))
(/ (/ (- -1.0 alpha) beta) (- -1.0 t_0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1.8e-7) {
tmp = ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 2.0))) / (1.0 + t_0);
} else if (beta <= 3e+46) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((-1.0 - alpha) / beta) / (-1.0 - t_0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (beta + alpha)
if (beta <= 1.8d-7) then
tmp = ((alpha + 1.0d0) / ((alpha + 2.0d0) * (alpha + 2.0d0))) / (1.0d0 + t_0)
else if (beta <= 3d+46) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = (((-1.0d0) - alpha) / beta) / ((-1.0d0) - t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1.8e-7) {
tmp = ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 2.0))) / (1.0 + t_0);
} else if (beta <= 3e+46) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((-1.0 - alpha) / beta) / (-1.0 - t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 1.8e-7: tmp = ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 2.0))) / (1.0 + t_0) elif beta <= 3e+46: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((-1.0 - alpha) / beta) / (-1.0 - t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 1.8e-7) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0))) / Float64(1.0 + t_0)); elseif (beta <= 3e+46) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(-1.0 - alpha) / beta) / Float64(-1.0 - t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 1.8e-7)
tmp = ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 2.0))) / (1.0 + t_0);
elseif (beta <= 3e+46)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((-1.0 - alpha) / beta) / (-1.0 - t_0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.8e-7], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3e+46], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(-1.0 - t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 1.8 \cdot 10^{-7}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)}}{1 + t\_0}\\
\mathbf{elif}\;\beta \leq 3 \cdot 10^{+46}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1 - \alpha}{\beta}}{-1 - t\_0}\\
\end{array}
\end{array}
if beta < 1.79999999999999997e-7Initial program 99.9%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6498.6%
Simplified98.6%
if 1.79999999999999997e-7 < beta < 3.00000000000000023e46Initial program 99.1%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
accelerator-lowering-fma.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
Applied egg-rr99.5%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6470.8%
Simplified70.8%
Taylor expanded in alpha around 0
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.9%
Simplified67.9%
if 3.00000000000000023e46 < beta Initial program 87.1%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6486.8%
Simplified86.8%
Final simplification93.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.65e-70)
(/ (+ alpha 1.0) (* (fma alpha (+ alpha 4.0) 4.0) (+ alpha 3.0)))
(if (<= beta 4e+46)
(/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))
(/ (/ (- -1.0 alpha) beta) (- -1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.65e-70) {
tmp = (alpha + 1.0) / (fma(alpha, (alpha + 4.0), 4.0) * (alpha + 3.0));
} else if (beta <= 4e+46) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((-1.0 - alpha) / beta) / (-1.0 - (2.0 + (beta + alpha)));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.65e-70) tmp = Float64(Float64(alpha + 1.0) / Float64(fma(alpha, Float64(alpha + 4.0), 4.0) * Float64(alpha + 3.0))); elseif (beta <= 4e+46) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(-1.0 - alpha) / beta) / Float64(-1.0 - Float64(2.0 + Float64(beta + alpha)))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.65e-70], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha * N[(alpha + 4.0), $MachinePrecision] + 4.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 4e+46], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(-1.0 - N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.65 \cdot 10^{-70}:\\
\;\;\;\;\frac{\alpha + 1}{\mathsf{fma}\left(\alpha, \alpha + 4, 4\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{elif}\;\beta \leq 4 \cdot 10^{+46}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1 - \alpha}{\beta}}{-1 - \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 2.64999999999999992e-70Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6494.6%
Simplified94.6%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
+-lowering-+.f6494.7%
Simplified94.7%
if 2.64999999999999992e-70 < beta < 4e46Initial program 99.6%
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
accelerator-lowering-fma.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
Applied egg-rr95.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6474.3%
Simplified74.3%
Taylor expanded in alpha around 0
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6464.3%
Simplified64.3%
if 4e46 < beta Initial program 87.1%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6486.8%
Simplified86.8%
Final simplification88.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))) (t_1 (+ 1.0 t_0)))
(if (<= beta 2e+16)
(/ (/ (+ beta 1.0) (* (+ beta 2.0) (+ beta 2.0))) t_1)
(/ (/ (+ alpha 1.0) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = 1.0 + t_0;
double tmp;
if (beta <= 2e+16) {
tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 2.0))) / t_1;
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 2.0d0 + (beta + alpha)
t_1 = 1.0d0 + t_0
if (beta <= 2d+16) then
tmp = ((beta + 1.0d0) / ((beta + 2.0d0) * (beta + 2.0d0))) / t_1
else
tmp = ((alpha + 1.0d0) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = 1.0 + t_0;
double tmp;
if (beta <= 2e+16) {
tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 2.0))) / t_1;
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) t_1 = 1.0 + t_0 tmp = 0 if beta <= 2e+16: tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 2.0))) / t_1 else: tmp = ((alpha + 1.0) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) t_1 = Float64(1.0 + t_0) tmp = 0.0 if (beta <= 2e+16) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(beta + 2.0))) / t_1); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
t_1 = 1.0 + t_0;
tmp = 0.0;
if (beta <= 2e+16)
tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 2.0))) / t_1;
else
tmp = ((alpha + 1.0) / t_0) / t_1;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + t$95$0), $MachinePrecision]}, If[LessEqual[beta, 2e+16], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
t_1 := 1 + t\_0\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 2e16Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6465.5%
Simplified65.5%
if 2e16 < beta Initial program 87.6%
Taylor expanded in beta around inf
+-lowering-+.f6487.6%
Simplified87.6%
Final simplification72.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.65e-70)
(/ (+ alpha 1.0) (* (fma alpha (+ alpha 4.0) 4.0) (+ alpha 3.0)))
(if (<= beta 1.2e+16)
(/ (+ beta 1.0) (* (+ beta 3.0) (* (+ beta 2.0) (+ beta 2.0))))
(/ (/ (- -1.0 alpha) beta) (- -1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.65e-70) {
tmp = (alpha + 1.0) / (fma(alpha, (alpha + 4.0), 4.0) * (alpha + 3.0));
} else if (beta <= 1.2e+16) {
tmp = (beta + 1.0) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((-1.0 - alpha) / beta) / (-1.0 - (2.0 + (beta + alpha)));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.65e-70) tmp = Float64(Float64(alpha + 1.0) / Float64(fma(alpha, Float64(alpha + 4.0), 4.0) * Float64(alpha + 3.0))); elseif (beta <= 1.2e+16) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 3.0) * Float64(Float64(beta + 2.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(-1.0 - alpha) / beta) / Float64(-1.0 - Float64(2.0 + Float64(beta + alpha)))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.65e-70], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha * N[(alpha + 4.0), $MachinePrecision] + 4.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.2e+16], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(-1.0 - N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.65 \cdot 10^{-70}:\\
\;\;\;\;\frac{\alpha + 1}{\mathsf{fma}\left(\alpha, \alpha + 4, 4\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{elif}\;\beta \leq 1.2 \cdot 10^{+16}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 3\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1 - \alpha}{\beta}}{-1 - \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 2.64999999999999992e-70Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6494.6%
Simplified94.6%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
+-lowering-+.f6494.7%
Simplified94.7%
if 2.64999999999999992e-70 < beta < 1.2e16Initial program 99.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6461.0%
Simplified61.0%
if 1.2e16 < beta Initial program 87.6%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6487.2%
Simplified87.2%
Final simplification88.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.65e-70)
(/ (+ alpha 1.0) (* (fma alpha (+ alpha 4.0) 4.0) (+ alpha 3.0)))
(if (<= beta 2e+17)
(/ (+ beta 1.0) (* (+ beta 3.0) (* (+ beta 2.0) (+ beta 2.0))))
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.65e-70) {
tmp = (alpha + 1.0) / (fma(alpha, (alpha + 4.0), 4.0) * (alpha + 3.0));
} else if (beta <= 2e+17) {
tmp = (beta + 1.0) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.65e-70) tmp = Float64(Float64(alpha + 1.0) / Float64(fma(alpha, Float64(alpha + 4.0), 4.0) * Float64(alpha + 3.0))); elseif (beta <= 2e+17) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 3.0) * Float64(Float64(beta + 2.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.65e-70], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha * N[(alpha + 4.0), $MachinePrecision] + 4.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2e+17], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.65 \cdot 10^{-70}:\\
\;\;\;\;\frac{\alpha + 1}{\mathsf{fma}\left(\alpha, \alpha + 4, 4\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{elif}\;\beta \leq 2 \cdot 10^{+17}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 3\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 2.64999999999999992e-70Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6494.6%
Simplified94.6%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
+-lowering-+.f6494.7%
Simplified94.7%
if 2.64999999999999992e-70 < beta < 2e17Initial program 99.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6461.0%
Simplified61.0%
if 2e17 < beta Initial program 87.6%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6487.2%
Simplified87.2%
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f6487.2%
Applied egg-rr87.2%
Final simplification88.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.3)
(fma
alpha
(fma
alpha
(fma alpha 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(if (<= beta 2.15e+153)
(/ (+ alpha 1.0) (* beta beta))
(/ (/ alpha beta) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else if (beta <= 2.15e+153) {
tmp = (alpha + 1.0) / (beta * beta);
} else {
tmp = (alpha / beta) / (beta + 3.0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); elseif (beta <= 2.15e+153) tmp = Float64(Float64(alpha + 1.0) / Float64(beta * beta)); else tmp = Float64(Float64(alpha / beta) / Float64(beta + 3.0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.3], N[(alpha * N[(alpha * N[(alpha * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], If[LessEqual[beta, 2.15e+153], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;\mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{elif}\;\beta \leq 2.15 \cdot 10^{+153}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6463.7%
Simplified63.7%
if 3.2999999999999998 < beta < 2.1499999999999999e153Initial program 90.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6471.2%
Simplified71.2%
if 2.1499999999999999e153 < beta Initial program 86.3%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6494.1%
Simplified94.1%
Taylor expanded in alpha around 0
+-commutativeN/A
+-lowering-+.f6494.1%
Simplified94.1%
Taylor expanded in alpha around inf
/-lowering-/.f6491.4%
Simplified91.4%
Final simplification69.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5) (/ (+ alpha 1.0) (* (fma alpha (+ alpha 4.0) 4.0) (+ alpha 3.0))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = (alpha + 1.0) / (fma(alpha, (alpha + 4.0), 4.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.5) tmp = Float64(Float64(alpha + 1.0) / Float64(fma(alpha, Float64(alpha + 4.0), 4.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.5], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha * N[(alpha + 4.0), $MachinePrecision] + 4.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5:\\
\;\;\;\;\frac{\alpha + 1}{\mathsf{fma}\left(\alpha, \alpha + 4, 4\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
+-lowering-+.f6492.2%
Simplified92.2%
if 3.5 < beta Initial program 88.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6482.9%
Simplified82.9%
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f6482.9%
Applied egg-rr82.9%
Final simplification89.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5) (/ (+ alpha 1.0) (* (fma alpha (+ alpha 4.0) 4.0) (+ alpha 3.0))) (/ (/ (+ alpha 1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = (alpha + 1.0) / (fma(alpha, (alpha + 4.0), 4.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.5) tmp = Float64(Float64(alpha + 1.0) / Float64(fma(alpha, Float64(alpha + 4.0), 4.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + 3.0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.5], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha * N[(alpha + 4.0), $MachinePrecision] + 4.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5:\\
\;\;\;\;\frac{\alpha + 1}{\mathsf{fma}\left(\alpha, \alpha + 4, 4\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
+-lowering-+.f6492.2%
Simplified92.2%
if 3.5 < beta Initial program 88.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6482.9%
Simplified82.9%
Taylor expanded in alpha around 0
+-commutativeN/A
+-lowering-+.f6482.7%
Simplified82.7%
Final simplification89.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6) (/ (+ alpha 1.0) (fma alpha (fma alpha (+ alpha 7.0) 16.0) 12.0)) (/ (/ (+ alpha 1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = (alpha + 1.0) / fma(alpha, fma(alpha, (alpha + 7.0), 16.0), 12.0);
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6) tmp = Float64(Float64(alpha + 1.0) / fma(alpha, fma(alpha, Float64(alpha + 7.0), 16.0), 12.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + 3.0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.6], N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha * N[(alpha * N[(alpha + 7.0), $MachinePrecision] + 16.0), $MachinePrecision] + 12.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6:\\
\;\;\;\;\frac{\alpha + 1}{\mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, \alpha + 7, 16\right), 12\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
+-lowering-+.f6492.2%
Simplified92.2%
if 3.60000000000000009 < beta Initial program 88.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6482.9%
Simplified82.9%
Taylor expanded in alpha around 0
+-commutativeN/A
+-lowering-+.f6482.7%
Simplified82.7%
Final simplification89.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(fma
alpha
(fma
alpha
(fma alpha 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(/ (/ (+ alpha 1.0) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + 3.0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.2], N[(alpha * N[(alpha * N[(alpha * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;\mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6463.7%
Simplified63.7%
if 2.2000000000000002 < beta Initial program 88.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6482.9%
Simplified82.9%
Taylor expanded in alpha around 0
+-commutativeN/A
+-lowering-+.f6482.7%
Simplified82.7%
Final simplification70.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.3)
(fma
alpha
(fma
alpha
(fma alpha 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(/ (/ (+ alpha 1.0) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.3], N[(alpha * N[(alpha * N[(alpha * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;\mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6463.7%
Simplified63.7%
if 3.2999999999999998 < beta Initial program 88.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6477.8%
Simplified77.8%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6482.6%
Applied egg-rr82.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.3)
(fma
alpha
(fma
alpha
(fma alpha 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(/ (+ alpha 1.0) (* beta beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else {
tmp = (alpha + 1.0) / (beta * beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); else tmp = Float64(Float64(alpha + 1.0) / Float64(beta * beta)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.3], N[(alpha * N[(alpha * N[(alpha * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;\mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6463.7%
Simplified63.7%
if 3.2999999999999998 < beta Initial program 88.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6477.8%
Simplified77.8%
Final simplification68.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(fma
alpha
(fma
alpha
(fma alpha 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(/ 1.0 (* beta (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.2], N[(alpha * N[(alpha * N[(alpha * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;\mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6463.7%
Simplified63.7%
if 2.2000000000000002 < beta Initial program 88.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6482.9%
Simplified82.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6477.1%
Simplified77.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.4)
(fma
alpha
(fma
alpha
(fma alpha 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(/ 1.0 (* beta beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.4) tmp = fma(alpha, fma(alpha, fma(alpha, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.4], N[(alpha * N[(alpha * N[(alpha * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4:\\
\;\;\;\;\mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.39999999999999991Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6463.7%
Simplified63.7%
if 3.39999999999999991 < beta Initial program 88.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6477.8%
Simplified77.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6477.0%
Simplified77.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.1)
(fma
alpha
(fma alpha -0.011574074074074073 -0.027777777777777776)
0.08333333333333333)
(/ 1.0 (* beta beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = fma(alpha, fma(alpha, -0.011574074074074073, -0.027777777777777776), 0.08333333333333333);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.1) tmp = fma(alpha, fma(alpha, -0.011574074074074073, -0.027777777777777776), 0.08333333333333333); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.1], N[(alpha * N[(alpha * -0.011574074074074073 + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.1:\\
\;\;\;\;\mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, -0.011574074074074073, -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.10000000000000009Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.2%
Simplified92.2%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6463.3%
Simplified63.3%
if 3.10000000000000009 < beta Initial program 88.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6477.8%
Simplified77.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6477.0%
Simplified77.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 8.2)
(fma
alpha
(fma alpha -0.011574074074074073 -0.027777777777777776)
0.08333333333333333)
(/ 1.0 beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.2) {
tmp = fma(alpha, fma(alpha, -0.011574074074074073, -0.027777777777777776), 0.08333333333333333);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.2) tmp = fma(alpha, fma(alpha, -0.011574074074074073, -0.027777777777777776), 0.08333333333333333); else tmp = Float64(1.0 / beta); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 8.2], N[(alpha * N[(alpha * -0.011574074074074073 + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.2:\\
\;\;\;\;\mathsf{fma}\left(\alpha, \mathsf{fma}\left(\alpha, -0.011574074074074073, -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 8.1999999999999993Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6491.7%
Simplified91.7%
Taylor expanded in alpha around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6463.0%
Simplified63.0%
if 8.1999999999999993 < beta Initial program 88.3%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6483.6%
Simplified83.6%
Taylor expanded in alpha around inf
/-lowering-/.f646.7%
Simplified6.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.2) (fma alpha -0.027777777777777776 0.08333333333333333) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.2) {
tmp = fma(alpha, -0.027777777777777776, 0.08333333333333333);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.2) tmp = fma(alpha, -0.027777777777777776, 0.08333333333333333); else tmp = Float64(1.0 / beta); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 8.2], N[(alpha * -0.027777777777777776 + 0.08333333333333333), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.2:\\
\;\;\;\;\mathsf{fma}\left(\alpha, -0.027777777777777776, 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 8.1999999999999993Initial program 99.8%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6491.7%
Simplified91.7%
Taylor expanded in alpha around 0
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6462.8%
Simplified62.8%
if 8.1999999999999993 < beta Initial program 88.3%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6483.6%
Simplified83.6%
Taylor expanded in alpha around inf
/-lowering-/.f646.7%
Simplified6.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (fma alpha -0.027777777777777776 0.08333333333333333))
assert(alpha < beta);
double code(double alpha, double beta) {
return fma(alpha, -0.027777777777777776, 0.08333333333333333);
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return fma(alpha, -0.027777777777777776, 0.08333333333333333) end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(alpha * -0.027777777777777776 + 0.08333333333333333), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\mathsf{fma}\left(\alpha, -0.027777777777777776, 0.08333333333333333\right)
\end{array}
Initial program 96.0%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6465.0%
Simplified65.0%
Taylor expanded in alpha around 0
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6443.1%
Simplified43.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 96.0%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6465.0%
Simplified65.0%
Taylor expanded in alpha around 0
Simplified43.0%
herbie shell --seed 2024193
(FPCore (alpha beta)
:name "Octave 3.8, jcobi/3"
:precision binary64
:pre (and (> alpha -1.0) (> beta -1.0))
(/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ (+ alpha beta) (* 2.0 1.0)) 1.0)))