Trigonometry A

Percentage Accurate: 99.8% → 99.8%
Time: 7.2s
Alternatives: 12
Speedup: 1.0×

Specification

?
\[0 \leq e \land e \leq 1\]
\[\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}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 12 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.8% accurate, 1.0× speedup?

\[\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}

Alternative 1: 99.8% accurate, 1.0× speedup?

\[\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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Final simplification99.7%

    \[\leadsto \frac{e \cdot \sin v}{1 + e \cdot \cos v} \]

Alternative 2: 99.6% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{e}{\frac{1 + e \cdot \cos v}{\sin v}} \end{array} \]
(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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Step-by-step derivation
    1. associate-/l*99.6%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  3. Simplified99.6%

    \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  4. Final simplification99.6%

    \[\leadsto \frac{e}{\frac{1 + e \cdot \cos v}{\sin v}} \]

Alternative 3: 98.3% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \sin v \cdot \left(e - e \cdot e\right) \end{array} \]
(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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Taylor expanded in v around 0 98.8%

    \[\leadsto \frac{e \cdot \sin v}{1 + \color{blue}{e}} \]
  3. Step-by-step derivation
    1. associate-/l*98.7%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e}{\sin v}}} \]
    2. associate-/r/98.8%

      \[\leadsto \color{blue}{\frac{e}{1 + e} \cdot \sin v} \]
    3. +-commutative98.8%

      \[\leadsto \frac{e}{\color{blue}{e + 1}} \cdot \sin v \]
  4. Applied egg-rr98.8%

    \[\leadsto \color{blue}{\frac{e}{e + 1} \cdot \sin v} \]
  5. Taylor expanded in e around 0 98.0%

    \[\leadsto \color{blue}{\left(-1 \cdot {e}^{2} + e\right)} \cdot \sin v \]
  6. Step-by-step derivation
    1. +-commutative98.0%

      \[\leadsto \color{blue}{\left(e + -1 \cdot {e}^{2}\right)} \cdot \sin v \]
    2. mul-1-neg98.0%

      \[\leadsto \left(e + \color{blue}{\left(-{e}^{2}\right)}\right) \cdot \sin v \]
    3. unsub-neg98.0%

      \[\leadsto \color{blue}{\left(e - {e}^{2}\right)} \cdot \sin v \]
    4. unpow298.0%

      \[\leadsto \left(e - \color{blue}{e \cdot e}\right) \cdot \sin v \]
  7. Simplified98.0%

    \[\leadsto \color{blue}{\left(e - e \cdot e\right)} \cdot \sin v \]
  8. Final simplification98.0%

    \[\leadsto \sin v \cdot \left(e - e \cdot e\right) \]

Alternative 4: 98.9% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \sin v \cdot \frac{e}{e + 1} \end{array} \]
(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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Taylor expanded in v around 0 98.8%

    \[\leadsto \frac{e \cdot \sin v}{1 + \color{blue}{e}} \]
  3. Step-by-step derivation
    1. associate-/l*98.7%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e}{\sin v}}} \]
    2. associate-/r/98.8%

      \[\leadsto \color{blue}{\frac{e}{1 + e} \cdot \sin v} \]
    3. +-commutative98.8%

      \[\leadsto \frac{e}{\color{blue}{e + 1}} \cdot \sin v \]
  4. Applied egg-rr98.8%

    \[\leadsto \color{blue}{\frac{e}{e + 1} \cdot \sin v} \]
  5. Final simplification98.8%

    \[\leadsto \sin v \cdot \frac{e}{e + 1} \]

Alternative 5: 97.9% accurate, 2.0× speedup?

\[\begin{array}{l} \\ e \cdot \sin v \end{array} \]
(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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Step-by-step derivation
    1. associate-/l*99.6%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  3. Simplified99.6%

    \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  4. Taylor expanded in e around 0 97.3%

    \[\leadsto \color{blue}{\sin v \cdot e} \]
  5. Final simplification97.3%

    \[\leadsto e \cdot \sin v \]

Alternative 6: 52.4% accurate, 10.0× speedup?

\[\begin{array}{l} \\ \frac{e}{v \cdot \left(e \cdot -0.5 - -0.16666666666666666 \cdot \left(e + 1\right)\right) + \left(\frac{e}{v} + \frac{1}{v}\right)} \end{array} \]
(FPCore (e v)
 :precision binary64
 (/
  e
  (+
   (* v (- (* e -0.5) (* -0.16666666666666666 (+ e 1.0))))
   (+ (/ e v) (/ 1.0 v)))))
double code(double e, double v) {
	return e / ((v * ((e * -0.5) - (-0.16666666666666666 * (e + 1.0)))) + ((e / v) + (1.0 / v)));
}
real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = e / ((v * ((e * (-0.5d0)) - ((-0.16666666666666666d0) * (e + 1.0d0)))) + ((e / v) + (1.0d0 / v)))
end function
public static double code(double e, double v) {
	return e / ((v * ((e * -0.5) - (-0.16666666666666666 * (e + 1.0)))) + ((e / v) + (1.0 / v)));
}
def code(e, v):
	return e / ((v * ((e * -0.5) - (-0.16666666666666666 * (e + 1.0)))) + ((e / v) + (1.0 / v)))
function code(e, v)
	return Float64(e / Float64(Float64(v * Float64(Float64(e * -0.5) - Float64(-0.16666666666666666 * Float64(e + 1.0)))) + Float64(Float64(e / v) + Float64(1.0 / v))))
end
function tmp = code(e, v)
	tmp = e / ((v * ((e * -0.5) - (-0.16666666666666666 * (e + 1.0)))) + ((e / v) + (1.0 / v)));
end
code[e_, v_] := N[(e / N[(N[(v * N[(N[(e * -0.5), $MachinePrecision] - N[(-0.16666666666666666 * N[(e + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(e / v), $MachinePrecision] + N[(1.0 / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{e}{v \cdot \left(e \cdot -0.5 - -0.16666666666666666 \cdot \left(e + 1\right)\right) + \left(\frac{e}{v} + \frac{1}{v}\right)}
\end{array}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Step-by-step derivation
    1. associate-/l*99.6%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  3. Simplified99.6%

    \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  4. Taylor expanded in v around 0 55.7%

    \[\leadsto \frac{e}{\color{blue}{\left(-0.5 \cdot e - -0.16666666666666666 \cdot \left(1 + e\right)\right) \cdot v + \left(\frac{e}{v} + \frac{1}{v}\right)}} \]
  5. Final simplification55.7%

    \[\leadsto \frac{e}{v \cdot \left(e \cdot -0.5 - -0.16666666666666666 \cdot \left(e + 1\right)\right) + \left(\frac{e}{v} + \frac{1}{v}\right)} \]

Alternative 7: 51.9% accurate, 23.2× speedup?

\[\begin{array}{l} \\ \frac{v}{\frac{v + \frac{v}{e}}{v}} \end{array} \]
(FPCore (e v) :precision binary64 (/ v (/ (+ v (/ v e)) v)))
double code(double e, double v) {
	return v / ((v + (v / e)) / v);
}
real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = v / ((v + (v / e)) / v)
end function
public static double code(double e, double v) {
	return v / ((v + (v / e)) / v);
}
def code(e, v):
	return v / ((v + (v / e)) / v)
function code(e, v)
	return Float64(v / Float64(Float64(v + Float64(v / e)) / v))
end
function tmp = code(e, v)
	tmp = v / ((v + (v / e)) / v);
end
code[e_, v_] := N[(v / N[(N[(v + N[(v / e), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{v}{\frac{v + \frac{v}{e}}{v}}
\end{array}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Step-by-step derivation
    1. associate-/l*99.6%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  3. Simplified99.6%

    \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  4. Taylor expanded in v around 0 54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{1 + e}{v}}} \]
  5. Step-by-step derivation
    1. +-commutative54.8%

      \[\leadsto \frac{e}{\frac{\color{blue}{e + 1}}{v}} \]
  6. Simplified54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{e + 1}{v}}} \]
  7. Taylor expanded in e around 0 54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{e}{v} + \frac{1}{v}}} \]
  8. Step-by-step derivation
    1. clear-num54.8%

      \[\leadsto \frac{e}{\color{blue}{\frac{1}{\frac{v}{e}}} + \frac{1}{v}} \]
    2. frac-add49.0%

      \[\leadsto \frac{e}{\color{blue}{\frac{1 \cdot v + \frac{v}{e} \cdot 1}{\frac{v}{e} \cdot v}}} \]
    3. *-un-lft-identity49.0%

      \[\leadsto \frac{e}{\frac{\color{blue}{v} + \frac{v}{e} \cdot 1}{\frac{v}{e} \cdot v}} \]
  9. Applied egg-rr49.0%

    \[\leadsto \frac{e}{\color{blue}{\frac{v + \frac{v}{e} \cdot 1}{\frac{v}{e} \cdot v}}} \]
  10. Step-by-step derivation
    1. *-rgt-identity49.0%

      \[\leadsto \frac{e}{\frac{v + \color{blue}{\frac{v}{e}}}{\frac{v}{e} \cdot v}} \]
    2. +-commutative49.0%

      \[\leadsto \frac{e}{\frac{\color{blue}{\frac{v}{e} + v}}{\frac{v}{e} \cdot v}} \]
    3. associate-*l/44.6%

      \[\leadsto \frac{e}{\frac{\frac{v}{e} + v}{\color{blue}{\frac{v \cdot v}{e}}}} \]
    4. associate-/r/44.5%

      \[\leadsto \frac{e}{\color{blue}{\frac{\frac{v}{e} + v}{v \cdot v} \cdot e}} \]
    5. +-commutative44.5%

      \[\leadsto \frac{e}{\frac{\color{blue}{v + \frac{v}{e}}}{v \cdot v} \cdot e} \]
  11. Simplified44.5%

    \[\leadsto \frac{e}{\color{blue}{\frac{v + \frac{v}{e}}{v \cdot v} \cdot e}} \]
  12. Step-by-step derivation
    1. expm1-log1p-u44.4%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{e}{\frac{v + \frac{v}{e}}{v \cdot v} \cdot e}\right)\right)} \]
    2. expm1-udef29.8%

      \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{e}{\frac{v + \frac{v}{e}}{v \cdot v} \cdot e}\right)} - 1} \]
    3. div-inv29.8%

      \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{e \cdot \frac{1}{\frac{v + \frac{v}{e}}{v \cdot v} \cdot e}}\right)} - 1 \]
    4. associate-/r*29.8%

      \[\leadsto e^{\mathsf{log1p}\left(e \cdot \color{blue}{\frac{\frac{1}{\frac{v + \frac{v}{e}}{v \cdot v}}}{e}}\right)} - 1 \]
    5. clear-num29.8%

      \[\leadsto e^{\mathsf{log1p}\left(e \cdot \frac{\color{blue}{\frac{v \cdot v}{v + \frac{v}{e}}}}{e}\right)} - 1 \]
  13. Applied egg-rr29.8%

    \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(e \cdot \frac{\frac{v \cdot v}{v + \frac{v}{e}}}{e}\right)} - 1} \]
  14. Step-by-step derivation
    1. expm1-def45.1%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(e \cdot \frac{\frac{v \cdot v}{v + \frac{v}{e}}}{e}\right)\right)} \]
    2. expm1-log1p45.2%

      \[\leadsto \color{blue}{e \cdot \frac{\frac{v \cdot v}{v + \frac{v}{e}}}{e}} \]
    3. associate-*r/37.7%

      \[\leadsto \color{blue}{\frac{e \cdot \frac{v \cdot v}{v + \frac{v}{e}}}{e}} \]
    4. *-commutative37.7%

      \[\leadsto \frac{\color{blue}{\frac{v \cdot v}{v + \frac{v}{e}} \cdot e}}{e} \]
    5. associate-*r/45.2%

      \[\leadsto \color{blue}{\frac{v \cdot v}{v + \frac{v}{e}} \cdot \frac{e}{e}} \]
    6. *-inverses45.2%

      \[\leadsto \frac{v \cdot v}{v + \frac{v}{e}} \cdot \color{blue}{1} \]
    7. *-commutative45.2%

      \[\leadsto \color{blue}{1 \cdot \frac{v \cdot v}{v + \frac{v}{e}}} \]
    8. *-lft-identity45.2%

      \[\leadsto \color{blue}{\frac{v \cdot v}{v + \frac{v}{e}}} \]
    9. associate-/l*55.4%

      \[\leadsto \color{blue}{\frac{v}{\frac{v + \frac{v}{e}}{v}}} \]
  15. Simplified55.4%

    \[\leadsto \color{blue}{\frac{v}{\frac{v + \frac{v}{e}}{v}}} \]
  16. Final simplification55.4%

    \[\leadsto \frac{v}{\frac{v + \frac{v}{e}}{v}} \]

Alternative 8: 51.2% accurate, 29.9× speedup?

\[\begin{array}{l} \\ \frac{e}{\frac{e + 1}{v}} \end{array} \]
(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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Step-by-step derivation
    1. associate-/l*99.6%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  3. Simplified99.6%

    \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  4. Taylor expanded in v around 0 54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{1 + e}{v}}} \]
  5. Step-by-step derivation
    1. +-commutative54.8%

      \[\leadsto \frac{e}{\frac{\color{blue}{e + 1}}{v}} \]
  6. Simplified54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{e + 1}{v}}} \]
  7. Final simplification54.8%

    \[\leadsto \frac{e}{\frac{e + 1}{v}} \]

Alternative 9: 51.2% accurate, 29.9× speedup?

\[\begin{array}{l} \\ \frac{v}{1 + \frac{1}{e}} \end{array} \]
(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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Step-by-step derivation
    1. associate-/l*99.6%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  3. Simplified99.6%

    \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  4. Taylor expanded in v around 0 54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{1 + e}{v}}} \]
  5. Step-by-step derivation
    1. +-commutative54.8%

      \[\leadsto \frac{e}{\frac{\color{blue}{e + 1}}{v}} \]
  6. Simplified54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{e + 1}{v}}} \]
  7. Taylor expanded in e around 0 54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{e}{v} + \frac{1}{v}}} \]
  8. Step-by-step derivation
    1. clear-num54.8%

      \[\leadsto \frac{e}{\color{blue}{\frac{1}{\frac{v}{e}}} + \frac{1}{v}} \]
    2. frac-add49.0%

      \[\leadsto \frac{e}{\color{blue}{\frac{1 \cdot v + \frac{v}{e} \cdot 1}{\frac{v}{e} \cdot v}}} \]
    3. *-un-lft-identity49.0%

      \[\leadsto \frac{e}{\frac{\color{blue}{v} + \frac{v}{e} \cdot 1}{\frac{v}{e} \cdot v}} \]
  9. Applied egg-rr49.0%

    \[\leadsto \frac{e}{\color{blue}{\frac{v + \frac{v}{e} \cdot 1}{\frac{v}{e} \cdot v}}} \]
  10. Step-by-step derivation
    1. *-rgt-identity49.0%

      \[\leadsto \frac{e}{\frac{v + \color{blue}{\frac{v}{e}}}{\frac{v}{e} \cdot v}} \]
    2. +-commutative49.0%

      \[\leadsto \frac{e}{\frac{\color{blue}{\frac{v}{e} + v}}{\frac{v}{e} \cdot v}} \]
    3. associate-*l/44.6%

      \[\leadsto \frac{e}{\frac{\frac{v}{e} + v}{\color{blue}{\frac{v \cdot v}{e}}}} \]
    4. associate-/r/44.5%

      \[\leadsto \frac{e}{\color{blue}{\frac{\frac{v}{e} + v}{v \cdot v} \cdot e}} \]
    5. +-commutative44.5%

      \[\leadsto \frac{e}{\frac{\color{blue}{v + \frac{v}{e}}}{v \cdot v} \cdot e} \]
  11. Simplified44.5%

    \[\leadsto \frac{e}{\color{blue}{\frac{v + \frac{v}{e}}{v \cdot v} \cdot e}} \]
  12. Taylor expanded in v around 0 54.8%

    \[\leadsto \color{blue}{\frac{v}{\frac{1}{e} + 1}} \]
  13. Final simplification54.8%

    \[\leadsto \frac{v}{1 + \frac{1}{e}} \]

Alternative 10: 51.3% accurate, 29.9× speedup?

\[\begin{array}{l} \\ \frac{e \cdot v}{e + 1} \end{array} \]
(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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Step-by-step derivation
    1. associate-/l*99.6%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  3. Simplified99.6%

    \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  4. Taylor expanded in v around 0 54.9%

    \[\leadsto \color{blue}{\frac{v \cdot e}{1 + e}} \]
  5. Final simplification54.9%

    \[\leadsto \frac{e \cdot v}{e + 1} \]

Alternative 11: 50.3% accurate, 69.7× speedup?

\[\begin{array}{l} \\ e \cdot v \end{array} \]
(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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Step-by-step derivation
    1. associate-/l*99.6%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  3. Simplified99.6%

    \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  4. Taylor expanded in v around 0 54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{1 + e}{v}}} \]
  5. Step-by-step derivation
    1. +-commutative54.8%

      \[\leadsto \frac{e}{\frac{\color{blue}{e + 1}}{v}} \]
  6. Simplified54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{e + 1}{v}}} \]
  7. Taylor expanded in e around 0 53.4%

    \[\leadsto \color{blue}{v \cdot e} \]
  8. Final simplification53.4%

    \[\leadsto e \cdot v \]

Alternative 12: 4.5% accurate, 209.0× speedup?

\[\begin{array}{l} \\ v \end{array} \]
(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}
Derivation
  1. Initial program 99.7%

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
  2. Step-by-step derivation
    1. associate-/l*99.6%

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  3. Simplified99.6%

    \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]
  4. Taylor expanded in v around 0 54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{1 + e}{v}}} \]
  5. Step-by-step derivation
    1. +-commutative54.8%

      \[\leadsto \frac{e}{\frac{\color{blue}{e + 1}}{v}} \]
  6. Simplified54.8%

    \[\leadsto \frac{e}{\color{blue}{\frac{e + 1}{v}}} \]
  7. Taylor expanded in e around inf 4.7%

    \[\leadsto \color{blue}{v} \]
  8. Final simplification4.7%

    \[\leadsto v \]

Reproduce

?
herbie shell --seed 2023224 
(FPCore (e v)
  :name "Trigonometry A"
  :precision binary64
  :pre (and (<= 0.0 e) (<= e 1.0))
  (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))