
(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 24 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 (+ (+ beta alpha) 2.0)) (t_1 (+ (+ beta alpha) 3.0)))
(if (<= alpha 4.3e+32)
(*
(pow t_0 -2.0)
(pow (/ t_1 (- (fma beta alpha (+ beta alpha)) -1.0)) -1.0))
(/
(/
(-
(* (- -1.0 alpha) (/ (+ 2.0 alpha) beta))
(- (- (/ -1.0 beta) (/ alpha beta)) (- alpha -1.0)))
t_1)
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double t_1 = (beta + alpha) + 3.0;
double tmp;
if (alpha <= 4.3e+32) {
tmp = pow(t_0, -2.0) * pow((t_1 / (fma(beta, alpha, (beta + alpha)) - -1.0)), -1.0);
} else {
tmp = ((((-1.0 - alpha) * ((2.0 + alpha) / beta)) - (((-1.0 / beta) - (alpha / beta)) - (alpha - -1.0))) / t_1) / t_0;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) t_1 = Float64(Float64(beta + alpha) + 3.0) tmp = 0.0 if (alpha <= 4.3e+32) tmp = Float64((t_0 ^ -2.0) * (Float64(t_1 / Float64(fma(beta, alpha, Float64(beta + alpha)) - -1.0)) ^ -1.0)); else tmp = Float64(Float64(Float64(Float64(Float64(-1.0 - alpha) * Float64(Float64(2.0 + alpha) / beta)) - Float64(Float64(Float64(-1.0 / beta) - Float64(alpha / beta)) - Float64(alpha - -1.0))) / t_1) / 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, If[LessEqual[alpha, 4.3e+32], N[(N[Power[t$95$0, -2.0], $MachinePrecision] * N[Power[N[(t$95$1 / N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(-1.0 - alpha), $MachinePrecision] * N[(N[(2.0 + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(-1.0 / beta), $MachinePrecision] - N[(alpha / beta), $MachinePrecision]), $MachinePrecision] - N[(alpha - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
t_1 := \left(\beta + \alpha\right) + 3\\
\mathbf{if}\;\alpha \leq 4.3 \cdot 10^{+32}:\\
\;\;\;\;{t\_0}^{-2} \cdot {\left(\frac{t\_1}{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) - -1}\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(-1 - \alpha\right) \cdot \frac{2 + \alpha}{\beta} - \left(\left(\frac{-1}{\beta} - \frac{\alpha}{\beta}\right) - \left(\alpha - -1\right)\right)}{t\_1}}{t\_0}\\
\end{array}
\end{array}
if alpha < 4.2999999999999997e32Initial program 99.8%
lift-/.f64N/A
clear-numN/A
inv-powN/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r/N/A
Applied rewrites99.9%
if 4.2999999999999997e32 < alpha Initial program 79.4%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites79.4%
Taylor expanded in beta around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-+.f64N/A
lower-/.f64N/A
lower-+.f6424.4
Applied rewrites24.4%
Final simplification77.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0))
(t_1
(/
(/ (/ (- (+ (* beta alpha) (+ beta alpha)) -1.0) t_0) t_0)
(- t_0 -1.0))))
(if (<= t_1 0.1)
t_1
(/
(/
(-
(* (- -1.0 alpha) (/ (fma 2.0 alpha 5.0) beta))
(- (- (/ -1.0 beta) (/ alpha beta)) (- alpha -1.0)))
beta)
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double t_1 = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (t_0 - -1.0);
double tmp;
if (t_1 <= 0.1) {
tmp = t_1;
} else {
tmp = ((((-1.0 - alpha) * (fma(2.0, alpha, 5.0) / beta)) - (((-1.0 / beta) - (alpha / beta)) - (alpha - -1.0))) / beta) / t_0;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) t_1 = Float64(Float64(Float64(Float64(Float64(Float64(beta * alpha) + Float64(beta + alpha)) - -1.0) / t_0) / t_0) / Float64(t_0 - -1.0)) tmp = 0.0 if (t_1 <= 0.1) tmp = t_1; else tmp = Float64(Float64(Float64(Float64(Float64(-1.0 - alpha) * Float64(fma(2.0, alpha, 5.0) / beta)) - Float64(Float64(Float64(-1.0 / beta) - Float64(alpha / beta)) - Float64(alpha - -1.0))) / beta) / 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(N[(beta * alpha), $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]}, If[LessEqual[t$95$1, 0.1], t$95$1, N[(N[(N[(N[(N[(-1.0 - alpha), $MachinePrecision] * N[(N[(2.0 * alpha + 5.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(-1.0 / beta), $MachinePrecision] - N[(alpha / beta), $MachinePrecision]), $MachinePrecision] - N[(alpha - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
t_1 := \frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) - -1}{t\_0}}{t\_0}}{t\_0 - -1}\\
\mathbf{if}\;t\_1 \leq 0.1:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(-1 - \alpha\right) \cdot \frac{\mathsf{fma}\left(2, \alpha, 5\right)}{\beta} - \left(\left(\frac{-1}{\beta} - \frac{\alpha}{\beta}\right) - \left(\alpha - -1\right)\right)}{\beta}}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64))) < 0.10000000000000001Initial program 99.8%
if 0.10000000000000001 < (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64))) Initial program 1.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites1.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f6457.6
Applied rewrites57.6%
Final simplification97.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 3.0)) (t_1 (+ (+ beta alpha) 2.0)))
(if (<= alpha 4.3e+32)
(/ (* (pow t_1 -2.0) (- (fma beta alpha (+ beta alpha)) -1.0)) t_0)
(/
(/
(-
(* (- -1.0 alpha) (/ (+ 2.0 alpha) beta))
(- (- (/ -1.0 beta) (/ alpha beta)) (- alpha -1.0)))
t_0)
t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 3.0;
double t_1 = (beta + alpha) + 2.0;
double tmp;
if (alpha <= 4.3e+32) {
tmp = (pow(t_1, -2.0) * (fma(beta, alpha, (beta + alpha)) - -1.0)) / t_0;
} else {
tmp = ((((-1.0 - alpha) * ((2.0 + alpha) / beta)) - (((-1.0 / beta) - (alpha / beta)) - (alpha - -1.0))) / t_0) / t_1;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 3.0) t_1 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (alpha <= 4.3e+32) tmp = Float64(Float64((t_1 ^ -2.0) * Float64(fma(beta, alpha, Float64(beta + alpha)) - -1.0)) / t_0); else tmp = Float64(Float64(Float64(Float64(Float64(-1.0 - alpha) * Float64(Float64(2.0 + alpha) / beta)) - Float64(Float64(Float64(-1.0 / beta) - Float64(alpha / beta)) - Float64(alpha - -1.0))) / t_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[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[alpha, 4.3e+32], N[(N[(N[Power[t$95$1, -2.0], $MachinePrecision] * N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(N[(N[(-1.0 - alpha), $MachinePrecision] * N[(N[(2.0 + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(-1.0 / beta), $MachinePrecision] - N[(alpha / beta), $MachinePrecision]), $MachinePrecision] - N[(alpha - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 3\\
t_1 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\alpha \leq 4.3 \cdot 10^{+32}:\\
\;\;\;\;\frac{{t\_1}^{-2} \cdot \left(\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) - -1\right)}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(-1 - \alpha\right) \cdot \frac{2 + \alpha}{\beta} - \left(\left(\frac{-1}{\beta} - \frac{\alpha}{\beta}\right) - \left(\alpha - -1\right)\right)}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if alpha < 4.2999999999999997e32Initial program 99.8%
Applied rewrites99.9%
if 4.2999999999999997e32 < alpha Initial program 79.4%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites79.4%
Taylor expanded in beta around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-+.f64N/A
lower-/.f64N/A
lower-+.f6424.4
Applied rewrites24.4%
Final simplification77.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0))
(t_1
(/
(/ (/ (- (+ (* beta alpha) (+ beta alpha)) -1.0) t_0) t_0)
(- t_0 -1.0))))
(if (<= t_1 0.1) t_1 (/ (/ (- alpha -1.0) (+ (+ beta alpha) 3.0)) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double t_1 = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (t_0 - -1.0);
double tmp;
if (t_1 <= 0.1) {
tmp = t_1;
} else {
tmp = ((alpha - -1.0) / ((beta + alpha) + 3.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) :: t_1
real(8) :: tmp
t_0 = (beta + alpha) + 2.0d0
t_1 = (((((beta * alpha) + (beta + alpha)) - (-1.0d0)) / t_0) / t_0) / (t_0 - (-1.0d0))
if (t_1 <= 0.1d0) then
tmp = t_1
else
tmp = ((alpha - (-1.0d0)) / ((beta + alpha) + 3.0d0)) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double t_1 = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (t_0 - -1.0);
double tmp;
if (t_1 <= 0.1) {
tmp = t_1;
} else {
tmp = ((alpha - -1.0) / ((beta + alpha) + 3.0)) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + alpha) + 2.0 t_1 = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (t_0 - -1.0) tmp = 0 if t_1 <= 0.1: tmp = t_1 else: tmp = ((alpha - -1.0) / ((beta + alpha) + 3.0)) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) t_1 = Float64(Float64(Float64(Float64(Float64(Float64(beta * alpha) + Float64(beta + alpha)) - -1.0) / t_0) / t_0) / Float64(t_0 - -1.0)) tmp = 0.0 if (t_1 <= 0.1) tmp = t_1; else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(beta + alpha) + 3.0)) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + alpha) + 2.0;
t_1 = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (t_0 - -1.0);
tmp = 0.0;
if (t_1 <= 0.1)
tmp = t_1;
else
tmp = ((alpha - -1.0) / ((beta + alpha) + 3.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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(N[(beta * alpha), $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]}, If[LessEqual[t$95$1, 0.1], t$95$1, N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
t_1 := \frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) - -1}{t\_0}}{t\_0}}{t\_0 - -1}\\
\mathbf{if}\;t\_1 \leq 0.1:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\left(\beta + \alpha\right) + 3}}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64))) < 0.10000000000000001Initial program 99.8%
if 0.10000000000000001 < (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64))) Initial program 1.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites1.7%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6458.3
Applied rewrites58.3%
Final simplification97.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0)))
(if (<= alpha 4.3e+32)
(/
(/ (/ (- (+ (* beta alpha) (+ beta alpha)) -1.0) t_0) t_0)
(- t_0 -1.0))
(/
(/
(-
(* (- -1.0 alpha) (/ (+ 2.0 alpha) beta))
(- (- (/ -1.0 beta) (/ alpha beta)) (- alpha -1.0)))
(+ (+ beta alpha) 3.0))
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (alpha <= 4.3e+32) {
tmp = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (t_0 - -1.0);
} else {
tmp = ((((-1.0 - alpha) * ((2.0 + alpha) / beta)) - (((-1.0 / beta) - (alpha / beta)) - (alpha - -1.0))) / ((beta + alpha) + 3.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 = (beta + alpha) + 2.0d0
if (alpha <= 4.3d+32) then
tmp = (((((beta * alpha) + (beta + alpha)) - (-1.0d0)) / t_0) / t_0) / (t_0 - (-1.0d0))
else
tmp = (((((-1.0d0) - alpha) * ((2.0d0 + alpha) / beta)) - ((((-1.0d0) / beta) - (alpha / beta)) - (alpha - (-1.0d0)))) / ((beta + alpha) + 3.0d0)) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (alpha <= 4.3e+32) {
tmp = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (t_0 - -1.0);
} else {
tmp = ((((-1.0 - alpha) * ((2.0 + alpha) / beta)) - (((-1.0 / beta) - (alpha / beta)) - (alpha - -1.0))) / ((beta + alpha) + 3.0)) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + alpha) + 2.0 tmp = 0 if alpha <= 4.3e+32: tmp = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (t_0 - -1.0) else: tmp = ((((-1.0 - alpha) * ((2.0 + alpha) / beta)) - (((-1.0 / beta) - (alpha / beta)) - (alpha - -1.0))) / ((beta + alpha) + 3.0)) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (alpha <= 4.3e+32) tmp = Float64(Float64(Float64(Float64(Float64(Float64(beta * alpha) + Float64(beta + alpha)) - -1.0) / t_0) / t_0) / Float64(t_0 - -1.0)); else tmp = Float64(Float64(Float64(Float64(Float64(-1.0 - alpha) * Float64(Float64(2.0 + alpha) / beta)) - Float64(Float64(Float64(-1.0 / beta) - Float64(alpha / beta)) - Float64(alpha - -1.0))) / Float64(Float64(beta + alpha) + 3.0)) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + alpha) + 2.0;
tmp = 0.0;
if (alpha <= 4.3e+32)
tmp = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (t_0 - -1.0);
else
tmp = ((((-1.0 - alpha) * ((2.0 + alpha) / beta)) - (((-1.0 / beta) - (alpha / beta)) - (alpha - -1.0))) / ((beta + alpha) + 3.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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[alpha, 4.3e+32], N[(N[(N[(N[(N[(N[(beta * alpha), $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], N[(N[(N[(N[(N[(-1.0 - alpha), $MachinePrecision] * N[(N[(2.0 + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(-1.0 / beta), $MachinePrecision] - N[(alpha / beta), $MachinePrecision]), $MachinePrecision] - N[(alpha - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\alpha \leq 4.3 \cdot 10^{+32}:\\
\;\;\;\;\frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) - -1}{t\_0}}{t\_0}}{t\_0 - -1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(-1 - \alpha\right) \cdot \frac{2 + \alpha}{\beta} - \left(\left(\frac{-1}{\beta} - \frac{\alpha}{\beta}\right) - \left(\alpha - -1\right)\right)}{\left(\beta + \alpha\right) + 3}}{t\_0}\\
\end{array}
\end{array}
if alpha < 4.2999999999999997e32Initial program 99.8%
if 4.2999999999999997e32 < alpha Initial program 79.4%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites79.4%
Taylor expanded in beta around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-+.f64N/A
lower-/.f64N/A
lower-+.f6424.4
Applied rewrites24.4%
Final simplification77.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0)))
(if (<= beta 5e+30)
(/
(- (fma beta alpha (+ beta alpha)) -1.0)
(*
(fma (+ (fma 2.0 alpha beta) 5.0) beta (* (+ 3.0 alpha) (+ 2.0 alpha)))
t_0))
(/ (/ (- alpha -1.0) (+ (+ beta alpha) 3.0)) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 5e+30) {
tmp = (fma(beta, alpha, (beta + alpha)) - -1.0) / (fma((fma(2.0, alpha, beta) + 5.0), beta, ((3.0 + alpha) * (2.0 + alpha))) * t_0);
} else {
tmp = ((alpha - -1.0) / ((beta + alpha) + 3.0)) / t_0;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 5e+30) tmp = Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) - -1.0) / Float64(fma(Float64(fma(2.0, alpha, beta) + 5.0), beta, Float64(Float64(3.0 + alpha) * Float64(2.0 + alpha))) * t_0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(beta + alpha) + 3.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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 5e+30], N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision] / N[(N[(N[(N[(2.0 * alpha + beta), $MachinePrecision] + 5.0), $MachinePrecision] * beta + N[(N[(3.0 + alpha), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+30}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) - -1}{\mathsf{fma}\left(\mathsf{fma}\left(2, \alpha, \beta\right) + 5, \beta, \left(3 + \alpha\right) \cdot \left(2 + \alpha\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\left(\beta + \alpha\right) + 3}}{t\_0}\\
\end{array}
\end{array}
if beta < 4.9999999999999998e30Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites95.9%
Taylor expanded in beta around 0
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6496.0
Applied rewrites96.0%
if 4.9999999999999998e30 < beta Initial program 79.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites79.7%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6486.5
Applied rewrites86.5%
Final simplification93.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0)))
(if (<= beta 5e+30)
(/ (- (fma beta alpha (+ beta alpha)) -1.0) (* (fma t_0 t_0 t_0) t_0))
(/ (/ (- alpha -1.0) (+ (+ beta alpha) 3.0)) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 5e+30) {
tmp = (fma(beta, alpha, (beta + alpha)) - -1.0) / (fma(t_0, t_0, t_0) * t_0);
} else {
tmp = ((alpha - -1.0) / ((beta + alpha) + 3.0)) / t_0;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 5e+30) tmp = Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) - -1.0) / Float64(fma(t_0, t_0, t_0) * t_0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(beta + alpha) + 3.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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 5e+30], N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision] / N[(N[(t$95$0 * t$95$0 + t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+30}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) - -1}{\mathsf{fma}\left(t\_0, t\_0, t\_0\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\left(\beta + \alpha\right) + 3}}{t\_0}\\
\end{array}
\end{array}
if beta < 4.9999999999999998e30Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites95.9%
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
metadata-evalN/A
associate-+l+N/A
lift-+.f64N/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6496.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.0
lift-+.f64N/A
+-commutativeN/A
lift-+.f6496.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.0
lift-+.f64N/A
+-commutativeN/A
lift-+.f6496.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.0
lift-+.f64N/A
+-commutativeN/A
lift-+.f6496.0
Applied rewrites96.0%
if 4.9999999999999998e30 < beta Initial program 79.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites79.7%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6486.5
Applied rewrites86.5%
Final simplification93.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 3.0)) (t_1 (+ (+ beta alpha) 2.0)))
(if (<= beta 4e+102)
(/ (/ (- (fma beta alpha (+ beta alpha)) -1.0) t_1) (* t_1 t_0))
(/ (/ (- alpha -1.0) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 3.0;
double t_1 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 4e+102) {
tmp = ((fma(beta, alpha, (beta + alpha)) - -1.0) / t_1) / (t_1 * t_0);
} else {
tmp = ((alpha - -1.0) / t_0) / t_1;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 3.0) t_1 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 4e+102) tmp = Float64(Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) - -1.0) / t_1) / Float64(t_1 * t_0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / t_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[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 4e+102], N[(N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * t$95$0), $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 := \left(\beta + \alpha\right) + 3\\
t_1 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+102}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) - -1}{t\_1}}{t\_1 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 3.99999999999999991e102Initial program 98.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites98.0%
if 3.99999999999999991e102 < beta Initial program 77.3%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites77.3%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6491.9
Applied rewrites91.9%
Final simplification96.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 3.0)) (t_1 (+ (+ beta alpha) 2.0)))
(if (<= beta 5e+30)
(/ (- (fma beta alpha (+ beta alpha)) -1.0) (* (* t_1 t_0) t_1))
(/ (/ (- alpha -1.0) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 3.0;
double t_1 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 5e+30) {
tmp = (fma(beta, alpha, (beta + alpha)) - -1.0) / ((t_1 * t_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(Float64(beta + alpha) + 3.0) t_1 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 5e+30) tmp = Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) - -1.0) / Float64(Float64(t_1 * t_0) * t_1)); else tmp = Float64(Float64(Float64(alpha - -1.0) / t_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[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 5e+30], N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision] / N[(N[(t$95$1 * t$95$0), $MachinePrecision] * t$95$1), $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 := \left(\beta + \alpha\right) + 3\\
t_1 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+30}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) - -1}{\left(t\_1 \cdot t\_0\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 4.9999999999999998e30Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites95.9%
if 4.9999999999999998e30 < beta Initial program 79.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites79.7%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6486.5
Applied rewrites86.5%
Final simplification93.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2e+16) (/ (/ (- beta -1.0) (fma (+ 5.0 beta) beta 6.0)) (+ (+ beta alpha) 2.0)) (/ (/ (- alpha -1.0) (+ (+ 2.0 beta) alpha)) (+ (+ 3.0 alpha) beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2e+16) {
tmp = ((beta - -1.0) / fma((5.0 + beta), beta, 6.0)) / ((beta + alpha) + 2.0);
} else {
tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / ((3.0 + alpha) + beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2e+16) tmp = Float64(Float64(Float64(beta - -1.0) / fma(Float64(5.0 + beta), beta, 6.0)) / Float64(Float64(beta + alpha) + 2.0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(2.0 + beta) + alpha)) / Float64(Float64(3.0 + alpha) + 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, 5.2e+16], N[(N[(N[(beta - -1.0), $MachinePrecision] / N[(N[(5.0 + beta), $MachinePrecision] * beta + 6.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(3.0 + alpha), $MachinePrecision] + beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{\beta - -1}{\mathsf{fma}\left(5 + \beta, \beta, 6\right)}}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \alpha}}{\left(3 + \alpha\right) + \beta}\\
\end{array}
\end{array}
if beta < 5.2e16Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6468.7
Applied rewrites68.7%
Taylor expanded in beta around 0
Applied rewrites68.7%
if 5.2e16 < beta Initial program 81.4%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.4%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6486.6
Applied rewrites86.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
distribute-rgt-inN/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
Applied rewrites86.6%
Final simplification74.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.15e+16) (/ (/ (- beta -1.0) (* (+ beta 3.0) (+ 2.0 beta))) (+ 2.0 beta)) (/ (/ (- alpha -1.0) (+ (+ 2.0 beta) alpha)) (+ (+ 3.0 alpha) beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15e+16) {
tmp = ((beta - -1.0) / ((beta + 3.0) * (2.0 + beta))) / (2.0 + beta);
} else {
tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / ((3.0 + alpha) + beta);
}
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 <= 1.15d+16) then
tmp = ((beta - (-1.0d0)) / ((beta + 3.0d0) * (2.0d0 + beta))) / (2.0d0 + beta)
else
tmp = ((alpha - (-1.0d0)) / ((2.0d0 + beta) + alpha)) / ((3.0d0 + alpha) + beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15e+16) {
tmp = ((beta - -1.0) / ((beta + 3.0) * (2.0 + beta))) / (2.0 + beta);
} else {
tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / ((3.0 + alpha) + beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.15e+16: tmp = ((beta - -1.0) / ((beta + 3.0) * (2.0 + beta))) / (2.0 + beta) else: tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / ((3.0 + alpha) + beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.15e+16) tmp = Float64(Float64(Float64(beta - -1.0) / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))) / Float64(2.0 + beta)); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(2.0 + beta) + alpha)) / Float64(Float64(3.0 + alpha) + beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.15e+16)
tmp = ((beta - -1.0) / ((beta + 3.0) * (2.0 + beta))) / (2.0 + beta);
else
tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / ((3.0 + alpha) + beta);
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, 1.15e+16], N[(N[(N[(beta - -1.0), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(3.0 + alpha), $MachinePrecision] + beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.15 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{\beta - -1}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}}{2 + \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \alpha}}{\left(3 + \alpha\right) + \beta}\\
\end{array}
\end{array}
if beta < 1.15e16Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6468.5
Applied rewrites68.5%
Taylor expanded in alpha around 0
lower-+.f6467.7
Applied rewrites67.7%
if 1.15e16 < beta Initial program 81.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.6%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6486.8
Applied rewrites86.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
distribute-rgt-inN/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
Applied rewrites86.8%
Final simplification74.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.5)
(/
(fma
(fma
(fma 0.03780864197530864 beta -0.05092592592592592)
beta
0.027777777777777776)
beta
0.16666666666666666)
(+ (+ beta alpha) 2.0))
(/ (/ (- alpha -1.0) (+ (+ 2.0 beta) alpha)) (+ (+ 3.0 alpha) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.5) {
tmp = fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / ((beta + alpha) + 2.0);
} else {
tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / ((3.0 + alpha) + beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.5) tmp = Float64(fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 2.0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(2.0 + beta) + alpha)) / Float64(Float64(3.0 + alpha) + 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, 1.5], N[(N[(N[(N[(0.03780864197530864 * beta + -0.05092592592592592), $MachinePrecision] * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(3.0 + alpha), $MachinePrecision] + beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.5:\\
\;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \alpha}}{\left(3 + \alpha\right) + \beta}\\
\end{array}
\end{array}
if beta < 1.5Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites67.5%
if 1.5 < beta Initial program 82.9%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites82.9%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6483.9
Applied rewrites83.9%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
distribute-rgt-inN/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
Applied rewrites83.9%
Final simplification73.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0)))
(if (<= beta 2.5)
(/
(fma
(fma
(fma 0.03780864197530864 beta -0.05092592592592592)
beta
0.027777777777777776)
beta
0.16666666666666666)
t_0)
(/ (/ (- alpha -1.0) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 2.5) {
tmp = fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0;
} else {
tmp = ((alpha - -1.0) / beta) / t_0;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 2.5) tmp = Float64(fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 2.5], N[(N[(N[(N[(0.03780864197530864 * beta + -0.05092592592592592), $MachinePrecision] * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites67.5%
if 2.5 < beta Initial program 82.9%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites82.9%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6483.3
Applied rewrites83.3%
Final simplification73.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.4)
(/
(fma 0.027777777777777776 beta 0.16666666666666666)
(+ (+ beta alpha) 2.0))
(if (<= beta 6.3e+152)
(/ (- alpha -1.0) (* beta beta))
(if (<= beta 6.5e+161) (/ (/ 1.0 beta) beta) (/ (/ alpha beta) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4) {
tmp = fma(0.027777777777777776, beta, 0.16666666666666666) / ((beta + alpha) + 2.0);
} else if (beta <= 6.3e+152) {
tmp = (alpha - -1.0) / (beta * beta);
} else if (beta <= 6.5e+161) {
tmp = (1.0 / beta) / beta;
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.4) tmp = Float64(fma(0.027777777777777776, beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 2.0)); elseif (beta <= 6.3e+152) tmp = Float64(Float64(alpha - -1.0) / Float64(beta * beta)); elseif (beta <= 6.5e+161) tmp = Float64(Float64(1.0 / beta) / beta); else tmp = Float64(Float64(alpha / 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, 5.4], N[(N[(0.027777777777777776 * beta + 0.16666666666666666), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 6.3e+152], N[(N[(alpha - -1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 6.5e+161], N[(N[(1.0 / beta), $MachinePrecision] / beta), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.4:\\
\;\;\;\;\frac{\mathsf{fma}\left(0.027777777777777776, \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\
\mathbf{elif}\;\beta \leq 6.3 \cdot 10^{+152}:\\
\;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\
\mathbf{elif}\;\beta \leq 6.5 \cdot 10^{+161}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.4000000000000004Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.3
Applied rewrites67.3%
Taylor expanded in beta around 0
Applied rewrites66.4%
if 5.4000000000000004 < beta < 6.29999999999999957e152Initial program 91.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6476.1
Applied rewrites76.1%
if 6.29999999999999957e152 < beta < 6.5e161Initial program 99.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6448.5
Applied rewrites48.5%
Taylor expanded in alpha around 0
Applied rewrites48.5%
Applied rewrites99.1%
if 6.5e161 < beta Initial program 68.9%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6477.2
Applied rewrites77.2%
Taylor expanded in alpha around inf
Applied rewrites77.2%
Applied rewrites91.9%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 9.0)
(/ 0.16666666666666666 (+ (+ beta alpha) 2.0))
(if (<= beta 6.3e+152)
(/ (- alpha -1.0) (* beta beta))
(if (<= beta 6.5e+161) (/ (/ 1.0 beta) beta) (/ (/ alpha beta) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else if (beta <= 6.3e+152) {
tmp = (alpha - -1.0) / (beta * beta);
} else if (beta <= 6.5e+161) {
tmp = (1.0 / beta) / beta;
} else {
tmp = (alpha / beta) / beta;
}
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 <= 9.0d0) then
tmp = 0.16666666666666666d0 / ((beta + alpha) + 2.0d0)
else if (beta <= 6.3d+152) then
tmp = (alpha - (-1.0d0)) / (beta * beta)
else if (beta <= 6.5d+161) then
tmp = (1.0d0 / beta) / beta
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else if (beta <= 6.3e+152) {
tmp = (alpha - -1.0) / (beta * beta);
} else if (beta <= 6.5e+161) {
tmp = (1.0 / beta) / beta;
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.0: tmp = 0.16666666666666666 / ((beta + alpha) + 2.0) elif beta <= 6.3e+152: tmp = (alpha - -1.0) / (beta * beta) elif beta <= 6.5e+161: tmp = (1.0 / beta) / beta else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.0) tmp = Float64(0.16666666666666666 / Float64(Float64(beta + alpha) + 2.0)); elseif (beta <= 6.3e+152) tmp = Float64(Float64(alpha - -1.0) / Float64(beta * beta)); elseif (beta <= 6.5e+161) tmp = Float64(Float64(1.0 / beta) / beta); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.0)
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
elseif (beta <= 6.3e+152)
tmp = (alpha - -1.0) / (beta * beta);
elseif (beta <= 6.5e+161)
tmp = (1.0 / beta) / beta;
else
tmp = (alpha / beta) / beta;
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, 9.0], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 6.3e+152], N[(N[(alpha - -1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 6.5e+161], N[(N[(1.0 / beta), $MachinePrecision] / beta), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9:\\
\;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\
\mathbf{elif}\;\beta \leq 6.3 \cdot 10^{+152}:\\
\;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\
\mathbf{elif}\;\beta \leq 6.5 \cdot 10^{+161}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 9Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.3
Applied rewrites67.3%
Taylor expanded in beta around 0
Applied rewrites65.6%
if 9 < beta < 6.29999999999999957e152Initial program 91.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6476.1
Applied rewrites76.1%
if 6.29999999999999957e152 < beta < 6.5e161Initial program 99.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6448.5
Applied rewrites48.5%
Taylor expanded in alpha around 0
Applied rewrites48.5%
Applied rewrites99.1%
if 6.5e161 < beta Initial program 68.9%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6477.2
Applied rewrites77.2%
Taylor expanded in alpha around inf
Applied rewrites77.2%
Applied rewrites91.9%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0)))
(if (<= beta 1.85)
(/
(fma
(fma -0.05092592592592592 beta 0.027777777777777776)
beta
0.16666666666666666)
t_0)
(/ (/ (- alpha -1.0) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 1.85) {
tmp = fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0;
} else {
tmp = ((alpha - -1.0) / beta) / t_0;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 1.85) tmp = Float64(fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 1.85], N[(N[(N[(-0.05092592592592592 * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 1.85:\\
\;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.05092592592592592, \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.8500000000000001Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites67.3%
if 1.8500000000000001 < beta Initial program 82.9%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites82.9%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6483.3
Applied rewrites83.3%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.9)
(/
(fma
(fma -0.05092592592592592 beta 0.027777777777777776)
beta
0.16666666666666666)
(+ (+ beta alpha) 2.0))
(/ (/ (- alpha -1.0) beta) (+ 2.0 beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.9) {
tmp = fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / ((beta + alpha) + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / (2.0 + beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.9) tmp = Float64(fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 2.0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(2.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, 1.9], N[(N[(N[(-0.05092592592592592 * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.9:\\
\;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.05092592592592592, \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{2 + \beta}\\
\end{array}
\end{array}
if beta < 1.8999999999999999Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites67.3%
if 1.8999999999999999 < beta Initial program 82.9%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites82.9%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6483.3
Applied rewrites83.3%
Taylor expanded in alpha around 0
lower-+.f6483.2
Applied rewrites83.2%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 9.0)
(/ 0.16666666666666666 (+ (+ beta alpha) 2.0))
(if (<= beta 3.4e+157)
(/ (- alpha -1.0) (* beta beta))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else if (beta <= 3.4e+157) {
tmp = (alpha - -1.0) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
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 <= 9.0d0) then
tmp = 0.16666666666666666d0 / ((beta + alpha) + 2.0d0)
else if (beta <= 3.4d+157) then
tmp = (alpha - (-1.0d0)) / (beta * beta)
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else if (beta <= 3.4e+157) {
tmp = (alpha - -1.0) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.0: tmp = 0.16666666666666666 / ((beta + alpha) + 2.0) elif beta <= 3.4e+157: tmp = (alpha - -1.0) / (beta * beta) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.0) tmp = Float64(0.16666666666666666 / Float64(Float64(beta + alpha) + 2.0)); elseif (beta <= 3.4e+157) tmp = Float64(Float64(alpha - -1.0) / Float64(beta * beta)); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.0)
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
elseif (beta <= 3.4e+157)
tmp = (alpha - -1.0) / (beta * beta);
else
tmp = (alpha / beta) / beta;
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, 9.0], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.4e+157], N[(N[(alpha - -1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9:\\
\;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\
\mathbf{elif}\;\beta \leq 3.4 \cdot 10^{+157}:\\
\;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 9Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.3
Applied rewrites67.3%
Taylor expanded in beta around 0
Applied rewrites65.6%
if 9 < beta < 3.39999999999999979e157Initial program 92.5%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6473.5
Applied rewrites73.5%
if 3.39999999999999979e157 < beta Initial program 68.9%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6477.2
Applied rewrites77.2%
Taylor expanded in alpha around inf
Applied rewrites77.2%
Applied rewrites91.9%
Final simplification71.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.0)
(/
(fma 0.027777777777777776 beta 0.16666666666666666)
(+ (+ beta alpha) 2.0))
(/ (/ (- alpha -1.0) beta) (+ 2.0 beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = fma(0.027777777777777776, beta, 0.16666666666666666) / ((beta + alpha) + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / (2.0 + beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = Float64(fma(0.027777777777777776, beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 2.0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(2.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, 4.0], N[(N[(0.027777777777777776 * beta + 0.16666666666666666), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{\mathsf{fma}\left(0.027777777777777776, \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{2 + \beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.3
Applied rewrites67.3%
Taylor expanded in beta around 0
Applied rewrites66.4%
if 4 < beta Initial program 82.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites82.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6484.2
Applied rewrites84.2%
Taylor expanded in alpha around 0
lower-+.f6484.0
Applied rewrites84.0%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.4)
(/
(fma 0.027777777777777776 beta 0.16666666666666666)
(+ (+ beta alpha) 2.0))
(/ (/ (- alpha -1.0) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4) {
tmp = fma(0.027777777777777776, beta, 0.16666666666666666) / ((beta + alpha) + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.4) tmp = Float64(fma(0.027777777777777776, beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 2.0)); 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, 5.4], N[(N[(0.027777777777777776 * beta + 0.16666666666666666), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $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 5.4:\\
\;\;\;\;\frac{\mathsf{fma}\left(0.027777777777777776, \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.4000000000000004Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.3
Applied rewrites67.3%
Taylor expanded in beta around 0
Applied rewrites66.4%
if 5.4000000000000004 < beta Initial program 82.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6475.0
Applied rewrites75.0%
Applied rewrites84.0%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9.0) (/ 0.16666666666666666 (+ (+ beta alpha) 2.0)) (/ (- alpha -1.0) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else {
tmp = (alpha - -1.0) / (beta * beta);
}
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 <= 9.0d0) then
tmp = 0.16666666666666666d0 / ((beta + alpha) + 2.0d0)
else
tmp = (alpha - (-1.0d0)) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else {
tmp = (alpha - -1.0) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.0: tmp = 0.16666666666666666 / ((beta + alpha) + 2.0) else: tmp = (alpha - -1.0) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.0) tmp = Float64(0.16666666666666666 / Float64(Float64(beta + alpha) + 2.0)); else tmp = Float64(Float64(alpha - -1.0) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.0)
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
else
tmp = (alpha - -1.0) / (beta * beta);
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, 9.0], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $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 9:\\
\;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 9Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.3
Applied rewrites67.3%
Taylor expanded in beta around 0
Applied rewrites65.6%
if 9 < beta Initial program 82.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6475.0
Applied rewrites75.0%
Final simplification69.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9.0) (/ 0.16666666666666666 (+ (+ beta alpha) 2.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else {
tmp = 1.0 / (beta * beta);
}
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 <= 9.0d0) then
tmp = 0.16666666666666666d0 / ((beta + alpha) + 2.0d0)
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.0: tmp = 0.16666666666666666 / ((beta + alpha) + 2.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.0) tmp = Float64(0.16666666666666666 / Float64(Float64(beta + alpha) + 2.0)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.0)
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
else
tmp = 1.0 / (beta * beta);
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, 9.0], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $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 9:\\
\;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 9Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6414.7
Applied rewrites14.7%
Taylor expanded in alpha around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6467.3
Applied rewrites67.3%
Taylor expanded in beta around 0
Applied rewrites65.6%
if 9 < beta Initial program 82.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6475.0
Applied rewrites75.0%
Taylor expanded in alpha around 0
Applied rewrites68.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 7.8e-15) (/ 1.0 (* beta beta)) (/ alpha (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.8e-15) {
tmp = 1.0 / (beta * beta);
} else {
tmp = alpha / (beta * beta);
}
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 (alpha <= 7.8d-15) then
tmp = 1.0d0 / (beta * beta)
else
tmp = alpha / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.8e-15) {
tmp = 1.0 / (beta * beta);
} else {
tmp = alpha / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 7.8e-15: tmp = 1.0 / (beta * beta) else: tmp = alpha / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 7.8e-15) tmp = Float64(1.0 / Float64(beta * beta)); else tmp = Float64(alpha / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (alpha <= 7.8e-15)
tmp = 1.0 / (beta * beta);
else
tmp = alpha / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[alpha, 7.8e-15], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(alpha / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 7.8 \cdot 10^{-15}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if alpha < 7.80000000000000053e-15Initial program 99.9%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6435.2
Applied rewrites35.2%
Taylor expanded in alpha around 0
Applied rewrites35.2%
if 7.80000000000000053e-15 < alpha Initial program 82.1%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6418.1
Applied rewrites18.1%
Taylor expanded in alpha around inf
Applied rewrites17.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ alpha (* beta beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return alpha / (beta * beta);
}
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 = alpha / (beta * beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return alpha / (beta * beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return alpha / (beta * beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(alpha / Float64(beta * beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = alpha / (beta * beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(alpha / N[(beta * beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\alpha}{\beta \cdot \beta}
\end{array}
Initial program 93.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6429.3
Applied rewrites29.3%
Taylor expanded in alpha around inf
Applied rewrites17.1%
herbie shell --seed 2024332
(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)))