
(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, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (* i 2.0) (+ beta alpha))))
(if (<= i 8.5e+150)
(/
(*
(/ i (/ (+ beta (* i 2.0)) (+ i beta)))
(/ i (/ (fma i 2.0 (+ beta alpha)) (+ i (+ beta alpha)))))
(+ (* t_0 t_0) -1.0))
0.0625)))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (i * 2.0) + (beta + alpha);
double tmp;
if (i <= 8.5e+150) {
tmp = ((i / ((beta + (i * 2.0)) / (i + beta))) * (i / (fma(i, 2.0, (beta + alpha)) / (i + (beta + alpha))))) / ((t_0 * t_0) + -1.0);
} else {
tmp = 0.0625;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(i * 2.0) + Float64(beta + alpha)) tmp = 0.0 if (i <= 8.5e+150) tmp = Float64(Float64(Float64(i / Float64(Float64(beta + Float64(i * 2.0)) / Float64(i + beta))) * Float64(i / Float64(fma(i, 2.0, Float64(beta + alpha)) / Float64(i + Float64(beta + alpha))))) / Float64(Float64(t_0 * t_0) + -1.0)); else tmp = 0.0625; 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[(i * 2.0), $MachinePrecision] + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 8.5e+150], N[(N[(N[(i / N[(N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision] / N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i / N[(N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := i \cdot 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;i \leq 8.5 \cdot 10^{+150}:\\
\;\;\;\;\frac{\frac{i}{\frac{\beta + i \cdot 2}{i + \beta}} \cdot \frac{i}{\frac{\mathsf{fma}\left(i, 2, \beta + \alpha\right)}{i + \left(\beta + \alpha\right)}}}{t_0 \cdot t_0 + -1}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if i < 8.4999999999999999e150Initial program 39.5%
times-frac80.1%
+-commutative80.1%
+-commutative80.1%
+-commutative80.1%
*-commutative80.1%
fma-udef80.1%
+-commutative80.1%
+-commutative80.1%
+-commutative80.1%
fma-def80.1%
+-commutative80.1%
+-commutative80.1%
*-commutative80.1%
fma-udef80.1%
+-commutative80.1%
Applied egg-rr80.1%
*-commutative80.1%
+-commutative80.1%
+-commutative80.1%
*-commutative80.1%
+-commutative80.1%
associate-/l*80.3%
+-commutative80.3%
+-commutative80.3%
+-commutative80.3%
Simplified80.3%
Taylor expanded in alpha around 0 77.5%
associate-/l*79.2%
*-commutative79.2%
Simplified79.2%
if 8.4999999999999999e150 < i Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.1%
Simplified0.1%
Taylor expanded in i around inf 82.8%
Final simplification81.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 (+ (* i 2.0) (+ beta alpha)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ beta alpha))))
(t_3 (/ (/ (* t_2 (+ t_2 (* beta alpha))) t_1) (+ t_1 -1.0))))
(if (<= t_3 0.1)
t_3
(+
(+ 0.0625 (* 0.0625 (/ (* beta 2.0) i)))
(* -0.125 (/ (+ beta alpha) i))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (i * 2.0) + (beta + alpha);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * ((beta + alpha) / i));
}
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) :: tmp
t_0 = (i * 2.0d0) + (beta + alpha)
t_1 = t_0 * t_0
t_2 = i * (i + (beta + alpha))
t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + (-1.0d0))
if (t_3 <= 0.1d0) then
tmp = t_3
else
tmp = (0.0625d0 + (0.0625d0 * ((beta * 2.0d0) / i))) + ((-0.125d0) * ((beta + alpha) / i))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (i * 2.0) + (beta + alpha);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0);
double tmp;
if (t_3 <= 0.1) {
tmp = t_3;
} else {
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * ((beta + alpha) / i));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (i * 2.0) + (beta + alpha) t_1 = t_0 * t_0 t_2 = i * (i + (beta + alpha)) t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0) tmp = 0 if t_3 <= 0.1: tmp = t_3 else: tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * ((beta + alpha) / i)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(i * 2.0) + Float64(beta + alpha)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(beta + alpha))) t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(beta * alpha))) / t_1) / Float64(t_1 + -1.0)) tmp = 0.0 if (t_3 <= 0.1) tmp = t_3; else tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(beta * 2.0) / i))) + Float64(-0.125 * Float64(Float64(beta + alpha) / i))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (i * 2.0) + (beta + alpha);
t_1 = t_0 * t_0;
t_2 = i * (i + (beta + alpha));
t_3 = ((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0);
tmp = 0.0;
if (t_3 <= 0.1)
tmp = t_3;
else
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * ((beta + alpha) / i));
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[(i * 2.0), $MachinePrecision] + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 * N[(t$95$2 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.0625 + N[(0.0625 * N[(N[(beta * 2.0), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := i \cdot 2 + \left(\beta + \alpha\right)\\
t_1 := t_0 \cdot t_0\\
t_2 := i \cdot \left(i + \left(\beta + \alpha\right)\right)\\
t_3 := \frac{\frac{t_2 \cdot \left(t_2 + \beta \cdot \alpha\right)}{t_1}}{t_1 + -1}\\
\mathbf{if}\;t_3 \leq 0.1:\\
\;\;\;\;t_3\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\beta \cdot 2}{i}\right) + -0.125 \cdot \frac{\beta + \alpha}{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.8%
associate-/l/0.0%
associate-*l*0.0%
times-frac8.7%
Simplified8.7%
Taylor expanded in i around inf 76.3%
cancel-sign-sub-inv76.3%
distribute-lft-out76.3%
metadata-eval76.3%
Simplified76.3%
Taylor expanded in alpha around 0 72.6%
associate-*r/72.2%
*-commutative72.2%
Simplified72.2%
Final simplification77.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (+ (+ 0.0625 (* 0.0625 (/ (* beta 2.0) i))) (* -0.125 (/ beta i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i));
}
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.0625d0 + (0.0625d0 * ((beta * 2.0d0) / i))) + ((-0.125d0) * (beta / i))
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i));
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i))
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(beta * 2.0) / i))) + Float64(-0.125 * Float64(beta / i))) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (0.0625 + (0.0625 * ((beta * 2.0) / i))) + (-0.125 * (beta / i));
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.0625 + N[(0.0625 * N[(N[(beta * 2.0), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\left(0.0625 + 0.0625 \cdot \frac{\beta \cdot 2}{i}\right) + -0.125 \cdot \frac{\beta}{i}
\end{array}
Initial program 20.1%
associate-/l/16.9%
associate-*l*16.8%
times-frac26.4%
Simplified26.4%
Taylor expanded in i around inf 76.3%
cancel-sign-sub-inv76.3%
distribute-lft-out76.3%
metadata-eval76.3%
Simplified76.3%
Taylor expanded in alpha around 0 73.3%
associate-*r/72.9%
*-commutative72.9%
Simplified72.9%
Taylor expanded in alpha around 0 74.7%
Final simplification74.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 6.8e+245) 0.0625 (/ 0.0 i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 6.8e+245) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
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 <= 6.8d+245) then
tmp = 0.0625d0
else
tmp = 0.0d0 / i
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 <= 6.8e+245) {
tmp = 0.0625;
} else {
tmp = 0.0 / i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 6.8e+245: tmp = 0.0625 else: tmp = 0.0 / i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 6.8e+245) tmp = 0.0625; else tmp = Float64(0.0 / i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 6.8e+245)
tmp = 0.0625;
else
tmp = 0.0 / i;
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, 6.8e+245], 0.0625, N[(0.0 / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.8 \cdot 10^{+245}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{0}{i}\\
\end{array}
\end{array}
if beta < 6.79999999999999996e245Initial program 21.1%
associate-/l/17.7%
associate-*l*17.7%
times-frac27.7%
Simplified27.7%
Taylor expanded in i around inf 75.6%
if 6.79999999999999996e245 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 24.8%
cancel-sign-sub-inv24.8%
distribute-lft-out24.8%
metadata-eval24.8%
Simplified24.8%
expm1-log1p-u6.8%
Applied egg-rr6.8%
Taylor expanded in i around 0 29.0%
distribute-rgt-out29.0%
metadata-eval29.0%
mul0-rgt29.0%
Simplified29.0%
Final simplification73.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
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.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 20.1%
associate-/l/16.9%
associate-*l*16.8%
times-frac26.4%
Simplified26.4%
Taylor expanded in i around inf 72.4%
Final simplification72.4%
herbie shell --seed 2023333
(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)))