
(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 18 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
(if (<= alpha 7000000000000.0)
(/
(*
(+ (fma beta alpha (+ beta alpha)) 1.0)
(pow (+ (+ beta alpha) 2.0) -2.0))
(+ 3.0 (+ beta alpha)))
(/
(/
(pow
(-
(/
(fma
-1.0
(+ (/ 2.0 (- -1.0 beta)) (/ beta (- -1.0 beta)))
(/ (- -1.0 beta) (pow (- -1.0 beta) 2.0)))
alpha)
(pow (- -1.0 beta) -1.0))
-1.0)
(+ (+ alpha beta) 2.0))
(+ (+ (+ alpha beta) 1.0) 2.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 7000000000000.0) {
tmp = ((fma(beta, alpha, (beta + alpha)) + 1.0) * pow(((beta + alpha) + 2.0), -2.0)) / (3.0 + (beta + alpha));
} else {
tmp = (pow(((fma(-1.0, ((2.0 / (-1.0 - beta)) + (beta / (-1.0 - beta))), ((-1.0 - beta) / pow((-1.0 - beta), 2.0))) / alpha) - pow((-1.0 - beta), -1.0)), -1.0) / ((alpha + beta) + 2.0)) / (((alpha + beta) + 1.0) + 2.0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 7000000000000.0) tmp = Float64(Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) + 1.0) * (Float64(Float64(beta + alpha) + 2.0) ^ -2.0)) / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(Float64((Float64(Float64(fma(-1.0, Float64(Float64(2.0 / Float64(-1.0 - beta)) + Float64(beta / Float64(-1.0 - beta))), Float64(Float64(-1.0 - beta) / (Float64(-1.0 - beta) ^ 2.0))) / alpha) - (Float64(-1.0 - beta) ^ -1.0)) ^ -1.0) / Float64(Float64(alpha + beta) + 2.0)) / Float64(Float64(Float64(alpha + beta) + 1.0) + 2.0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[alpha, 7000000000000.0], N[(N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[Power[N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[N[(N[(N[(-1.0 * N[(N[(2.0 / N[(-1.0 - beta), $MachinePrecision]), $MachinePrecision] + N[(beta / N[(-1.0 - beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-1.0 - beta), $MachinePrecision] / N[Power[N[(-1.0 - beta), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] - N[Power[N[(-1.0 - beta), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 1.0), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 7000000000000:\\
\;\;\;\;\frac{\left(\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) + 1\right) \cdot {\left(\left(\beta + \alpha\right) + 2\right)}^{-2}}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{{\left(\frac{\mathsf{fma}\left(-1, \frac{2}{-1 - \beta} + \frac{\beta}{-1 - \beta}, \frac{-1 - \beta}{{\left(-1 - \beta\right)}^{2}}\right)}{\alpha} - {\left(-1 - \beta\right)}^{-1}\right)}^{-1}}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + 1\right) + 2}\\
\end{array}
\end{array}
if alpha < 7e12Initial program 99.9%
Applied rewrites99.9%
if 7e12 < alpha Initial program 76.3%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6476.3
lift-+.f64N/A
+-commutativeN/A
lower-+.f6476.3
lift-*.f64N/A
metadata-eval76.3
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6476.3
lift-+.f64N/A
+-commutativeN/A
lower-+.f6476.3
Applied rewrites76.3%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-/.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
lower-+.f64N/A
+-commutativeN/A
Applied rewrites55.6%
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lift-*.f64N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
metadata-evalN/A
associate--l+N/A
metadata-evalN/A
lift-*.f64N/A
lift-+.f64N/A
lower-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
metadata-evalN/A
associate--l+N/A
metadata-evalN/A
lower-+.f6455.6
Applied rewrites55.6%
Taylor expanded in alpha around -inf
lower--.f64N/A
Applied rewrites99.8%
Final simplification99.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 2.55e+90)
(/
(fma (+ alpha 1.0) beta (/ (fma alpha alpha -1.0) (- alpha 1.0)))
(* (* (+ 3.0 (+ alpha beta)) t_0) t_0))
(/
(/
(-
(+ (+ 1.0 (+ alpha (pow beta -1.0))) (/ alpha beta))
(* (+ 1.0 alpha) (/ (fma 2.0 alpha 4.0) beta)))
beta)
(+ 3.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 2.55e+90) {
tmp = fma((alpha + 1.0), beta, (fma(alpha, alpha, -1.0) / (alpha - 1.0))) / (((3.0 + (alpha + beta)) * t_0) * t_0);
} else {
tmp = ((((1.0 + (alpha + pow(beta, -1.0))) + (alpha / beta)) - ((1.0 + alpha) * (fma(2.0, alpha, 4.0) / beta))) / beta) / (3.0 + (beta + alpha));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 2.55e+90) tmp = Float64(fma(Float64(alpha + 1.0), beta, Float64(fma(alpha, alpha, -1.0) / Float64(alpha - 1.0))) / Float64(Float64(Float64(3.0 + Float64(alpha + beta)) * t_0) * t_0)); else tmp = Float64(Float64(Float64(Float64(Float64(1.0 + Float64(alpha + (beta ^ -1.0))) + Float64(alpha / beta)) - Float64(Float64(1.0 + alpha) * Float64(fma(2.0, alpha, 4.0) / beta))) / beta) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.55e+90], N[(N[(N[(alpha + 1.0), $MachinePrecision] * beta + N[(N[(alpha * alpha + -1.0), $MachinePrecision] / N[(alpha - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(1.0 + N[(alpha + N[Power[beta, -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] - N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(2.0 * alpha + 4.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 2.55 \cdot 10^{+90}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\alpha + 1, \beta, \frac{\mathsf{fma}\left(\alpha, \alpha, -1\right)}{\alpha - 1}\right)}{\left(\left(3 + \left(\alpha + \beta\right)\right) \cdot t\_0\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(\left(1 + \left(\alpha + {\beta}^{-1}\right)\right) + \frac{\alpha}{\beta}\right) - \left(1 + \alpha\right) \cdot \frac{\mathsf{fma}\left(2, \alpha, 4\right)}{\beta}}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 2.5499999999999998e90Initial program 99.9%
Applied rewrites99.9%
Applied rewrites96.3%
lift-+.f64N/A
flip-+N/A
lower-/.f64N/A
metadata-evalN/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
lower--.f6483.8
Applied rewrites83.8%
if 2.5499999999999998e90 < beta Initial program 75.8%
Applied rewrites69.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower--.f64N/A
associate-+r+N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/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.f6489.9
Applied rewrites89.9%
Final simplification85.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= alpha 7e+49)
(/
(*
(+ (fma beta alpha (+ beta alpha)) 1.0)
(pow (+ (+ beta alpha) 2.0) -2.0))
(+ 3.0 (+ beta alpha)))
(/
(/
(-
(+ (+ 1.0 alpha) (- (/ alpha beta) (/ -1.0 beta)))
(* (+ 1.0 alpha) (/ (+ 2.0 alpha) beta)))
(+ (+ alpha beta) 2.0))
(+ (+ (+ alpha beta) 1.0) 2.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 7e+49) {
tmp = ((fma(beta, alpha, (beta + alpha)) + 1.0) * pow(((beta + alpha) + 2.0), -2.0)) / (3.0 + (beta + alpha));
} else {
tmp = ((((1.0 + alpha) + ((alpha / beta) - (-1.0 / beta))) - ((1.0 + alpha) * ((2.0 + alpha) / beta))) / ((alpha + beta) + 2.0)) / (((alpha + beta) + 1.0) + 2.0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 7e+49) tmp = Float64(Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) + 1.0) * (Float64(Float64(beta + alpha) + 2.0) ^ -2.0)) / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(Float64(Float64(Float64(Float64(1.0 + alpha) + Float64(Float64(alpha / beta) - Float64(-1.0 / beta))) - Float64(Float64(1.0 + alpha) * Float64(Float64(2.0 + alpha) / beta))) / Float64(Float64(alpha + beta) + 2.0)) / Float64(Float64(Float64(alpha + beta) + 1.0) + 2.0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[alpha, 7e+49], N[(N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[Power[N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] + N[(N[(alpha / beta), $MachinePrecision] - N[(-1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(2.0 + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 1.0), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 7 \cdot 10^{+49}:\\
\;\;\;\;\frac{\left(\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) + 1\right) \cdot {\left(\left(\beta + \alpha\right) + 2\right)}^{-2}}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(\left(1 + \alpha\right) + \left(\frac{\alpha}{\beta} - \frac{-1}{\beta}\right)\right) - \left(1 + \alpha\right) \cdot \frac{2 + \alpha}{\beta}}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + 1\right) + 2}\\
\end{array}
\end{array}
if alpha < 6.9999999999999995e49Initial program 99.9%
Applied rewrites99.9%
if 6.9999999999999995e49 < alpha Initial program 74.1%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6474.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6474.0
lift-*.f64N/A
metadata-eval74.0
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6474.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6474.0
Applied rewrites74.0%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-/.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
lower-+.f64N/A
+-commutativeN/A
Applied rewrites60.9%
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lift-*.f64N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
metadata-evalN/A
associate--l+N/A
metadata-evalN/A
lift-*.f64N/A
lift-+.f64N/A
lower-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
metadata-evalN/A
associate--l+N/A
metadata-evalN/A
lower-+.f6460.9
Applied rewrites60.9%
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-+.f6422.8
Applied rewrites22.8%
Final simplification81.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 2.55e+90)
(/
(fma (+ alpha 1.0) beta (/ (fma alpha alpha -1.0) (- alpha 1.0)))
(* (* (+ 3.0 (+ alpha beta)) t_0) t_0))
(/
(/
(-
(+ (+ 1.0 alpha) (- (/ alpha beta) (/ -1.0 beta)))
(* (+ 1.0 alpha) (/ (+ 2.0 alpha) beta)))
(+ (+ alpha beta) 2.0))
(+ (+ (+ alpha beta) 1.0) 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 2.55e+90) {
tmp = fma((alpha + 1.0), beta, (fma(alpha, alpha, -1.0) / (alpha - 1.0))) / (((3.0 + (alpha + beta)) * t_0) * t_0);
} else {
tmp = ((((1.0 + alpha) + ((alpha / beta) - (-1.0 / beta))) - ((1.0 + alpha) * ((2.0 + alpha) / beta))) / ((alpha + beta) + 2.0)) / (((alpha + beta) + 1.0) + 2.0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 2.55e+90) tmp = Float64(fma(Float64(alpha + 1.0), beta, Float64(fma(alpha, alpha, -1.0) / Float64(alpha - 1.0))) / Float64(Float64(Float64(3.0 + Float64(alpha + beta)) * t_0) * t_0)); else tmp = Float64(Float64(Float64(Float64(Float64(1.0 + alpha) + Float64(Float64(alpha / beta) - Float64(-1.0 / beta))) - Float64(Float64(1.0 + alpha) * Float64(Float64(2.0 + alpha) / beta))) / Float64(Float64(alpha + beta) + 2.0)) / Float64(Float64(Float64(alpha + beta) + 1.0) + 2.0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.55e+90], N[(N[(N[(alpha + 1.0), $MachinePrecision] * beta + N[(N[(alpha * alpha + -1.0), $MachinePrecision] / N[(alpha - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] + N[(N[(alpha / beta), $MachinePrecision] - N[(-1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(2.0 + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 1.0), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 2.55 \cdot 10^{+90}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\alpha + 1, \beta, \frac{\mathsf{fma}\left(\alpha, \alpha, -1\right)}{\alpha - 1}\right)}{\left(\left(3 + \left(\alpha + \beta\right)\right) \cdot t\_0\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(\left(1 + \alpha\right) + \left(\frac{\alpha}{\beta} - \frac{-1}{\beta}\right)\right) - \left(1 + \alpha\right) \cdot \frac{2 + \alpha}{\beta}}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + 1\right) + 2}\\
\end{array}
\end{array}
if beta < 2.5499999999999998e90Initial program 99.9%
Applied rewrites99.9%
Applied rewrites96.3%
lift-+.f64N/A
flip-+N/A
lower-/.f64N/A
metadata-evalN/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
lower--.f6483.8
Applied rewrites83.8%
if 2.5499999999999998e90 < beta Initial program 75.8%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6475.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6475.8
lift-*.f64N/A
metadata-eval75.8
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6475.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6475.8
Applied rewrites75.8%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-/.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
lower-+.f64N/A
+-commutativeN/A
Applied rewrites85.8%
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lift-*.f64N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
metadata-evalN/A
associate--l+N/A
metadata-evalN/A
lift-*.f64N/A
lift-+.f64N/A
lower-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
metadata-evalN/A
associate--l+N/A
metadata-evalN/A
lower-+.f6485.8
Applied rewrites85.8%
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-+.f6490.0
Applied rewrites90.0%
Final simplification85.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 3.0 (+ alpha beta))) (t_1 (+ 2.0 (+ alpha beta))))
(if (<= beta 4.4e+94)
(/
(fma (+ alpha 1.0) beta (/ (fma alpha alpha -1.0) (- alpha 1.0)))
(* (* t_0 t_1) t_1))
(/ (/ (+ alpha 1.0) t_1) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 3.0 + (alpha + beta);
double t_1 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 4.4e+94) {
tmp = fma((alpha + 1.0), beta, (fma(alpha, alpha, -1.0) / (alpha - 1.0))) / ((t_0 * t_1) * t_1);
} else {
tmp = ((alpha + 1.0) / t_1) / t_0;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(3.0 + Float64(alpha + beta)) t_1 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 4.4e+94) tmp = Float64(fma(Float64(alpha + 1.0), beta, Float64(fma(alpha, alpha, -1.0) / Float64(alpha - 1.0))) / Float64(Float64(t_0 * t_1) * t_1)); else tmp = Float64(Float64(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[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.4e+94], N[(N[(N[(alpha + 1.0), $MachinePrecision] * beta + N[(N[(alpha * alpha + -1.0), $MachinePrecision] / N[(alpha - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 3 + \left(\alpha + \beta\right)\\
t_1 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 4.4 \cdot 10^{+94}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\alpha + 1, \beta, \frac{\mathsf{fma}\left(\alpha, \alpha, -1\right)}{\alpha - 1}\right)}{\left(t\_0 \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_1}}{t\_0}\\
\end{array}
\end{array}
if beta < 4.40000000000000024e94Initial program 99.9%
Applied rewrites99.9%
Applied rewrites96.3%
lift-+.f64N/A
flip-+N/A
lower-/.f64N/A
metadata-evalN/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
lower--.f6483.8
Applied rewrites83.8%
if 4.40000000000000024e94 < beta Initial program 75.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--.f6490.4
Applied rewrites90.4%
Applied rewrites90.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 4.7e+94)
(/
(fma (+ alpha 1.0) beta (+ alpha 1.0))
(*
(fma (+ (fma 2.0 alpha beta) 5.0) beta (* (+ 2.0 alpha) (+ 3.0 alpha)))
t_0))
(/ (/ (+ alpha 1.0) t_0) (+ 3.0 (+ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 4.7e+94) {
tmp = fma((alpha + 1.0), beta, (alpha + 1.0)) / (fma((fma(2.0, alpha, beta) + 5.0), beta, ((2.0 + alpha) * (3.0 + alpha))) * t_0);
} else {
tmp = ((alpha + 1.0) / t_0) / (3.0 + (alpha + beta));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 4.7e+94) tmp = Float64(fma(Float64(alpha + 1.0), beta, Float64(alpha + 1.0)) / Float64(fma(Float64(fma(2.0, alpha, beta) + 5.0), beta, Float64(Float64(2.0 + alpha) * Float64(3.0 + alpha))) * t_0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(3.0 + Float64(alpha + beta))); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.7e+94], N[(N[(N[(alpha + 1.0), $MachinePrecision] * beta + N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(N[(2.0 * alpha + beta), $MachinePrecision] + 5.0), $MachinePrecision] * beta + N[(N[(2.0 + alpha), $MachinePrecision] * N[(3.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 4.7 \cdot 10^{+94}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\alpha + 1, \beta, \alpha + 1\right)}{\mathsf{fma}\left(\mathsf{fma}\left(2, \alpha, \beta\right) + 5, \beta, \left(2 + \alpha\right) \cdot \left(3 + \alpha\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 4.70000000000000017e94Initial program 99.9%
Applied rewrites99.9%
Applied rewrites96.3%
Taylor expanded in beta around 0
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6496.3
Applied rewrites96.3%
if 4.70000000000000017e94 < beta Initial program 75.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--.f6490.4
Applied rewrites90.4%
Applied rewrites90.4%
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 4.7e+94)
(/
(+ (fma beta alpha (+ beta alpha)) 1.0)
(* (* (+ 3.0 (+ beta alpha)) t_0) t_0))
(/ (/ (+ alpha 1.0) (+ 2.0 (+ alpha beta))) (+ 3.0 (+ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 4.7e+94) {
tmp = (fma(beta, alpha, (beta + alpha)) + 1.0) / (((3.0 + (beta + alpha)) * t_0) * t_0);
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (3.0 + (alpha + beta));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 4.7e+94) tmp = Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) + 1.0) / Float64(Float64(Float64(3.0 + Float64(beta + alpha)) * t_0) * t_0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(2.0 + Float64(alpha + beta))) / Float64(3.0 + Float64(alpha + beta))); 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, 4.7e+94], N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 4.7 \cdot 10^{+94}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) + 1}{\left(\left(3 + \left(\beta + \alpha\right)\right) \cdot t\_0\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{2 + \left(\alpha + \beta\right)}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 4.70000000000000017e94Initial program 99.9%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites96.3%
if 4.70000000000000017e94 < beta Initial program 75.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--.f6490.4
Applied rewrites90.4%
Applied rewrites90.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 3.0 (+ alpha beta))) (t_1 (+ 2.0 (+ alpha beta))))
(if (<= beta 2.05e+17)
(/ (+ 1.0 beta) (* (* t_0 t_1) t_1))
(/ (/ (+ alpha 1.0) t_1) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 3.0 + (alpha + beta);
double t_1 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 2.05e+17) {
tmp = (1.0 + beta) / ((t_0 * t_1) * t_1);
} else {
tmp = ((alpha + 1.0) / t_1) / 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 = 3.0d0 + (alpha + beta)
t_1 = 2.0d0 + (alpha + beta)
if (beta <= 2.05d+17) then
tmp = (1.0d0 + beta) / ((t_0 * t_1) * t_1)
else
tmp = ((alpha + 1.0d0) / t_1) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 3.0 + (alpha + beta);
double t_1 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 2.05e+17) {
tmp = (1.0 + beta) / ((t_0 * t_1) * t_1);
} else {
tmp = ((alpha + 1.0) / t_1) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 3.0 + (alpha + beta) t_1 = 2.0 + (alpha + beta) tmp = 0 if beta <= 2.05e+17: tmp = (1.0 + beta) / ((t_0 * t_1) * t_1) else: tmp = ((alpha + 1.0) / t_1) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(3.0 + Float64(alpha + beta)) t_1 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 2.05e+17) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(t_0 * t_1) * t_1)); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_1) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 3.0 + (alpha + beta);
t_1 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 2.05e+17)
tmp = (1.0 + beta) / ((t_0 * t_1) * t_1);
else
tmp = ((alpha + 1.0) / t_1) / 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[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.05e+17], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(t$95$0 * t$95$1), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 3 + \left(\alpha + \beta\right)\\
t_1 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 2.05 \cdot 10^{+17}:\\
\;\;\;\;\frac{1 + \beta}{\left(t\_0 \cdot t\_1\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_1}}{t\_0}\\
\end{array}
\end{array}
if beta < 2.05e17Initial program 99.9%
Applied rewrites99.9%
Applied rewrites95.9%
Taylor expanded in alpha around 0
lower-+.f6486.9
Applied rewrites86.9%
if 2.05e17 < beta Initial program 81.2%
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--.f6488.2
Applied rewrites88.2%
Applied rewrites88.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.6e+91) (/ (+ alpha 1.0) (* (+ 3.0 (+ alpha beta)) (+ 2.0 (+ alpha beta)))) (/ (/ (+ 1.0 alpha) beta) (+ 3.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6e+91) {
tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (3.0 + (beta + 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 <= 6.6d+91) then
tmp = (alpha + 1.0d0) / ((3.0d0 + (alpha + beta)) * (2.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + alpha) / beta) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6e+91) {
tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.6e+91: tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + (alpha + beta))) else: tmp = ((1.0 + alpha) / beta) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.6e+91) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(3.0 + Float64(alpha + beta)) * Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.6e+91)
tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + (alpha + beta)));
else
tmp = ((1.0 + alpha) / beta) / (3.0 + (beta + 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, 6.6e+91], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.6 \cdot 10^{+91}:\\
\;\;\;\;\frac{\alpha + 1}{\left(3 + \left(\alpha + \beta\right)\right) \cdot \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 6.60000000000000034e91Initial program 99.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--.f6422.7
Applied rewrites22.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites34.2%
if 6.60000000000000034e91 < beta Initial program 75.8%
Applied rewrites69.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6490.2
Applied rewrites90.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2e+90) (/ (+ alpha 1.0) (* (+ 3.0 (+ alpha beta)) (+ 2.0 beta))) (/ (/ (+ 1.0 alpha) beta) (+ 3.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+90) {
tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / beta) / (3.0 + (beta + 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 <= 2d+90) then
tmp = (alpha + 1.0d0) / ((3.0d0 + (alpha + beta)) * (2.0d0 + beta))
else
tmp = ((1.0d0 + alpha) / beta) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+90) {
tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / beta) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2e+90: tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + beta)) else: tmp = ((1.0 + alpha) / beta) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2e+90) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(3.0 + Float64(alpha + beta)) * Float64(2.0 + beta))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2e+90)
tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + beta));
else
tmp = ((1.0 + alpha) / beta) / (3.0 + (beta + 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, 2e+90], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2 \cdot 10^{+90}:\\
\;\;\;\;\frac{\alpha + 1}{\left(3 + \left(\alpha + \beta\right)\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 1.99999999999999993e90Initial program 99.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--.f6422.7
Applied rewrites22.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites34.2%
Taylor expanded in alpha around 0
lower-+.f6421.9
Applied rewrites21.9%
if 1.99999999999999993e90 < beta Initial program 75.8%
Applied rewrites69.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6490.2
Applied rewrites90.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ (+ alpha 1.0) (+ 2.0 (+ alpha beta))) (+ 3.0 (+ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((alpha + 1.0) / (2.0 + (alpha + beta))) / (3.0 + (alpha + 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 + 1.0d0) / (2.0d0 + (alpha + beta))) / (3.0d0 + (alpha + beta))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((alpha + 1.0) / (2.0 + (alpha + beta))) / (3.0 + (alpha + beta));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((alpha + 1.0) / (2.0 + (alpha + beta))) / (3.0 + (alpha + beta))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(alpha + 1.0) / Float64(2.0 + Float64(alpha + beta))) / Float64(3.0 + Float64(alpha + beta))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (3.0 + (alpha + beta));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{\alpha + 1}{2 + \left(\alpha + \beta\right)}}{3 + \left(\alpha + \beta\right)}
\end{array}
Initial program 93.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--.f6439.9
Applied rewrites39.9%
Applied rewrites39.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.6e+91) (/ (+ alpha 1.0) (* (+ 3.0 (+ alpha beta)) (+ 2.0 beta))) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6e+91) {
tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + beta));
} 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 <= 6.6d+91) then
tmp = (alpha + 1.0d0) / ((3.0d0 + (alpha + beta)) * (2.0d0 + beta))
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 <= 6.6e+91) {
tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + beta));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.6e+91: tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + beta)) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.6e+91) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(3.0 + Float64(alpha + beta)) * Float64(2.0 + beta))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.6e+91)
tmp = (alpha + 1.0) / ((3.0 + (alpha + beta)) * (2.0 + beta));
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, 6.6e+91], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $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 6.6 \cdot 10^{+91}:\\
\;\;\;\;\frac{\alpha + 1}{\left(3 + \left(\alpha + \beta\right)\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.60000000000000034e91Initial program 99.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--.f6422.7
Applied rewrites22.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites34.2%
Taylor expanded in alpha around 0
lower-+.f6421.9
Applied rewrites21.9%
if 6.60000000000000034e91 < beta Initial program 75.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6488.5
Applied rewrites88.5%
Applied rewrites90.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2e+90) (/ (+ alpha 1.0) (* (+ 2.0 beta) (+ 3.0 beta))) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+90) {
tmp = (alpha + 1.0) / ((2.0 + beta) * (3.0 + beta));
} 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 <= 2d+90) then
tmp = (alpha + 1.0d0) / ((2.0d0 + beta) * (3.0d0 + beta))
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 <= 2e+90) {
tmp = (alpha + 1.0) / ((2.0 + beta) * (3.0 + beta));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2e+90: tmp = (alpha + 1.0) / ((2.0 + beta) * (3.0 + beta)) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2e+90) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(2.0 + beta) * Float64(3.0 + beta))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2e+90)
tmp = (alpha + 1.0) / ((2.0 + beta) * (3.0 + beta));
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, 2e+90], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(3.0 + beta), $MachinePrecision]), $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 2 \cdot 10^{+90}:\\
\;\;\;\;\frac{\alpha + 1}{\left(2 + \beta\right) \cdot \left(3 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.99999999999999993e90Initial program 99.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--.f6422.7
Applied rewrites22.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites34.2%
Taylor expanded in alpha around 0
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6421.6
Applied rewrites21.6%
if 1.99999999999999993e90 < beta Initial program 75.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6488.5
Applied rewrites88.5%
Applied rewrites90.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5e+154) (/ (+ 1.0 alpha) (* beta beta)) (/ (/ alpha beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+154) {
tmp = (1.0 + alpha) / (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 <= 5d+154) then
tmp = (1.0d0 + alpha) / (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 <= 5e+154) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5e+154: tmp = (1.0 + alpha) / (beta * beta) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5e+154) tmp = Float64(Float64(1.0 + alpha) / 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 <= 5e+154)
tmp = (1.0 + alpha) / (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, 5e+154], N[(N[(1.0 + alpha), $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 5 \cdot 10^{+154}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.00000000000000004e154Initial program 99.9%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6417.8
Applied rewrites17.8%
if 5.00000000000000004e154 < beta Initial program 68.5%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6487.0
Applied rewrites87.0%
Taylor expanded in alpha around inf
Applied rewrites87.0%
Applied rewrites89.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ (+ alpha 1.0) beta) beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((alpha + 1.0) / 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 + 1.0d0) / beta) / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((alpha + 1.0) / beta) / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((alpha + 1.0) / beta) / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(alpha + 1.0) / beta) / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((alpha + 1.0) / beta) / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{\alpha + 1}{\beta}}{\beta}
\end{array}
Initial program 93.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6431.3
Applied rewrites31.3%
Applied rewrites31.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (+ 1.0 alpha) (* beta beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return (1.0 + 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 = (1.0d0 + alpha) / (beta * beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return (1.0 + alpha) / (beta * beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return (1.0 + alpha) / (beta * beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(1.0 + alpha) / Float64(beta * beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = (1.0 + alpha) / (beta * beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1 + \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-*.f6431.3
Applied rewrites31.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (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 = 1.0d0 / (beta * beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (beta * beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot \beta}
\end{array}
Initial program 93.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6431.3
Applied rewrites31.3%
Taylor expanded in alpha around 0
Applied rewrites30.3%
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-*.f6431.3
Applied rewrites31.3%
Taylor expanded in alpha around inf
Applied rewrites20.1%
herbie shell --seed 2024307
(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)))