
(FPCore (e v) :precision binary64 (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))
double code(double e, double v) {
return (e * sin(v)) / (1.0 + (e * cos(v)));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = (e * sin(v)) / (1.0d0 + (e * cos(v)))
end function
public static double code(double e, double v) {
return (e * Math.sin(v)) / (1.0 + (e * Math.cos(v)));
}
def code(e, v): return (e * math.sin(v)) / (1.0 + (e * math.cos(v)))
function code(e, v) return Float64(Float64(e * sin(v)) / Float64(1.0 + Float64(e * cos(v)))) end
function tmp = code(e, v) tmp = (e * sin(v)) / (1.0 + (e * cos(v))); end
code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e \cdot \sin v}{1 + e \cdot \cos v}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (e v) :precision binary64 (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))
double code(double e, double v) {
return (e * sin(v)) / (1.0 + (e * cos(v)));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = (e * sin(v)) / (1.0d0 + (e * cos(v)))
end function
public static double code(double e, double v) {
return (e * Math.sin(v)) / (1.0 + (e * Math.cos(v)));
}
def code(e, v): return (e * math.sin(v)) / (1.0 + (e * math.cos(v)))
function code(e, v) return Float64(Float64(e * sin(v)) / Float64(1.0 + Float64(e * cos(v)))) end
function tmp = code(e, v) tmp = (e * sin(v)) / (1.0 + (e * cos(v))); end
code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e \cdot \sin v}{1 + e \cdot \cos v}
\end{array}
(FPCore (e v) :precision binary64 (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))
double code(double e, double v) {
return (e * sin(v)) / (1.0 + (e * cos(v)));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = (e * sin(v)) / (1.0d0 + (e * cos(v)))
end function
public static double code(double e, double v) {
return (e * Math.sin(v)) / (1.0 + (e * Math.cos(v)));
}
def code(e, v): return (e * math.sin(v)) / (1.0 + (e * math.cos(v)))
function code(e, v) return Float64(Float64(e * sin(v)) / Float64(1.0 + Float64(e * cos(v)))) end
function tmp = code(e, v) tmp = (e * sin(v)) / (1.0 + (e * cos(v))); end
code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e \cdot \sin v}{1 + e \cdot \cos v}
\end{array}
Initial program 99.9%
Final simplification99.9%
(FPCore (e v) :precision binary64 (/ (sin v) (+ (cos v) (/ 1.0 e))))
double code(double e, double v) {
return sin(v) / (cos(v) + (1.0 / e));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = sin(v) / (cos(v) + (1.0d0 / e))
end function
public static double code(double e, double v) {
return Math.sin(v) / (Math.cos(v) + (1.0 / e));
}
def code(e, v): return math.sin(v) / (math.cos(v) + (1.0 / e))
function code(e, v) return Float64(sin(v) / Float64(cos(v) + Float64(1.0 / e))) end
function tmp = code(e, v) tmp = sin(v) / (cos(v) + (1.0 / e)); end
code[e_, v_] := N[(N[Sin[v], $MachinePrecision] / N[(N[Cos[v], $MachinePrecision] + N[(1.0 / e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sin v}{\cos v + \frac{1}{e}}
\end{array}
Initial program 99.9%
*-commutative99.9%
associate-/l*99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in e around 0 99.6%
Final simplification99.6%
(FPCore (e v) :precision binary64 (* (/ (* e (sin v)) (- 1.0 (* e e))) (- 1.0 e)))
double code(double e, double v) {
return ((e * sin(v)) / (1.0 - (e * e))) * (1.0 - e);
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = ((e * sin(v)) / (1.0d0 - (e * e))) * (1.0d0 - e)
end function
public static double code(double e, double v) {
return ((e * Math.sin(v)) / (1.0 - (e * e))) * (1.0 - e);
}
def code(e, v): return ((e * math.sin(v)) / (1.0 - (e * e))) * (1.0 - e)
function code(e, v) return Float64(Float64(Float64(e * sin(v)) / Float64(1.0 - Float64(e * e))) * Float64(1.0 - e)) end
function tmp = code(e, v) tmp = ((e * sin(v)) / (1.0 - (e * e))) * (1.0 - e); end
code[e_, v_] := N[(N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(1.0 - N[(e * e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - e), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e \cdot \sin v}{1 - e \cdot e} \cdot \left(1 - e\right)
\end{array}
Initial program 99.9%
Taylor expanded in v around 0 99.3%
flip-+99.3%
associate-/r/99.3%
metadata-eval99.3%
Applied egg-rr99.3%
Final simplification99.3%
(FPCore (e v) :precision binary64 (* (sin v) (- e (* e e))))
double code(double e, double v) {
return sin(v) * (e - (e * e));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = sin(v) * (e - (e * e))
end function
public static double code(double e, double v) {
return Math.sin(v) * (e - (e * e));
}
def code(e, v): return math.sin(v) * (e - (e * e))
function code(e, v) return Float64(sin(v) * Float64(e - Float64(e * e))) end
function tmp = code(e, v) tmp = sin(v) * (e - (e * e)); end
code[e_, v_] := N[(N[Sin[v], $MachinePrecision] * N[(e - N[(e * e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sin v \cdot \left(e - e \cdot e\right)
\end{array}
Initial program 99.9%
*-commutative99.9%
associate-/l*99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in e around 0 99.4%
+-commutative99.4%
fma-def99.4%
mul-1-neg99.4%
fma-neg99.4%
associate-*r*99.4%
*-commutative99.4%
unpow299.4%
Simplified99.4%
*-commutative99.4%
distribute-lft-out--99.4%
*-commutative99.4%
Applied egg-rr99.4%
Taylor expanded in v around 0 99.2%
unpow299.2%
Simplified99.2%
Final simplification99.2%
(FPCore (e v) :precision binary64 (/ (* e (sin v)) (+ e 1.0)))
double code(double e, double v) {
return (e * sin(v)) / (e + 1.0);
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = (e * sin(v)) / (e + 1.0d0)
end function
public static double code(double e, double v) {
return (e * Math.sin(v)) / (e + 1.0);
}
def code(e, v): return (e * math.sin(v)) / (e + 1.0)
function code(e, v) return Float64(Float64(e * sin(v)) / Float64(e + 1.0)) end
function tmp = code(e, v) tmp = (e * sin(v)) / (e + 1.0); end
code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e \cdot \sin v}{e + 1}
\end{array}
Initial program 99.9%
Taylor expanded in v around 0 99.3%
Final simplification99.3%
(FPCore (e v) :precision binary64 (* e (sin v)))
double code(double e, double v) {
return e * sin(v);
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = e * sin(v)
end function
public static double code(double e, double v) {
return e * Math.sin(v);
}
def code(e, v): return e * math.sin(v)
function code(e, v) return Float64(e * sin(v)) end
function tmp = code(e, v) tmp = e * sin(v); end
code[e_, v_] := N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \sin v
\end{array}
Initial program 99.9%
*-commutative99.9%
associate-/l*99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in e around 0 98.7%
Final simplification98.7%
(FPCore (e v) :precision binary64 (/ 1.0 (+ (* 0.16666666666666666 (/ (* v (+ e 1.0)) e)) (+ (/ 1.0 v) (/ 1.0 (* e v))))))
double code(double e, double v) {
return 1.0 / ((0.16666666666666666 * ((v * (e + 1.0)) / e)) + ((1.0 / v) + (1.0 / (e * v))));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = 1.0d0 / ((0.16666666666666666d0 * ((v * (e + 1.0d0)) / e)) + ((1.0d0 / v) + (1.0d0 / (e * v))))
end function
public static double code(double e, double v) {
return 1.0 / ((0.16666666666666666 * ((v * (e + 1.0)) / e)) + ((1.0 / v) + (1.0 / (e * v))));
}
def code(e, v): return 1.0 / ((0.16666666666666666 * ((v * (e + 1.0)) / e)) + ((1.0 / v) + (1.0 / (e * v))))
function code(e, v) return Float64(1.0 / Float64(Float64(0.16666666666666666 * Float64(Float64(v * Float64(e + 1.0)) / e)) + Float64(Float64(1.0 / v) + Float64(1.0 / Float64(e * v))))) end
function tmp = code(e, v) tmp = 1.0 / ((0.16666666666666666 * ((v * (e + 1.0)) / e)) + ((1.0 / v) + (1.0 / (e * v)))); end
code[e_, v_] := N[(1.0 / N[(N[(0.16666666666666666 * N[(N[(v * N[(e + 1.0), $MachinePrecision]), $MachinePrecision] / e), $MachinePrecision]), $MachinePrecision] + N[(N[(1.0 / v), $MachinePrecision] + N[(1.0 / N[(e * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{0.16666666666666666 \cdot \frac{v \cdot \left(e + 1\right)}{e} + \left(\frac{1}{v} + \frac{1}{e \cdot v}\right)}
\end{array}
Initial program 99.9%
Taylor expanded in v around 0 99.3%
clear-num98.6%
inv-pow98.6%
associate-/r*98.3%
+-commutative98.3%
Applied egg-rr98.3%
unpow-198.3%
Simplified98.3%
Taylor expanded in v around 0 54.4%
Final simplification54.4%
(FPCore (e v) :precision binary64 (* v (- e (* e e))))
double code(double e, double v) {
return v * (e - (e * e));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = v * (e - (e * e))
end function
public static double code(double e, double v) {
return v * (e - (e * e));
}
def code(e, v): return v * (e - (e * e))
function code(e, v) return Float64(v * Float64(e - Float64(e * e))) end
function tmp = code(e, v) tmp = v * (e - (e * e)); end
code[e_, v_] := N[(v * N[(e - N[(e * e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
v \cdot \left(e - e \cdot e\right)
\end{array}
Initial program 99.9%
*-commutative99.9%
associate-/l*99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in v around 0 53.8%
associate-/l*53.7%
+-commutative53.7%
Simplified53.7%
Taylor expanded in e around 0 53.7%
associate-*r*53.7%
neg-mul-153.7%
distribute-rgt-out53.7%
+-commutative53.7%
sub-neg53.7%
unpow253.7%
Simplified53.7%
Final simplification53.7%
(FPCore (e v) :precision binary64 (/ (* e v) (+ e 1.0)))
double code(double e, double v) {
return (e * v) / (e + 1.0);
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = (e * v) / (e + 1.0d0)
end function
public static double code(double e, double v) {
return (e * v) / (e + 1.0);
}
def code(e, v): return (e * v) / (e + 1.0)
function code(e, v) return Float64(Float64(e * v) / Float64(e + 1.0)) end
function tmp = code(e, v) tmp = (e * v) / (e + 1.0); end
code[e_, v_] := N[(N[(e * v), $MachinePrecision] / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e \cdot v}{e + 1}
\end{array}
Initial program 99.9%
*-commutative99.9%
associate-/l*99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in v around 0 53.8%
Final simplification53.8%
(FPCore (e v) :precision binary64 (* e v))
double code(double e, double v) {
return e * v;
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = e * v
end function
public static double code(double e, double v) {
return e * v;
}
def code(e, v): return e * v
function code(e, v) return Float64(e * v) end
function tmp = code(e, v) tmp = e * v; end
code[e_, v_] := N[(e * v), $MachinePrecision]
\begin{array}{l}
\\
e \cdot v
\end{array}
Initial program 99.9%
*-commutative99.9%
associate-/l*99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in v around 0 53.8%
associate-/l*53.7%
+-commutative53.7%
Simplified53.7%
Taylor expanded in e around 0 53.3%
*-commutative53.3%
Simplified53.3%
Final simplification53.3%
(FPCore (e v) :precision binary64 v)
double code(double e, double v) {
return v;
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = v
end function
public static double code(double e, double v) {
return v;
}
def code(e, v): return v
function code(e, v) return v end
function tmp = code(e, v) tmp = v; end
code[e_, v_] := v
\begin{array}{l}
\\
v
\end{array}
Initial program 99.9%
*-commutative99.9%
associate-/l*99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
Taylor expanded in v around 0 53.8%
associate-/l*53.7%
+-commutative53.7%
Simplified53.7%
Taylor expanded in e around inf 4.5%
Final simplification4.5%
herbie shell --seed 2023279
(FPCore (e v)
:name "Trigonometry A"
:precision binary64
:pre (and (<= 0.0 e) (<= e 1.0))
(/ (* e (sin v)) (+ 1.0 (* e (cos v)))))