
(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.8%
Final simplification99.8%
(FPCore (e v) :precision binary64 (/ e (/ (+ 1.0 (* e (cos v))) (sin v))))
double code(double e, double v) {
return e / ((1.0 + (e * cos(v))) / sin(v));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = e / ((1.0d0 + (e * cos(v))) / sin(v))
end function
public static double code(double e, double v) {
return e / ((1.0 + (e * Math.cos(v))) / Math.sin(v));
}
def code(e, v): return e / ((1.0 + (e * math.cos(v))) / math.sin(v))
function code(e, v) return Float64(e / Float64(Float64(1.0 + Float64(e * cos(v))) / sin(v))) end
function tmp = code(e, v) tmp = e / ((1.0 + (e * cos(v))) / sin(v)); end
code[e_, v_] := N[(e / N[(N[(1.0 + N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sin[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}
\end{array}
Initial program 99.8%
associate-/l*99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (e v) :precision binary64 (/ (sin v) (/ (+ e 1.0) e)))
double code(double e, double v) {
return sin(v) / ((e + 1.0) / e);
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = sin(v) / ((e + 1.0d0) / e)
end function
public static double code(double e, double v) {
return Math.sin(v) / ((e + 1.0) / e);
}
def code(e, v): return math.sin(v) / ((e + 1.0) / e)
function code(e, v) return Float64(sin(v) / Float64(Float64(e + 1.0) / e)) end
function tmp = code(e, v) tmp = sin(v) / ((e + 1.0) / e); end
code[e_, v_] := N[(N[Sin[v], $MachinePrecision] / N[(N[(e + 1.0), $MachinePrecision] / e), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sin v}{\frac{e + 1}{e}}
\end{array}
Initial program 99.8%
Taylor expanded in v around 0 99.1%
Taylor expanded in v around inf 99.1%
associate-/l*98.8%
+-commutative98.8%
Simplified98.8%
Final simplification98.8%
(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.8%
Taylor expanded in v around 0 99.1%
Final simplification99.1%
(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.6%
Simplified99.6%
Taylor expanded in e around 0 97.7%
Final simplification97.7%
(FPCore (e v) :precision binary64 (/ e (+ 1.0 (/ (+ e 1.0) v))))
double code(double e, double v) {
return e / (1.0 + ((e + 1.0) / v));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = e / (1.0d0 + ((e + 1.0d0) / v))
end function
public static double code(double e, double v) {
return e / (1.0 + ((e + 1.0) / v));
}
def code(e, v): return e / (1.0 + ((e + 1.0) / v))
function code(e, v) return Float64(e / Float64(1.0 + Float64(Float64(e + 1.0) / v))) end
function tmp = code(e, v) tmp = e / (1.0 + ((e + 1.0) / v)); end
code[e_, v_] := N[(e / N[(1.0 + N[(N[(e + 1.0), $MachinePrecision] / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e}{1 + \frac{e + 1}{v}}
\end{array}
Initial program 99.8%
associate-/l*99.6%
Simplified99.6%
expm1-log1p-u53.0%
+-commutative53.0%
fma-def53.0%
Applied egg-rr53.0%
expm1-udef52.9%
log1p-expm1-u52.9%
log1p-udef52.9%
add-exp-log52.9%
expm1-log1p-u99.5%
Applied egg-rr99.5%
associate--l+99.5%
Simplified99.5%
Taylor expanded in v around 0 56.2%
Final simplification56.2%
(FPCore (e v) :precision binary64 (* e (- v (* e v))))
double code(double e, double v) {
return e * (v - (e * v));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = e * (v - (e * v))
end function
public static double code(double e, double v) {
return e * (v - (e * v));
}
def code(e, v): return e * (v - (e * v))
function code(e, v) return Float64(e * Float64(v - Float64(e * v))) end
function tmp = code(e, v) tmp = e * (v - (e * v)); end
code[e_, v_] := N[(e * N[(v - N[(e * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \left(v - e \cdot v\right)
\end{array}
Initial program 99.8%
associate-/l*99.6%
Simplified99.6%
Taylor expanded in v around 0 52.7%
associate-/l*52.6%
associate-/r/52.7%
+-commutative52.7%
Simplified52.7%
Taylor expanded in e around 0 51.9%
mul-1-neg51.9%
unsub-neg51.9%
Simplified51.9%
Final simplification51.9%
(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.6%
Simplified99.6%
Taylor expanded in v around 0 52.7%
associate-/l*52.6%
associate-/r/52.7%
+-commutative52.7%
Simplified52.7%
Final simplification52.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.8%
associate-/l*99.6%
Simplified99.6%
expm1-log1p-u53.0%
+-commutative53.0%
fma-def53.0%
Applied egg-rr53.0%
expm1-udef52.9%
log1p-expm1-u52.9%
log1p-udef52.9%
add-exp-log52.9%
expm1-log1p-u99.5%
Applied egg-rr99.5%
associate--l+99.5%
Simplified99.5%
Taylor expanded in v around 0 52.7%
Final simplification52.7%
(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.6%
Simplified99.6%
Taylor expanded in v around 0 52.7%
associate-/l*52.6%
associate-/r/52.7%
+-commutative52.7%
Simplified52.7%
Taylor expanded in e around 0 51.3%
Final simplification51.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.8%
associate-/l*99.6%
Simplified99.6%
Taylor expanded in v around 0 54.0%
Taylor expanded in e around inf 5.7%
*-commutative5.7%
Simplified5.7%
Taylor expanded in v around 0 4.3%
Final simplification4.3%
herbie shell --seed 2023240
(FPCore (e v)
:name "Trigonometry A"
:precision binary64
:pre (and (<= 0.0 e) (<= e 1.0))
(/ (* e (sin v)) (+ 1.0 (* e (cos v)))))