
(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 5 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 (* -16.0 (+ beta (+ beta alpha))))
(t_1 (+ i (+ beta alpha)))
(t_2 (+ (* beta -0.125) (* -0.00390625 t_0)))
(t_3 (+ alpha (fma i 2.0 beta)))
(t_4 (cbrt (/ (fma i t_1 (* beta alpha)) t_3))))
(if (<= beta 2e+108)
(-
(fma 0.0625 (/ (* beta beta) (* i i)) (- 0.0625 (/ t_2 i)))
(fma
0.0625
(/ t_2 (/ (* i i) t_0))
(*
0.00390625
(/
(fma
16.0
(* beta (+ beta alpha))
(* 4.0 (+ (* beta beta) (+ (pow (+ beta alpha) 2.0) -1.0))))
(* i i)))))
(if (<= beta 3.4e+139)
(* (/ i (fma t_3 t_3 -1.0)) (* (* t_4 (* t_4 t_4)) (/ t_1 t_3)))
(if (<= beta 4.8e+169)
(- (+ 0.0625 (/ 0.0625 (/ i beta))) (* 0.0625 (/ (+ beta alpha) i)))
(/ (* (/ i beta) (+ i alpha)) beta))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = -16.0 * (beta + (beta + alpha));
double t_1 = i + (beta + alpha);
double t_2 = (beta * -0.125) + (-0.00390625 * t_0);
double t_3 = alpha + fma(i, 2.0, beta);
double t_4 = cbrt((fma(i, t_1, (beta * alpha)) / t_3));
double tmp;
if (beta <= 2e+108) {
tmp = fma(0.0625, ((beta * beta) / (i * i)), (0.0625 - (t_2 / i))) - fma(0.0625, (t_2 / ((i * i) / t_0)), (0.00390625 * (fma(16.0, (beta * (beta + alpha)), (4.0 * ((beta * beta) + (pow((beta + alpha), 2.0) + -1.0)))) / (i * i))));
} else if (beta <= 3.4e+139) {
tmp = (i / fma(t_3, t_3, -1.0)) * ((t_4 * (t_4 * t_4)) * (t_1 / t_3));
} else if (beta <= 4.8e+169) {
tmp = (0.0625 + (0.0625 / (i / beta))) - (0.0625 * ((beta + alpha) / i));
} else {
tmp = ((i / beta) * (i + alpha)) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(-16.0 * Float64(beta + Float64(beta + alpha))) t_1 = Float64(i + Float64(beta + alpha)) t_2 = Float64(Float64(beta * -0.125) + Float64(-0.00390625 * t_0)) t_3 = Float64(alpha + fma(i, 2.0, beta)) t_4 = cbrt(Float64(fma(i, t_1, Float64(beta * alpha)) / t_3)) tmp = 0.0 if (beta <= 2e+108) tmp = Float64(fma(0.0625, Float64(Float64(beta * beta) / Float64(i * i)), Float64(0.0625 - Float64(t_2 / i))) - fma(0.0625, Float64(t_2 / Float64(Float64(i * i) / t_0)), Float64(0.00390625 * Float64(fma(16.0, Float64(beta * Float64(beta + alpha)), Float64(4.0 * Float64(Float64(beta * beta) + Float64((Float64(beta + alpha) ^ 2.0) + -1.0)))) / Float64(i * i))))); elseif (beta <= 3.4e+139) tmp = Float64(Float64(i / fma(t_3, t_3, -1.0)) * Float64(Float64(t_4 * Float64(t_4 * t_4)) * Float64(t_1 / t_3))); elseif (beta <= 4.8e+169) tmp = Float64(Float64(0.0625 + Float64(0.0625 / Float64(i / beta))) - Float64(0.0625 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(Float64(i / beta) * Float64(i + alpha)) / beta); 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[(-16.0 * N[(beta + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(beta * -0.125), $MachinePrecision] + N[(-0.00390625 * t$95$0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Power[N[(N[(i * t$95$1 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], 1/3], $MachinePrecision]}, If[LessEqual[beta, 2e+108], N[(N[(0.0625 * N[(N[(beta * beta), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 - N[(t$95$2 / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(t$95$2 / N[(N[(i * i), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] + N[(0.00390625 * N[(N[(16.0 * N[(beta * N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(N[(beta * beta), $MachinePrecision] + N[(N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.4e+139], N[(N[(i / N[(t$95$3 * t$95$3 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$4 * N[(t$95$4 * t$95$4), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 / t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 4.8e+169], N[(N[(0.0625 + N[(0.0625 / N[(i / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i / beta), $MachinePrecision] * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := -16 \cdot \left(\beta + \left(\beta + \alpha\right)\right)\\
t_1 := i + \left(\beta + \alpha\right)\\
t_2 := \beta \cdot -0.125 + -0.00390625 \cdot t_0\\
t_3 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\
t_4 := \sqrt[3]{\frac{\mathsf{fma}\left(i, t_1, \beta \cdot \alpha\right)}{t_3}}\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+108}:\\
\;\;\;\;\mathsf{fma}\left(0.0625, \frac{\beta \cdot \beta}{i \cdot i}, 0.0625 - \frac{t_2}{i}\right) - \mathsf{fma}\left(0.0625, \frac{t_2}{\frac{i \cdot i}{t_0}}, 0.00390625 \cdot \frac{\mathsf{fma}\left(16, \beta \cdot \left(\beta + \alpha\right), 4 \cdot \left(\beta \cdot \beta + \left({\left(\beta + \alpha\right)}^{2} + -1\right)\right)\right)}{i \cdot i}\right)\\
\mathbf{elif}\;\beta \leq 3.4 \cdot 10^{+139}:\\
\;\;\;\;\frac{i}{\mathsf{fma}\left(t_3, t_3, -1\right)} \cdot \left(\left(t_4 \cdot \left(t_4 \cdot t_4\right)\right) \cdot \frac{t_1}{t_3}\right)\\
\mathbf{elif}\;\beta \leq 4.8 \cdot 10^{+169}:\\
\;\;\;\;\left(0.0625 + \frac{0.0625}{\frac{i}{\beta}}\right) - 0.0625 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\beta} \cdot \left(i + \alpha\right)}{\beta}\\
\end{array}
\end{array}
if beta < 2.0000000000000001e108Initial program 20.5%
Taylor expanded in alpha around 0 21.9%
associate-/l*42.9%
unpow242.9%
+-commutative42.9%
*-commutative42.9%
fma-udef42.9%
Simplified42.9%
Taylor expanded in i around -inf 75.3%
Simplified75.4%
if 2.0000000000000001e108 < beta < 3.4000000000000002e139Initial program 22.9%
associate-/l/1.2%
associate-*l*1.2%
times-frac33.8%
Simplified55.2%
add-cube-cbrt54.9%
Applied egg-rr54.9%
if 3.4000000000000002e139 < beta < 4.7999999999999997e169Initial program 0.7%
Taylor expanded in i around inf 12.7%
+-commutative12.7%
+-commutative12.7%
*-commutative12.7%
fma-def12.7%
distribute-lft-out--12.7%
+-commutative12.7%
distribute-lft-out12.7%
*-commutative12.7%
unpow212.7%
Simplified12.7%
Taylor expanded in i around inf 61.3%
Taylor expanded in beta around inf 61.0%
associate-*r/61.0%
associate-/l*61.0%
Simplified61.0%
if 4.7999999999999997e169 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified21.9%
Taylor expanded in beta around inf 39.2%
associate-/l*41.2%
unpow241.2%
+-commutative41.2%
Simplified41.2%
Taylor expanded in beta around 0 39.2%
*-commutative39.2%
+-commutative39.2%
associate-*l/41.2%
unpow241.2%
+-commutative41.2%
*-commutative41.2%
+-commutative41.2%
associate-/r*65.2%
Simplified65.2%
associate-*r/86.7%
+-commutative86.7%
Applied egg-rr86.7%
Final simplification75.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ alpha (fma i 2.0 beta)))
(t_1 (* -16.0 (+ beta (+ beta alpha))))
(t_2 (+ (* beta -0.125) (* -0.00390625 t_1)))
(t_3 (+ i (+ beta alpha))))
(if (<= beta 8.8e+105)
(-
(fma 0.0625 (/ (* beta beta) (* i i)) (- 0.0625 (/ t_2 i)))
(fma
0.0625
(/ t_2 (/ (* i i) t_1))
(*
0.00390625
(/
(fma
16.0
(* beta (+ beta alpha))
(* 4.0 (+ (* beta beta) (+ (pow (+ beta alpha) 2.0) -1.0))))
(* i i)))))
(if (<= beta 3.4e+139)
(*
(/ i (fma t_0 t_0 -1.0))
(* (/ (fma i t_3 (* beta alpha)) t_0) (/ t_3 t_0)))
(if (<= beta 4.5e+169)
(- (+ 0.0625 (/ 0.0625 (/ i beta))) (* 0.0625 (/ (+ beta alpha) i)))
(/ (* (/ i beta) (+ i alpha)) beta))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = alpha + fma(i, 2.0, beta);
double t_1 = -16.0 * (beta + (beta + alpha));
double t_2 = (beta * -0.125) + (-0.00390625 * t_1);
double t_3 = i + (beta + alpha);
double tmp;
if (beta <= 8.8e+105) {
tmp = fma(0.0625, ((beta * beta) / (i * i)), (0.0625 - (t_2 / i))) - fma(0.0625, (t_2 / ((i * i) / t_1)), (0.00390625 * (fma(16.0, (beta * (beta + alpha)), (4.0 * ((beta * beta) + (pow((beta + alpha), 2.0) + -1.0)))) / (i * i))));
} else if (beta <= 3.4e+139) {
tmp = (i / fma(t_0, t_0, -1.0)) * ((fma(i, t_3, (beta * alpha)) / t_0) * (t_3 / t_0));
} else if (beta <= 4.5e+169) {
tmp = (0.0625 + (0.0625 / (i / beta))) - (0.0625 * ((beta + alpha) / i));
} else {
tmp = ((i / beta) * (i + alpha)) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(alpha + fma(i, 2.0, beta)) t_1 = Float64(-16.0 * Float64(beta + Float64(beta + alpha))) t_2 = Float64(Float64(beta * -0.125) + Float64(-0.00390625 * t_1)) t_3 = Float64(i + Float64(beta + alpha)) tmp = 0.0 if (beta <= 8.8e+105) tmp = Float64(fma(0.0625, Float64(Float64(beta * beta) / Float64(i * i)), Float64(0.0625 - Float64(t_2 / i))) - fma(0.0625, Float64(t_2 / Float64(Float64(i * i) / t_1)), Float64(0.00390625 * Float64(fma(16.0, Float64(beta * Float64(beta + alpha)), Float64(4.0 * Float64(Float64(beta * beta) + Float64((Float64(beta + alpha) ^ 2.0) + -1.0)))) / Float64(i * i))))); elseif (beta <= 3.4e+139) tmp = Float64(Float64(i / fma(t_0, t_0, -1.0)) * Float64(Float64(fma(i, t_3, Float64(beta * alpha)) / t_0) * Float64(t_3 / t_0))); elseif (beta <= 4.5e+169) tmp = Float64(Float64(0.0625 + Float64(0.0625 / Float64(i / beta))) - Float64(0.0625 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(Float64(i / beta) * Float64(i + alpha)) / beta); 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[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-16.0 * N[(beta + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(beta * -0.125), $MachinePrecision] + N[(-0.00390625 * t$95$1), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 8.8e+105], N[(N[(0.0625 * N[(N[(beta * beta), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 - N[(t$95$2 / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(t$95$2 / N[(N[(i * i), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] + N[(0.00390625 * N[(N[(16.0 * N[(beta * N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(N[(beta * beta), $MachinePrecision] + N[(N[Power[N[(beta + alpha), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.4e+139], N[(N[(i / N[(t$95$0 * t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i * t$95$3 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(t$95$3 / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 4.5e+169], N[(N[(0.0625 + N[(0.0625 / N[(i / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.0625 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i / beta), $MachinePrecision] * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\
t_1 := -16 \cdot \left(\beta + \left(\beta + \alpha\right)\right)\\
t_2 := \beta \cdot -0.125 + -0.00390625 \cdot t_1\\
t_3 := i + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 8.8 \cdot 10^{+105}:\\
\;\;\;\;\mathsf{fma}\left(0.0625, \frac{\beta \cdot \beta}{i \cdot i}, 0.0625 - \frac{t_2}{i}\right) - \mathsf{fma}\left(0.0625, \frac{t_2}{\frac{i \cdot i}{t_1}}, 0.00390625 \cdot \frac{\mathsf{fma}\left(16, \beta \cdot \left(\beta + \alpha\right), 4 \cdot \left(\beta \cdot \beta + \left({\left(\beta + \alpha\right)}^{2} + -1\right)\right)\right)}{i \cdot i}\right)\\
\mathbf{elif}\;\beta \leq 3.4 \cdot 10^{+139}:\\
\;\;\;\;\frac{i}{\mathsf{fma}\left(t_0, t_0, -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, t_3, \beta \cdot \alpha\right)}{t_0} \cdot \frac{t_3}{t_0}\right)\\
\mathbf{elif}\;\beta \leq 4.5 \cdot 10^{+169}:\\
\;\;\;\;\left(0.0625 + \frac{0.0625}{\frac{i}{\beta}}\right) - 0.0625 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\beta} \cdot \left(i + \alpha\right)}{\beta}\\
\end{array}
\end{array}
if beta < 8.80000000000000027e105Initial program 20.5%
Taylor expanded in alpha around 0 21.9%
associate-/l*42.9%
unpow242.9%
+-commutative42.9%
*-commutative42.9%
fma-udef42.9%
Simplified42.9%
Taylor expanded in i around -inf 75.3%
Simplified75.4%
if 8.80000000000000027e105 < beta < 3.4000000000000002e139Initial program 22.9%
associate-/l/1.2%
associate-*l*1.2%
times-frac33.8%
Simplified55.2%
if 3.4000000000000002e139 < beta < 4.5e169Initial program 0.7%
Taylor expanded in i around inf 12.7%
+-commutative12.7%
+-commutative12.7%
*-commutative12.7%
fma-def12.7%
distribute-lft-out--12.7%
+-commutative12.7%
distribute-lft-out12.7%
*-commutative12.7%
unpow212.7%
Simplified12.7%
Taylor expanded in i around inf 61.3%
Taylor expanded in beta around inf 61.0%
associate-*r/61.0%
associate-/l*61.0%
Simplified61.0%
if 4.5e169 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified21.9%
Taylor expanded in beta around inf 39.2%
associate-/l*41.2%
unpow241.2%
+-commutative41.2%
Simplified41.2%
Taylor expanded in beta around 0 39.2%
*-commutative39.2%
+-commutative39.2%
associate-*l/41.2%
unpow241.2%
+-commutative41.2%
*-commutative41.2%
+-commutative41.2%
associate-/r*65.2%
Simplified65.2%
associate-*r/86.7%
+-commutative86.7%
Applied egg-rr86.7%
Final simplification75.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7e+169) 0.0625 (/ (* (/ i beta) (+ i alpha)) beta)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7e+169) {
tmp = 0.0625;
} else {
tmp = ((i / beta) * (i + alpha)) / beta;
}
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 <= 7d+169) then
tmp = 0.0625d0
else
tmp = ((i / beta) * (i + alpha)) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7e+169) {
tmp = 0.0625;
} else {
tmp = ((i / beta) * (i + alpha)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 7e+169: tmp = 0.0625 else: tmp = ((i / beta) * (i + alpha)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7e+169) tmp = 0.0625; else tmp = Float64(Float64(Float64(i / beta) * Float64(i + alpha)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 7e+169)
tmp = 0.0625;
else
tmp = ((i / beta) * (i + alpha)) / beta;
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, 7e+169], 0.0625, N[(N[(N[(i / beta), $MachinePrecision] * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7 \cdot 10^{+169}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\beta} \cdot \left(i + \alpha\right)}{\beta}\\
\end{array}
\end{array}
if beta < 7.00000000000000038e169Initial program 19.7%
associate-/l/17.3%
associate-*l*17.3%
times-frac28.9%
Simplified43.5%
Taylor expanded in i around inf 78.5%
if 7.00000000000000038e169 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified21.9%
Taylor expanded in beta around inf 39.2%
associate-/l*41.2%
unpow241.2%
+-commutative41.2%
Simplified41.2%
Taylor expanded in beta around 0 39.2%
*-commutative39.2%
+-commutative39.2%
associate-*l/41.2%
unpow241.2%
+-commutative41.2%
*-commutative41.2%
+-commutative41.2%
associate-/r*65.2%
Simplified65.2%
associate-*r/86.7%
+-commutative86.7%
Applied egg-rr86.7%
Final simplification79.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 8.2e+170) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8.2e+170) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
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 <= 8.2d+170) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8.2e+170) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 8.2e+170: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 8.2e+170) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 8.2e+170)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
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, 8.2e+170], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.2 \cdot 10^{+170}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 8.2000000000000001e170Initial program 19.7%
associate-/l/17.3%
associate-*l*17.3%
times-frac28.9%
Simplified43.5%
Taylor expanded in i around inf 78.5%
if 8.2000000000000001e170 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified21.9%
Taylor expanded in beta around inf 39.2%
associate-/l*41.2%
unpow241.2%
+-commutative41.2%
Simplified41.2%
Taylor expanded in i around inf 39.3%
unpow239.3%
unpow239.3%
Simplified39.3%
Taylor expanded in i around 0 39.3%
unpow239.3%
unpow239.3%
times-frac79.1%
Simplified79.1%
Final simplification78.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return 0.0625;
}
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
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return 0.0625
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return 0.0625 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.0625
\end{array}
Initial program 17.0%
associate-/l/14.9%
associate-*l*14.8%
times-frac24.8%
Simplified40.5%
Taylor expanded in i around inf 69.2%
Final simplification69.2%
herbie shell --seed 2023188
(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)))