
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (/ (+ alpha beta) i))
(t_1 (fma 2.0 i (+ alpha beta)))
(t_2 (+ (+ alpha beta) 1.0))
(t_3
(fma -1.0 (* (+ t_2 (+ alpha beta)) -2.0) (* -4.0 (+ alpha beta)))))
(if (<= beta 1.85e+152)
(*
(-
(fma 0.25 t_0 0.25)
(* (/ (* (+ (- (+ alpha beta) 1.0) (+ alpha beta)) 2.0) i) 0.0625))
(pow
(fma
-1.0
(/ (fma -1.0 (+ (* t_0 t_2) t_3) (* (/ t_3 i) (+ alpha beta))) i)
4.0)
-1.0))
(*
(pow
(/
(- t_1 1.0)
(-
(+ (fma i (/ (+ alpha i) beta) i) alpha)
(* (/ (fma 2.0 i alpha) beta) (+ alpha i))))
-1.0)
(pow (/ (+ t_1 1.0) (* (/ i t_1) (+ (+ alpha beta) i))) -1.0)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) / i;
double t_1 = fma(2.0, i, (alpha + beta));
double t_2 = (alpha + beta) + 1.0;
double t_3 = fma(-1.0, ((t_2 + (alpha + beta)) * -2.0), (-4.0 * (alpha + beta)));
double tmp;
if (beta <= 1.85e+152) {
tmp = (fma(0.25, t_0, 0.25) - ((((((alpha + beta) - 1.0) + (alpha + beta)) * 2.0) / i) * 0.0625)) * pow(fma(-1.0, (fma(-1.0, ((t_0 * t_2) + t_3), ((t_3 / i) * (alpha + beta))) / i), 4.0), -1.0);
} else {
tmp = pow(((t_1 - 1.0) / ((fma(i, ((alpha + i) / beta), i) + alpha) - ((fma(2.0, i, alpha) / beta) * (alpha + i)))), -1.0) * pow(((t_1 + 1.0) / ((i / t_1) * ((alpha + beta) + i))), -1.0);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) / i) t_1 = fma(2.0, i, Float64(alpha + beta)) t_2 = Float64(Float64(alpha + beta) + 1.0) t_3 = fma(-1.0, Float64(Float64(t_2 + Float64(alpha + beta)) * -2.0), Float64(-4.0 * Float64(alpha + beta))) tmp = 0.0 if (beta <= 1.85e+152) tmp = Float64(Float64(fma(0.25, t_0, 0.25) - Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) - 1.0) + Float64(alpha + beta)) * 2.0) / i) * 0.0625)) * (fma(-1.0, Float64(fma(-1.0, Float64(Float64(t_0 * t_2) + t_3), Float64(Float64(t_3 / i) * Float64(alpha + beta))) / i), 4.0) ^ -1.0)); else tmp = Float64((Float64(Float64(t_1 - 1.0) / Float64(Float64(fma(i, Float64(Float64(alpha + i) / beta), i) + alpha) - Float64(Float64(fma(2.0, i, alpha) / beta) * Float64(alpha + i)))) ^ -1.0) * (Float64(Float64(t_1 + 1.0) / Float64(Float64(i / t_1) * Float64(Float64(alpha + beta) + i))) ^ -1.0)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(-1.0 * N[(N[(t$95$2 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision] + N[(-4.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.85e+152], N[(N[(N[(0.25 * t$95$0 + 0.25), $MachinePrecision] - N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] - 1.0), $MachinePrecision] + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] / i), $MachinePrecision] * 0.0625), $MachinePrecision]), $MachinePrecision] * N[Power[N[(-1.0 * N[(N[(-1.0 * N[(N[(t$95$0 * t$95$2), $MachinePrecision] + t$95$3), $MachinePrecision] + N[(N[(t$95$3 / i), $MachinePrecision] * N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] + 4.0), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision], N[(N[Power[N[(N[(t$95$1 - 1.0), $MachinePrecision] / N[(N[(N[(i * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] + i), $MachinePrecision] + alpha), $MachinePrecision] - N[(N[(N[(2.0 * i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision] * N[Power[N[(N[(t$95$1 + 1.0), $MachinePrecision] / N[(N[(i / t$95$1), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \frac{\alpha + \beta}{i}\\
t_1 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
t_2 := \left(\alpha + \beta\right) + 1\\
t_3 := \mathsf{fma}\left(-1, \left(t\_2 + \left(\alpha + \beta\right)\right) \cdot -2, -4 \cdot \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\beta \leq 1.85 \cdot 10^{+152}:\\
\;\;\;\;\left(\mathsf{fma}\left(0.25, t\_0, 0.25\right) - \frac{\left(\left(\left(\alpha + \beta\right) - 1\right) + \left(\alpha + \beta\right)\right) \cdot 2}{i} \cdot 0.0625\right) \cdot {\left(\mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, t\_0 \cdot t\_2 + t\_3, \frac{t\_3}{i} \cdot \left(\alpha + \beta\right)\right)}{i}, 4\right)\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{t\_1 - 1}{\left(\mathsf{fma}\left(i, \frac{\alpha + i}{\beta}, i\right) + \alpha\right) - \frac{\mathsf{fma}\left(2, i, \alpha\right)}{\beta} \cdot \left(\alpha + i\right)}\right)}^{-1} \cdot {\left(\frac{t\_1 + 1}{\frac{i}{t\_1} \cdot \left(\left(\alpha + \beta\right) + i\right)}\right)}^{-1}\\
\end{array}
\end{array}
if beta < 1.84999999999999998e152Initial program 19.2%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f6420.0
Applied rewrites20.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites48.0%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6485.0
Applied rewrites85.0%
Taylor expanded in i around -inf
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites85.1%
if 1.84999999999999998e152 < beta Initial program 0.0%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f640.0
Applied rewrites0.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites22.3%
Taylor expanded in beta around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
associate-/l*N/A
lower-fma.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.f6460.0
Applied rewrites60.0%
Final simplification81.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma 2.0 i (+ alpha beta)))
(t_1 (/ (+ alpha beta) i))
(t_2 (+ (+ alpha beta) 1.0))
(t_3
(fma -1.0 (* (+ t_2 (+ alpha beta)) -2.0) (* -4.0 (+ alpha beta)))))
(if (<= beta 1.85e+152)
(*
(-
(fma 0.25 t_1 0.25)
(* (/ (* (+ (- (+ alpha beta) 1.0) (+ alpha beta)) 2.0) i) 0.0625))
(pow
(fma
-1.0
(/ (fma -1.0 (+ (* t_1 t_2) t_3) (* (/ t_3 i) (+ alpha beta))) i)
4.0)
-1.0))
(*
(/
(-
(+ (fma i (/ (+ alpha i) beta) i) alpha)
(* (/ (- (fma 4.0 i (* alpha 2.0)) 1.0) beta) (+ alpha i)))
beta)
(pow (/ (+ t_0 1.0) (* (/ i t_0) (+ (+ alpha beta) i))) -1.0)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(2.0, i, (alpha + beta));
double t_1 = (alpha + beta) / i;
double t_2 = (alpha + beta) + 1.0;
double t_3 = fma(-1.0, ((t_2 + (alpha + beta)) * -2.0), (-4.0 * (alpha + beta)));
double tmp;
if (beta <= 1.85e+152) {
tmp = (fma(0.25, t_1, 0.25) - ((((((alpha + beta) - 1.0) + (alpha + beta)) * 2.0) / i) * 0.0625)) * pow(fma(-1.0, (fma(-1.0, ((t_1 * t_2) + t_3), ((t_3 / i) * (alpha + beta))) / i), 4.0), -1.0);
} else {
tmp = (((fma(i, ((alpha + i) / beta), i) + alpha) - (((fma(4.0, i, (alpha * 2.0)) - 1.0) / beta) * (alpha + i))) / beta) * pow(((t_0 + 1.0) / ((i / t_0) * ((alpha + beta) + i))), -1.0);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(2.0, i, Float64(alpha + beta)) t_1 = Float64(Float64(alpha + beta) / i) t_2 = Float64(Float64(alpha + beta) + 1.0) t_3 = fma(-1.0, Float64(Float64(t_2 + Float64(alpha + beta)) * -2.0), Float64(-4.0 * Float64(alpha + beta))) tmp = 0.0 if (beta <= 1.85e+152) tmp = Float64(Float64(fma(0.25, t_1, 0.25) - Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) - 1.0) + Float64(alpha + beta)) * 2.0) / i) * 0.0625)) * (fma(-1.0, Float64(fma(-1.0, Float64(Float64(t_1 * t_2) + t_3), Float64(Float64(t_3 / i) * Float64(alpha + beta))) / i), 4.0) ^ -1.0)); else tmp = Float64(Float64(Float64(Float64(fma(i, Float64(Float64(alpha + i) / beta), i) + alpha) - Float64(Float64(Float64(fma(4.0, i, Float64(alpha * 2.0)) - 1.0) / beta) * Float64(alpha + i))) / beta) * (Float64(Float64(t_0 + 1.0) / Float64(Float64(i / t_0) * Float64(Float64(alpha + beta) + i))) ^ -1.0)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(-1.0 * N[(N[(t$95$2 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision] + N[(-4.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.85e+152], N[(N[(N[(0.25 * t$95$1 + 0.25), $MachinePrecision] - N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] - 1.0), $MachinePrecision] + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] / i), $MachinePrecision] * 0.0625), $MachinePrecision]), $MachinePrecision] * N[Power[N[(-1.0 * N[(N[(-1.0 * N[(N[(t$95$1 * t$95$2), $MachinePrecision] + t$95$3), $MachinePrecision] + N[(N[(t$95$3 / i), $MachinePrecision] * N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] + 4.0), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(i * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] + i), $MachinePrecision] + alpha), $MachinePrecision] - N[(N[(N[(N[(4.0 * i + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision] / beta), $MachinePrecision] * N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[Power[N[(N[(t$95$0 + 1.0), $MachinePrecision] / N[(N[(i / t$95$0), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
t_1 := \frac{\alpha + \beta}{i}\\
t_2 := \left(\alpha + \beta\right) + 1\\
t_3 := \mathsf{fma}\left(-1, \left(t\_2 + \left(\alpha + \beta\right)\right) \cdot -2, -4 \cdot \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\beta \leq 1.85 \cdot 10^{+152}:\\
\;\;\;\;\left(\mathsf{fma}\left(0.25, t\_1, 0.25\right) - \frac{\left(\left(\left(\alpha + \beta\right) - 1\right) + \left(\alpha + \beta\right)\right) \cdot 2}{i} \cdot 0.0625\right) \cdot {\left(\mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, t\_1 \cdot t\_2 + t\_3, \frac{t\_3}{i} \cdot \left(\alpha + \beta\right)\right)}{i}, 4\right)\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\mathsf{fma}\left(i, \frac{\alpha + i}{\beta}, i\right) + \alpha\right) - \frac{\mathsf{fma}\left(4, i, \alpha \cdot 2\right) - 1}{\beta} \cdot \left(\alpha + i\right)}{\beta} \cdot {\left(\frac{t\_0 + 1}{\frac{i}{t\_0} \cdot \left(\left(\alpha + \beta\right) + i\right)}\right)}^{-1}\\
\end{array}
\end{array}
if beta < 1.84999999999999998e152Initial program 19.2%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f6420.0
Applied rewrites20.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites48.0%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6485.0
Applied rewrites85.0%
Taylor expanded in i around -inf
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites85.1%
if 1.84999999999999998e152 < beta Initial program 0.0%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f640.0
Applied rewrites0.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites22.3%
Taylor expanded in beta around inf
lower-/.f64N/A
Applied rewrites59.8%
Final simplification81.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) 1.0))
(t_1
(fma -1.0 (* (+ t_0 (+ alpha beta)) -2.0) (* -4.0 (+ alpha beta))))
(t_2 (fma 2.0 i (+ alpha beta))))
(if (<= beta 1.95e+152)
(*
0.25
(pow
(fma
-1.0
(/
(fma
-1.0
(+ (* (/ (+ alpha beta) i) t_0) t_1)
(* (/ t_1 i) (+ alpha beta)))
i)
4.0)
-1.0))
(*
(/
(-
(+ (fma i (/ (+ alpha i) beta) i) alpha)
(* (/ (- (fma 4.0 i (* alpha 2.0)) 1.0) beta) (+ alpha i)))
beta)
(pow (/ (+ t_2 1.0) (* (/ i t_2) (+ (+ alpha beta) i))) -1.0)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + 1.0;
double t_1 = fma(-1.0, ((t_0 + (alpha + beta)) * -2.0), (-4.0 * (alpha + beta)));
double t_2 = fma(2.0, i, (alpha + beta));
double tmp;
if (beta <= 1.95e+152) {
tmp = 0.25 * pow(fma(-1.0, (fma(-1.0, ((((alpha + beta) / i) * t_0) + t_1), ((t_1 / i) * (alpha + beta))) / i), 4.0), -1.0);
} else {
tmp = (((fma(i, ((alpha + i) / beta), i) + alpha) - (((fma(4.0, i, (alpha * 2.0)) - 1.0) / beta) * (alpha + i))) / beta) * pow(((t_2 + 1.0) / ((i / t_2) * ((alpha + beta) + i))), -1.0);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + 1.0) t_1 = fma(-1.0, Float64(Float64(t_0 + Float64(alpha + beta)) * -2.0), Float64(-4.0 * Float64(alpha + beta))) t_2 = fma(2.0, i, Float64(alpha + beta)) tmp = 0.0 if (beta <= 1.95e+152) tmp = Float64(0.25 * (fma(-1.0, Float64(fma(-1.0, Float64(Float64(Float64(Float64(alpha + beta) / i) * t_0) + t_1), Float64(Float64(t_1 / i) * Float64(alpha + beta))) / i), 4.0) ^ -1.0)); else tmp = Float64(Float64(Float64(Float64(fma(i, Float64(Float64(alpha + i) / beta), i) + alpha) - Float64(Float64(Float64(fma(4.0, i, Float64(alpha * 2.0)) - 1.0) / beta) * Float64(alpha + i))) / beta) * (Float64(Float64(t_2 + 1.0) / Float64(Float64(i / t_2) * Float64(Float64(alpha + beta) + i))) ^ -1.0)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$1 = N[(-1.0 * N[(N[(t$95$0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision] + N[(-4.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.95e+152], N[(0.25 * N[Power[N[(-1.0 * N[(N[(-1.0 * N[(N[(N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision] * t$95$0), $MachinePrecision] + t$95$1), $MachinePrecision] + N[(N[(t$95$1 / i), $MachinePrecision] * N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] + 4.0), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(i * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] + i), $MachinePrecision] + alpha), $MachinePrecision] - N[(N[(N[(N[(4.0 * i + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision] / beta), $MachinePrecision] * N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[Power[N[(N[(t$95$2 + 1.0), $MachinePrecision] / N[(N[(i / t$95$2), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 1\\
t_1 := \mathsf{fma}\left(-1, \left(t\_0 + \left(\alpha + \beta\right)\right) \cdot -2, -4 \cdot \left(\alpha + \beta\right)\right)\\
t_2 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 1.95 \cdot 10^{+152}:\\
\;\;\;\;0.25 \cdot {\left(\mathsf{fma}\left(-1, \frac{\mathsf{fma}\left(-1, \frac{\alpha + \beta}{i} \cdot t\_0 + t\_1, \frac{t\_1}{i} \cdot \left(\alpha + \beta\right)\right)}{i}, 4\right)\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\mathsf{fma}\left(i, \frac{\alpha + i}{\beta}, i\right) + \alpha\right) - \frac{\mathsf{fma}\left(4, i, \alpha \cdot 2\right) - 1}{\beta} \cdot \left(\alpha + i\right)}{\beta} \cdot {\left(\frac{t\_2 + 1}{\frac{i}{t\_2} \cdot \left(\left(\alpha + \beta\right) + i\right)}\right)}^{-1}\\
\end{array}
\end{array}
if beta < 1.95000000000000006e152Initial program 19.2%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f6420.0
Applied rewrites20.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites48.0%
Taylor expanded in i around inf
Applied rewrites79.8%
Taylor expanded in i around -inf
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites85.8%
if 1.95000000000000006e152 < beta Initial program 0.0%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f640.0
Applied rewrites0.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites22.3%
Taylor expanded in beta around inf
lower-/.f64N/A
Applied rewrites59.8%
Final simplification81.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma 2.0 i (+ alpha beta)))
(t_1 (pow (/ (+ t_0 1.0) (* (/ i t_0) (+ (+ alpha beta) i))) -1.0)))
(if (<= beta 1.85e+152)
(*
t_1
(-
(fma 0.25 (/ (+ alpha beta) i) 0.25)
(* (/ (* (+ (- (+ alpha beta) 1.0) (+ alpha beta)) 2.0) i) 0.0625)))
(*
(/
(-
(+ (fma i (/ (+ alpha i) beta) i) alpha)
(* (/ (- (fma 4.0 i (* alpha 2.0)) 1.0) beta) (+ alpha i)))
beta)
t_1))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(2.0, i, (alpha + beta));
double t_1 = pow(((t_0 + 1.0) / ((i / t_0) * ((alpha + beta) + i))), -1.0);
double tmp;
if (beta <= 1.85e+152) {
tmp = t_1 * (fma(0.25, ((alpha + beta) / i), 0.25) - ((((((alpha + beta) - 1.0) + (alpha + beta)) * 2.0) / i) * 0.0625));
} else {
tmp = (((fma(i, ((alpha + i) / beta), i) + alpha) - (((fma(4.0, i, (alpha * 2.0)) - 1.0) / beta) * (alpha + i))) / beta) * t_1;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(2.0, i, Float64(alpha + beta)) t_1 = Float64(Float64(t_0 + 1.0) / Float64(Float64(i / t_0) * Float64(Float64(alpha + beta) + i))) ^ -1.0 tmp = 0.0 if (beta <= 1.85e+152) tmp = Float64(t_1 * Float64(fma(0.25, Float64(Float64(alpha + beta) / i), 0.25) - Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) - 1.0) + Float64(alpha + beta)) * 2.0) / i) * 0.0625))); else tmp = Float64(Float64(Float64(Float64(fma(i, Float64(Float64(alpha + i) / beta), i) + alpha) - Float64(Float64(Float64(fma(4.0, i, Float64(alpha * 2.0)) - 1.0) / beta) * Float64(alpha + i))) / beta) * t_1); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Power[N[(N[(t$95$0 + 1.0), $MachinePrecision] / N[(N[(i / t$95$0), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]}, If[LessEqual[beta, 1.85e+152], N[(t$95$1 * N[(N[(0.25 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision] + 0.25), $MachinePrecision] - N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] - 1.0), $MachinePrecision] + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] / i), $MachinePrecision] * 0.0625), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(i * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] + i), $MachinePrecision] + alpha), $MachinePrecision] - N[(N[(N[(N[(4.0 * i + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision] / beta), $MachinePrecision] * N[(alpha + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
t_1 := {\left(\frac{t\_0 + 1}{\frac{i}{t\_0} \cdot \left(\left(\alpha + \beta\right) + i\right)}\right)}^{-1}\\
\mathbf{if}\;\beta \leq 1.85 \cdot 10^{+152}:\\
\;\;\;\;t\_1 \cdot \left(\mathsf{fma}\left(0.25, \frac{\alpha + \beta}{i}, 0.25\right) - \frac{\left(\left(\left(\alpha + \beta\right) - 1\right) + \left(\alpha + \beta\right)\right) \cdot 2}{i} \cdot 0.0625\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\mathsf{fma}\left(i, \frac{\alpha + i}{\beta}, i\right) + \alpha\right) - \frac{\mathsf{fma}\left(4, i, \alpha \cdot 2\right) - 1}{\beta} \cdot \left(\alpha + i\right)}{\beta} \cdot t\_1\\
\end{array}
\end{array}
if beta < 1.84999999999999998e152Initial program 19.2%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f6420.0
Applied rewrites20.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites48.0%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6485.0
Applied rewrites85.0%
if 1.84999999999999998e152 < beta Initial program 0.0%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f640.0
Applied rewrites0.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites22.3%
Taylor expanded in beta around inf
lower-/.f64N/A
Applied rewrites59.8%
Final simplification81.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma 2.0 i (+ alpha beta)))
(t_1 (pow (/ (+ t_0 1.0) (* (/ i t_0) (+ (+ alpha beta) i))) -1.0)))
(if (<= beta 8.8e+151)
(*
t_1
(-
(fma 0.25 (/ (+ alpha beta) i) 0.25)
(* (/ (* (+ (- (+ alpha beta) 1.0) (+ alpha beta)) 2.0) i) 0.0625)))
(* (/ (+ alpha i) beta) t_1))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(2.0, i, (alpha + beta));
double t_1 = pow(((t_0 + 1.0) / ((i / t_0) * ((alpha + beta) + i))), -1.0);
double tmp;
if (beta <= 8.8e+151) {
tmp = t_1 * (fma(0.25, ((alpha + beta) / i), 0.25) - ((((((alpha + beta) - 1.0) + (alpha + beta)) * 2.0) / i) * 0.0625));
} else {
tmp = ((alpha + i) / beta) * t_1;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(2.0, i, Float64(alpha + beta)) t_1 = Float64(Float64(t_0 + 1.0) / Float64(Float64(i / t_0) * Float64(Float64(alpha + beta) + i))) ^ -1.0 tmp = 0.0 if (beta <= 8.8e+151) tmp = Float64(t_1 * Float64(fma(0.25, Float64(Float64(alpha + beta) / i), 0.25) - Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) - 1.0) + Float64(alpha + beta)) * 2.0) / i) * 0.0625))); else tmp = Float64(Float64(Float64(alpha + i) / beta) * t_1); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Power[N[(N[(t$95$0 + 1.0), $MachinePrecision] / N[(N[(i / t$95$0), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]}, If[LessEqual[beta, 8.8e+151], N[(t$95$1 * N[(N[(0.25 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision] + 0.25), $MachinePrecision] - N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] - 1.0), $MachinePrecision] + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision] / i), $MachinePrecision] * 0.0625), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] * t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
t_1 := {\left(\frac{t\_0 + 1}{\frac{i}{t\_0} \cdot \left(\left(\alpha + \beta\right) + i\right)}\right)}^{-1}\\
\mathbf{if}\;\beta \leq 8.8 \cdot 10^{+151}:\\
\;\;\;\;t\_1 \cdot \left(\mathsf{fma}\left(0.25, \frac{\alpha + \beta}{i}, 0.25\right) - \frac{\left(\left(\left(\alpha + \beta\right) - 1\right) + \left(\alpha + \beta\right)\right) \cdot 2}{i} \cdot 0.0625\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + i}{\beta} \cdot t\_1\\
\end{array}
\end{array}
if beta < 8.80000000000000027e151Initial program 19.2%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f6420.0
Applied rewrites20.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites48.0%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6485.0
Applied rewrites85.0%
if 8.80000000000000027e151 < beta Initial program 0.0%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f640.0
Applied rewrites0.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites22.3%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6461.9
Applied rewrites61.9%
Final simplification81.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma 2.0 i (+ alpha beta))))
(if (<= beta 2.15e+143)
0.0625
(*
(/ (+ alpha i) beta)
(pow (/ (+ t_0 1.0) (* (/ i t_0) (+ (+ alpha beta) i))) -1.0)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(2.0, i, (alpha + beta));
double tmp;
if (beta <= 2.15e+143) {
tmp = 0.0625;
} else {
tmp = ((alpha + i) / beta) * pow(((t_0 + 1.0) / ((i / t_0) * ((alpha + beta) + i))), -1.0);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(2.0, i, Float64(alpha + beta)) tmp = 0.0 if (beta <= 2.15e+143) tmp = 0.0625; else tmp = Float64(Float64(Float64(alpha + i) / beta) * (Float64(Float64(t_0 + 1.0) / Float64(Float64(i / t_0) * Float64(Float64(alpha + beta) + i))) ^ -1.0)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.15e+143], 0.0625, N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] * N[Power[N[(N[(t$95$0 + 1.0), $MachinePrecision] / N[(N[(i / t$95$0), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 2.15 \cdot 10^{+143}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + i}{\beta} \cdot {\left(\frac{t\_0 + 1}{\frac{i}{t\_0} \cdot \left(\left(\alpha + \beta\right) + i\right)}\right)}^{-1}\\
\end{array}
\end{array}
if beta < 2.15000000000000001e143Initial program 18.9%
Taylor expanded in i around inf
Applied rewrites80.1%
if 2.15000000000000001e143 < beta Initial program 2.4%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f642.4
Applied rewrites2.4%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites23.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6461.5
Applied rewrites61.5%
Final simplification77.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma i 2.0 (+ alpha beta))))
(if (<= beta 1.85e+152)
(*
(fma
-0.125
(/ (fma (+ alpha beta) 2.0 -1.0) i)
(fma (/ (+ alpha beta) i) 0.25 0.25))
(/ (* (/ i t_0) (+ (+ alpha beta) i)) (+ t_0 1.0)))
(* (/ i beta) (/ (+ alpha i) beta)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (alpha + beta));
double tmp;
if (beta <= 1.85e+152) {
tmp = fma(-0.125, (fma((alpha + beta), 2.0, -1.0) / i), fma(((alpha + beta) / i), 0.25, 0.25)) * (((i / t_0) * ((alpha + beta) + i)) / (t_0 + 1.0));
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (beta <= 1.85e+152) tmp = Float64(fma(-0.125, Float64(fma(Float64(alpha + beta), 2.0, -1.0) / i), fma(Float64(Float64(alpha + beta) / i), 0.25, 0.25)) * Float64(Float64(Float64(i / t_0) * Float64(Float64(alpha + beta) + i)) / Float64(t_0 + 1.0))); else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) / beta)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.85e+152], N[(N[(-0.125 * N[(N[(N[(alpha + beta), $MachinePrecision] * 2.0 + -1.0), $MachinePrecision] / i), $MachinePrecision] + N[(N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision] * 0.25 + 0.25), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i / t$95$0), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 1.85 \cdot 10^{+152}:\\
\;\;\;\;\mathsf{fma}\left(-0.125, \frac{\mathsf{fma}\left(\alpha + \beta, 2, -1\right)}{i}, \mathsf{fma}\left(\frac{\alpha + \beta}{i}, 0.25, 0.25\right)\right) \cdot \frac{\frac{i}{t\_0} \cdot \left(\left(\alpha + \beta\right) + i\right)}{t\_0 + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if beta < 1.84999999999999998e152Initial program 19.2%
Taylor expanded in alpha around 0
*-commutativeN/A
lower-*.f64N/A
lower-+.f6420.0
Applied rewrites20.0%
lift-/.f64N/A
clear-numN/A
inv-powN/A
Applied rewrites48.0%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6485.0
Applied rewrites85.0%
Applied rewrites85.0%
if 1.84999999999999998e152 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-/.f6461.2
Applied rewrites61.2%
Final simplification81.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1e+144) 0.0625 (* (/ i beta) (/ (+ alpha i) beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1e+144) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1d+144) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((alpha + i) / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1e+144) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((alpha + i) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1e+144: tmp = 0.0625 else: tmp = (i / beta) * ((alpha + i) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1e+144) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(alpha + i) / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1e+144)
tmp = 0.0625;
else
tmp = (i / beta) * ((alpha + i) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1e+144], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10^{+144}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha + i}{\beta}\\
\end{array}
\end{array}
if beta < 1.00000000000000002e144Initial program 18.9%
Taylor expanded in i around inf
Applied rewrites80.1%
if 1.00000000000000002e144 < beta Initial program 2.4%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-/.f6460.9
Applied rewrites60.9%
Final simplification77.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.85e+152) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.85e+152) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.85d+152) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.85e+152) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.85e+152: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.85e+152) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.85e+152)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.85e+152], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.85 \cdot 10^{+152}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 1.84999999999999998e152Initial program 19.2%
Taylor expanded in i around inf
Applied rewrites79.9%
if 1.84999999999999998e152 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-/.f6461.2
Applied rewrites61.2%
Taylor expanded in alpha around 0
Applied rewrites54.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.15e+196) 0.0625 (/ (* (/ i beta) alpha) beta)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.15e+196) {
tmp = 0.0625;
} else {
tmp = ((i / beta) * alpha) / beta;
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.15d+196) then
tmp = 0.0625d0
else
tmp = ((i / beta) * alpha) / beta
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.15e+196) {
tmp = 0.0625;
} else {
tmp = ((i / beta) * alpha) / beta;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.15e+196: tmp = 0.0625 else: tmp = ((i / beta) * alpha) / beta return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.15e+196) tmp = 0.0625; else tmp = Float64(Float64(Float64(i / beta) * alpha) / beta); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.15e+196)
tmp = 0.0625;
else
tmp = ((i / beta) * alpha) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.15e+196], 0.0625, N[(N[(N[(i / beta), $MachinePrecision] * alpha), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.15 \cdot 10^{+196}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\beta} \cdot \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 1.1499999999999999e196Initial program 18.2%
Taylor expanded in i around inf
Applied rewrites77.2%
if 1.1499999999999999e196 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-/.f6467.8
Applied rewrites67.8%
Taylor expanded in alpha around inf
Applied rewrites26.5%
Applied rewrites34.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.45e+237) 0.0625 (/ alpha (* (/ beta i) beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.45e+237) {
tmp = 0.0625;
} else {
tmp = alpha / ((beta / i) * beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.45d+237) then
tmp = 0.0625d0
else
tmp = alpha / ((beta / i) * beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.45e+237) {
tmp = 0.0625;
} else {
tmp = alpha / ((beta / i) * beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.45e+237: tmp = 0.0625 else: tmp = alpha / ((beta / i) * beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.45e+237) tmp = 0.0625; else tmp = Float64(alpha / Float64(Float64(beta / i) * beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.45e+237)
tmp = 0.0625;
else
tmp = alpha / ((beta / i) * beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.45e+237], 0.0625, N[(alpha / N[(N[(beta / i), $MachinePrecision] * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.45 \cdot 10^{+237}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{\frac{\beta}{i} \cdot \beta}\\
\end{array}
\end{array}
if beta < 1.45000000000000005e237Initial program 17.2%
Taylor expanded in i around inf
Applied rewrites74.6%
if 1.45000000000000005e237 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-/.f6476.8
Applied rewrites76.8%
Taylor expanded in alpha around inf
Applied rewrites34.5%
Applied rewrites42.1%
Final simplification72.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.45e+237) 0.0625 (* (/ i (* beta beta)) alpha)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.45e+237) {
tmp = 0.0625;
} else {
tmp = (i / (beta * beta)) * alpha;
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.45d+237) then
tmp = 0.0625d0
else
tmp = (i / (beta * beta)) * alpha
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.45e+237) {
tmp = 0.0625;
} else {
tmp = (i / (beta * beta)) * alpha;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.45e+237: tmp = 0.0625 else: tmp = (i / (beta * beta)) * alpha return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.45e+237) tmp = 0.0625; else tmp = Float64(Float64(i / Float64(beta * beta)) * alpha); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.45e+237)
tmp = 0.0625;
else
tmp = (i / (beta * beta)) * alpha;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.45e+237], 0.0625, N[(N[(i / N[(beta * beta), $MachinePrecision]), $MachinePrecision] * alpha), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.45 \cdot 10^{+237}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta \cdot \beta} \cdot \alpha\\
\end{array}
\end{array}
if beta < 1.45000000000000005e237Initial program 17.2%
Taylor expanded in i around inf
Applied rewrites74.6%
if 1.45000000000000005e237 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-/.f6476.8
Applied rewrites76.8%
Taylor expanded in alpha around inf
Applied rewrites34.5%
Final simplification72.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 16.2%
Taylor expanded in i around inf
Applied rewrites71.7%
herbie shell --seed 2024264
(FPCore (alpha beta i)
:name "Octave 3.8, jcobi/4"
:precision binary64
:pre (and (and (> alpha -1.0) (> beta -1.0)) (> i 1.0))
(/ (/ (* (* i (+ (+ alpha beta) i)) (+ (* beta alpha) (* i (+ (+ alpha beta) i)))) (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i)))) (- (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i))) 1.0)))