
(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 16 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 (+ 2.0 beta))))
(if (<= beta 2.12e+36)
(/ (* (+ 1.0 beta) (+ 1.0 alpha)) (* t_0 (* t_0 (+ alpha (+ beta 3.0)))))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 2.12e+36) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.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 = alpha + (2.0d0 + beta)
if (beta <= 2.12d+36) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 2.12e+36) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 2.12e+36: tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 2.12e+36) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(t_0 * Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 2.12e+36)
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.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[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.12e+36], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 2.12 \cdot 10^{+36}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{t\_0 \cdot \left(t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.12000000000000004e36Initial program 99.9%
Simplified93.5%
if 2.12000000000000004e36 < beta Initial program 80.9%
Taylor expanded in beta around inf 89.5%
Taylor expanded in alpha around 0 89.5%
associate-+r+89.5%
Simplified89.5%
Final simplification92.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))))
(/
1.0
(*
t_0
(/ (+ beta (+ alpha 3.0)) (* (+ 1.0 beta) (/ (+ 1.0 alpha) t_0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
return 1.0 / (t_0 * ((beta + (alpha + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / t_0))));
}
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
t_0 = 2.0d0 + (beta + alpha)
code = 1.0d0 / (t_0 * ((beta + (alpha + 3.0d0)) / ((1.0d0 + beta) * ((1.0d0 + alpha) / t_0))))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
return 1.0 / (t_0 * ((beta + (alpha + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / t_0))));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) return 1.0 / (t_0 * ((beta + (alpha + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / t_0))))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) return Float64(1.0 / Float64(t_0 * Float64(Float64(beta + Float64(alpha + 3.0)) / Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) / t_0))))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 1.0 / (t_0 * ((beta + (alpha + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / t_0))));
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]}, N[(1.0 / N[(t$95$0 * N[(N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\frac{1}{t\_0 \cdot \frac{\beta + \left(\alpha + 3\right)}{\left(1 + \beta\right) \cdot \frac{1 + \alpha}{t\_0}}}
\end{array}
\end{array}
Initial program 95.3%
Simplified85.3%
associate-+r+85.3%
fma-undefine85.3%
*-commutative85.3%
associate-+l+85.3%
+-commutative85.3%
associate-+l+85.3%
*-commutative85.3%
associate-*r*85.3%
associate-+r+85.3%
+-commutative85.3%
associate-/l/93.9%
clear-num93.9%
inv-pow93.9%
Applied egg-rr93.9%
unpow-193.9%
associate-/l*94.4%
associate-+r+94.4%
+-commutative94.4%
+-commutative94.4%
associate-+r+94.4%
+-commutative94.4%
associate-+r+94.4%
+-commutative94.4%
fma-undefine94.4%
*-commutative94.4%
+-commutative94.4%
associate-+r+94.4%
+-commutative94.4%
*-rgt-identity94.4%
*-commutative94.4%
+-commutative94.4%
distribute-lft-in94.4%
+-commutative94.4%
*-commutative94.4%
Simplified94.4%
associate-/l*98.7%
Applied egg-rr98.7%
Final simplification98.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3e+27)
(/
1.0
(* (+ 2.0 (+ beta alpha)) (* (+ 2.0 beta) (/ (+ beta 3.0) (+ 1.0 beta)))))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+27) {
tmp = 1.0 / ((2.0 + (beta + alpha)) * ((2.0 + beta) * ((beta + 3.0) / (1.0 + beta))));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.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) :: tmp
if (beta <= 3d+27) then
tmp = 1.0d0 / ((2.0d0 + (beta + alpha)) * ((2.0d0 + beta) * ((beta + 3.0d0) / (1.0d0 + beta))))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+27) {
tmp = 1.0 / ((2.0 + (beta + alpha)) * ((2.0 + beta) * ((beta + 3.0) / (1.0 + beta))));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3e+27: tmp = 1.0 / ((2.0 + (beta + alpha)) * ((2.0 + beta) * ((beta + 3.0) / (1.0 + beta)))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3e+27) tmp = Float64(1.0 / Float64(Float64(2.0 + Float64(beta + alpha)) * Float64(Float64(2.0 + beta) * Float64(Float64(beta + 3.0) / Float64(1.0 + beta))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3e+27)
tmp = 1.0 / ((2.0 + (beta + alpha)) * ((2.0 + beta) * ((beta + 3.0) / (1.0 + beta))));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3e+27], N[(1.0 / N[(N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3 \cdot 10^{+27}:\\
\;\;\;\;\frac{1}{\left(2 + \left(\beta + \alpha\right)\right) \cdot \left(\left(2 + \beta\right) \cdot \frac{\beta + 3}{1 + \beta}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.99999999999999976e27Initial program 99.9%
Simplified93.4%
associate-+r+93.4%
fma-undefine93.4%
*-commutative93.4%
associate-+l+93.4%
+-commutative93.4%
associate-+l+93.4%
*-commutative93.4%
associate-*r*93.4%
associate-+r+93.4%
+-commutative93.4%
associate-/l/99.2%
clear-num99.2%
inv-pow99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-/l*99.2%
associate-+r+99.2%
+-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
fma-undefine99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
*-rgt-identity99.2%
*-commutative99.2%
+-commutative99.2%
distribute-lft-in99.2%
+-commutative99.2%
*-commutative99.2%
Simplified99.2%
Taylor expanded in alpha around 0 71.0%
associate-/l*71.0%
Simplified71.0%
if 2.99999999999999976e27 < beta Initial program 81.4%
Taylor expanded in beta around inf 89.8%
Taylor expanded in alpha around 0 89.8%
associate-+r+89.8%
Simplified89.8%
Final simplification75.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.45e+27) (/ 1.0 (* (+ 2.0 beta) (* (+ 2.0 beta) (/ (+ beta 3.0) (+ 1.0 beta))))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.45e+27) {
tmp = 1.0 / ((2.0 + beta) * ((2.0 + beta) * ((beta + 3.0) / (1.0 + beta))));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.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) :: tmp
if (beta <= 3.45d+27) then
tmp = 1.0d0 / ((2.0d0 + beta) * ((2.0d0 + beta) * ((beta + 3.0d0) / (1.0d0 + beta))))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.45e+27) {
tmp = 1.0 / ((2.0 + beta) * ((2.0 + beta) * ((beta + 3.0) / (1.0 + beta))));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.45e+27: tmp = 1.0 / ((2.0 + beta) * ((2.0 + beta) * ((beta + 3.0) / (1.0 + beta)))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.45e+27) tmp = Float64(1.0 / Float64(Float64(2.0 + beta) * Float64(Float64(2.0 + beta) * Float64(Float64(beta + 3.0) / Float64(1.0 + beta))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.45e+27)
tmp = 1.0 / ((2.0 + beta) * ((2.0 + beta) * ((beta + 3.0) / (1.0 + beta))));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.45e+27], N[(1.0 / N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.45 \cdot 10^{+27}:\\
\;\;\;\;\frac{1}{\left(2 + \beta\right) \cdot \left(\left(2 + \beta\right) \cdot \frac{\beta + 3}{1 + \beta}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 3.45000000000000009e27Initial program 99.9%
Simplified93.4%
associate-+r+93.4%
fma-undefine93.4%
*-commutative93.4%
associate-+l+93.4%
+-commutative93.4%
associate-+l+93.4%
*-commutative93.4%
associate-*r*93.4%
associate-+r+93.4%
+-commutative93.4%
associate-/l/99.2%
clear-num99.2%
inv-pow99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-/l*99.2%
associate-+r+99.2%
+-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
fma-undefine99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
*-rgt-identity99.2%
*-commutative99.2%
+-commutative99.2%
distribute-lft-in99.2%
+-commutative99.2%
*-commutative99.2%
Simplified99.2%
Taylor expanded in alpha around 0 71.0%
associate-/l*71.0%
Simplified71.0%
Taylor expanded in alpha around 0 70.1%
if 3.45000000000000009e27 < beta Initial program 81.4%
Taylor expanded in beta around inf 89.8%
Taylor expanded in alpha around 0 89.8%
associate-+r+89.8%
Simplified89.8%
Final simplification75.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6) (/ (/ (+ 1.0 alpha) (+ 2.0 alpha)) (* (+ 2.0 alpha) (+ alpha 3.0))) (/ (/ (- -1.0 alpha) beta) (* beta (+ (/ (- -3.0 alpha) beta) -1.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((-1.0 - alpha) / beta) / (beta * (((-3.0 - alpha) / beta) + -1.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) :: tmp
if (beta <= 3.6d0) then
tmp = ((1.0d0 + alpha) / (2.0d0 + alpha)) / ((2.0d0 + alpha) * (alpha + 3.0d0))
else
tmp = (((-1.0d0) - alpha) / beta) / (beta * ((((-3.0d0) - alpha) / beta) + (-1.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((-1.0 - alpha) / beta) / (beta * (((-3.0 - alpha) / beta) + -1.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6: tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0)) else: tmp = ((-1.0 - alpha) / beta) / (beta * (((-3.0 - alpha) / beta) + -1.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + alpha)) / Float64(Float64(2.0 + alpha) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(-1.0 - alpha) / beta) / Float64(beta * Float64(Float64(Float64(-3.0 - alpha) / beta) + -1.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.6)
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
else
tmp = ((-1.0 - alpha) / beta) / (beta * (((-3.0 - alpha) / beta) + -1.0));
end
tmp_2 = 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[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + alpha), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta * N[(N[(N[(-3.0 - alpha), $MachinePrecision] / beta), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \alpha}}{\left(2 + \alpha\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1 - \alpha}{\beta}}{\beta \cdot \left(\frac{-3 - \alpha}{\beta} + -1\right)}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.9%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in beta around 0 97.2%
Taylor expanded in beta around 0 97.3%
+-commutative97.3%
+-commutative97.3%
Simplified97.3%
if 3.60000000000000009 < beta Initial program 83.9%
Taylor expanded in beta around inf 85.6%
Taylor expanded in beta around -inf 85.6%
mul-1-neg85.6%
distribute-rgt-neg-in85.6%
sub-neg85.6%
associate-*r/85.6%
distribute-lft-in85.6%
metadata-eval85.6%
metadata-eval85.6%
mul-1-neg85.6%
unsub-neg85.6%
metadata-eval85.6%
metadata-eval85.6%
Simplified85.6%
Final simplification93.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) (/ (/ (+ 1.0 alpha) (+ 2.0 alpha)) (* (+ 2.0 alpha) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.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) :: tmp
if (beta <= 3.0d0) then
tmp = ((1.0d0 + alpha) / (2.0d0 + alpha)) / ((2.0d0 + alpha) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + alpha)) / Float64(Float64(2.0 + alpha) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + alpha), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \alpha}}{\left(2 + \alpha\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 3Initial program 99.9%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in beta around 0 97.2%
Taylor expanded in beta around 0 97.3%
+-commutative97.3%
+-commutative97.3%
Simplified97.3%
if 3 < beta Initial program 83.9%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 85.6%
associate-+r+85.6%
Simplified85.6%
Final simplification93.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) (/ (+ 1.0 alpha) (+ 12.0 (* alpha (+ 16.0 (* alpha 7.0))))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = (1.0 + alpha) / (12.0 + (alpha * (16.0 + (alpha * 7.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.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) :: tmp
if (beta <= 3.0d0) then
tmp = (1.0d0 + alpha) / (12.0d0 + (alpha * (16.0d0 + (alpha * 7.0d0))))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = (1.0 + alpha) / (12.0 + (alpha * (16.0 + (alpha * 7.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = (1.0 + alpha) / (12.0 + (alpha * (16.0 + (alpha * 7.0)))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(Float64(1.0 + alpha) / Float64(12.0 + Float64(alpha * Float64(16.0 + Float64(alpha * 7.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = (1.0 + alpha) / (12.0 + (alpha * (16.0 + (alpha * 7.0))));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(12.0 + N[(alpha * N[(16.0 + N[(alpha * 7.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;\frac{1 + \alpha}{12 + \alpha \cdot \left(16 + \alpha \cdot 7\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 3Initial program 99.9%
Simplified93.1%
Taylor expanded in alpha around -inf 92.9%
mul-1-neg92.9%
distribute-rgt-neg-in92.9%
sub-neg92.9%
associate-*r/92.9%
distribute-lft-in92.9%
metadata-eval92.9%
mul-1-neg92.9%
unsub-neg92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in beta around 0 91.2%
associate-*r/91.2%
metadata-eval91.2%
+-commutative91.2%
+-commutative91.2%
Simplified91.2%
Taylor expanded in alpha around 0 83.4%
*-commutative83.4%
Simplified83.4%
if 3 < beta Initial program 83.9%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 85.6%
associate-+r+85.6%
Simplified85.6%
Final simplification84.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+
0.08333333333333333
(*
alpha
(-
(* alpha (- (* alpha 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.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) :: tmp
if (beta <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * ((alpha * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * Float64(Float64(alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = 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[(0.08333333333333333 + N[(alpha * N[(N[(alpha * N[(N[(alpha * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot \left(\alpha \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
Simplified93.1%
Taylor expanded in alpha around -inf 92.9%
mul-1-neg92.9%
distribute-rgt-neg-in92.9%
sub-neg92.9%
associate-*r/92.9%
distribute-lft-in92.9%
metadata-eval92.9%
mul-1-neg92.9%
unsub-neg92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in beta around 0 91.2%
associate-*r/91.2%
metadata-eval91.2%
+-commutative91.2%
+-commutative91.2%
Simplified91.2%
Taylor expanded in alpha around 0 69.0%
if 2.2000000000000002 < beta Initial program 83.9%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 85.6%
associate-+r+85.6%
Simplified85.6%
Final simplification73.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.1)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.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) :: tmp
if (beta <= 2.1d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
Simplified93.1%
Taylor expanded in alpha around -inf 92.9%
mul-1-neg92.9%
distribute-rgt-neg-in92.9%
sub-neg92.9%
associate-*r/92.9%
distribute-lft-in92.9%
metadata-eval92.9%
mul-1-neg92.9%
unsub-neg92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in beta around 0 91.2%
associate-*r/91.2%
metadata-eval91.2%
+-commutative91.2%
+-commutative91.2%
Simplified91.2%
Taylor expanded in alpha around 0 68.8%
if 2.10000000000000009 < beta Initial program 83.9%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 85.6%
associate-+r+85.6%
Simplified85.6%
Final simplification73.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.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) :: tmp
if (beta <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = 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[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
Simplified93.1%
Taylor expanded in alpha around -inf 92.9%
mul-1-neg92.9%
distribute-rgt-neg-in92.9%
sub-neg92.9%
associate-*r/92.9%
distribute-lft-in92.9%
metadata-eval92.9%
mul-1-neg92.9%
unsub-neg92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in beta around 0 91.2%
associate-*r/91.2%
metadata-eval91.2%
+-commutative91.2%
+-commutative91.2%
Simplified91.2%
Taylor expanded in alpha around 0 68.8%
if 2.2000000000000002 < beta Initial program 83.9%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 85.5%
+-commutative85.5%
Simplified85.5%
Final simplification73.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.4)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ 1.0 (* beta (/ beta (+ 1.0 alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = 1.0 / (beta * (beta / (1.0 + alpha)));
}
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) :: tmp
if (beta <= 3.4d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta / (1.0d0 + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = 1.0 / (beta * (beta / (1.0 + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.4: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = 1.0 / (beta * (beta / (1.0 + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.4) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(1.0 / Float64(beta * Float64(beta / Float64(1.0 + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.4)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = 1.0 / (beta * (beta / (1.0 + alpha)));
end
tmp_2 = 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[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 3.39999999999999991Initial program 99.9%
Simplified93.1%
Taylor expanded in alpha around -inf 92.9%
mul-1-neg92.9%
distribute-rgt-neg-in92.9%
sub-neg92.9%
associate-*r/92.9%
distribute-lft-in92.9%
metadata-eval92.9%
mul-1-neg92.9%
unsub-neg92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in beta around 0 91.2%
associate-*r/91.2%
metadata-eval91.2%
+-commutative91.2%
+-commutative91.2%
Simplified91.2%
Taylor expanded in alpha around 0 68.8%
if 3.39999999999999991 < beta Initial program 83.9%
Simplified66.4%
associate-+r+66.4%
fma-undefine66.4%
*-commutative66.4%
associate-+l+66.4%
+-commutative66.4%
associate-+l+66.4%
*-commutative66.4%
associate-*r*66.3%
associate-+r+66.3%
+-commutative66.3%
associate-/l/81.2%
clear-num81.1%
inv-pow81.1%
Applied egg-rr81.1%
unpow-181.1%
associate-/l*82.7%
associate-+r+82.7%
+-commutative82.7%
+-commutative82.7%
associate-+r+82.7%
+-commutative82.7%
associate-+r+82.7%
+-commutative82.7%
fma-undefine82.7%
*-commutative82.7%
+-commutative82.7%
associate-+r+82.7%
+-commutative82.7%
*-rgt-identity82.7%
*-commutative82.7%
+-commutative82.7%
distribute-lft-in82.7%
+-commutative82.7%
*-commutative82.7%
Simplified82.7%
Taylor expanded in beta around inf 83.5%
Taylor expanded in beta around inf 83.3%
Final simplification73.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ 1.0 beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = (1.0 / beta) / (beta + 3.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) :: tmp
if (beta <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) 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 = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = 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[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / 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:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
Simplified93.1%
Taylor expanded in alpha around -inf 92.9%
mul-1-neg92.9%
distribute-rgt-neg-in92.9%
sub-neg92.9%
associate-*r/92.9%
distribute-lft-in92.9%
metadata-eval92.9%
mul-1-neg92.9%
unsub-neg92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in beta around 0 91.2%
associate-*r/91.2%
metadata-eval91.2%
+-commutative91.2%
+-commutative91.2%
Simplified91.2%
Taylor expanded in alpha around 0 68.8%
if 2.2000000000000002 < beta Initial program 83.9%
Simplified66.4%
associate-+r+66.4%
fma-undefine66.4%
*-commutative66.4%
associate-+l+66.4%
+-commutative66.4%
associate-+l+66.4%
*-commutative66.4%
associate-*r*66.3%
associate-+r+66.3%
+-commutative66.3%
associate-/l/81.2%
clear-num81.1%
inv-pow81.1%
Applied egg-rr81.1%
unpow-181.1%
associate-/l*82.7%
associate-+r+82.7%
+-commutative82.7%
+-commutative82.7%
associate-+r+82.7%
+-commutative82.7%
associate-+r+82.7%
+-commutative82.7%
fma-undefine82.7%
*-commutative82.7%
+-commutative82.7%
associate-+r+82.7%
+-commutative82.7%
*-rgt-identity82.7%
*-commutative82.7%
+-commutative82.7%
distribute-lft-in82.7%
+-commutative82.7%
*-commutative82.7%
Simplified82.7%
Taylor expanded in beta around inf 84.0%
Taylor expanded in alpha around 0 78.1%
associate-/r*78.5%
Simplified78.5%
Taylor expanded in beta around inf 78.4%
Final simplification71.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.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) :: tmp
if (beta <= 2.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) 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.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / 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.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
Simplified93.1%
Taylor expanded in alpha around -inf 92.9%
mul-1-neg92.9%
distribute-rgt-neg-in92.9%
sub-neg92.9%
associate-*r/92.9%
distribute-lft-in92.9%
metadata-eval92.9%
mul-1-neg92.9%
unsub-neg92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in beta around 0 91.2%
associate-*r/91.2%
metadata-eval91.2%
+-commutative91.2%
+-commutative91.2%
Simplified91.2%
Taylor expanded in alpha around 0 68.7%
*-commutative68.7%
Simplified68.7%
if 2.10000000000000009 < beta Initial program 83.9%
Simplified66.4%
associate-+r+66.4%
fma-undefine66.4%
*-commutative66.4%
associate-+l+66.4%
+-commutative66.4%
associate-+l+66.4%
*-commutative66.4%
associate-*r*66.3%
associate-+r+66.3%
+-commutative66.3%
associate-/l/81.2%
clear-num81.1%
inv-pow81.1%
Applied egg-rr81.1%
unpow-181.1%
associate-/l*82.7%
associate-+r+82.7%
+-commutative82.7%
+-commutative82.7%
associate-+r+82.7%
+-commutative82.7%
associate-+r+82.7%
+-commutative82.7%
fma-undefine82.7%
*-commutative82.7%
+-commutative82.7%
associate-+r+82.7%
+-commutative82.7%
*-rgt-identity82.7%
*-commutative82.7%
+-commutative82.7%
distribute-lft-in82.7%
+-commutative82.7%
*-commutative82.7%
Simplified82.7%
Taylor expanded in beta around inf 84.0%
Taylor expanded in alpha around 0 78.1%
associate-/r*78.5%
Simplified78.5%
Taylor expanded in beta around inf 78.4%
Final simplification71.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.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) :: tmp
if (beta <= 2.0d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) 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.0) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.0], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $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:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2Initial program 99.9%
Simplified93.1%
Taylor expanded in alpha around -inf 92.9%
mul-1-neg92.9%
distribute-rgt-neg-in92.9%
sub-neg92.9%
associate-*r/92.9%
distribute-lft-in92.9%
metadata-eval92.9%
mul-1-neg92.9%
unsub-neg92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in beta around 0 91.2%
associate-*r/91.2%
metadata-eval91.2%
+-commutative91.2%
+-commutative91.2%
Simplified91.2%
Taylor expanded in alpha around 0 68.7%
*-commutative68.7%
Simplified68.7%
if 2 < beta Initial program 83.9%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 78.0%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (+ 0.08333333333333333 (* alpha -0.027777777777777776)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333 + (alpha * -0.027777777777777776);
}
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 + (alpha * (-0.027777777777777776d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333 + (alpha * -0.027777777777777776);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333 + (alpha * -0.027777777777777776)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333 + \alpha \cdot -0.027777777777777776
\end{array}
Initial program 95.3%
Simplified85.3%
Taylor expanded in alpha around -inf 83.7%
mul-1-neg83.7%
distribute-rgt-neg-in83.7%
sub-neg83.7%
associate-*r/83.7%
distribute-lft-in83.7%
metadata-eval83.7%
mul-1-neg83.7%
unsub-neg83.7%
metadata-eval83.7%
Simplified83.7%
Taylor expanded in beta around 0 69.3%
associate-*r/69.3%
metadata-eval69.3%
+-commutative69.3%
+-commutative69.3%
Simplified69.3%
Taylor expanded in alpha around 0 49.9%
*-commutative49.9%
Simplified49.9%
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 95.3%
Simplified85.3%
Taylor expanded in alpha around -inf 83.7%
mul-1-neg83.7%
distribute-rgt-neg-in83.7%
sub-neg83.7%
associate-*r/83.7%
distribute-lft-in83.7%
metadata-eval83.7%
mul-1-neg83.7%
unsub-neg83.7%
metadata-eval83.7%
Simplified83.7%
Taylor expanded in beta around 0 69.3%
associate-*r/69.3%
metadata-eval69.3%
+-commutative69.3%
+-commutative69.3%
Simplified69.3%
Taylor expanded in alpha around 0 50.0%
herbie shell --seed 2024151
(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)))