
(FPCore (t) :precision binary64 (let* ((t_1 (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))))) (t_2 (* t_1 t_1))) (/ (+ 1.0 t_2) (+ 2.0 t_2))))
double code(double t) {
double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
double t_2 = t_1 * t_1;
return (1.0 + t_2) / (2.0 + t_2);
}
real(8) function code(t)
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
t_1 = 2.0d0 - ((2.0d0 / t) / (1.0d0 + (1.0d0 / t)))
t_2 = t_1 * t_1
code = (1.0d0 + t_2) / (2.0d0 + t_2)
end function
public static double code(double t) {
double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
double t_2 = t_1 * t_1;
return (1.0 + t_2) / (2.0 + t_2);
}
def code(t): t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t))) t_2 = t_1 * t_1 return (1.0 + t_2) / (2.0 + t_2)
function code(t) t_1 = Float64(2.0 - Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t)))) t_2 = Float64(t_1 * t_1) return Float64(Float64(1.0 + t_2) / Float64(2.0 + t_2)) end
function tmp = code(t) t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t))); t_2 = t_1 * t_1; tmp = (1.0 + t_2) / (2.0 + t_2); end
code[t_] := Block[{t$95$1 = N[(2.0 - N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(1.0 + t$95$2), $MachinePrecision] / N[(2.0 + t$95$2), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\
t_2 := t\_1 \cdot t\_1\\
\frac{1 + t\_2}{2 + t\_2}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (t) :precision binary64 (let* ((t_1 (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))))) (t_2 (* t_1 t_1))) (/ (+ 1.0 t_2) (+ 2.0 t_2))))
double code(double t) {
double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
double t_2 = t_1 * t_1;
return (1.0 + t_2) / (2.0 + t_2);
}
real(8) function code(t)
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
t_1 = 2.0d0 - ((2.0d0 / t) / (1.0d0 + (1.0d0 / t)))
t_2 = t_1 * t_1
code = (1.0d0 + t_2) / (2.0d0 + t_2)
end function
public static double code(double t) {
double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
double t_2 = t_1 * t_1;
return (1.0 + t_2) / (2.0 + t_2);
}
def code(t): t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t))) t_2 = t_1 * t_1 return (1.0 + t_2) / (2.0 + t_2)
function code(t) t_1 = Float64(2.0 - Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t)))) t_2 = Float64(t_1 * t_1) return Float64(Float64(1.0 + t_2) / Float64(2.0 + t_2)) end
function tmp = code(t) t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t))); t_2 = t_1 * t_1; tmp = (1.0 + t_2) / (2.0 + t_2); end
code[t_] := Block[{t$95$1 = N[(2.0 - N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(1.0 + t$95$2), $MachinePrecision] / N[(2.0 + t$95$2), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\
t_2 := t\_1 \cdot t\_1\\
\frac{1 + t\_2}{2 + t\_2}
\end{array}
\end{array}
(FPCore (t)
:precision binary64
(let* ((t_1 (+ 2.0 (/ -2.0 (+ 1.0 t)))))
(/
(+
1.0
(* (+ 2.0 (/ (/ 2.0 t) (- -1.0 (/ 1.0 t)))) (+ 2.0 (/ 2.0 (- -1.0 t)))))
(fma t_1 t_1 2.0))))
double code(double t) {
double t_1 = 2.0 + (-2.0 / (1.0 + t));
return (1.0 + ((2.0 + ((2.0 / t) / (-1.0 - (1.0 / t)))) * (2.0 + (2.0 / (-1.0 - t))))) / fma(t_1, t_1, 2.0);
}
function code(t) t_1 = Float64(2.0 + Float64(-2.0 / Float64(1.0 + t))) return Float64(Float64(1.0 + Float64(Float64(2.0 + Float64(Float64(2.0 / t) / Float64(-1.0 - Float64(1.0 / t)))) * Float64(2.0 + Float64(2.0 / Float64(-1.0 - t))))) / fma(t_1, t_1, 2.0)) end
code[t_] := Block[{t$95$1 = N[(2.0 + N[(-2.0 / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 + N[(N[(2.0 + N[(N[(2.0 / t), $MachinePrecision] / N[(-1.0 - N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 + N[(2.0 / N[(-1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * t$95$1 + 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 + \frac{-2}{1 + t}\\
\frac{1 + \left(2 + \frac{\frac{2}{t}}{-1 - \frac{1}{t}}\right) \cdot \left(2 + \frac{2}{-1 - t}\right)}{\mathsf{fma}\left(t\_1, t\_1, 2\right)}
\end{array}
\end{array}
Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
accelerator-lowering-fma.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
metadata-evalN/A
rgt-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
metadata-evalN/A
rgt-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64100.0
Applied egg-rr100.0%
associate-/l/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64100.0
Applied egg-rr100.0%
distribute-lft-inN/A
*-rgt-identityN/A
rgt-mult-inverseN/A
+-lowering-+.f64100.0
Applied egg-rr100.0%
Final simplification100.0%
(FPCore (t)
:precision binary64
(if (<= (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 0.001)
(+
0.8333333333333334
(/
(+
(/ (+ 0.037037037037037035 (/ 0.04938271604938271 t)) t)
-0.2222222222222222)
t))
(/
(fma (* t t) (fma t (fma t 12.0 -8.0) 4.0) 1.0)
(fma (* t (fma t (fma t (fma -2.0 t 2.0) -2.0) 2.0)) (* 2.0 t) 2.0))))
double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 0.001) {
tmp = 0.8333333333333334 + ((((0.037037037037037035 + (0.04938271604938271 / t)) / t) + -0.2222222222222222) / t);
} else {
tmp = fma((t * t), fma(t, fma(t, 12.0, -8.0), 4.0), 1.0) / fma((t * fma(t, fma(t, fma(-2.0, t, 2.0), -2.0), 2.0)), (2.0 * t), 2.0);
}
return tmp;
}
function code(t) tmp = 0.0 if (Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) <= 0.001) tmp = Float64(0.8333333333333334 + Float64(Float64(Float64(Float64(0.037037037037037035 + Float64(0.04938271604938271 / t)) / t) + -0.2222222222222222) / t)); else tmp = Float64(fma(Float64(t * t), fma(t, fma(t, 12.0, -8.0), 4.0), 1.0) / fma(Float64(t * fma(t, fma(t, fma(-2.0, t, 2.0), -2.0), 2.0)), Float64(2.0 * t), 2.0)); end return tmp end
code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.001], N[(0.8333333333333334 + N[(N[(N[(N[(0.037037037037037035 + N[(0.04938271604938271 / t), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] + -0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * t), $MachinePrecision] * N[(t * N[(t * 12.0 + -8.0), $MachinePrecision] + 4.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(t * N[(t * N[(t * N[(-2.0 * t + 2.0), $MachinePrecision] + -2.0), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] * N[(2.0 * t), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\frac{2}{t}}{1 + \frac{1}{t}} \leq 0.001:\\
\;\;\;\;0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} + -0.2222222222222222}{t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, \mathsf{fma}\left(t, 12, -8\right), 4\right), 1\right)}{\mathsf{fma}\left(t \cdot \mathsf{fma}\left(t, \mathsf{fma}\left(t, \mathsf{fma}\left(-2, t, 2\right), -2\right), 2\right), 2 \cdot t, 2\right)}\\
\end{array}
\end{array}
if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1e-3Initial program 100.0%
Taylor expanded in t around inf
associate--l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
associate--r+N/A
cube-multN/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
div-subN/A
unpow2N/A
associate-/l/N/A
associate-*r/N/A
metadata-evalN/A
div-subN/A
Simplified99.8%
Taylor expanded in t around -inf
+-lowering-+.f64N/A
associate-*r/N/A
mul-1-negN/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
/-lowering-/.f64N/A
Simplified99.9%
if 1e-3 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
Taylor expanded in t around 0
*-lowering-*.f6499.5
Simplified99.5%
Taylor expanded in t around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
(FPCore (t)
:precision binary64
(if (<= (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 0.001)
(+
0.8333333333333334
(/
(+
(/ (+ 0.037037037037037035 (/ 0.04938271604938271 t)) t)
-0.2222222222222222)
t))
(/
(fma (* t t) (fma t (fma t 12.0 -8.0) 4.0) 1.0)
(fma (+ 4.0 (/ -4.0 (+ 1.0 t))) t 2.0))))
double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 0.001) {
tmp = 0.8333333333333334 + ((((0.037037037037037035 + (0.04938271604938271 / t)) / t) + -0.2222222222222222) / t);
} else {
tmp = fma((t * t), fma(t, fma(t, 12.0, -8.0), 4.0), 1.0) / fma((4.0 + (-4.0 / (1.0 + t))), t, 2.0);
}
return tmp;
}
function code(t) tmp = 0.0 if (Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) <= 0.001) tmp = Float64(0.8333333333333334 + Float64(Float64(Float64(Float64(0.037037037037037035 + Float64(0.04938271604938271 / t)) / t) + -0.2222222222222222) / t)); else tmp = Float64(fma(Float64(t * t), fma(t, fma(t, 12.0, -8.0), 4.0), 1.0) / fma(Float64(4.0 + Float64(-4.0 / Float64(1.0 + t))), t, 2.0)); end return tmp end
code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.001], N[(0.8333333333333334 + N[(N[(N[(N[(0.037037037037037035 + N[(0.04938271604938271 / t), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] + -0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * t), $MachinePrecision] * N[(t * N[(t * 12.0 + -8.0), $MachinePrecision] + 4.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(4.0 + N[(-4.0 / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t + 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\frac{2}{t}}{1 + \frac{1}{t}} \leq 0.001:\\
\;\;\;\;0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} + -0.2222222222222222}{t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, \mathsf{fma}\left(t, 12, -8\right), 4\right), 1\right)}{\mathsf{fma}\left(4 + \frac{-4}{1 + t}, t, 2\right)}\\
\end{array}
\end{array}
if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1e-3Initial program 100.0%
Taylor expanded in t around inf
associate--l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
associate--r+N/A
cube-multN/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
div-subN/A
unpow2N/A
associate-/l/N/A
associate-*r/N/A
metadata-evalN/A
div-subN/A
Simplified99.8%
Taylor expanded in t around -inf
+-lowering-+.f64N/A
associate-*r/N/A
mul-1-negN/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
/-lowering-/.f64N/A
Simplified99.9%
if 1e-3 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
Taylor expanded in t around 0
*-lowering-*.f6499.5
Simplified99.5%
div-invN/A
rgt-mult-inverseN/A
+-commutativeN/A
cancel-sign-sub-invN/A
metadata-evalN/A
div-invN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
metadata-evalN/A
+-lowering-+.f6499.5
Applied egg-rr99.5%
Final simplification99.7%
(FPCore (t) :precision binary64 (let* ((t_1 (+ 2.0 (/ 2.0 (- -1.0 t)))) (t_2 (+ 2.0 (/ -2.0 (+ 1.0 t))))) (/ (fma t_1 t_1 1.0) (fma t_2 t_2 2.0))))
double code(double t) {
double t_1 = 2.0 + (2.0 / (-1.0 - t));
double t_2 = 2.0 + (-2.0 / (1.0 + t));
return fma(t_1, t_1, 1.0) / fma(t_2, t_2, 2.0);
}
function code(t) t_1 = Float64(2.0 + Float64(2.0 / Float64(-1.0 - t))) t_2 = Float64(2.0 + Float64(-2.0 / Float64(1.0 + t))) return Float64(fma(t_1, t_1, 1.0) / fma(t_2, t_2, 2.0)) end
code[t_] := Block[{t$95$1 = N[(2.0 + N[(2.0 / N[(-1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 + N[(-2.0 / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * t$95$1 + 1.0), $MachinePrecision] / N[(t$95$2 * t$95$2 + 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := 2 + \frac{2}{-1 - t}\\
t_2 := 2 + \frac{-2}{1 + t}\\
\frac{\mathsf{fma}\left(t\_1, t\_1, 1\right)}{\mathsf{fma}\left(t\_2, t\_2, 2\right)}
\end{array}
\end{array}
Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
accelerator-lowering-fma.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
metadata-evalN/A
rgt-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-fracN/A
/-lowering-/.f64N/A
metadata-evalN/A
rgt-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64100.0
Applied egg-rr100.0%
associate-/l/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64100.0
Applied egg-rr100.0%
+-commutativeN/A
Applied egg-rr100.0%
Final simplification100.0%
(FPCore (t)
:precision binary64
(if (<= (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 0.001)
(+
0.8333333333333334
(/
(+
(/ (+ 0.037037037037037035 (/ 0.04938271604938271 t)) t)
-0.2222222222222222)
t))
(fma (* t t) (fma t (+ t -2.0) 1.0) 0.5)))
double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 0.001) {
tmp = 0.8333333333333334 + ((((0.037037037037037035 + (0.04938271604938271 / t)) / t) + -0.2222222222222222) / t);
} else {
tmp = fma((t * t), fma(t, (t + -2.0), 1.0), 0.5);
}
return tmp;
}
function code(t) tmp = 0.0 if (Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) <= 0.001) tmp = Float64(0.8333333333333334 + Float64(Float64(Float64(Float64(0.037037037037037035 + Float64(0.04938271604938271 / t)) / t) + -0.2222222222222222) / t)); else tmp = fma(Float64(t * t), fma(t, Float64(t + -2.0), 1.0), 0.5); end return tmp end
code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.001], N[(0.8333333333333334 + N[(N[(N[(N[(0.037037037037037035 + N[(0.04938271604938271 / t), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] + -0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(t * t), $MachinePrecision] * N[(t * N[(t + -2.0), $MachinePrecision] + 1.0), $MachinePrecision] + 0.5), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\frac{2}{t}}{1 + \frac{1}{t}} \leq 0.001:\\
\;\;\;\;0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} + -0.2222222222222222}{t}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, t + -2, 1\right), 0.5\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1e-3Initial program 100.0%
Taylor expanded in t around inf
associate--l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
associate--r+N/A
cube-multN/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
div-subN/A
unpow2N/A
associate-/l/N/A
associate-*r/N/A
metadata-evalN/A
div-subN/A
Simplified99.8%
Taylor expanded in t around -inf
+-lowering-+.f64N/A
associate-*r/N/A
mul-1-negN/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
/-lowering-/.f64N/A
Simplified99.9%
if 1e-3 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
+-lowering-+.f6499.5
Simplified99.5%
Final simplification99.7%
(FPCore (t)
:precision binary64
(if (<= (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 0.001)
(+
0.8333333333333334
(/ (fma t -0.2222222222222222 0.037037037037037035) (* t t)))
(fma (* t t) (fma t (+ t -2.0) 1.0) 0.5)))
double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 0.001) {
tmp = 0.8333333333333334 + (fma(t, -0.2222222222222222, 0.037037037037037035) / (t * t));
} else {
tmp = fma((t * t), fma(t, (t + -2.0), 1.0), 0.5);
}
return tmp;
}
function code(t) tmp = 0.0 if (Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) <= 0.001) tmp = Float64(0.8333333333333334 + Float64(fma(t, -0.2222222222222222, 0.037037037037037035) / Float64(t * t))); else tmp = fma(Float64(t * t), fma(t, Float64(t + -2.0), 1.0), 0.5); end return tmp end
code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.001], N[(0.8333333333333334 + N[(N[(t * -0.2222222222222222 + 0.037037037037037035), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t * t), $MachinePrecision] * N[(t * N[(t + -2.0), $MachinePrecision] + 1.0), $MachinePrecision] + 0.5), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\frac{2}{t}}{1 + \frac{1}{t}} \leq 0.001:\\
\;\;\;\;0.8333333333333334 + \frac{\mathsf{fma}\left(t, -0.2222222222222222, 0.037037037037037035\right)}{t \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, t + -2, 1\right), 0.5\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1e-3Initial program 100.0%
Taylor expanded in t around inf
associate--l+N/A
+-lowering-+.f64N/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
associate-*r/N/A
metadata-evalN/A
div-subN/A
/-lowering-/.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6499.7
Simplified99.7%
Taylor expanded in t around inf
associate--l+N/A
+-lowering-+.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate--r-N/A
associate-*r/N/A
metadata-evalN/A
unpow2N/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-subN/A
neg-sub0N/A
mul-1-negN/A
associate-*r/N/A
Simplified99.8%
Taylor expanded in t around 0
/-lowering-/.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6499.8
Simplified99.8%
if 1e-3 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
+-lowering-+.f6499.5
Simplified99.5%
Final simplification99.6%
(FPCore (t) :precision binary64 (if (<= (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 0.001) (- 0.8333333333333334 (/ 0.2222222222222222 t)) (fma (* t t) (fma t (+ t -2.0) 1.0) 0.5)))
double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 0.001) {
tmp = 0.8333333333333334 - (0.2222222222222222 / t);
} else {
tmp = fma((t * t), fma(t, (t + -2.0), 1.0), 0.5);
}
return tmp;
}
function code(t) tmp = 0.0 if (Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) <= 0.001) tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t)); else tmp = fma(Float64(t * t), fma(t, Float64(t + -2.0), 1.0), 0.5); end return tmp end
code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.001], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], N[(N[(t * t), $MachinePrecision] * N[(t * N[(t + -2.0), $MachinePrecision] + 1.0), $MachinePrecision] + 0.5), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\frac{2}{t}}{1 + \frac{1}{t}} \leq 0.001:\\
\;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, t + -2, 1\right), 0.5\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1e-3Initial program 100.0%
Taylor expanded in t around inf
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6499.6
Simplified99.6%
Taylor expanded in t around inf
--lowering--.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6499.6
Simplified99.6%
if 1e-3 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
+-lowering-+.f6499.5
Simplified99.5%
Final simplification99.6%
(FPCore (t) :precision binary64 (if (<= (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 0.001) (- 0.8333333333333334 (/ 0.2222222222222222 t)) (fma t (fma -2.0 (* t t) t) 0.5)))
double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 0.001) {
tmp = 0.8333333333333334 - (0.2222222222222222 / t);
} else {
tmp = fma(t, fma(-2.0, (t * t), t), 0.5);
}
return tmp;
}
function code(t) tmp = 0.0 if (Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) <= 0.001) tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t)); else tmp = fma(t, fma(-2.0, Float64(t * t), t), 0.5); end return tmp end
code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.001], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], N[(t * N[(-2.0 * N[(t * t), $MachinePrecision] + t), $MachinePrecision] + 0.5), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\frac{2}{t}}{1 + \frac{1}{t}} \leq 0.001:\\
\;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(-2, t \cdot t, t\right), 0.5\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1e-3Initial program 100.0%
Taylor expanded in t around inf
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6499.6
Simplified99.6%
Taylor expanded in t around inf
--lowering--.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6499.6
Simplified99.6%
if 1e-3 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
Taylor expanded in t around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
distribute-rgt-inN/A
associate-*l*N/A
unpow2N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6499.5
Simplified99.5%
(FPCore (t) :precision binary64 (if (<= (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 0.001) (- 0.8333333333333334 (/ 0.2222222222222222 t)) (fma t t 0.5)))
double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 0.001) {
tmp = 0.8333333333333334 - (0.2222222222222222 / t);
} else {
tmp = fma(t, t, 0.5);
}
return tmp;
}
function code(t) tmp = 0.0 if (Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) <= 0.001) tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t)); else tmp = fma(t, t, 0.5); end return tmp end
code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.001], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], N[(t * t + 0.5), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\frac{2}{t}}{1 + \frac{1}{t}} \leq 0.001:\\
\;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t, t, 0.5\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1e-3Initial program 100.0%
Taylor expanded in t around inf
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6499.6
Simplified99.6%
Taylor expanded in t around inf
--lowering--.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6499.6
Simplified99.6%
if 1e-3 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
Taylor expanded in t around 0
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
(FPCore (t) :precision binary64 (if (<= (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 0.001) 0.8333333333333334 (fma t t 0.5)))
double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 0.001) {
tmp = 0.8333333333333334;
} else {
tmp = fma(t, t, 0.5);
}
return tmp;
}
function code(t) tmp = 0.0 if (Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) <= 0.001) tmp = 0.8333333333333334; else tmp = fma(t, t, 0.5); end return tmp end
code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.001], 0.8333333333333334, N[(t * t + 0.5), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\frac{2}{t}}{1 + \frac{1}{t}} \leq 0.001:\\
\;\;\;\;0.8333333333333334\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t, t, 0.5\right)\\
\end{array}
\end{array}
if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1e-3Initial program 100.0%
Taylor expanded in t around inf
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6499.6
Simplified99.6%
Taylor expanded in t around inf
Simplified98.7%
if 1e-3 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) Initial program 100.0%
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr100.0%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
Taylor expanded in t around 0
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f6499.5
Simplified99.5%
(FPCore (t) :precision binary64 (if (<= (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 1.0) 0.8333333333333334 0.5))
double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 1.0) {
tmp = 0.8333333333333334;
} else {
tmp = 0.5;
}
return tmp;
}
real(8) function code(t)
real(8), intent (in) :: t
real(8) :: tmp
if (((2.0d0 / t) / (1.0d0 + (1.0d0 / t))) <= 1.0d0) then
tmp = 0.8333333333333334d0
else
tmp = 0.5d0
end if
code = tmp
end function
public static double code(double t) {
double tmp;
if (((2.0 / t) / (1.0 + (1.0 / t))) <= 1.0) {
tmp = 0.8333333333333334;
} else {
tmp = 0.5;
}
return tmp;
}
def code(t): tmp = 0 if ((2.0 / t) / (1.0 + (1.0 / t))) <= 1.0: tmp = 0.8333333333333334 else: tmp = 0.5 return tmp
function code(t) tmp = 0.0 if (Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) <= 1.0) tmp = 0.8333333333333334; else tmp = 0.5; end return tmp end
function tmp_2 = code(t) tmp = 0.0; if (((2.0 / t) / (1.0 + (1.0 / t))) <= 1.0) tmp = 0.8333333333333334; else tmp = 0.5; end tmp_2 = tmp; end
code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], 0.8333333333333334, 0.5]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{\frac{2}{t}}{1 + \frac{1}{t}} \leq 1:\\
\;\;\;\;0.8333333333333334\\
\mathbf{else}:\\
\;\;\;\;0.5\\
\end{array}
\end{array}
if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1Initial program 100.0%
Taylor expanded in t around inf
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6499.6
Simplified99.6%
Taylor expanded in t around inf
Simplified98.7%
if 1 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) Initial program 100.0%
Taylor expanded in t around 0
Simplified99.3%
Taylor expanded in t around 0
Simplified99.3%
(FPCore (t) :precision binary64 0.5)
double code(double t) {
return 0.5;
}
real(8) function code(t)
real(8), intent (in) :: t
code = 0.5d0
end function
public static double code(double t) {
return 0.5;
}
def code(t): return 0.5
function code(t) return 0.5 end
function tmp = code(t) tmp = 0.5; end
code[t_] := 0.5
\begin{array}{l}
\\
0.5
\end{array}
Initial program 100.0%
Taylor expanded in t around 0
Simplified62.3%
Taylor expanded in t around 0
Simplified63.2%
herbie shell --seed 2024199
(FPCore (t)
:name "Kahan p13 Example 2"
:precision binary64
(/ (+ 1.0 (* (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))) (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))))) (+ 2.0 (* (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))) (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))))))))