
(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 7 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 and beta 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 (+ alpha beta)))
(t_3 (* i t_2))
(t_4 (+ alpha (fma i 2.0 beta))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(*
(/ i (fma t_4 t_4 -1.0))
(/ (fma i t_2 (* alpha beta)) (/ (* t_4 t_4) t_2)))
(- (+ 0.0625 (* 0.25 (/ (* beta 0.25) i))) (* 0.0625 (/ beta i))))))assert(alpha < beta);
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 + (alpha + beta);
double t_3 = i * t_2;
double t_4 = alpha + fma(i, 2.0, beta);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (i / fma(t_4, t_4, -1.0)) * (fma(i, t_2, (alpha * beta)) / ((t_4 * t_4) / t_2));
} else {
tmp = (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) 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(alpha + beta)) t_3 = Float64(i * t_2) t_4 = Float64(alpha + fma(i, 2.0, beta)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(i / fma(t_4, t_4, -1.0)) * Float64(fma(i, t_2, Float64(alpha * beta)) / Float64(Float64(t_4 * t_4) / t_2))); else tmp = Float64(Float64(0.0625 + Float64(0.25 * Float64(Float64(beta * 0.25) / i))) - Float64(0.0625 * Float64(beta / i))); end return tmp end
NOTE: alpha and beta 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[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i * t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(i / N[(t$95$4 * t$95$4 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(i * t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$4 * t$95$4), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + N[(0.25 * N[(N[(beta * 0.25), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := i + \left(\alpha + \beta\right)\\
t_3 := i \cdot t_2\\
t_4 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\
\mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\
\;\;\;\;\frac{i}{\mathsf{fma}\left(t_4, t_4, -1\right)} \cdot \frac{\mathsf{fma}\left(i, t_2, \alpha \cdot \beta\right)}{\frac{t_4 \cdot t_4}{t_2}}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.25 \cdot \frac{\beta \cdot 0.25}{i}\right) - 0.0625 \cdot \frac{\beta}{i}\\
\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 35.6%
associate-/l/28.8%
associate-*l*28.7%
times-frac48.0%
Simplified99.5%
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%
Simplified6.9%
Taylor expanded in i around inf 15.0%
cancel-sign-sub-inv15.0%
distribute-lft-out15.0%
distribute-lft-out15.0%
+-commutative15.0%
metadata-eval15.0%
+-commutative15.0%
Simplified15.0%
Taylor expanded in i around inf 71.9%
Taylor expanded in alpha around 0 65.0%
distribute-rgt-out65.0%
metadata-eval65.0%
Simplified65.0%
Taylor expanded in alpha around 0 66.5%
Final simplification76.4%
NOTE: alpha and beta 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 (* i (+ i (+ alpha beta))))
(t_4 (* i (+ alpha (+ i beta)))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
(/
(* t_4 (* (fma alpha beta t_4) (pow (fma i 2.0 (+ alpha beta)) -2.0)))
t_2)
(- (+ 0.0625 (* 0.25 (/ (* beta 0.25) i))) (* 0.0625 (/ beta i))))))assert(alpha < beta);
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 = i * (i + (alpha + beta));
double t_4 = i * (alpha + (i + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (t_4 * (fma(alpha, beta, t_4) * pow(fma(i, 2.0, (alpha + beta)), -2.0))) / t_2;
} else {
tmp = (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) 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(i * Float64(i + Float64(alpha + beta))) t_4 = Float64(i * Float64(alpha + Float64(i + beta))) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(t_4 * Float64(fma(alpha, beta, t_4) * (fma(i, 2.0, Float64(alpha + beta)) ^ -2.0))) / t_2); else tmp = Float64(Float64(0.0625 + Float64(0.25 * Float64(Float64(beta * 0.25) / i))) - Float64(0.0625 * Float64(beta / i))); end return tmp end
NOTE: alpha and beta 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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(t$95$4 * N[(N[(alpha * beta + t$95$4), $MachinePrecision] * N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(0.25 * N[(N[(beta * 0.25), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\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 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_4 := i \cdot \left(\alpha + \left(i + \beta\right)\right)\\
\mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\
\;\;\;\;\frac{t_4 \cdot \left(\mathsf{fma}\left(\alpha, \beta, t_4\right) \cdot {\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{-2}\right)}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.25 \cdot \frac{\beta \cdot 0.25}{i}\right) - 0.0625 \cdot \frac{\beta}{i}\\
\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 35.6%
expm1-log1p-u33.3%
expm1-udef33.3%
Applied egg-rr33.3%
expm1-def33.3%
expm1-log1p35.5%
associate-*l*99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
Simplified99.3%
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%
Simplified6.9%
Taylor expanded in i around inf 15.0%
cancel-sign-sub-inv15.0%
distribute-lft-out15.0%
distribute-lft-out15.0%
+-commutative15.0%
metadata-eval15.0%
+-commutative15.0%
Simplified15.0%
Taylor expanded in i around inf 71.9%
Taylor expanded in alpha around 0 65.0%
distribute-rgt-out65.0%
metadata-eval65.0%
Simplified65.0%
Taylor expanded in alpha around 0 66.5%
Final simplification76.3%
NOTE: alpha and beta 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))))
(if (<= t_3 0.1)
t_3
(- (+ 0.0625 (* 0.25 (/ (* beta 0.25) i))) (* 0.0625 (/ beta i))))))assert(alpha < beta);
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 tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i));
}
return tmp;
}
NOTE: alpha and beta 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) :: 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))
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (0.0625d0 + (0.25d0 * ((beta * 0.25d0) / i))) - (0.0625d0 * (beta / i))
end if
code = tmp
end function
assert alpha < beta;
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 tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) 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) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i)) return tmp
alpha, beta = sort([alpha, beta]) 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)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(0.0625 + Float64(0.25 * Float64(Float64(beta * 0.25) / i))) - Float64(0.0625 * Float64(beta / i))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
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);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i));
end
tmp_2 = tmp;
end
NOTE: alpha and beta 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]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.0625 + N[(0.25 * N[(N[(beta * 0.25), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\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}\\
\mathbf{if}\;t_3 \leq 0.1:\\
\;\;\;\;t_3\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.25 \cdot \frac{\beta \cdot 0.25}{i}\right) - 0.0625 \cdot \frac{\beta}{i}\\
\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.7%
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-frac4.8%
Simplified27.4%
Taylor expanded in i around inf 30.2%
cancel-sign-sub-inv30.2%
distribute-lft-out30.2%
distribute-lft-out30.2%
+-commutative30.2%
metadata-eval30.2%
+-commutative30.2%
Simplified30.2%
Taylor expanded in i around inf 74.5%
Taylor expanded in alpha around 0 69.1%
distribute-rgt-out69.1%
metadata-eval69.1%
Simplified69.1%
Taylor expanded in alpha around 0 70.3%
Final simplification73.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (+ 0.0625 (* (/ beta i) 0.125)) (* 0.125 (/ (+ alpha beta) i))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return (0.0625 + ((beta / i) * 0.125)) - (0.125 * ((alpha + beta) / i));
}
NOTE: alpha and beta 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 + ((beta / i) * 0.125d0)) - (0.125d0 * ((alpha + beta) / i))
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return (0.0625 + ((beta / i) * 0.125)) - (0.125 * ((alpha + beta) / i));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return (0.0625 + ((beta / i) * 0.125)) - (0.125 * ((alpha + beta) / i))
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(Float64(beta / i) * 0.125)) - Float64(0.125 * Float64(Float64(alpha + beta) / i))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = (0.0625 + ((beta / i) * 0.125)) - (0.125 * ((alpha + beta) / i));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\left(0.0625 + \frac{\beta}{i} \cdot 0.125\right) - 0.125 \cdot \frac{\alpha + \beta}{i}
\end{array}
Initial program 10.7%
associate-/l/8.7%
associate-*l*8.6%
times-frac14.5%
Simplified34.7%
Taylor expanded in i around inf 75.0%
Taylor expanded in alpha around 0 70.1%
Final simplification70.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (+ 0.0625 (* 0.25 (/ (* beta 0.25) i))) (* 0.0625 (/ beta i))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i));
}
NOTE: alpha and beta 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 + (0.25d0 * ((beta * 0.25d0) / i))) - (0.0625d0 * (beta / i))
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i))
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(0.25 * Float64(Float64(beta * 0.25) / i))) - Float64(0.0625 * Float64(beta / i))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = (0.0625 + (0.25 * ((beta * 0.25) / i))) - (0.0625 * (beta / i));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.0625 + N[(0.25 * N[(N[(beta * 0.25), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\left(0.0625 + 0.25 \cdot \frac{\beta \cdot 0.25}{i}\right) - 0.0625 \cdot \frac{\beta}{i}
\end{array}
Initial program 10.7%
associate-/l/8.7%
associate-*l*8.6%
times-frac14.5%
Simplified34.7%
Taylor expanded in i around inf 35.5%
cancel-sign-sub-inv35.5%
distribute-lft-out35.5%
distribute-lft-out35.5%
+-commutative35.5%
metadata-eval35.5%
+-commutative35.5%
Simplified35.5%
Taylor expanded in i around inf 75.0%
Taylor expanded in alpha around 0 70.1%
distribute-rgt-out70.1%
metadata-eval70.1%
Simplified70.1%
Taylor expanded in alpha around 0 71.2%
Final simplification71.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.12e+229) 0.0625 0.0))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.12e+229) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
NOTE: alpha and beta 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.12d+229) then
tmp = 0.0625d0
else
tmp = 0.0d0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.12e+229) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 1.12e+229: tmp = 0.0625 else: tmp = 0.0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.12e+229) tmp = 0.0625; else tmp = 0.0; end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.12e+229)
tmp = 0.0625;
else
tmp = 0.0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.12e+229], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.12 \cdot 10^{+229}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 1.12e229Initial program 11.7%
associate-/l/9.5%
associate-*l*9.4%
times-frac15.8%
Simplified36.7%
Taylor expanded in i around inf 71.8%
if 1.12e229 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified13.6%
Taylor expanded in i around inf 48.4%
clear-num43.2%
inv-pow43.2%
Applied egg-rr43.2%
unpow-143.2%
Simplified43.2%
Taylor expanded in i around 0 36.5%
div-sub36.5%
+-commutative36.5%
distribute-lft-in36.5%
associate-*r*36.5%
metadata-eval36.5%
*-commutative36.5%
associate-*l/36.5%
associate-*r/36.5%
*-commutative36.5%
+-commutative36.5%
+-inverses36.5%
Simplified36.5%
Final simplification68.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0)
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return 0.0;
}
NOTE: alpha and beta 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.0d0
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return 0.0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return 0.0
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return 0.0 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0
\end{array}
Initial program 10.7%
associate-/l/8.7%
associate-*l*8.6%
times-frac14.5%
Simplified34.7%
Taylor expanded in i around inf 75.0%
clear-num73.5%
inv-pow73.5%
Applied egg-rr73.5%
unpow-173.5%
Simplified73.5%
Taylor expanded in i around 0 11.5%
div-sub11.5%
+-commutative11.5%
distribute-lft-in11.5%
associate-*r*11.5%
metadata-eval11.5%
*-commutative11.5%
associate-*l/11.5%
associate-*r/11.5%
*-commutative11.5%
+-commutative11.5%
+-inverses11.5%
Simplified11.5%
Final simplification11.5%
herbie shell --seed 2023314
(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)))