
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t\_1 \cdot t\_1\\
\frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1}
\end{array}
\end{array}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.4e+154) (+ (/ 0.015625 (* i i)) 0.0625) (* (/ (+ i alpha) beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.4e+154) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = ((i + alpha) / beta) * (i / beta);
}
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 <= 3.4d+154) then
tmp = (0.015625d0 / (i * i)) + 0.0625d0
else
tmp = ((i + alpha) / beta) * (i / beta)
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 <= 3.4e+154) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = ((i + alpha) / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3.4e+154: tmp = (0.015625 / (i * i)) + 0.0625 else: tmp = ((i + alpha) / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.4e+154) tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); else tmp = Float64(Float64(Float64(i + alpha) / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.4e+154)
tmp = (0.015625 / (i * i)) + 0.0625;
else
tmp = ((i + alpha) / beta) * (i / beta);
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, 3.4e+154], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4 \cdot 10^{+154}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 3.39999999999999974e154Initial program 21.3%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites16.1%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites74.9%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6475.0
Applied rewrites75.0%
if 3.39999999999999974e154 < beta Initial program 0.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f647.8
Applied rewrites7.8%
lift-+.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6461.3
Applied rewrites61.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ beta alpha)))))
(if (<= (/ (/ (* t_2 (+ t_2 (* beta alpha))) t_1) (+ t_1 -1.0)) 2e-11)
(* i (/ (+ i alpha) (* beta beta)))
(+ (/ 0.015625 (* i i)) 0.0625))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double tmp;
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= 2e-11) {
tmp = i * ((i + alpha) / (beta * beta));
} else {
tmp = (0.015625 / (i * i)) + 0.0625;
}
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) :: tmp
t_0 = (beta + alpha) + (i * 2.0d0)
t_1 = t_0 * t_0
t_2 = i * (i + (beta + alpha))
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + (-1.0d0))) <= 2d-11) then
tmp = i * ((i + alpha) / (beta * beta))
else
tmp = (0.015625d0 / (i * i)) + 0.0625d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double tmp;
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= 2e-11) {
tmp = i * ((i + alpha) / (beta * beta));
} else {
tmp = (0.015625 / (i * i)) + 0.0625;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + alpha) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (beta + alpha)) tmp = 0 if (((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= 2e-11: tmp = i * ((i + alpha) / (beta * beta)) else: tmp = (0.015625 / (i * i)) + 0.0625 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(beta + alpha))) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(beta * alpha))) / t_1) / Float64(t_1 + -1.0)) <= 2e-11) tmp = Float64(i * Float64(Float64(i + alpha) / Float64(beta * beta))); else tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (beta + alpha));
tmp = 0.0;
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= 2e-11)
tmp = i * ((i + alpha) / (beta * beta));
else
tmp = (0.015625 / (i * i)) + 0.0625;
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[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[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], 2e-11], N[(i * N[(N[(i + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \beta \cdot \alpha\right)}{t\_1}}{t\_1 + -1} \leq 2 \cdot 10^{-11}:\\
\;\;\;\;i \cdot \frac{i + \alpha}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 1.99999999999999988e-11Initial program 98.5%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6440.5
Applied rewrites40.5%
lift-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6440.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6440.4
Applied rewrites40.4%
if 1.99999999999999988e-11 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 13.3%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites12.7%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites64.8%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6471.0
Applied rewrites71.0%
Final simplification69.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ beta alpha)))))
(if (<= (/ (/ (* t_2 (+ t_2 (* beta alpha))) t_1) (+ t_1 -1.0)) 2e-11)
(/ (* i i) (* beta beta))
(+ (/ 0.015625 (* i i)) 0.0625))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double tmp;
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= 2e-11) {
tmp = (i * i) / (beta * beta);
} else {
tmp = (0.015625 / (i * i)) + 0.0625;
}
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) :: tmp
t_0 = (beta + alpha) + (i * 2.0d0)
t_1 = t_0 * t_0
t_2 = i * (i + (beta + alpha))
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + (-1.0d0))) <= 2d-11) then
tmp = (i * i) / (beta * beta)
else
tmp = (0.015625d0 / (i * i)) + 0.0625d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (beta + alpha) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (beta + alpha));
double tmp;
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= 2e-11) {
tmp = (i * i) / (beta * beta);
} else {
tmp = (0.015625 / (i * i)) + 0.0625;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (beta + alpha) + (i * 2.0) t_1 = t_0 * t_0 t_2 = i * (i + (beta + alpha)) tmp = 0 if (((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= 2e-11: tmp = (i * i) / (beta * beta) else: tmp = (0.015625 / (i * i)) + 0.0625 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(beta + alpha) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(beta + alpha))) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(beta * alpha))) / t_1) / Float64(t_1 + -1.0)) <= 2e-11) tmp = Float64(Float64(i * i) / Float64(beta * beta)); else tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (beta + alpha) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = i * (i + (beta + alpha));
tmp = 0.0;
if ((((t_2 * (t_2 + (beta * alpha))) / t_1) / (t_1 + -1.0)) <= 2e-11)
tmp = (i * i) / (beta * beta);
else
tmp = (0.015625 / (i * i)) + 0.0625;
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[(beta + alpha), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[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], 2e-11], N[(N[(i * i), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + i \cdot 2\\
t_1 := t\_0 \cdot t\_0\\
t_2 := i \cdot \left(i + \left(\beta + \alpha\right)\right)\\
\mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \beta \cdot \alpha\right)}{t\_1}}{t\_1 + -1} \leq 2 \cdot 10^{-11}:\\
\;\;\;\;\frac{i \cdot i}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 1.99999999999999988e-11Initial program 98.5%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6440.5
Applied rewrites40.5%
Taylor expanded in i around inf
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6436.5
Applied rewrites36.5%
if 1.99999999999999988e-11 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) Initial program 13.3%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites12.7%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites64.8%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6471.0
Applied rewrites71.0%
Final simplification69.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.4e+154) (+ (/ 0.015625 (* i i)) 0.0625) (* (/ i beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.4e+154) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
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 <= 3.4d+154) then
tmp = (0.015625d0 / (i * i)) + 0.0625d0
else
tmp = (i / beta) * (i / beta)
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 <= 3.4e+154) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3.4e+154: tmp = (0.015625 / (i * i)) + 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.4e+154) tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.4e+154)
tmp = (0.015625 / (i * i)) + 0.0625;
else
tmp = (i / beta) * (i / beta);
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, 3.4e+154], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4 \cdot 10^{+154}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 3.39999999999999974e154Initial program 21.3%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites16.1%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites74.9%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6475.0
Applied rewrites75.0%
if 3.39999999999999974e154 < beta Initial program 0.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f647.8
Applied rewrites7.8%
lift-+.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6461.3
Applied rewrites61.3%
Taylor expanded in i around inf
lower-/.f6455.3
Applied rewrites55.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 9.5e+274) (+ (/ 0.015625 (* i i)) 0.0625) (/ (* i alpha) (* beta beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 9.5e+274) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = (i * alpha) / (beta * beta);
}
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 <= 9.5d+274) then
tmp = (0.015625d0 / (i * i)) + 0.0625d0
else
tmp = (i * alpha) / (beta * beta)
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 <= 9.5e+274) {
tmp = (0.015625 / (i * i)) + 0.0625;
} else {
tmp = (i * alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 9.5e+274: tmp = (0.015625 / (i * i)) + 0.0625 else: tmp = (i * alpha) / (beta * beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 9.5e+274) tmp = Float64(Float64(0.015625 / Float64(i * i)) + 0.0625); else tmp = Float64(Float64(i * alpha) / Float64(beta * beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 9.5e+274)
tmp = (0.015625 / (i * i)) + 0.0625;
else
tmp = (i * alpha) / (beta * beta);
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, 9.5e+274], N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision], N[(N[(i * alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.5 \cdot 10^{+274}:\\
\;\;\;\;\frac{0.015625}{i \cdot i} + 0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i \cdot \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 9.50000000000000031e274Initial program 18.3%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites13.8%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites64.2%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6470.3
Applied rewrites70.3%
if 9.50000000000000031e274 < beta Initial program 0.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6410.0
Applied rewrites10.0%
Taylor expanded in i around 0
lower-*.f6414.6
Applied rewrites14.6%
Final simplification68.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (+ (/ 0.015625 (* i i)) 0.0625))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return (0.015625 / (i * i)) + 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.015625d0 / (i * i)) + 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return (0.015625 / (i * i)) + 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return (0.015625 / (i * i)) + 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return Float64(Float64(0.015625 / Float64(i * i)) + 0.0625) end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = (0.015625 / (i * i)) + 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := N[(N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\frac{0.015625}{i \cdot i} + 0.0625
\end{array}
Initial program 17.6%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
unpow2N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites13.2%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites61.7%
Taylor expanded in beta around 0
+-commutativeN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f64N/A
unpow2N/A
lower-*.f6467.7
Applied rewrites67.7%
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 17.6%
Taylor expanded in i around inf
Applied rewrites67.5%
herbie shell --seed 2024219
(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)))