
(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 11 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 (+ beta (fma i 2.0 alpha))))
(if (<= alpha 2.3e+70)
(/
(*
(*
(/ i (+ beta (+ 1.0 (* i 2.0))))
(/ (+ i beta) (+ beta (fma i 2.0 -1.0))))
(/ (+ i (+ alpha beta)) t_0))
(/ t_0 i))
(/
(* i (/ (+ alpha i) (+ beta (+ -1.0 (fma i 2.0 alpha)))))
(+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = beta + fma(i, 2.0, alpha);
double tmp;
if (alpha <= 2.3e+70) {
tmp = (((i / (beta + (1.0 + (i * 2.0)))) * ((i + beta) / (beta + fma(i, 2.0, -1.0)))) * ((i + (alpha + beta)) / t_0)) / (t_0 / i);
} else {
tmp = (i * ((alpha + i) / (beta + (-1.0 + fma(i, 2.0, alpha))))) / (1.0 + t_0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(beta + fma(i, 2.0, alpha)) tmp = 0.0 if (alpha <= 2.3e+70) tmp = Float64(Float64(Float64(Float64(i / Float64(beta + Float64(1.0 + Float64(i * 2.0)))) * Float64(Float64(i + beta) / Float64(beta + fma(i, 2.0, -1.0)))) * Float64(Float64(i + Float64(alpha + beta)) / t_0)) / Float64(t_0 / i)); else tmp = Float64(Float64(i * Float64(Float64(alpha + i) / Float64(beta + Float64(-1.0 + fma(i, 2.0, alpha))))) / Float64(1.0 + t_0)); 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[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 2.3e+70], N[(N[(N[(N[(i / N[(beta + N[(1.0 + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / N[(beta + N[(i * 2.0 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 / i), $MachinePrecision]), $MachinePrecision], N[(N[(i * N[(N[(alpha + i), $MachinePrecision] / N[(beta + N[(-1.0 + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \mathsf{fma}\left(i, 2, \alpha\right)\\
\mathbf{if}\;\alpha \leq 2.3 \cdot 10^{+70}:\\
\;\;\;\;\frac{\left(\frac{i}{\beta + \left(1 + i \cdot 2\right)} \cdot \frac{i + \beta}{\beta + \mathsf{fma}\left(i, 2, -1\right)}\right) \cdot \frac{i + \left(\alpha + \beta\right)}{t_0}}{\frac{t_0}{i}}\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \frac{\alpha + i}{\beta + \left(-1 + \mathsf{fma}\left(i, 2, \alpha\right)\right)}}{1 + t_0}\\
\end{array}
\end{array}
if alpha < 2.29999999999999994e70Initial program 19.0%
Simplified37.7%
*-commutative37.7%
fma-udef37.7%
difference-of-sqr--137.7%
fma-udef37.7%
+-commutative37.7%
*-commutative37.7%
associate-+r+37.7%
+-commutative37.7%
fma-udef37.7%
+-commutative37.7%
*-commutative37.7%
associate-+r+37.7%
+-commutative37.7%
Applied egg-rr42.8%
Taylor expanded in alpha around 0 36.8%
times-frac98.8%
*-commutative98.8%
associate--l+98.8%
*-commutative98.8%
Simplified98.8%
Applied egg-rr98.9%
if 2.29999999999999994e70 < alpha Initial program 4.9%
Taylor expanded in beta around inf 11.3%
distribute-rgt-in11.3%
associate-+l+11.3%
associate-+l+11.3%
Applied egg-rr11.3%
distribute-rgt-in11.3%
associate-+r+11.3%
difference-of-sqr-111.3%
times-frac16.1%
+-commutative16.1%
+-commutative16.1%
associate-+r+16.1%
*-commutative16.1%
fma-udef16.1%
+-commutative16.1%
sub-neg16.1%
Applied egg-rr16.1%
associate-*l/16.2%
associate-+l+16.2%
Simplified16.2%
Final simplification77.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ beta (fma i 2.0 alpha))) (t_1 (+ beta (* i 2.0))))
(if (<= alpha 2.3e+70)
(*
(* (/ i t_1) (/ (+ i (+ alpha beta)) t_0))
(* (/ i (+ 1.0 t_1)) (/ (+ i beta) (+ beta (+ (* i 2.0) -1.0)))))
(* (/ (+ alpha i) (+ 1.0 t_0)) (/ i (+ -1.0 t_0))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = beta + fma(i, 2.0, alpha);
double t_1 = beta + (i * 2.0);
double tmp;
if (alpha <= 2.3e+70) {
tmp = ((i / t_1) * ((i + (alpha + beta)) / t_0)) * ((i / (1.0 + t_1)) * ((i + beta) / (beta + ((i * 2.0) + -1.0))));
} else {
tmp = ((alpha + i) / (1.0 + t_0)) * (i / (-1.0 + t_0));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(beta + fma(i, 2.0, alpha)) t_1 = Float64(beta + Float64(i * 2.0)) tmp = 0.0 if (alpha <= 2.3e+70) tmp = Float64(Float64(Float64(i / t_1) * Float64(Float64(i + Float64(alpha + beta)) / t_0)) * Float64(Float64(i / Float64(1.0 + t_1)) * Float64(Float64(i + beta) / Float64(beta + Float64(Float64(i * 2.0) + -1.0))))); else tmp = Float64(Float64(Float64(alpha + i) / Float64(1.0 + t_0)) * Float64(i / Float64(-1.0 + t_0))); 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[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 2.3e+70], N[(N[(N[(i / t$95$1), $MachinePrecision] * N[(N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(i / N[(1.0 + t$95$1), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / N[(beta + N[(N[(i * 2.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision] * N[(i / N[(-1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \mathsf{fma}\left(i, 2, \alpha\right)\\
t_1 := \beta + i \cdot 2\\
\mathbf{if}\;\alpha \leq 2.3 \cdot 10^{+70}:\\
\;\;\;\;\left(\frac{i}{t_1} \cdot \frac{i + \left(\alpha + \beta\right)}{t_0}\right) \cdot \left(\frac{i}{1 + t_1} \cdot \frac{i + \beta}{\beta + \left(i \cdot 2 + -1\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + i}{1 + t_0} \cdot \frac{i}{-1 + t_0}\\
\end{array}
\end{array}
if alpha < 2.29999999999999994e70Initial program 19.0%
Simplified37.7%
*-commutative37.7%
fma-udef37.7%
difference-of-sqr--137.7%
fma-udef37.7%
+-commutative37.7%
*-commutative37.7%
associate-+r+37.7%
+-commutative37.7%
fma-udef37.7%
+-commutative37.7%
*-commutative37.7%
associate-+r+37.7%
+-commutative37.7%
Applied egg-rr42.8%
Taylor expanded in alpha around 0 36.8%
times-frac98.8%
*-commutative98.8%
associate--l+98.8%
*-commutative98.8%
Simplified98.8%
Taylor expanded in alpha around 0 98.8%
if 2.29999999999999994e70 < alpha Initial program 4.9%
Taylor expanded in beta around inf 11.3%
distribute-rgt-in11.3%
associate-+l+11.3%
associate-+l+11.3%
Applied egg-rr11.3%
*-commutative11.3%
distribute-rgt-in11.3%
associate-+r+11.3%
difference-of-sqr-111.3%
times-frac16.1%
+-commutative16.1%
+-commutative16.1%
+-commutative16.1%
associate-+r+16.1%
*-commutative16.1%
fma-udef16.1%
sub-neg16.1%
Applied egg-rr16.1%
Final simplification77.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ beta (fma i 2.0 alpha))) (t_1 (+ beta (* i 2.0))))
(if (<= alpha 2.3e+70)
(*
(* (/ i t_1) (/ (+ i (+ alpha beta)) t_0))
(* (/ i (+ 1.0 t_1)) (/ (+ i beta) (+ beta (+ (* i 2.0) -1.0)))))
(/
(* i (/ (+ alpha i) (+ beta (+ -1.0 (fma i 2.0 alpha)))))
(+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = beta + fma(i, 2.0, alpha);
double t_1 = beta + (i * 2.0);
double tmp;
if (alpha <= 2.3e+70) {
tmp = ((i / t_1) * ((i + (alpha + beta)) / t_0)) * ((i / (1.0 + t_1)) * ((i + beta) / (beta + ((i * 2.0) + -1.0))));
} else {
tmp = (i * ((alpha + i) / (beta + (-1.0 + fma(i, 2.0, alpha))))) / (1.0 + t_0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(beta + fma(i, 2.0, alpha)) t_1 = Float64(beta + Float64(i * 2.0)) tmp = 0.0 if (alpha <= 2.3e+70) tmp = Float64(Float64(Float64(i / t_1) * Float64(Float64(i + Float64(alpha + beta)) / t_0)) * Float64(Float64(i / Float64(1.0 + t_1)) * Float64(Float64(i + beta) / Float64(beta + Float64(Float64(i * 2.0) + -1.0))))); else tmp = Float64(Float64(i * Float64(Float64(alpha + i) / Float64(beta + Float64(-1.0 + fma(i, 2.0, alpha))))) / Float64(1.0 + t_0)); 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[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 2.3e+70], N[(N[(N[(i / t$95$1), $MachinePrecision] * N[(N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(i / N[(1.0 + t$95$1), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / N[(beta + N[(N[(i * 2.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i * N[(N[(alpha + i), $MachinePrecision] / N[(beta + N[(-1.0 + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \mathsf{fma}\left(i, 2, \alpha\right)\\
t_1 := \beta + i \cdot 2\\
\mathbf{if}\;\alpha \leq 2.3 \cdot 10^{+70}:\\
\;\;\;\;\left(\frac{i}{t_1} \cdot \frac{i + \left(\alpha + \beta\right)}{t_0}\right) \cdot \left(\frac{i}{1 + t_1} \cdot \frac{i + \beta}{\beta + \left(i \cdot 2 + -1\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \frac{\alpha + i}{\beta + \left(-1 + \mathsf{fma}\left(i, 2, \alpha\right)\right)}}{1 + t_0}\\
\end{array}
\end{array}
if alpha < 2.29999999999999994e70Initial program 19.0%
Simplified37.7%
*-commutative37.7%
fma-udef37.7%
difference-of-sqr--137.7%
fma-udef37.7%
+-commutative37.7%
*-commutative37.7%
associate-+r+37.7%
+-commutative37.7%
fma-udef37.7%
+-commutative37.7%
*-commutative37.7%
associate-+r+37.7%
+-commutative37.7%
Applied egg-rr42.8%
Taylor expanded in alpha around 0 36.8%
times-frac98.8%
*-commutative98.8%
associate--l+98.8%
*-commutative98.8%
Simplified98.8%
Taylor expanded in alpha around 0 98.8%
if 2.29999999999999994e70 < alpha Initial program 4.9%
Taylor expanded in beta around inf 11.3%
distribute-rgt-in11.3%
associate-+l+11.3%
associate-+l+11.3%
Applied egg-rr11.3%
distribute-rgt-in11.3%
associate-+r+11.3%
difference-of-sqr-111.3%
times-frac16.1%
+-commutative16.1%
+-commutative16.1%
associate-+r+16.1%
*-commutative16.1%
fma-udef16.1%
+-commutative16.1%
sub-neg16.1%
Applied egg-rr16.1%
associate-*l/16.2%
associate-+l+16.2%
Simplified16.2%
Final simplification77.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ beta (* i 2.0))))
(*
(* (/ i t_0) (/ (+ i (+ alpha beta)) (+ beta (fma i 2.0 alpha))))
(* (/ i (+ 1.0 t_0)) (/ (+ i beta) (+ beta (+ (* i 2.0) -1.0)))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = beta + (i * 2.0);
return ((i / t_0) * ((i + (alpha + beta)) / (beta + fma(i, 2.0, alpha)))) * ((i / (1.0 + t_0)) * ((i + beta) / (beta + ((i * 2.0) + -1.0))));
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(beta + Float64(i * 2.0)) return Float64(Float64(Float64(i / t_0) * Float64(Float64(i + Float64(alpha + beta)) / Float64(beta + fma(i, 2.0, alpha)))) * Float64(Float64(i / Float64(1.0 + t_0)) * Float64(Float64(i + beta) / Float64(beta + Float64(Float64(i * 2.0) + -1.0))))) end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(i / t$95$0), $MachinePrecision] * N[(N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(i / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / N[(beta + N[(N[(i * 2.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + i \cdot 2\\
\left(\frac{i}{t_0} \cdot \frac{i + \left(\alpha + \beta\right)}{\beta + \mathsf{fma}\left(i, 2, \alpha\right)}\right) \cdot \left(\frac{i}{1 + t_0} \cdot \frac{i + \beta}{\beta + \left(i \cdot 2 + -1\right)}\right)
\end{array}
\end{array}
Initial program 15.3%
Simplified35.2%
*-commutative35.2%
fma-udef35.2%
difference-of-sqr--135.2%
fma-udef35.2%
+-commutative35.2%
*-commutative35.2%
associate-+r+35.2%
+-commutative35.2%
fma-udef35.2%
+-commutative35.2%
*-commutative35.2%
associate-+r+35.2%
+-commutative35.2%
Applied egg-rr41.3%
Taylor expanded in alpha around 0 30.1%
times-frac83.6%
*-commutative83.6%
associate--l+83.6%
*-commutative83.6%
Simplified83.6%
Taylor expanded in alpha around 0 82.8%
Final simplification82.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ beta (* i 2.0))) (t_1 (+ beta (fma i 2.0 alpha))))
(if (<= beta 2e+134)
(* (* (/ i t_1) (/ (+ i beta) t_0)) 0.25)
(*
(* (/ i (+ 1.0 t_0)) (/ (+ i beta) (+ beta (+ (* i 2.0) -1.0))))
(* (/ (+ i (+ alpha beta)) t_1) (/ i beta))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = beta + (i * 2.0);
double t_1 = beta + fma(i, 2.0, alpha);
double tmp;
if (beta <= 2e+134) {
tmp = ((i / t_1) * ((i + beta) / t_0)) * 0.25;
} else {
tmp = ((i / (1.0 + t_0)) * ((i + beta) / (beta + ((i * 2.0) + -1.0)))) * (((i + (alpha + beta)) / t_1) * (i / beta));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(beta + Float64(i * 2.0)) t_1 = Float64(beta + fma(i, 2.0, alpha)) tmp = 0.0 if (beta <= 2e+134) tmp = Float64(Float64(Float64(i / t_1) * Float64(Float64(i + beta) / t_0)) * 0.25); else tmp = Float64(Float64(Float64(i / Float64(1.0 + t_0)) * Float64(Float64(i + beta) / Float64(beta + Float64(Float64(i * 2.0) + -1.0)))) * Float64(Float64(Float64(i + Float64(alpha + beta)) / t_1) * Float64(i / 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[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+134], N[(N[(N[(i / t$95$1), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision], N[(N[(N[(i / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / N[(beta + N[(N[(i * 2.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + i \cdot 2\\
t_1 := \beta + \mathsf{fma}\left(i, 2, \alpha\right)\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+134}:\\
\;\;\;\;\left(\frac{i}{t_1} \cdot \frac{i + \beta}{t_0}\right) \cdot 0.25\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{i}{1 + t_0} \cdot \frac{i + \beta}{\beta + \left(i \cdot 2 + -1\right)}\right) \cdot \left(\frac{i + \left(\alpha + \beta\right)}{t_1} \cdot \frac{i}{\beta}\right)\\
\end{array}
\end{array}
if beta < 1.99999999999999984e134Initial program 19.9%
Simplified41.7%
Taylor expanded in i around inf 78.4%
Taylor expanded in alpha around 0 78.3%
*-commutative78.3%
Simplified78.3%
if 1.99999999999999984e134 < beta Initial program 0.1%
Simplified14.0%
*-commutative14.0%
fma-udef14.0%
difference-of-sqr--114.0%
fma-udef14.0%
+-commutative14.0%
*-commutative14.0%
associate-+r+14.0%
+-commutative14.0%
fma-udef14.0%
+-commutative14.0%
*-commutative14.0%
associate-+r+14.0%
+-commutative14.0%
Applied egg-rr26.6%
Taylor expanded in alpha around 0 16.2%
times-frac88.7%
*-commutative88.7%
associate--l+88.7%
*-commutative88.7%
Simplified88.7%
Taylor expanded in beta around inf 68.9%
Final simplification76.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (* i 2.0) (+ alpha beta)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ alpha beta))))
(t_3 (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ -1.0 t_1))))
(if (<= t_3 0.1)
t_3
(-
(+ 0.0625 (* 0.0625 (/ (+ (* alpha 2.0) (* beta 2.0)) i)))
(* 0.125 (/ (+ alpha beta) i))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = (i * 2.0) + (alpha + beta);
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) / (-1.0 + t_1);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + 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 = (i * 2.0d0) + (alpha + beta)
t_1 = t_0 * t_0
t_2 = i * (i + (alpha + beta))
t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / ((-1.0d0) + t_1)
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (0.0625d0 + (0.0625d0 * (((alpha * 2.0d0) + (beta * 2.0d0)) / i))) - (0.125d0 * ((alpha + beta) / i))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double t_0 = (i * 2.0) + (alpha + beta);
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) / (-1.0 + t_1);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + beta) / i));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): t_0 = (i * 2.0) + (alpha + beta) t_1 = t_0 * t_0 t_2 = i * (i + (alpha + beta)) t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (-1.0 + t_1) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + beta) / i)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(Float64(i * 2.0) + Float64(alpha + beta)) 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(-1.0 + t_1)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)) / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (i * 2.0) + (alpha + beta);
t_1 = t_0 * t_0;
t_2 = i * (i + (alpha + beta));
t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (-1.0 + t_1);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + 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[(i * 2.0), $MachinePrecision] + N[(alpha + beta), $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[(-1.0 + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.0625 + N[(0.0625 * N[(N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := i \cdot 2 + \left(\alpha + \beta\right)\\
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}}{-1 + t_1}\\
\mathbf{if}\;t_3 \leq 0.1:\\
\;\;\;\;t_3\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\alpha \cdot 2 + \beta \cdot 2}{i}\right) - 0.125 \cdot \frac{\alpha + \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.6%
Simplified24.0%
Taylor expanded in i around inf 73.2%
Final simplification77.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (- (+ 0.0625 (* 0.0625 (/ (+ (* alpha 2.0) (* beta 2.0)) i))) (* 0.125 (/ (+ alpha beta) i))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (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 + (0.0625d0 * (((alpha * 2.0d0) + (beta * 2.0d0)) / i))) - (0.125d0 * ((alpha + beta) / i))
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + beta) / i));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + beta) / i))
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)) / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (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[(0.0625 * N[(N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $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 + 0.0625 \cdot \frac{\alpha \cdot 2 + \beta \cdot 2}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}
\end{array}
Initial program 15.3%
Simplified35.2%
Taylor expanded in i around inf 73.5%
Final simplification73.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (+ (* 0.125 (/ (+ alpha beta) i)) (+ 0.0625 (/ -0.125 (/ i (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return (0.125 * ((alpha + beta) / i)) + (0.0625 + (-0.125 / (i / (alpha + beta))));
}
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.125d0 * ((alpha + beta) / i)) + (0.0625d0 + ((-0.125d0) / (i / (alpha + beta))))
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return (0.125 * ((alpha + beta) / i)) + (0.0625 + (-0.125 / (i / (alpha + beta))));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return (0.125 * ((alpha + beta) / i)) + (0.0625 + (-0.125 / (i / (alpha + beta))))
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return Float64(Float64(0.125 * Float64(Float64(alpha + beta) / i)) + Float64(0.0625 + Float64(-0.125 / Float64(i / Float64(alpha + beta))))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = (0.125 * ((alpha + beta) / i)) + (0.0625 + (-0.125 / (i / (alpha + beta))));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(-0.125 / N[(i / N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.125 \cdot \frac{\alpha + \beta}{i} + \left(0.0625 + \frac{-0.125}{\frac{i}{\alpha + \beta}}\right)
\end{array}
Initial program 15.3%
Simplified35.2%
Taylor expanded in i around inf 73.5%
cancel-sign-sub-inv73.5%
+-commutative73.5%
associate-+l+73.5%
associate-*r/73.5%
distribute-lft-out73.5%
associate-*r*73.5%
metadata-eval73.5%
associate-*r/73.5%
clear-num70.3%
un-div-inv70.3%
metadata-eval70.3%
Applied egg-rr70.3%
Final simplification70.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (+ (* 0.125 (/ (+ alpha beta) i)) (+ 0.0625 (/ -0.125 (/ i beta)))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return (0.125 * ((alpha + beta) / i)) + (0.0625 + (-0.125 / (i / beta)));
}
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.125d0 * ((alpha + beta) / i)) + (0.0625d0 + ((-0.125d0) / (i / beta)))
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return (0.125 * ((alpha + beta) / i)) + (0.0625 + (-0.125 / (i / beta)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return (0.125 * ((alpha + beta) / i)) + (0.0625 + (-0.125 / (i / beta)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return Float64(Float64(0.125 * Float64(Float64(alpha + beta) / i)) + Float64(0.0625 + Float64(-0.125 / Float64(i / beta)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = (0.125 * ((alpha + beta) / i)) + (0.0625 + (-0.125 / (i / beta)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(-0.125 / N[(i / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.125 \cdot \frac{\alpha + \beta}{i} + \left(0.0625 + \frac{-0.125}{\frac{i}{\beta}}\right)
\end{array}
Initial program 15.3%
Simplified35.2%
Taylor expanded in i around inf 73.5%
cancel-sign-sub-inv73.5%
+-commutative73.5%
associate-+l+73.5%
associate-*r/73.5%
distribute-lft-out73.5%
associate-*r*73.5%
metadata-eval73.5%
associate-*r/73.5%
clear-num70.3%
un-div-inv70.3%
metadata-eval70.3%
Applied egg-rr70.3%
Taylor expanded in alpha around 0 67.4%
Final simplification67.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 6e+243) 0.0625 (/ (* (+ alpha beta) 0.0) i)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6e+243) {
tmp = 0.0625;
} else {
tmp = ((alpha + beta) * 0.0) / 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) :: tmp
if (beta <= 6d+243) then
tmp = 0.0625d0
else
tmp = ((alpha + beta) * 0.0d0) / i
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6e+243) {
tmp = 0.0625;
} else {
tmp = ((alpha + beta) * 0.0) / i;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 6e+243: tmp = 0.0625 else: tmp = ((alpha + beta) * 0.0) / i return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 6e+243) tmp = 0.0625; else tmp = Float64(Float64(Float64(alpha + beta) * 0.0) / i); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 6e+243)
tmp = 0.0625;
else
tmp = ((alpha + beta) * 0.0) / i;
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, 6e+243], 0.0625, N[(N[(N[(alpha + beta), $MachinePrecision] * 0.0), $MachinePrecision] / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6 \cdot 10^{+243}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\alpha + \beta\right) \cdot 0}{i}\\
\end{array}
\end{array}
if beta < 5.99999999999999969e243Initial program 16.9%
Simplified38.5%
Taylor expanded in i around inf 70.3%
if 5.99999999999999969e243 < beta Initial program 0.0%
Simplified4.2%
Taylor expanded in i around inf 49.4%
cancel-sign-sub-inv49.4%
+-commutative49.4%
associate-+l+49.4%
associate-*r/49.4%
distribute-lft-out49.4%
associate-*r*49.4%
metadata-eval49.4%
associate-*r/49.4%
clear-num36.5%
un-div-inv36.5%
metadata-eval36.5%
Applied egg-rr36.5%
Taylor expanded in i around 0 41.1%
distribute-rgt-out41.1%
+-commutative41.1%
metadata-eval41.1%
Simplified41.1%
Final simplification67.5%
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 15.3%
Simplified35.2%
Taylor expanded in i around inf 64.8%
Final simplification64.8%
herbie shell --seed 2023305
(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)))