
(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 12 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) (fma e (cos v) 1.0))))
double code(double e, double v) {
return e * (sin(v) / fma(e, cos(v), 1.0));
}
function code(e, v) return Float64(e * Float64(sin(v) / fma(e, cos(v), 1.0))) end
code[e_, v_] := N[(e * N[(N[Sin[v], $MachinePrecision] / N[(e * N[Cos[v], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \frac{\sin v}{\mathsf{fma}\left(e, \cos v, 1\right)}
\end{array}
Initial program 99.8%
lift-sin.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-+.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.8
Applied egg-rr99.8%
Final simplification99.8%
(FPCore (e v) :precision binary64 (* (sin v) (* e (- 1.0 (* e (cos v))))))
double code(double e, double v) {
return sin(v) * (e * (1.0 - (e * cos(v))));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = sin(v) * (e * (1.0d0 - (e * cos(v))))
end function
public static double code(double e, double v) {
return Math.sin(v) * (e * (1.0 - (e * Math.cos(v))));
}
def code(e, v): return math.sin(v) * (e * (1.0 - (e * math.cos(v))))
function code(e, v) return Float64(sin(v) * Float64(e * Float64(1.0 - Float64(e * cos(v))))) end
function tmp = code(e, v) tmp = sin(v) * (e * (1.0 - (e * cos(v)))); end
code[e_, v_] := N[(N[Sin[v], $MachinePrecision] * N[(e * N[(1.0 - N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sin v \cdot \left(e \cdot \left(1 - e \cdot \cos v\right)\right)
\end{array}
Initial program 99.8%
lift-sin.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-+.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.8
Applied egg-rr99.8%
Taylor expanded in e around 0
*-lft-identityN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-inN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-*.f64N/A
lower-cos.f6498.9
Simplified98.9%
(FPCore (e v) :precision binary64 (* e (* (sin v) (fma (cos v) (- e) 1.0))))
double code(double e, double v) {
return e * (sin(v) * fma(cos(v), -e, 1.0));
}
function code(e, v) return Float64(e * Float64(sin(v) * fma(cos(v), Float64(-e), 1.0))) end
code[e_, v_] := N[(e * N[(N[Sin[v], $MachinePrecision] * N[(N[Cos[v], $MachinePrecision] * (-e) + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \left(\sin v \cdot \mathsf{fma}\left(\cos v, -e, 1\right)\right)
\end{array}
Initial program 99.8%
Taylor expanded in e around 0
lower-*.f64N/A
mul-1-negN/A
associate-*r*N/A
distribute-lft-neg-inN/A
distribute-rgt1-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-fma.f64N/A
lower-cos.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-sin.f6498.9
Simplified98.9%
Final simplification98.9%
(FPCore (e v) :precision binary64 (/ (* (sin v) e) (fma e 1.0 1.0)))
double code(double e, double v) {
return (sin(v) * e) / fma(e, 1.0, 1.0);
}
function code(e, v) return Float64(Float64(sin(v) * e) / fma(e, 1.0, 1.0)) end
code[e_, v_] := N[(N[(N[Sin[v], $MachinePrecision] * e), $MachinePrecision] / N[(e * 1.0 + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sin v \cdot e}{\mathsf{fma}\left(e, 1, 1\right)}
\end{array}
Initial program 99.8%
lift-sin.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-+.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.8
Applied egg-rr99.8%
lift-sin.f64N/A
lift-cos.f64N/A
lift-fma.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f6499.8
Applied egg-rr99.8%
Taylor expanded in v around 0
Simplified98.9%
(FPCore (e v) :precision binary64 (* e (/ (sin v) (fma e 1.0 1.0))))
double code(double e, double v) {
return e * (sin(v) / fma(e, 1.0, 1.0));
}
function code(e, v) return Float64(e * Float64(sin(v) / fma(e, 1.0, 1.0))) end
code[e_, v_] := N[(e * N[(N[Sin[v], $MachinePrecision] / N[(e * 1.0 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \frac{\sin v}{\mathsf{fma}\left(e, 1, 1\right)}
\end{array}
Initial program 99.8%
lift-sin.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-+.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.8
Applied egg-rr99.8%
Taylor expanded in v around 0
Simplified98.9%
Final simplification98.9%
(FPCore (e v) :precision binary64 (* e (* (sin v) (fma 1.0 (- e) 1.0))))
double code(double e, double v) {
return e * (sin(v) * fma(1.0, -e, 1.0));
}
function code(e, v) return Float64(e * Float64(sin(v) * fma(1.0, Float64(-e), 1.0))) end
code[e_, v_] := N[(e * N[(N[Sin[v], $MachinePrecision] * N[(1.0 * (-e) + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \left(\sin v \cdot \mathsf{fma}\left(1, -e, 1\right)\right)
\end{array}
Initial program 99.8%
Taylor expanded in e around 0
lower-*.f64N/A
mul-1-negN/A
associate-*r*N/A
distribute-lft-neg-inN/A
distribute-rgt1-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-fma.f64N/A
lower-cos.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-sin.f6498.9
Simplified98.9%
Taylor expanded in v around 0
Simplified98.4%
Final simplification98.4%
(FPCore (e v) :precision binary64 (* (sin v) e))
double code(double e, double v) {
return sin(v) * e;
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = sin(v) * e
end function
public static double code(double e, double v) {
return Math.sin(v) * e;
}
def code(e, v): return math.sin(v) * e
function code(e, v) return Float64(sin(v) * e) end
function tmp = code(e, v) tmp = sin(v) * e; end
code[e_, v_] := N[(N[Sin[v], $MachinePrecision] * e), $MachinePrecision]
\begin{array}{l}
\\
\sin v \cdot e
\end{array}
Initial program 99.8%
Taylor expanded in e around 0
lower-*.f64N/A
lower-sin.f6498.1
Simplified98.1%
Final simplification98.1%
(FPCore (e v) :precision binary64 (* v (/ e (+ e (fma (* v v) (fma e -0.3333333333333333 0.16666666666666666) 1.0)))))
double code(double e, double v) {
return v * (e / (e + fma((v * v), fma(e, -0.3333333333333333, 0.16666666666666666), 1.0)));
}
function code(e, v) return Float64(v * Float64(e / Float64(e + fma(Float64(v * v), fma(e, -0.3333333333333333, 0.16666666666666666), 1.0)))) end
code[e_, v_] := N[(v * N[(e / N[(e + N[(N[(v * v), $MachinePrecision] * N[(e * -0.3333333333333333 + 0.16666666666666666), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
v \cdot \frac{e}{e + \mathsf{fma}\left(v \cdot v, \mathsf{fma}\left(e, -0.3333333333333333, 0.16666666666666666\right), 1\right)}
\end{array}
Initial program 99.8%
lift-sin.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-+.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f6499.6
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.6
Applied egg-rr99.6%
Taylor expanded in v around 0
lower-/.f64N/A
+-commutativeN/A
associate-+l+N/A
lower-+.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
lower-fma.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
*-commutativeN/A
+-commutativeN/A
distribute-lft1-inN/A
lower-fma.f6453.1
Simplified53.1%
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-+.f64N/A
div-invN/A
div-invN/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr53.2%
Final simplification53.2%
(FPCore (e v) :precision binary64 (* e (/ v (fma (* v v) 0.16666666666666666 1.0))))
double code(double e, double v) {
return e * (v / fma((v * v), 0.16666666666666666, 1.0));
}
function code(e, v) return Float64(e * Float64(v / fma(Float64(v * v), 0.16666666666666666, 1.0))) end
code[e_, v_] := N[(e * N[(v / N[(N[(v * v), $MachinePrecision] * 0.16666666666666666 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \frac{v}{\mathsf{fma}\left(v \cdot v, 0.16666666666666666, 1\right)}
\end{array}
Initial program 99.8%
lift-sin.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-+.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f6499.6
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.6
Applied egg-rr99.6%
Taylor expanded in v around 0
lower-/.f64N/A
+-commutativeN/A
associate-+l+N/A
lower-+.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
lower-fma.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
*-commutativeN/A
+-commutativeN/A
distribute-lft1-inN/A
lower-fma.f6453.1
Simplified53.1%
Taylor expanded in e around 0
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6452.4
Simplified52.4%
(FPCore (e v) :precision binary64 (* v (/ e (+ e 1.0))))
double code(double e, double v) {
return v * (e / (e + 1.0));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = v * (e / (e + 1.0d0))
end function
public static double code(double e, double v) {
return v * (e / (e + 1.0));
}
def code(e, v): return v * (e / (e + 1.0))
function code(e, v) return Float64(v * Float64(e / Float64(e + 1.0))) end
function tmp = code(e, v) tmp = v * (e / (e + 1.0)); end
code[e_, v_] := N[(v * N[(e / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
v \cdot \frac{e}{e + 1}
\end{array}
Initial program 99.8%
Taylor expanded in v around 0
*-commutativeN/A
associate-*r/N/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f6451.6
Simplified51.6%
(FPCore (e v) :precision binary64 (* e (- v (* v e))))
double code(double e, double v) {
return e * (v - (v * e));
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = e * (v - (v * e))
end function
public static double code(double e, double v) {
return e * (v - (v * e));
}
def code(e, v): return e * (v - (v * e))
function code(e, v) return Float64(e * Float64(v - Float64(v * e))) end
function tmp = code(e, v) tmp = e * (v - (v * e)); end
code[e_, v_] := N[(e * N[(v - N[(v * e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e \cdot \left(v - v \cdot e\right)
\end{array}
Initial program 99.8%
Taylor expanded in v around 0
*-commutativeN/A
associate-*r/N/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f6451.6
Simplified51.6%
Taylor expanded in e around 0
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
distribute-rgt-out--N/A
*-lft-identityN/A
lower--.f64N/A
lower-*.f6451.1
Simplified51.1%
Final simplification51.1%
(FPCore (e v) :precision binary64 (* v e))
double code(double e, double v) {
return v * e;
}
real(8) function code(e, v)
real(8), intent (in) :: e
real(8), intent (in) :: v
code = v * e
end function
public static double code(double e, double v) {
return v * e;
}
def code(e, v): return v * e
function code(e, v) return Float64(v * e) end
function tmp = code(e, v) tmp = v * e; end
code[e_, v_] := N[(v * e), $MachinePrecision]
\begin{array}{l}
\\
v \cdot e
\end{array}
Initial program 99.8%
Taylor expanded in v around 0
*-commutativeN/A
associate-*r/N/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f6451.6
Simplified51.6%
Taylor expanded in e around 0
lower-*.f6450.8
Simplified50.8%
Final simplification50.8%
herbie shell --seed 2024215
(FPCore (e v)
:name "Trigonometry A"
:precision binary64
:pre (and (<= 0.0 e) (<= e 1.0))
(/ (* e (sin v)) (+ 1.0 (* e (cos v)))))