
(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 (/ (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.8%
*-commutative99.8%
cos-neg99.8%
associate-/l*99.6%
+-commutative99.6%
cos-neg99.6%
metadata-eval99.6%
sub-neg99.6%
div-sub99.6%
*-commutative99.6%
associate-/l*99.6%
*-inverses99.6%
/-rgt-identity99.6%
metadata-eval99.6%
associate-/r*99.6%
neg-mul-199.6%
unsub-neg99.6%
neg-mul-199.6%
associate-/r*99.6%
metadata-eval99.6%
distribute-neg-frac99.6%
metadata-eval99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (e v) :precision binary64 (/ e (/ (+ e 1.0) (sin v))))
double code(double e, double v) {
return e / ((e + 1.0) / sin(v));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = e / ((e + 1.0d0) / sin(v))
end function
public static double code(double e, double v) {
return e / ((e + 1.0) / Math.sin(v));
}
def code(e, v): return e / ((e + 1.0) / math.sin(v))
function code(e, v) return Float64(e / Float64(Float64(e + 1.0) / sin(v))) end
function tmp = code(e, v) tmp = e / ((e + 1.0) / sin(v)); end
code[e_, v_] := N[(e / N[(N[(e + 1.0), $MachinePrecision] / N[Sin[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e}{\frac{e + 1}{\sin v}}
\end{array}
Initial program 99.8%
Taylor expanded in v around 0 98.3%
expm1-log1p-u98.3%
expm1-udef31.4%
*-commutative31.4%
*-un-lft-identity31.4%
times-frac31.4%
/-rgt-identity31.4%
+-commutative31.4%
Applied egg-rr31.4%
expm1-def98.2%
expm1-log1p98.2%
*-commutative98.2%
associate-/r/98.0%
Simplified98.0%
Final simplification98.0%
(FPCore (e v) :precision binary64 (/ (sin v) (+ 1.0 (/ 1.0 e))))
double code(double e, double v) {
return sin(v) / (1.0 + (1.0 / e));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = sin(v) / (1.0d0 + (1.0d0 / e))
end function
public static double code(double e, double v) {
return Math.sin(v) / (1.0 + (1.0 / e));
}
def code(e, v): return math.sin(v) / (1.0 + (1.0 / e))
function code(e, v) return Float64(sin(v) / Float64(1.0 + Float64(1.0 / e))) end
function tmp = code(e, v) tmp = sin(v) / (1.0 + (1.0 / e)); end
code[e_, v_] := N[(N[Sin[v], $MachinePrecision] / N[(1.0 + N[(1.0 / e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sin v}{1 + \frac{1}{e}}
\end{array}
Initial program 99.8%
*-commutative99.8%
cos-neg99.8%
associate-/l*99.6%
+-commutative99.6%
cos-neg99.6%
metadata-eval99.6%
sub-neg99.6%
div-sub99.6%
*-commutative99.6%
associate-/l*99.6%
*-inverses99.6%
/-rgt-identity99.6%
metadata-eval99.6%
associate-/r*99.6%
neg-mul-199.6%
unsub-neg99.6%
neg-mul-199.6%
associate-/r*99.6%
metadata-eval99.6%
distribute-neg-frac99.6%
metadata-eval99.6%
Simplified99.6%
Taylor expanded in v around 0 98.1%
Final simplification98.1%
(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 98.3%
Final simplification98.3%
(FPCore (e v) :precision binary64 (if (<= v 1.5e-25) (/ (* e v) (+ e 1.0)) (* e (sin v))))
double code(double e, double v) {
double tmp;
if (v <= 1.5e-25) {
tmp = (e * v) / (e + 1.0);
} else {
tmp = e * sin(v);
}
return tmp;
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
real(8) :: tmp
if (v <= 1.5d-25) then
tmp = (e * v) / (e + 1.0d0)
else
tmp = e * sin(v)
end if
code = tmp
end function
public static double code(double e, double v) {
double tmp;
if (v <= 1.5e-25) {
tmp = (e * v) / (e + 1.0);
} else {
tmp = e * Math.sin(v);
}
return tmp;
}
def code(e, v): tmp = 0 if v <= 1.5e-25: tmp = (e * v) / (e + 1.0) else: tmp = e * math.sin(v) return tmp
function code(e, v) tmp = 0.0 if (v <= 1.5e-25) tmp = Float64(Float64(e * v) / Float64(e + 1.0)); else tmp = Float64(e * sin(v)); end return tmp end
function tmp_2 = code(e, v) tmp = 0.0; if (v <= 1.5e-25) tmp = (e * v) / (e + 1.0); else tmp = e * sin(v); end tmp_2 = tmp; end
code[e_, v_] := If[LessEqual[v, 1.5e-25], N[(N[(e * v), $MachinePrecision] / N[(e + 1.0), $MachinePrecision]), $MachinePrecision], N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;v \leq 1.5 \cdot 10^{-25}:\\
\;\;\;\;\frac{e \cdot v}{e + 1}\\
\mathbf{else}:\\
\;\;\;\;e \cdot \sin v\\
\end{array}
\end{array}
if v < 1.4999999999999999e-25Initial program 99.9%
Taylor expanded in v around 0 99.0%
Taylor expanded in v around 0 67.6%
if 1.4999999999999999e-25 < v Initial program 99.5%
*-commutative99.5%
cos-neg99.5%
associate-/l*99.5%
+-commutative99.5%
cos-neg99.5%
metadata-eval99.5%
sub-neg99.5%
div-sub99.4%
*-commutative99.4%
associate-/l*99.4%
*-inverses99.4%
/-rgt-identity99.4%
metadata-eval99.4%
associate-/r*99.4%
neg-mul-199.4%
unsub-neg99.4%
neg-mul-199.4%
associate-/r*99.4%
metadata-eval99.4%
distribute-neg-frac99.4%
metadata-eval99.4%
Simplified99.4%
Taylor expanded in e around 0 96.0%
Final simplification75.0%
(FPCore (e v) :precision binary64 (/ e (/ (+ e 1.0) v)))
double code(double e, double v) {
return e / ((e + 1.0) / v);
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = e / ((e + 1.0d0) / v)
end function
public static double code(double e, double v) {
return e / ((e + 1.0) / v);
}
def code(e, v): return e / ((e + 1.0) / v)
function code(e, v) return Float64(e / Float64(Float64(e + 1.0) / v)) end
function tmp = code(e, v) tmp = e / ((e + 1.0) / v); end
code[e_, v_] := N[(e / N[(N[(e + 1.0), $MachinePrecision] / v), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e}{\frac{e + 1}{v}}
\end{array}
Initial program 99.8%
div-inv99.8%
*-commutative99.8%
associate-*l*99.8%
+-commutative99.8%
fma-def99.8%
Applied egg-rr99.8%
Taylor expanded in v around 0 51.5%
associate-/l*51.4%
+-commutative51.4%
Simplified51.4%
Final simplification51.4%
(FPCore (e v) :precision binary64 (/ v (+ 1.0 (/ 1.0 e))))
double code(double e, double v) {
return v / (1.0 + (1.0 / e));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = v / (1.0d0 + (1.0d0 / e))
end function
public static double code(double e, double v) {
return v / (1.0 + (1.0 / e));
}
def code(e, v): return v / (1.0 + (1.0 / e))
function code(e, v) return Float64(v / Float64(1.0 + Float64(1.0 / e))) end
function tmp = code(e, v) tmp = v / (1.0 + (1.0 / e)); end
code[e_, v_] := N[(v / N[(1.0 + N[(1.0 / e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{v}{1 + \frac{1}{e}}
\end{array}
Initial program 99.8%
*-commutative99.8%
cos-neg99.8%
associate-/l*99.6%
+-commutative99.6%
cos-neg99.6%
metadata-eval99.6%
sub-neg99.6%
div-sub99.6%
*-commutative99.6%
associate-/l*99.6%
*-inverses99.6%
/-rgt-identity99.6%
metadata-eval99.6%
associate-/r*99.6%
neg-mul-199.6%
unsub-neg99.6%
neg-mul-199.6%
associate-/r*99.6%
metadata-eval99.6%
distribute-neg-frac99.6%
metadata-eval99.6%
Simplified99.6%
Taylor expanded in v around 0 51.5%
Final simplification51.5%
(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%
Taylor expanded in v around 0 98.3%
Taylor expanded in v around 0 51.5%
Final simplification51.5%
(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%
*-commutative99.8%
cos-neg99.8%
associate-/l*99.6%
+-commutative99.6%
cos-neg99.6%
metadata-eval99.6%
sub-neg99.6%
div-sub99.6%
*-commutative99.6%
associate-/l*99.6%
*-inverses99.6%
/-rgt-identity99.6%
metadata-eval99.6%
associate-/r*99.6%
neg-mul-199.6%
unsub-neg99.6%
neg-mul-199.6%
associate-/r*99.6%
metadata-eval99.6%
distribute-neg-frac99.6%
metadata-eval99.6%
Simplified99.6%
Taylor expanded in v around 0 51.5%
Taylor expanded in e around 0 49.9%
Final simplification49.9%
(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%
*-commutative99.8%
cos-neg99.8%
associate-/l*99.6%
+-commutative99.6%
cos-neg99.6%
metadata-eval99.6%
sub-neg99.6%
div-sub99.6%
*-commutative99.6%
associate-/l*99.6%
*-inverses99.6%
/-rgt-identity99.6%
metadata-eval99.6%
associate-/r*99.6%
neg-mul-199.6%
unsub-neg99.6%
neg-mul-199.6%
associate-/r*99.6%
metadata-eval99.6%
distribute-neg-frac99.6%
metadata-eval99.6%
Simplified99.6%
Taylor expanded in v around 0 51.5%
Taylor expanded in e around inf 4.7%
Final simplification4.7%
herbie shell --seed 2023331
(FPCore (e v)
:name "Trigonometry A"
:precision binary64
:pre (and (<= 0.0 e) (<= e 1.0))
(/ (* e (sin v)) (+ 1.0 (* e (cos v)))))