
(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, 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 (* 0.125 (/ beta i)))
(t_3 (+ i (+ alpha beta)))
(t_4 (* i t_3))
(t_5 (pow (fma i 2.0 (+ alpha beta)) 2.0)))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(* (/ (fma i t_3 (* alpha beta)) t_5) (/ t_4 (+ t_5 -1.0)))
(- (+ 0.0625 t_2) t_2))))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 = 0.125 * (beta / i);
double t_3 = i + (alpha + beta);
double t_4 = i * t_3;
double t_5 = pow(fma(i, 2.0, (alpha + beta)), 2.0);
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = (fma(i, t_3, (alpha * beta)) / t_5) * (t_4 / (t_5 + -1.0));
} else {
tmp = (0.0625 + t_2) - t_2;
}
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(0.125 * Float64(beta / i)) t_3 = Float64(i + Float64(alpha + beta)) t_4 = Float64(i * t_3) t_5 = fma(i, 2.0, Float64(alpha + beta)) ^ 2.0 tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(fma(i, t_3, Float64(alpha * beta)) / t_5) * Float64(t_4 / Float64(t_5 + -1.0))); else tmp = Float64(Float64(0.0625 + t_2) - t_2); 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[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision] * N[(t$95$4 / N[(t$95$5 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + t$95$2), $MachinePrecision] - t$95$2), $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 := 0.125 \cdot \frac{\beta}{i}\\
t_3 := i + \left(\alpha + \beta\right)\\
t_4 := i \cdot t\_3\\
t_5 := {\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}\\
\mathbf{if}\;\frac{\frac{t\_4 \cdot \left(t\_4 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{t\_5} \cdot \frac{t\_4}{t\_5 + -1}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t\_2\right) - t\_2\\
\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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 47.3%
associate-/l/41.8%
Simplified41.8%
*-commutative41.8%
fma-undefine41.8%
*-commutative41.8%
+-commutative41.8%
+-commutative41.8%
*-commutative41.8%
pow241.8%
*-commutative41.8%
pow241.8%
fma-undefine41.8%
Applied egg-rr99.7%
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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-/l*6.0%
+-commutative6.0%
+-commutative6.0%
+-commutative6.0%
associate-+l+6.0%
+-commutative6.0%
associate-*l*6.0%
Simplified6.0%
Taylor expanded in i around inf 76.4%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in alpha around 0 71.3%
Final simplification82.0%
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 (* i (+ i (+ alpha beta))))
(t_2 (* t_0 t_0))
(t_3 (+ t_2 -1.0))
(t_4 (* 0.125 (/ beta i))))
(if (<= (/ (/ (* t_1 (+ t_1 (* alpha beta))) t_2) t_3) INFINITY)
(/
(* (fma alpha beta t_1) (/ t_1 (pow (fma i 2.0 (+ alpha beta)) 2.0)))
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 = i * (i + (alpha + beta));
double t_2 = t_0 * t_0;
double t_3 = t_2 + -1.0;
double t_4 = 0.125 * (beta / i);
double tmp;
if ((((t_1 * (t_1 + (alpha * beta))) / t_2) / t_3) <= ((double) INFINITY)) {
tmp = (fma(alpha, beta, t_1) * (t_1 / pow(fma(i, 2.0, (alpha + beta)), 2.0))) / 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(i * Float64(i + Float64(alpha + beta))) t_2 = Float64(t_0 * t_0) t_3 = Float64(t_2 + -1.0) t_4 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (Float64(Float64(Float64(t_1 * Float64(t_1 + Float64(alpha * beta))) / t_2) / t_3) <= Inf) tmp = Float64(Float64(fma(alpha, beta, t_1) * Float64(t_1 / (fma(i, 2.0, Float64(alpha + beta)) ^ 2.0))) / t_3); else tmp = Float64(Float64(0.0625 + t_4) - t_4); 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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 + -1.0), $MachinePrecision]}, Block[{t$95$4 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$1 * N[(t$95$1 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / t$95$3), $MachinePrecision], Infinity], N[(N[(N[(alpha * beta + t$95$1), $MachinePrecision] * N[(t$95$1 / N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], 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 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_2 := t\_0 \cdot t\_0\\
t_3 := t\_2 + -1\\
t_4 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\frac{\frac{t\_1 \cdot \left(t\_1 + \alpha \cdot \beta\right)}{t\_2}}{t\_3} \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(\alpha, \beta, t\_1\right) \cdot \frac{t\_1}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}}}{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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0Initial program 47.3%
*-commutative47.3%
*-un-lft-identity47.3%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
*-commutative99.7%
fma-undefine99.7%
+-commutative99.7%
pow299.7%
+-commutative99.7%
*-commutative99.7%
fma-define99.7%
Applied egg-rr99.7%
/-rgt-identity99.7%
fma-define99.7%
+-commutative99.7%
fma-define99.7%
Simplified99.7%
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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.0%
associate-/l/0.0%
associate-/l*6.0%
+-commutative6.0%
+-commutative6.0%
+-commutative6.0%
associate-+l+6.0%
+-commutative6.0%
associate-*l*6.0%
Simplified6.0%
Taylor expanded in i around inf 76.4%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in alpha around 0 71.3%
Final simplification82.0%
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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 0.10000000000000001Initial program 99.8%
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 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 0.7%
associate-/l/0.0%
associate-/l*5.4%
+-commutative5.4%
+-commutative5.4%
+-commutative5.4%
associate-+l+5.4%
+-commutative5.4%
associate-*l*5.4%
Simplified5.4%
Taylor expanded in i around inf 77.0%
Taylor expanded in alpha around 0 71.1%
Taylor expanded in alpha around 0 73.2%
Final simplification77.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 (* 0.125 (/ beta i)))) (if (<= beta 1.4e+186) (- (+ 0.0625 t_0) t_0) (pow (/ i beta) 2.0))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 1.4e+186) {
tmp = (0.0625 + t_0) - t_0;
} else {
tmp = pow((i / beta), 2.0);
}
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) :: tmp
t_0 = 0.125d0 * (beta / i)
if (beta <= 1.4d+186) then
tmp = (0.0625d0 + t_0) - t_0
else
tmp = (i / beta) ** 2.0d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 1.4e+186) {
tmp = (0.0625 + t_0) - t_0;
} else {
tmp = Math.pow((i / beta), 2.0);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) tmp = 0 if beta <= 1.4e+186: tmp = (0.0625 + t_0) - t_0 else: tmp = math.pow((i / beta), 2.0) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (beta <= 1.4e+186) tmp = Float64(Float64(0.0625 + t_0) - t_0); else tmp = Float64(i / beta) ^ 2.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = 0.125 * (beta / i);
tmp = 0.0;
if (beta <= 1.4e+186)
tmp = (0.0625 + t_0) - t_0;
else
tmp = (i / beta) ^ 2.0;
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[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.4e+186], N[(N[(0.0625 + t$95$0), $MachinePrecision] - t$95$0), $MachinePrecision], N[Power[N[(i / beta), $MachinePrecision], 2.0], $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\beta \leq 1.4 \cdot 10^{+186}:\\
\;\;\;\;\left(0.0625 + t\_0\right) - t\_0\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{i}{\beta}\right)}^{2}\\
\end{array}
\end{array}
if beta < 1.40000000000000009e186Initial program 20.3%
associate-/l/17.9%
associate-/l*21.6%
+-commutative21.6%
+-commutative21.6%
+-commutative21.6%
associate-+l+21.6%
+-commutative21.6%
associate-*l*21.6%
Simplified21.6%
Taylor expanded in i around inf 82.3%
Taylor expanded in alpha around 0 76.7%
Taylor expanded in alpha around 0 78.7%
if 1.40000000000000009e186 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*9.3%
+-commutative9.3%
+-commutative9.3%
+-commutative9.3%
associate-+l+9.3%
+-commutative9.3%
associate-*l*9.3%
Simplified9.3%
Taylor expanded in beta around inf 23.0%
associate-/l*25.7%
Simplified25.7%
Taylor expanded in i around inf 23.4%
unpow223.4%
unpow223.4%
times-frac67.8%
unpow167.8%
pow-plus67.8%
metadata-eval67.8%
Simplified67.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 (* 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 17.7%
associate-/l/15.7%
associate-/l*20.1%
+-commutative20.1%
+-commutative20.1%
+-commutative20.1%
associate-+l+20.1%
+-commutative20.1%
associate-*l*20.1%
Simplified20.1%
Taylor expanded in i around inf 76.6%
Taylor expanded in alpha around 0 71.7%
Taylor expanded in alpha around 0 73.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.2e+187) 0.0625 0.0))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.2e+187) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
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 <= 4.2d+187) then
tmp = 0.0625d0
else
tmp = 0.0d0
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 <= 4.2e+187) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 4.2e+187: tmp = 0.0625 else: tmp = 0.0 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.2e+187) tmp = 0.0625; else tmp = 0.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4.2e+187)
tmp = 0.0625;
else
tmp = 0.0;
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, 4.2e+187], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2 \cdot 10^{+187}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 4.2e187Initial program 20.2%
associate-/l/17.8%
associate-/l*21.5%
+-commutative21.5%
+-commutative21.5%
+-commutative21.5%
associate-+l+21.5%
+-commutative21.5%
associate-*l*21.5%
Simplified21.5%
Taylor expanded in i around inf 77.5%
if 4.2e187 < beta Initial program 0.0%
associate-/l/0.0%
associate-/l*9.6%
+-commutative9.6%
+-commutative9.6%
+-commutative9.6%
associate-+l+9.6%
+-commutative9.6%
associate-*l*9.6%
Simplified9.6%
Taylor expanded in i around inf 37.8%
add-log-exp37.2%
cancel-sign-sub-inv37.2%
+-commutative37.2%
fma-define37.2%
distribute-lft-out37.2%
metadata-eval37.2%
Applied egg-rr37.2%
Taylor expanded in i around 0 26.4%
distribute-rgt-out26.4%
+-commutative26.4%
metadata-eval26.4%
mul0-rgt26.4%
Simplified26.4%
Taylor expanded in i around 0 26.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.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
code = 0.0d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0
\end{array}
Initial program 17.7%
associate-/l/15.7%
associate-/l*20.1%
+-commutative20.1%
+-commutative20.1%
+-commutative20.1%
associate-+l+20.1%
+-commutative20.1%
associate-*l*20.1%
Simplified20.1%
Taylor expanded in i around inf 76.6%
add-log-exp72.6%
cancel-sign-sub-inv72.6%
+-commutative72.6%
fma-define72.6%
distribute-lft-out72.6%
metadata-eval72.6%
Applied egg-rr72.6%
Taylor expanded in i around 0 10.1%
distribute-rgt-out10.1%
+-commutative10.1%
metadata-eval10.1%
mul0-rgt10.1%
Simplified10.1%
Taylor expanded in i around 0 10.1%
herbie shell --seed 2024166
(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)))