
(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 6 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 (+ i (+ beta alpha))) (t_1 (+ alpha (fma i 2.0 beta))))
(if (<= beta 4e+53)
0.0625
(if (<= beta 1.2e+79)
(*
(/ i (fma t_1 t_1 -1.0))
(* (/ (fma i t_0 (* beta alpha)) t_1) (/ t_0 t_1)))
(if (<= beta 8.2e+121) 0.0625 (* (/ i beta) (/ (+ i alpha) beta)))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = i + (beta + alpha);
double t_1 = alpha + fma(i, 2.0, beta);
double tmp;
if (beta <= 4e+53) {
tmp = 0.0625;
} else if (beta <= 1.2e+79) {
tmp = (i / fma(t_1, t_1, -1.0)) * ((fma(i, t_0, (beta * alpha)) / t_1) * (t_0 / t_1));
} else if (beta <= 8.2e+121) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(i + Float64(beta + alpha)) t_1 = Float64(alpha + fma(i, 2.0, beta)) tmp = 0.0 if (beta <= 4e+53) tmp = 0.0625; elseif (beta <= 1.2e+79) tmp = Float64(Float64(i / fma(t_1, t_1, -1.0)) * Float64(Float64(fma(i, t_0, Float64(beta * alpha)) / t_1) * Float64(t_0 / t_1))); elseif (beta <= 8.2e+121) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(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[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+53], 0.0625, If[LessEqual[beta, 1.2e+79], N[(N[(i / N[(t$95$1 * t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i * t$95$0 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(t$95$0 / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 8.2e+121], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := i + \left(\beta + \alpha\right)\\
t_1 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+53}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.2 \cdot 10^{+79}:\\
\;\;\;\;\frac{i}{\mathsf{fma}\left(t_1, t_1, -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, t_0, \beta \cdot \alpha\right)}{t_1} \cdot \frac{t_0}{t_1}\right)\\
\mathbf{elif}\;\beta \leq 8.2 \cdot 10^{+121}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 4e53 or 1.19999999999999993e79 < beta < 8.2e121Initial program 21.7%
associate-/l/19.7%
associate-*l*19.6%
times-frac25.5%
Simplified44.1%
Taylor expanded in i around inf 79.9%
if 4e53 < beta < 1.19999999999999993e79Initial program 40.6%
associate-/l/39.7%
associate-*l*39.7%
times-frac60.0%
Simplified79.7%
if 8.2e121 < beta Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac2.0%
Simplified9.9%
Taylor expanded in beta around inf 30.3%
associate-/l*32.5%
unpow232.5%
Simplified32.5%
div-inv32.5%
+-commutative32.5%
Applied egg-rr32.5%
associate-*l*54.6%
+-commutative54.6%
Simplified54.6%
Taylor expanded in beta around 0 30.3%
unpow230.3%
times-frac69.6%
+-commutative69.6%
Simplified69.6%
Final simplification77.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ i (+ beta alpha)))
(t_1 (fma i 2.0 (+ beta alpha)))
(t_2 (+ (+ beta alpha) (* i 2.0))))
(if (<= beta 4e+53)
0.0625
(if (<= beta 1.3e+79)
(/
(* (/ (fma i t_0 (* beta alpha)) t_1) (/ i (/ t_1 t_0)))
(+ (* t_2 t_2) -1.0))
(if (<= beta 8.2e+121) 0.0625 (* (/ i beta) (/ (+ i alpha) beta)))))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double t_0 = i + (beta + alpha);
double t_1 = fma(i, 2.0, (beta + alpha));
double t_2 = (beta + alpha) + (i * 2.0);
double tmp;
if (beta <= 4e+53) {
tmp = 0.0625;
} else if (beta <= 1.3e+79) {
tmp = ((fma(i, t_0, (beta * alpha)) / t_1) * (i / (t_1 / t_0))) / ((t_2 * t_2) + -1.0);
} else if (beta <= 8.2e+121) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) t_0 = Float64(i + Float64(beta + alpha)) t_1 = fma(i, 2.0, Float64(beta + alpha)) t_2 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) tmp = 0.0 if (beta <= 4e+53) tmp = 0.0625; elseif (beta <= 1.3e+79) tmp = Float64(Float64(Float64(fma(i, t_0, Float64(beta * alpha)) / t_1) * Float64(i / Float64(t_1 / t_0))) / Float64(Float64(t_2 * t_2) + -1.0)); elseif (beta <= 8.2e+121) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(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[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+53], 0.0625, If[LessEqual[beta, 1.3e+79], N[(N[(N[(N[(i * t$95$0 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(i / N[(t$95$1 / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$2 * t$95$2), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 8.2e+121], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := i + \left(\beta + \alpha\right)\\
t_1 := \mathsf{fma}\left(i, 2, \beta + \alpha\right)\\
t_2 := \left(\beta + \alpha\right) + i \cdot 2\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+53}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.3 \cdot 10^{+79}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, t_0, \beta \cdot \alpha\right)}{t_1} \cdot \frac{i}{\frac{t_1}{t_0}}}{t_2 \cdot t_2 + -1}\\
\mathbf{elif}\;\beta \leq 8.2 \cdot 10^{+121}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 4e53 or 1.30000000000000007e79 < beta < 8.2e121Initial program 21.7%
associate-/l/19.7%
associate-*l*19.6%
times-frac25.5%
Simplified44.1%
Taylor expanded in i around inf 79.9%
if 4e53 < beta < 1.30000000000000007e79Initial program 40.6%
times-frac79.7%
+-commutative79.7%
+-commutative79.7%
*-commutative79.7%
fma-udef79.7%
+-commutative79.7%
associate-+l+79.7%
+-commutative79.7%
*-commutative79.7%
+-commutative79.7%
associate-+l+79.7%
+-commutative79.7%
fma-udef79.7%
+-commutative79.7%
*-commutative79.7%
fma-udef79.7%
Applied egg-rr79.7%
*-commutative79.7%
+-commutative79.7%
associate-/l*79.4%
+-commutative79.4%
Simplified79.4%
if 8.2e121 < beta Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac2.0%
Simplified9.9%
Taylor expanded in beta around inf 30.3%
associate-/l*32.5%
unpow232.5%
Simplified32.5%
div-inv32.5%
+-commutative32.5%
Applied egg-rr32.5%
associate-*l*54.6%
+-commutative54.6%
Simplified54.6%
Taylor expanded in beta around 0 30.3%
unpow230.3%
times-frac69.6%
+-commutative69.6%
Simplified69.6%
Final simplification77.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 8.2e+121) 0.0625 (* (/ i beta) (/ (+ i alpha) beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 8.2e+121) {
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 <= 8.2d+121) 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 <= 8.2e+121) {
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 <= 8.2e+121: 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 <= 8.2e+121) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(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 <= 8.2e+121)
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, 8.2e+121], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.2 \cdot 10^{+121}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 8.2e121Initial program 22.1%
associate-/l/20.2%
associate-*l*20.1%
times-frac26.3%
Simplified45.0%
Taylor expanded in i around inf 79.1%
if 8.2e121 < beta Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac2.0%
Simplified9.9%
Taylor expanded in beta around inf 30.3%
associate-/l*32.5%
unpow232.5%
Simplified32.5%
div-inv32.5%
+-commutative32.5%
Applied egg-rr32.5%
associate-*l*54.6%
+-commutative54.6%
Simplified54.6%
Taylor expanded in beta around 0 30.3%
unpow230.3%
times-frac69.6%
+-commutative69.6%
Simplified69.6%
Final simplification77.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.4e+221) 0.0625 (* i (/ (/ i beta) beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.4e+221) {
tmp = 0.0625;
} else {
tmp = i * ((i / beta) / 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 <= 4.4d+221) then
tmp = 0.0625d0
else
tmp = i * ((i / beta) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.4e+221) {
tmp = 0.0625;
} else {
tmp = i * ((i / beta) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 4.4e+221: tmp = 0.0625 else: tmp = i * ((i / beta) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.4e+221) tmp = 0.0625; else tmp = Float64(i * Float64(Float64(i / beta) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4.4e+221)
tmp = 0.0625;
else
tmp = i * ((i / beta) / 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, 4.4e+221], 0.0625, N[(i * N[(N[(i / beta), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.4 \cdot 10^{+221}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;i \cdot \frac{\frac{i}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.3999999999999999e221Initial program 20.1%
associate-/l/18.3%
associate-*l*18.2%
times-frac24.4%
Simplified42.2%
Taylor expanded in i around inf 75.6%
if 4.3999999999999999e221 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified6.5%
Taylor expanded in beta around inf 40.2%
associate-/l*42.5%
unpow242.5%
Simplified42.5%
Taylor expanded in alpha around 0 42.5%
unpow242.5%
Simplified42.5%
div-inv42.5%
associate-/l*56.7%
Applied egg-rr56.7%
Taylor expanded in beta around 0 42.5%
*-rgt-identity42.5%
unpow242.5%
times-frac58.4%
*-commutative58.4%
associate-*l/58.5%
*-lft-identity58.5%
Simplified58.5%
Final simplification73.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.35e+220) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.35e+220) {
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 <= 1.35d+220) 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 <= 1.35e+220) {
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 <= 1.35e+220: 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 <= 1.35e+220) 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 <= 1.35e+220)
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, 1.35e+220], 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 1.35 \cdot 10^{+220}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 1.3499999999999999e220Initial program 20.1%
associate-/l/18.3%
associate-*l*18.2%
times-frac24.4%
Simplified42.2%
Taylor expanded in i around inf 75.6%
if 1.3499999999999999e220 < beta Initial program 0.0%
times-frac6.5%
+-commutative6.5%
+-commutative6.5%
*-commutative6.5%
fma-udef6.5%
+-commutative6.5%
associate-+l+6.5%
+-commutative6.5%
*-commutative6.5%
+-commutative6.5%
associate-+l+6.5%
+-commutative6.5%
fma-udef6.5%
+-commutative6.5%
*-commutative6.5%
fma-udef6.5%
Applied egg-rr6.5%
*-commutative6.5%
+-commutative6.5%
associate-/l*6.5%
+-commutative6.5%
Simplified6.5%
Taylor expanded in alpha around 0 12.9%
Taylor expanded in beta around inf 40.4%
unpow240.4%
unpow240.4%
times-frac76.1%
Simplified76.1%
Final simplification75.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.7%
associate-/l/16.1%
associate-*l*16.0%
times-frac21.4%
Simplified37.9%
Taylor expanded in i around inf 68.5%
Final simplification68.5%
herbie shell --seed 2023285
(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)))