
(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 9 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 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ alpha beta))))
(t_3 (+ alpha (+ i beta)))
(t_4 (+ beta (fma 2.0 i alpha)))
(t_5 (+ t_1 -1.0))
(t_6 (* 0.125 (/ beta i))))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) t_5) INFINITY)
(/ (/ (* i (/ (fma i t_3 (* alpha beta)) t_4)) (/ t_4 t_3)) t_5)
(- (+ 0.0625 t_6) t_6))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (alpha + beta));
double t_3 = alpha + (i + beta);
double t_4 = beta + fma(2.0, i, alpha);
double t_5 = t_1 + -1.0;
double t_6 = 0.125 * (beta / i);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / t_5) <= ((double) INFINITY)) {
tmp = ((i * (fma(i, t_3, (alpha * beta)) / t_4)) / (t_4 / t_3)) / t_5;
} else {
tmp = (0.0625 + t_6) - t_6;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(alpha + Float64(i + beta)) t_4 = Float64(beta + fma(2.0, i, alpha)) t_5 = Float64(t_1 + -1.0) t_6 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / t_5) <= Inf) tmp = Float64(Float64(Float64(i * Float64(fma(i, t_3, Float64(alpha * beta)) / t_4)) / Float64(t_4 / t_3)) / t_5); else tmp = Float64(Float64(0.0625 + t_6) - t_6); 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] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(beta + N[(2.0 * i + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$6 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$5), $MachinePrecision], Infinity], N[(N[(N[(i * N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision] / N[(t$95$4 / t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[(0.0625 + t$95$6), $MachinePrecision] - t$95$6), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := \alpha + \left(i + \beta\right)\\
t_4 := \beta + \mathsf{fma}\left(2, i, \alpha\right)\\
t_5 := t\_1 + -1\\
t_6 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_5} \leq \infty:\\
\;\;\;\;\frac{\frac{i \cdot \frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{t\_4}}{\frac{t\_4}{t\_3}}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t\_6\right) - t\_6\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 41.9%
times-frac99.7%
associate-+l+99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
+-commutative99.7%
+-commutative99.7%
*-commutative99.7%
fma-udef99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
Applied egg-rr99.7%
*-commutative99.7%
*-commutative99.7%
associate-/l*99.8%
Simplified99.8%
associate-*r/99.8%
fma-udef99.8%
*-commutative99.8%
fma-def99.8%
fma-udef99.8%
*-commutative99.8%
fma-def99.8%
Applied egg-rr99.8%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 82.1%
Taylor expanded in alpha around 0 76.7%
Taylor expanded in alpha around 0 78.3%
Final simplification85.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) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ alpha beta))))
(t_3 (+ alpha (+ i beta)))
(t_4 (+ beta (fma i 2.0 alpha)))
(t_5 (+ t_1 -1.0))
(t_6 (* 0.125 (/ beta i))))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) t_5) INFINITY)
(/ (* (/ (fma i t_3 (* alpha beta)) t_4) (/ i (/ t_4 t_3))) t_5)
(- (+ 0.0625 t_6) t_6))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (alpha + beta));
double t_3 = alpha + (i + beta);
double t_4 = beta + fma(i, 2.0, alpha);
double t_5 = t_1 + -1.0;
double t_6 = 0.125 * (beta / i);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / t_5) <= ((double) INFINITY)) {
tmp = ((fma(i, t_3, (alpha * beta)) / t_4) * (i / (t_4 / t_3))) / t_5;
} else {
tmp = (0.0625 + t_6) - t_6;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(alpha + Float64(i + beta)) t_4 = Float64(beta + fma(i, 2.0, alpha)) t_5 = Float64(t_1 + -1.0) t_6 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / t_5) <= Inf) tmp = Float64(Float64(Float64(fma(i, t_3, Float64(alpha * beta)) / t_4) * Float64(i / Float64(t_4 / t_3))) / t_5); else tmp = Float64(Float64(0.0625 + t_6) - t_6); 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] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$6 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$5), $MachinePrecision], Infinity], N[(N[(N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision] * N[(i / N[(t$95$4 / t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[(0.0625 + t$95$6), $MachinePrecision] - t$95$6), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := \alpha + \left(i + \beta\right)\\
t_4 := \beta + \mathsf{fma}\left(i, 2, \alpha\right)\\
t_5 := t\_1 + -1\\
t_6 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_5} \leq \infty:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{t\_4} \cdot \frac{i}{\frac{t\_4}{t\_3}}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t\_6\right) - t\_6\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 41.9%
times-frac99.7%
associate-+l+99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
+-commutative99.7%
+-commutative99.7%
*-commutative99.7%
fma-udef99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
Applied egg-rr99.7%
*-commutative99.7%
*-commutative99.7%
associate-/l*99.8%
Simplified99.8%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 82.1%
Taylor expanded in alpha around 0 76.7%
Taylor expanded in alpha around 0 78.3%
Final simplification85.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) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* 0.125 (/ beta i)))
(t_4 (* i (+ i (+ alpha beta))))
(t_5 (+ alpha (+ i beta))))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
i
(*
t_5
(* (fma i t_5 (* alpha beta)) (pow (+ beta (fma i 2.0 alpha)) -2.0))))
t_2)
(- (+ 0.0625 t_3) t_3))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = 0.125 * (beta / i);
double t_4 = i * (i + (alpha + beta));
double t_5 = alpha + (i + beta);
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (i * (t_5 * (fma(i, t_5, (alpha * beta)) * pow((beta + fma(i, 2.0, alpha)), -2.0)))) / t_2;
} else {
tmp = (0.0625 + t_3) - t_3;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(0.125 * Float64(beta / i)) t_4 = Float64(i * Float64(i + Float64(alpha + beta))) t_5 = Float64(alpha + Float64(i + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(i * Float64(t_5 * Float64(fma(i, t_5, Float64(alpha * beta)) * (Float64(beta + fma(i, 2.0, alpha)) ^ -2.0)))) / t_2); else tmp = Float64(Float64(0.0625 + t_3) - t_3); 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] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(i * N[(t$95$5 * N[(N[(i * t$95$5 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] * N[Power[N[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + t$95$3), $MachinePrecision] - t$95$3), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
t_3 := 0.125 \cdot \frac{\beta}{i}\\
t_4 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_5 := \alpha + \left(i + \beta\right)\\
\mathbf{if}\;\frac{\frac{t\_4 \cdot \left(t\_4 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{i \cdot \left(t\_5 \cdot \left(\mathsf{fma}\left(i, t\_5, \alpha \cdot \beta\right) \cdot {\left(\beta + \mathsf{fma}\left(i, 2, \alpha\right)\right)}^{-2}\right)\right)}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t\_3\right) - t\_3\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 41.9%
expm1-log1p-u39.5%
expm1-udef39.5%
Applied egg-rr39.5%
expm1-def39.5%
expm1-log1p41.8%
associate-*r*60.6%
associate-*l*99.4%
*-commutative99.4%
Simplified99.4%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 82.1%
Taylor expanded in alpha around 0 76.7%
Taylor expanded in alpha around 0 78.3%
Final simplification85.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 (+ (+ alpha beta) (* i 2.0))))
(if (<= i 1.75e+153)
(/
(/
(* i (/ i (/ (fma 2.0 i beta) (+ i beta))))
(/ (+ beta (fma 2.0 i alpha)) (+ i (+ alpha beta))))
(+ (* t_0 t_0) -1.0))
0.0625)))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double tmp;
if (i <= 1.75e+153) {
tmp = ((i * (i / (fma(2.0, i, beta) / (i + beta)))) / ((beta + fma(2.0, i, alpha)) / (i + (alpha + beta)))) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) tmp = 0.0 if (i <= 1.75e+153) tmp = Float64(Float64(Float64(i * Float64(i / Float64(fma(2.0, i, beta) / Float64(i + beta)))) / Float64(Float64(beta + fma(2.0, i, alpha)) / Float64(i + Float64(alpha + beta)))) / Float64(Float64(t_0 * t_0) + -1.0)); else tmp = 0.0625; 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] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 1.75e+153], N[(N[(N[(i * N[(i / N[(N[(2.0 * i + beta), $MachinePrecision] / N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + N[(2.0 * i + alpha), $MachinePrecision]), $MachinePrecision] / N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
\mathbf{if}\;i \leq 1.75 \cdot 10^{+153}:\\
\;\;\;\;\frac{\frac{i \cdot \frac{i}{\frac{\mathsf{fma}\left(2, i, \beta\right)}{i + \beta}}}{\frac{\beta + \mathsf{fma}\left(2, i, \alpha\right)}{i + \left(\alpha + \beta\right)}}}{t\_0 \cdot t\_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 1.75e153Initial program 31.2%
times-frac77.4%
associate-+l+77.4%
+-commutative77.4%
*-commutative77.4%
associate-+r+77.4%
+-commutative77.4%
fma-def77.4%
+-commutative77.4%
+-commutative77.4%
*-commutative77.4%
fma-udef77.4%
+-commutative77.4%
associate-+l+77.4%
*-commutative77.4%
+-commutative77.4%
*-commutative77.4%
associate-+r+77.4%
+-commutative77.4%
fma-def77.4%
Applied egg-rr77.4%
*-commutative77.4%
*-commutative77.4%
associate-/l*77.5%
Simplified77.5%
Taylor expanded in alpha around 0 75.2%
associate-*r/75.2%
associate-/l*77.3%
+-commutative77.3%
fma-def77.3%
fma-udef77.3%
*-commutative77.3%
fma-def77.3%
associate-+r+77.3%
Applied egg-rr77.3%
if 1.75e153 < i Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 89.9%
Final simplification84.5%
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 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* 0.125 (/ beta i)))
(t_4 (* i (+ i (+ alpha beta)))))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
(/ i (/ (+ beta (fma i 2.0 alpha)) (+ alpha (+ i beta))))
(/ (* i (+ i beta)) (+ beta (* i 2.0))))
t_2)
(- (+ 0.0625 t_3) t_3))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = 0.125 * (beta / i);
double t_4 = i * (i + (alpha + beta));
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = ((i / ((beta + fma(i, 2.0, alpha)) / (alpha + (i + beta)))) * ((i * (i + beta)) / (beta + (i * 2.0)))) / t_2;
} else {
tmp = (0.0625 + t_3) - t_3;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(0.125 * Float64(beta / i)) t_4 = Float64(i * Float64(i + Float64(alpha + beta))) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(Float64(i / Float64(Float64(beta + fma(i, 2.0, alpha)) / Float64(alpha + Float64(i + beta)))) * Float64(Float64(i * Float64(i + beta)) / Float64(beta + Float64(i * 2.0)))) / t_2); else tmp = Float64(Float64(0.0625 + t_3) - t_3); 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] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(i / N[(N[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + t$95$3), $MachinePrecision] - t$95$3), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := t\_1 + -1\\
t_3 := 0.125 \cdot \frac{\beta}{i}\\
t_4 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\frac{\frac{t\_4 \cdot \left(t\_4 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta + \mathsf{fma}\left(i, 2, \alpha\right)}{\alpha + \left(i + \beta\right)}} \cdot \frac{i \cdot \left(i + \beta\right)}{\beta + i \cdot 2}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t\_3\right) - t\_3\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 41.9%
times-frac99.7%
associate-+l+99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
+-commutative99.7%
+-commutative99.7%
*-commutative99.7%
fma-udef99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
Applied egg-rr99.7%
*-commutative99.7%
*-commutative99.7%
associate-/l*99.8%
Simplified99.8%
Taylor expanded in alpha around 0 89.1%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 82.1%
Taylor expanded in alpha around 0 76.7%
Taylor expanded in alpha around 0 78.3%
Final simplification81.8%
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 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ alpha beta))))
(t_3 (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)))
(t_4 (* 0.125 (/ beta i))))
(if (<= t_3 0.1) t_3 (- (+ 0.0625 t_4) t_4))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (alpha + beta));
double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
double t_4 = 0.125 * (beta / i);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + t_4) - t_4;
}
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) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: tmp
t_0 = (alpha + beta) + (i * 2.0d0)
t_1 = t_0 * t_0
t_2 = i * (i + (alpha + beta))
t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + (-1.0d0))
t_4 = 0.125d0 * (beta / i)
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (0.0625d0 + t_4) - t_4
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (alpha + beta));
double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
double t_4 = 0.125 * (beta / i);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + t_4) - t_4;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (alpha + beta)) t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0) t_4 = 0.125 * (beta / i) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (0.0625 + t_4) - t_4 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) t_4 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(0.0625 + t_4) - t_4); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (alpha + beta));
t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
t_4 = 0.125 * (beta / i);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (0.0625 + t_4) - t_4;
end
tmp_2 = 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] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.0625 + t$95$4), $MachinePrecision] - t$95$4), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := \frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1}\\
t_4 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;t\_3 \leq 0.1:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t\_4\right) - t\_4\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < 0.10000000000000001Initial program 99.6%
if 0.10000000000000001 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.7%
associate-/l/0.0%
associate-*l*0.0%
times-frac7.6%
Simplified7.6%
Taylor expanded in i around inf 82.9%
Taylor expanded in alpha around 0 78.4%
Taylor expanded in alpha around 0 79.9%
Final simplification82.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.75e+243) 0.0625 (/ (* 0.125 (- beta (+ alpha beta))) i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.75e+243) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (alpha + beta))) / i;
}
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 <= 2.75d+243) then
tmp = 0.0625d0
else
tmp = (0.125d0 * (beta - (alpha + beta))) / i
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 <= 2.75e+243) {
tmp = 0.0625;
} else {
tmp = (0.125 * (beta - (alpha + beta))) / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.75e+243: tmp = 0.0625 else: tmp = (0.125 * (beta - (alpha + beta))) / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.75e+243) tmp = 0.0625; else tmp = Float64(Float64(0.125 * Float64(beta - Float64(alpha + beta))) / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2.75e+243)
tmp = 0.0625;
else
tmp = (0.125 * (beta - (alpha + beta))) / i;
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, 2.75e+243], 0.0625, N[(N[(0.125 * N[(beta - N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.75 \cdot 10^{+243}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0.125 \cdot \left(\beta - \left(\alpha + \beta\right)\right)}{i}\\
\end{array}
\end{array}
if beta < 2.75000000000000002e243Initial program 14.3%
associate-/l/12.8%
associate-*l*12.8%
times-frac20.7%
Simplified20.7%
Taylor expanded in i around inf 81.7%
if 2.75000000000000002e243 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 30.9%
Taylor expanded in alpha around 0 30.6%
Taylor expanded in i around 0 22.9%
distribute-lft-out--22.9%
Simplified22.9%
Final simplification78.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (let* ((t_0 (* 0.125 (/ beta i)))) (- (+ 0.0625 t_0) t_0)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
return (0.0625 + t_0) - t_0;
}
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) :: t_0
t_0 = 0.125d0 * (beta / i)
code = (0.0625d0 + t_0) - t_0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
return (0.0625 + t_0) - t_0;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) return (0.0625 + t_0) - t_0
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) return Float64(Float64(0.0625 + t_0) - t_0) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
t_0 = 0.125 * (beta / i);
tmp = (0.0625 + t_0) - t_0;
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[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, N[(N[(0.0625 + t$95$0), $MachinePrecision] - t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
\left(0.0625 + t\_0\right) - t\_0
\end{array}
\end{array}
Initial program 13.4%
associate-/l/12.1%
associate-*l*12.1%
times-frac19.4%
Simplified19.4%
Taylor expanded in i around inf 82.1%
Taylor expanded in alpha around 0 78.0%
Taylor expanded in alpha around 0 79.6%
Final simplification79.6%
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 13.4%
associate-/l/12.1%
associate-*l*12.1%
times-frac19.4%
Simplified19.4%
Taylor expanded in i around inf 77.6%
Final simplification77.6%
herbie shell --seed 2024026
(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)))