
(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 7 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(e * Float64(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[(e * N[(N[Sin[v], $MachinePrecision] / N[(1.0 + N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \frac{\sin v}{1 + e \cdot \cos v}
\end{array}
Initial program 99.8%
associate-/l*99.8%
remove-double-neg99.8%
cos-neg99.8%
distribute-frac-neg99.8%
sin-neg99.8%
distribute-neg-frac99.8%
sin-neg99.8%
remove-double-neg99.8%
+-commutative99.8%
cos-neg99.8%
fma-define99.8%
Simplified99.8%
Taylor expanded in v around inf 99.8%
Final simplification99.8%
(FPCore (e v) :precision binary64 (* (sin v) (/ e (+ e 1.0))))
double code(double e, double v) {
return sin(v) * (e / (e + 1.0));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = sin(v) * (e / (e + 1.0d0))
end function
public static double code(double e, double v) {
return Math.sin(v) * (e / (e + 1.0));
}
def code(e, v): return math.sin(v) * (e / (e + 1.0))
function code(e, v) return Float64(sin(v) * Float64(e / Float64(e + 1.0))) end
function tmp = code(e, v) tmp = sin(v) * (e / (e + 1.0)); end
code[e_, v_] := N[(N[Sin[v], $MachinePrecision] * N[(e / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sin v \cdot \frac{e}{e + 1}
\end{array}
Initial program 99.8%
Taylor expanded in v around 0 98.9%
associate-/l*98.9%
+-commutative98.9%
Applied egg-rr98.9%
*-commutative98.9%
associate-*l/98.9%
associate-*r/98.9%
Simplified98.9%
Final simplification98.9%
(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.8%
associate-/l*99.8%
remove-double-neg99.8%
cos-neg99.8%
distribute-frac-neg99.8%
sin-neg99.8%
distribute-neg-frac99.8%
sin-neg99.8%
remove-double-neg99.8%
+-commutative99.8%
cos-neg99.8%
fma-define99.8%
Simplified99.8%
Taylor expanded in e around 0 97.8%
Final simplification97.8%
(FPCore (e v) :precision binary64 (* e (* v (- 1.0 e))))
double code(double e, double v) {
return e * (v * (1.0 - e));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = e * (v * (1.0d0 - e))
end function
public static double code(double e, double v) {
return e * (v * (1.0 - e));
}
def code(e, v): return e * (v * (1.0 - e))
function code(e, v) return Float64(e * Float64(v * Float64(1.0 - e))) end
function tmp = code(e, v) tmp = e * (v * (1.0 - e)); end
code[e_, v_] := N[(e * N[(v * N[(1.0 - e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \left(v \cdot \left(1 - e\right)\right)
\end{array}
Initial program 99.8%
associate-/l*99.8%
remove-double-neg99.8%
cos-neg99.8%
distribute-frac-neg99.8%
sin-neg99.8%
distribute-neg-frac99.8%
sin-neg99.8%
remove-double-neg99.8%
+-commutative99.8%
cos-neg99.8%
fma-define99.8%
Simplified99.8%
Taylor expanded in v around 0 52.6%
associate-/l*52.6%
+-commutative52.6%
Simplified52.6%
Taylor expanded in e around 0 52.0%
*-lft-identity52.0%
neg-mul-152.0%
distribute-lft-neg-in52.0%
distribute-rgt-in52.0%
sub-neg52.0%
Simplified52.0%
Final simplification52.0%
(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(e * Float64(v / Float64(e + 1.0))) end
function tmp = code(e, v) tmp = e * (v / (e + 1.0)); end
code[e_, v_] := N[(e * N[(v / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \frac{v}{e + 1}
\end{array}
Initial program 99.8%
associate-/l*99.8%
remove-double-neg99.8%
cos-neg99.8%
distribute-frac-neg99.8%
sin-neg99.8%
distribute-neg-frac99.8%
sin-neg99.8%
remove-double-neg99.8%
+-commutative99.8%
cos-neg99.8%
fma-define99.8%
Simplified99.8%
Taylor expanded in v around 0 52.6%
associate-/l*52.6%
+-commutative52.6%
Simplified52.6%
Final simplification52.6%
(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.8%
associate-/l*99.8%
remove-double-neg99.8%
cos-neg99.8%
distribute-frac-neg99.8%
sin-neg99.8%
distribute-neg-frac99.8%
sin-neg99.8%
remove-double-neg99.8%
+-commutative99.8%
cos-neg99.8%
fma-define99.8%
Simplified99.8%
Taylor expanded in v around 0 52.6%
associate-/l*52.6%
+-commutative52.6%
Simplified52.6%
Taylor expanded in e around 0 51.5%
Final simplification51.5%
(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.8%
associate-/l*99.8%
remove-double-neg99.8%
cos-neg99.8%
distribute-frac-neg99.8%
sin-neg99.8%
distribute-neg-frac99.8%
sin-neg99.8%
remove-double-neg99.8%
+-commutative99.8%
cos-neg99.8%
fma-define99.8%
Simplified99.8%
Taylor expanded in v around 0 52.6%
associate-/l*52.6%
+-commutative52.6%
Simplified52.6%
Taylor expanded in e around inf 4.7%
Final simplification4.7%
herbie shell --seed 2024067
(FPCore (e v)
:name "Trigonometry A"
:precision binary64
:pre (and (<= 0.0 e) (<= e 1.0))
(/ (* e (sin v)) (+ 1.0 (* e (cos v)))))