Optimal throwing angle

Percentage Accurate: 67.9% → 99.8%

Time: 9.4s

Alternatives: 6

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \end{array} \]

FPCore

(FPCore (v H)
 :precision binary64
 (atan (/ v (sqrt (- (* v v) (* (* 2.0 9.8) H))))))

C

double code(double v, double H) {
	return atan((v / sqrt(((v * v) - ((2.0 * 9.8) * H)))));
}

Fortran

real(8) function code(v, h)
    real(8), intent (in) :: v
    real(8), intent (in) :: h
    code = atan((v / sqrt(((v * v) - ((2.0d0 * 9.8d0) * h)))))
end function

Java

public static double code(double v, double H) {
	return Math.atan((v / Math.sqrt(((v * v) - ((2.0 * 9.8) * H)))));
}

Python

def code(v, H):
	return math.atan((v / math.sqrt(((v * v) - ((2.0 * 9.8) * H)))))

Julia

function code(v, H)
	return atan(Float64(v / sqrt(Float64(Float64(v * v) - Float64(Float64(2.0 * 9.8) * H)))))
end

MATLAB

function tmp = code(v, H)
	tmp = atan((v / sqrt(((v * v) - ((2.0 * 9.8) * H)))));
end

Wolfram

code[v_, H_] := N[ArcTan[N[(v / N[Sqrt[N[(N[(v * v), $MachinePrecision] - N[(N[(2.0 * 9.8), $MachinePrecision] * H), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Initial Program: 67.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \end{array} \]

FPCore

(FPCore (v H)
 :precision binary64
 (atan (/ v (sqrt (- (* v v) (* (* 2.0 9.8) H))))))

C

double code(double v, double H) {
	return atan((v / sqrt(((v * v) - ((2.0 * 9.8) * H)))));
}

Fortran

real(8) function code(v, h)
    real(8), intent (in) :: v
    real(8), intent (in) :: h
    code = atan((v / sqrt(((v * v) - ((2.0d0 * 9.8d0) * h)))))
end function

Java

public static double code(double v, double H) {
	return Math.atan((v / Math.sqrt(((v * v) - ((2.0 * 9.8) * H)))));
}

Python

def code(v, H):
	return math.atan((v / math.sqrt(((v * v) - ((2.0 * 9.8) * H)))))

Julia

function code(v, H)
	return atan(Float64(v / sqrt(Float64(Float64(v * v) - Float64(Float64(2.0 * 9.8) * H)))))
end

MATLAB

function tmp = code(v, H)
	tmp = atan((v / sqrt(((v * v) - ((2.0 * 9.8) * H)))));
end

Wolfram

code[v_, H_] := N[ArcTan[N[(v / N[Sqrt[N[(N[(v * v), $MachinePrecision] - N[(N[(2.0 * 9.8), $MachinePrecision] * H), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq -2 \cdot 10^{+154}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 4 \cdot 10^{+149}:\\ \;\;\;\;\tan^{-1} \left(\frac{v}{\sqrt{\mathsf{fma}\left(v, v, H \cdot -19.6\right)}}\right)\\ \mathbf{else}:\\ \;\;\;\;\tan^{-1} 1\\ \end{array} \end{array} \]

FPCore

(FPCore (v H)
 :precision binary64
 (if (<= v -2e+154)
   (atan -1.0)
   (if (<= v 4e+149) (atan (/ v (sqrt (fma v v (* H -19.6))))) (atan 1.0))))

C

double code(double v, double H) {
	double tmp;
	if (v <= -2e+154) {
		tmp = atan(-1.0);
	} else if (v <= 4e+149) {
		tmp = atan((v / sqrt(fma(v, v, (H * -19.6)))));
	} else {
		tmp = atan(1.0);
	}
	return tmp;
}

Julia

function code(v, H)
	tmp = 0.0
	if (v <= -2e+154)
		tmp = atan(-1.0);
	elseif (v <= 4e+149)
		tmp = atan(Float64(v / sqrt(fma(v, v, Float64(H * -19.6)))));
	else
		tmp = atan(1.0);
	end
	return tmp
end

Wolfram

code[v_, H_] := If[LessEqual[v, -2e+154], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 4e+149], N[ArcTan[N[(v / N[Sqrt[N[(v * v + N[(H * -19.6), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[ArcTan[1.0], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if v < -2.00000000000000007e154

   1. Initial program 3.1%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around -inf

      \[\leadsto \tan^{-1} \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Simplified 100.0%

      \[\leadsto \tan^{-1} \color{blue}{-1} \]

   if -2.00000000000000007e154 < v < 4.0000000000000002e149

   1. Initial program 99.7%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\sqrt{\color{blue}{v \cdot v + \left(\mathsf{neg}\left(\left(2 \cdot \frac{49}{5}\right) \cdot H\right)\right)}}}\right) \]

      2. accelerator-lowering-fma.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\sqrt{\color{blue}{\mathsf{fma}\left(v, v, \mathsf{neg}\left(\left(2 \cdot \frac{49}{5}\right) \cdot H\right)\right)}}}\right) \]

      3. *-commutative N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\sqrt{\mathsf{fma}\left(v, v, \mathsf{neg}\left(\color{blue}{H \cdot \left(2 \cdot \frac{49}{5}\right)}\right)\right)}}\right) \]

      4. distribute-rgt-neg-in N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\sqrt{\mathsf{fma}\left(v, v, \color{blue}{H \cdot \left(\mathsf{neg}\left(2 \cdot \frac{49}{5}\right)\right)}\right)}}\right) \]

      5. *-lowering-*.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\sqrt{\mathsf{fma}\left(v, v, \color{blue}{H \cdot \left(\mathsf{neg}\left(2 \cdot \frac{49}{5}\right)\right)}\right)}}\right) \]

      6. metadata-eval N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\sqrt{\mathsf{fma}\left(v, v, H \cdot \left(\mathsf{neg}\left(\color{blue}{\frac{98}{5}}\right)\right)\right)}}\right) \]

      7. metadata-eval 99.7

         \[\leadsto \tan^{-1} \left(\frac{v}{\sqrt{\mathsf{fma}\left(v, v, H \cdot \color{blue}{-19.6}\right)}}\right) \]

   4. Applied egg-rr 99.7%

      \[\leadsto \tan^{-1} \left(\frac{v}{\sqrt{\color{blue}{\mathsf{fma}\left(v, v, H \cdot -19.6\right)}}}\right) \]

   if 4.0000000000000002e149 < v

   1. Initial program 5.5%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around inf

      \[\leadsto \tan^{-1} \color{blue}{1} \]
   4. Step-by-step derivation

   5. Simplified 100.0%

      \[\leadsto \tan^{-1} \color{blue}{1} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 89.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq -6.6 \cdot 10^{-58}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 3.3 \cdot 10^{-39}:\\ \;\;\;\;\tan^{-1} \left(v \cdot \sqrt{\frac{-0.05102040816326531}{H}}\right)\\ \mathbf{else}:\\ \;\;\;\;\tan^{-1} \left(\frac{v}{\mathsf{fma}\left(H, \frac{-9.8}{v}, v\right)}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (v H)
 :precision binary64
 (if (<= v -6.6e-58)
   (atan -1.0)
   (if (<= v 3.3e-39)
     (atan (* v (sqrt (/ -0.05102040816326531 H))))
     (atan (/ v (fma H (/ -9.8 v) v))))))

C

double code(double v, double H) {
	double tmp;
	if (v <= -6.6e-58) {
		tmp = atan(-1.0);
	} else if (v <= 3.3e-39) {
		tmp = atan((v * sqrt((-0.05102040816326531 / H))));
	} else {
		tmp = atan((v / fma(H, (-9.8 / v), v)));
	}
	return tmp;
}

Julia

function code(v, H)
	tmp = 0.0
	if (v <= -6.6e-58)
		tmp = atan(-1.0);
	elseif (v <= 3.3e-39)
		tmp = atan(Float64(v * sqrt(Float64(-0.05102040816326531 / H))));
	else
		tmp = atan(Float64(v / fma(H, Float64(-9.8 / v), v)));
	end
	return tmp
end

Wolfram

code[v_, H_] := If[LessEqual[v, -6.6e-58], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 3.3e-39], N[ArcTan[N[(v * N[Sqrt[N[(-0.05102040816326531 / H), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[ArcTan[N[(v / N[(H * N[(-9.8 / v), $MachinePrecision] + v), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if v < -6.60000000000000052e-58

   1. Initial program 51.5%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around -inf

      \[\leadsto \tan^{-1} \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Simplified 87.6%

      \[\leadsto \tan^{-1} \color{blue}{-1} \]

   if -6.60000000000000052e-58 < v < 3.29999999999999985e-39

   1. Initial program 99.6%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. clear-num N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{1}{\frac{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}}{v}}\right)} \]

      2. associate-/r/ N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{1}{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}} \cdot v\right)} \]

      3. *-lowering-*.f64 N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{1}{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}} \cdot v\right)} \]

   4. Applied egg-rr 99.6%

      \[\leadsto \tan^{-1} \color{blue}{\left(\sqrt{\frac{1}{\mathsf{fma}\left(v, v, H \cdot -19.6\right)}} \cdot v\right)} \]

   5. Taylor expanded in v around 0

      \[\leadsto \tan^{-1} \left(\sqrt{\color{blue}{\frac{\frac{-5}{98}}{H}}} \cdot v\right) \]
   6. Step-by-step derivation

      1. rem-square-sqrt N/A

         \[\leadsto \tan^{-1} \left(\sqrt{\frac{\color{blue}{\sqrt{\frac{-5}{98}} \cdot \sqrt{\frac{-5}{98}}}}{H}} \cdot v\right) \]

      2. unpow2 N/A

         \[\leadsto \tan^{-1} \left(\sqrt{\frac{\color{blue}{{\left(\sqrt{\frac{-5}{98}}\right)}^{2}}}{H}} \cdot v\right) \]

      3. /-lowering-/.f64 N/A

         \[\leadsto \tan^{-1} \left(\sqrt{\color{blue}{\frac{{\left(\sqrt{\frac{-5}{98}}\right)}^{2}}{H}}} \cdot v\right) \]

      4. unpow2 N/A

         \[\leadsto \tan^{-1} \left(\sqrt{\frac{\color{blue}{\sqrt{\frac{-5}{98}} \cdot \sqrt{\frac{-5}{98}}}}{H}} \cdot v\right) \]

      5. rem-square-sqrt 91.2

         \[\leadsto \tan^{-1} \left(\sqrt{\frac{\color{blue}{-0.05102040816326531}}{H}} \cdot v\right) \]

   7. Simplified 91.2%

      \[\leadsto \tan^{-1} \left(\sqrt{\color{blue}{\frac{-0.05102040816326531}{H}}} \cdot v\right) \]

   if 3.29999999999999985e-39 < v

   1. Initial program 49.7%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in H around 0

      \[\leadsto \tan^{-1} \left(\frac{v}{\color{blue}{v + \frac{-49}{5} \cdot \frac{H}{v}}}\right) \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\color{blue}{\frac{-49}{5} \cdot \frac{H}{v} + v}}\right) \]

      2. *-commutative N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\color{blue}{\frac{H}{v} \cdot \frac{-49}{5}} + v}\right) \]

      3. associate-*l/ N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\color{blue}{\frac{H \cdot \frac{-49}{5}}{v}} + v}\right) \]

      4. associate-*r/ N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\color{blue}{H \cdot \frac{\frac{-49}{5}}{v}} + v}\right) \]

      5. metadata-eval N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{H \cdot \frac{\color{blue}{\mathsf{neg}\left(\frac{49}{5}\right)}}{v} + v}\right) \]

      6. distribute-neg-frac N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{H \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{\frac{49}{5}}{v}\right)\right)} + v}\right) \]

      7. metadata-eval N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{H \cdot \left(\mathsf{neg}\left(\frac{\color{blue}{\frac{49}{5} \cdot 1}}{v}\right)\right) + v}\right) \]

      8. associate-*r/ N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{H \cdot \left(\mathsf{neg}\left(\color{blue}{\frac{49}{5} \cdot \frac{1}{v}}\right)\right) + v}\right) \]

      9. accelerator-lowering-fma.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{v}{\color{blue}{\mathsf{fma}\left(H, \mathsf{neg}\left(\frac{49}{5} \cdot \frac{1}{v}\right), v\right)}}\right) \]

      10. associate-*r/ N/A

          \[\leadsto \tan^{-1} \left(\frac{v}{\mathsf{fma}\left(H, \mathsf{neg}\left(\color{blue}{\frac{\frac{49}{5} \cdot 1}{v}}\right), v\right)}\right) \]

      11. metadata-eval N/A

          \[\leadsto \tan^{-1} \left(\frac{v}{\mathsf{fma}\left(H, \mathsf{neg}\left(\frac{\color{blue}{\frac{49}{5}}}{v}\right), v\right)}\right) \]

      12. distribute-neg-frac N/A

          \[\leadsto \tan^{-1} \left(\frac{v}{\mathsf{fma}\left(H, \color{blue}{\frac{\mathsf{neg}\left(\frac{49}{5}\right)}{v}}, v\right)}\right) \]

      13. metadata-eval N/A

          \[\leadsto \tan^{-1} \left(\frac{v}{\mathsf{fma}\left(H, \frac{\color{blue}{\frac{-49}{5}}}{v}, v\right)}\right) \]

      14. /-lowering-/.f64 90.3

          \[\leadsto \tan^{-1} \left(\frac{v}{\mathsf{fma}\left(H, \color{blue}{\frac{-9.8}{v}}, v\right)}\right) \]

   5. Simplified 90.3%

      \[\leadsto \tan^{-1} \left(\frac{v}{\color{blue}{\mathsf{fma}\left(H, \frac{-9.8}{v}, v\right)}}\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 89.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq -6.6 \cdot 10^{-58}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 3.3 \cdot 10^{-39}:\\ \;\;\;\;\tan^{-1} \left(v \cdot \sqrt{\frac{-0.05102040816326531}{H}}\right)\\ \mathbf{else}:\\ \;\;\;\;\tan^{-1} \left(\frac{v}{\mathsf{fma}\left(H, \frac{-9.8}{v}, v\right)}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 89.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq -6.6 \cdot 10^{-58}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 2.7 \cdot 10^{-39}:\\ \;\;\;\;\tan^{-1} \left(v \cdot \sqrt{\frac{-0.05102040816326531}{H}}\right)\\ \mathbf{else}:\\ \;\;\;\;\tan^{-1} 1\\ \end{array} \end{array} \]

FPCore

(FPCore (v H)
 :precision binary64
 (if (<= v -6.6e-58)
   (atan -1.0)
   (if (<= v 2.7e-39)
     (atan (* v (sqrt (/ -0.05102040816326531 H))))
     (atan 1.0))))

C

double code(double v, double H) {
	double tmp;
	if (v <= -6.6e-58) {
		tmp = atan(-1.0);
	} else if (v <= 2.7e-39) {
		tmp = atan((v * sqrt((-0.05102040816326531 / H))));
	} else {
		tmp = atan(1.0);
	}
	return tmp;
}

Fortran

real(8) function code(v, h)
    real(8), intent (in) :: v
    real(8), intent (in) :: h
    real(8) :: tmp
    if (v <= (-6.6d-58)) then
        tmp = atan((-1.0d0))
    else if (v <= 2.7d-39) then
        tmp = atan((v * sqrt(((-0.05102040816326531d0) / h))))
    else
        tmp = atan(1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double v, double H) {
	double tmp;
	if (v <= -6.6e-58) {
		tmp = Math.atan(-1.0);
	} else if (v <= 2.7e-39) {
		tmp = Math.atan((v * Math.sqrt((-0.05102040816326531 / H))));
	} else {
		tmp = Math.atan(1.0);
	}
	return tmp;
}

Python

def code(v, H):
	tmp = 0
	if v <= -6.6e-58:
		tmp = math.atan(-1.0)
	elif v <= 2.7e-39:
		tmp = math.atan((v * math.sqrt((-0.05102040816326531 / H))))
	else:
		tmp = math.atan(1.0)
	return tmp

Julia

function code(v, H)
	tmp = 0.0
	if (v <= -6.6e-58)
		tmp = atan(-1.0);
	elseif (v <= 2.7e-39)
		tmp = atan(Float64(v * sqrt(Float64(-0.05102040816326531 / H))));
	else
		tmp = atan(1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(v, H)
	tmp = 0.0;
	if (v <= -6.6e-58)
		tmp = atan(-1.0);
	elseif (v <= 2.7e-39)
		tmp = atan((v * sqrt((-0.05102040816326531 / H))));
	else
		tmp = atan(1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[v_, H_] := If[LessEqual[v, -6.6e-58], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 2.7e-39], N[ArcTan[N[(v * N[Sqrt[N[(-0.05102040816326531 / H), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[ArcTan[1.0], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if v < -6.60000000000000052e-58

   1. Initial program 51.5%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around -inf

      \[\leadsto \tan^{-1} \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Simplified 87.6%

      \[\leadsto \tan^{-1} \color{blue}{-1} \]

   if -6.60000000000000052e-58 < v < 2.7000000000000001e-39

   1. Initial program 99.6%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. clear-num N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{1}{\frac{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}}{v}}\right)} \]

      2. associate-/r/ N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{1}{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}} \cdot v\right)} \]

      3. *-lowering-*.f64 N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{1}{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}} \cdot v\right)} \]

   4. Applied egg-rr 99.6%

      \[\leadsto \tan^{-1} \color{blue}{\left(\sqrt{\frac{1}{\mathsf{fma}\left(v, v, H \cdot -19.6\right)}} \cdot v\right)} \]

   5. Taylor expanded in v around 0

      \[\leadsto \tan^{-1} \left(\sqrt{\color{blue}{\frac{\frac{-5}{98}}{H}}} \cdot v\right) \]
   6. Step-by-step derivation

      1. rem-square-sqrt N/A

         \[\leadsto \tan^{-1} \left(\sqrt{\frac{\color{blue}{\sqrt{\frac{-5}{98}} \cdot \sqrt{\frac{-5}{98}}}}{H}} \cdot v\right) \]

      2. unpow2 N/A

         \[\leadsto \tan^{-1} \left(\sqrt{\frac{\color{blue}{{\left(\sqrt{\frac{-5}{98}}\right)}^{2}}}{H}} \cdot v\right) \]

      3. /-lowering-/.f64 N/A

         \[\leadsto \tan^{-1} \left(\sqrt{\color{blue}{\frac{{\left(\sqrt{\frac{-5}{98}}\right)}^{2}}{H}}} \cdot v\right) \]

      4. unpow2 N/A

         \[\leadsto \tan^{-1} \left(\sqrt{\frac{\color{blue}{\sqrt{\frac{-5}{98}} \cdot \sqrt{\frac{-5}{98}}}}{H}} \cdot v\right) \]

      5. rem-square-sqrt 91.2

         \[\leadsto \tan^{-1} \left(\sqrt{\frac{\color{blue}{-0.05102040816326531}}{H}} \cdot v\right) \]

   7. Simplified 91.2%

      \[\leadsto \tan^{-1} \left(\sqrt{\color{blue}{\frac{-0.05102040816326531}{H}}} \cdot v\right) \]

   if 2.7000000000000001e-39 < v

   1. Initial program 49.7%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around inf

      \[\leadsto \tan^{-1} \color{blue}{1} \]
   4. Step-by-step derivation

   5. Simplified 89.8%

      \[\leadsto \tan^{-1} \color{blue}{1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 89.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq -6.6 \cdot 10^{-58}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 2.7 \cdot 10^{-39}:\\ \;\;\;\;\tan^{-1} \left(v \cdot \sqrt{\frac{-0.05102040816326531}{H}}\right)\\ \mathbf{else}:\\ \;\;\;\;\tan^{-1} 1\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 71.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq -1.05 \cdot 10^{-153}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 1.1 \cdot 10^{-194}:\\ \;\;\;\;\tan^{-1} \left(\frac{\left(v \cdot v\right) \cdot -0.10204081632653061}{H}\right)\\ \mathbf{else}:\\ \;\;\;\;\tan^{-1} 1\\ \end{array} \end{array} \]

FPCore

(FPCore (v H)
 :precision binary64
 (if (<= v -1.05e-153)
   (atan -1.0)
   (if (<= v 1.1e-194)
     (atan (/ (* (* v v) -0.10204081632653061) H))
     (atan 1.0))))

C

double code(double v, double H) {
	double tmp;
	if (v <= -1.05e-153) {
		tmp = atan(-1.0);
	} else if (v <= 1.1e-194) {
		tmp = atan((((v * v) * -0.10204081632653061) / H));
	} else {
		tmp = atan(1.0);
	}
	return tmp;
}

Fortran

real(8) function code(v, h)
    real(8), intent (in) :: v
    real(8), intent (in) :: h
    real(8) :: tmp
    if (v <= (-1.05d-153)) then
        tmp = atan((-1.0d0))
    else if (v <= 1.1d-194) then
        tmp = atan((((v * v) * (-0.10204081632653061d0)) / h))
    else
        tmp = atan(1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double v, double H) {
	double tmp;
	if (v <= -1.05e-153) {
		tmp = Math.atan(-1.0);
	} else if (v <= 1.1e-194) {
		tmp = Math.atan((((v * v) * -0.10204081632653061) / H));
	} else {
		tmp = Math.atan(1.0);
	}
	return tmp;
}

Python

def code(v, H):
	tmp = 0
	if v <= -1.05e-153:
		tmp = math.atan(-1.0)
	elif v <= 1.1e-194:
		tmp = math.atan((((v * v) * -0.10204081632653061) / H))
	else:
		tmp = math.atan(1.0)
	return tmp

Julia

function code(v, H)
	tmp = 0.0
	if (v <= -1.05e-153)
		tmp = atan(-1.0);
	elseif (v <= 1.1e-194)
		tmp = atan(Float64(Float64(Float64(v * v) * -0.10204081632653061) / H));
	else
		tmp = atan(1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(v, H)
	tmp = 0.0;
	if (v <= -1.05e-153)
		tmp = atan(-1.0);
	elseif (v <= 1.1e-194)
		tmp = atan((((v * v) * -0.10204081632653061) / H));
	else
		tmp = atan(1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[v_, H_] := If[LessEqual[v, -1.05e-153], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 1.1e-194], N[ArcTan[N[(N[(N[(v * v), $MachinePrecision] * -0.10204081632653061), $MachinePrecision] / H), $MachinePrecision]], $MachinePrecision], N[ArcTan[1.0], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if v < -1.05000000000000002e-153

   1. Initial program 60.4%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around -inf

      \[\leadsto \tan^{-1} \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Simplified 75.1%

      \[\leadsto \tan^{-1} \color{blue}{-1} \]

   if -1.05000000000000002e-153 < v < 1.1000000000000001e-194

   1. Initial program 99.6%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. clear-num N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{1}{\frac{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}}{v}}\right)} \]

      2. /-lowering-/.f64 N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{1}{\frac{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}}{v}}\right)} \]

      3. /-lowering-/.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\color{blue}{\frac{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}}{v}}}\right) \]

      4. sqrt-lowering-sqrt.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\frac{\color{blue}{\sqrt{v \cdot v - \left(2 \cdot \frac{49}{5}\right) \cdot H}}}{v}}\right) \]

      5. sub-neg N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\frac{\sqrt{\color{blue}{v \cdot v + \left(\mathsf{neg}\left(\left(2 \cdot \frac{49}{5}\right) \cdot H\right)\right)}}}{v}}\right) \]

      6. accelerator-lowering-fma.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\frac{\sqrt{\color{blue}{\mathsf{fma}\left(v, v, \mathsf{neg}\left(\left(2 \cdot \frac{49}{5}\right) \cdot H\right)\right)}}}{v}}\right) \]

      7. *-commutative N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\frac{\sqrt{\mathsf{fma}\left(v, v, \mathsf{neg}\left(\color{blue}{H \cdot \left(2 \cdot \frac{49}{5}\right)}\right)\right)}}{v}}\right) \]

      8. distribute-rgt-neg-in N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\frac{\sqrt{\mathsf{fma}\left(v, v, \color{blue}{H \cdot \left(\mathsf{neg}\left(2 \cdot \frac{49}{5}\right)\right)}\right)}}{v}}\right) \]

      9. *-lowering-*.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\frac{\sqrt{\mathsf{fma}\left(v, v, \color{blue}{H \cdot \left(\mathsf{neg}\left(2 \cdot \frac{49}{5}\right)\right)}\right)}}{v}}\right) \]

      10. metadata-eval N/A

          \[\leadsto \tan^{-1} \left(\frac{1}{\frac{\sqrt{\mathsf{fma}\left(v, v, H \cdot \left(\mathsf{neg}\left(\color{blue}{\frac{98}{5}}\right)\right)\right)}}{v}}\right) \]

      11. metadata-eval 95.0

          \[\leadsto \tan^{-1} \left(\frac{1}{\frac{\sqrt{\mathsf{fma}\left(v, v, H \cdot \color{blue}{-19.6}\right)}}{v}}\right) \]

   4. Applied egg-rr 95.0%

      \[\leadsto \tan^{-1} \color{blue}{\left(\frac{1}{\frac{\sqrt{\mathsf{fma}\left(v, v, H \cdot -19.6\right)}}{v}}\right)} \]

   5. Taylor expanded in v around inf

      \[\leadsto \tan^{-1} \left(\frac{1}{\color{blue}{1 + \frac{-49}{5} \cdot \frac{H}{{v}^{2}}}}\right) \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\color{blue}{\frac{-49}{5} \cdot \frac{H}{{v}^{2}} + 1}}\right) \]

      2. *-commutative N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\color{blue}{\frac{H}{{v}^{2}} \cdot \frac{-49}{5}} + 1}\right) \]

      3. accelerator-lowering-fma.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\color{blue}{\mathsf{fma}\left(\frac{H}{{v}^{2}}, \frac{-49}{5}, 1\right)}}\right) \]

      4. /-lowering-/.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\mathsf{fma}\left(\color{blue}{\frac{H}{{v}^{2}}}, \frac{-49}{5}, 1\right)}\right) \]

      5. unpow2 N/A

         \[\leadsto \tan^{-1} \left(\frac{1}{\mathsf{fma}\left(\frac{H}{\color{blue}{v \cdot v}}, \frac{-49}{5}, 1\right)}\right) \]

      6. *-lowering-*.f64 47.7

         \[\leadsto \tan^{-1} \left(\frac{1}{\mathsf{fma}\left(\frac{H}{\color{blue}{v \cdot v}}, -9.8, 1\right)}\right) \]

   7. Simplified 47.7%

      \[\leadsto \tan^{-1} \left(\frac{1}{\color{blue}{\mathsf{fma}\left(\frac{H}{v \cdot v}, -9.8, 1\right)}}\right) \]

   8. Taylor expanded in H around inf

      \[\leadsto \tan^{-1} \color{blue}{\left(\frac{-5}{49} \cdot \frac{{v}^{2}}{H}\right)} \]
   9. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{\frac{-5}{49} \cdot {v}^{2}}{H}\right)} \]

      2. /-lowering-/.f64 N/A

         \[\leadsto \tan^{-1} \color{blue}{\left(\frac{\frac{-5}{49} \cdot {v}^{2}}{H}\right)} \]

      3. *-commutative N/A

         \[\leadsto \tan^{-1} \left(\frac{\color{blue}{{v}^{2} \cdot \frac{-5}{49}}}{H}\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \tan^{-1} \left(\frac{\color{blue}{{v}^{2} \cdot \frac{-5}{49}}}{H}\right) \]

      5. unpow2 N/A

         \[\leadsto \tan^{-1} \left(\frac{\color{blue}{\left(v \cdot v\right)} \cdot \frac{-5}{49}}{H}\right) \]

      6. *-lowering-*.f64 47.7

         \[\leadsto \tan^{-1} \left(\frac{\color{blue}{\left(v \cdot v\right)} \cdot -0.10204081632653061}{H}\right) \]

   10. Simplified 47.7%

       \[\leadsto \tan^{-1} \color{blue}{\left(\frac{\left(v \cdot v\right) \cdot -0.10204081632653061}{H}\right)} \]

   if 1.1000000000000001e-194 < v

   1. Initial program 60.4%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around inf

      \[\leadsto \tan^{-1} \color{blue}{1} \]
   4. Step-by-step derivation

   5. Simplified 74.3%

      \[\leadsto \tan^{-1} \color{blue}{1} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 67.3% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq -6.5 \cdot 10^{-304}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{else}:\\ \;\;\;\;\tan^{-1} 1\\ \end{array} \end{array} \]

FPCore

(FPCore (v H) :precision binary64 (if (<= v -6.5e-304) (atan -1.0) (atan 1.0)))

C

double code(double v, double H) {
	double tmp;
	if (v <= -6.5e-304) {
		tmp = atan(-1.0);
	} else {
		tmp = atan(1.0);
	}
	return tmp;
}

Fortran

real(8) function code(v, h)
    real(8), intent (in) :: v
    real(8), intent (in) :: h
    real(8) :: tmp
    if (v <= (-6.5d-304)) then
        tmp = atan((-1.0d0))
    else
        tmp = atan(1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double v, double H) {
	double tmp;
	if (v <= -6.5e-304) {
		tmp = Math.atan(-1.0);
	} else {
		tmp = Math.atan(1.0);
	}
	return tmp;
}

Python

def code(v, H):
	tmp = 0
	if v <= -6.5e-304:
		tmp = math.atan(-1.0)
	else:
		tmp = math.atan(1.0)
	return tmp

Julia

function code(v, H)
	tmp = 0.0
	if (v <= -6.5e-304)
		tmp = atan(-1.0);
	else
		tmp = atan(1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(v, H)
	tmp = 0.0;
	if (v <= -6.5e-304)
		tmp = atan(-1.0);
	else
		tmp = atan(1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[v_, H_] := If[LessEqual[v, -6.5e-304], N[ArcTan[-1.0], $MachinePrecision], N[ArcTan[1.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if v < -6.50000000000000011e-304

   1. Initial program 67.0%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around -inf

      \[\leadsto \tan^{-1} \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Simplified 63.1%

      \[\leadsto \tan^{-1} \color{blue}{-1} \]

   if -6.50000000000000011e-304 < v

   1. Initial program 67.6%

      \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around inf

      \[\leadsto \tan^{-1} \color{blue}{1} \]
   4. Step-by-step derivation

   5. Simplified 61.3%

      \[\leadsto \tan^{-1} \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 35.1% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \tan^{-1} -1 \end{array} \]

FPCore

(FPCore (v H) :precision binary64 (atan -1.0))

C

double code(double v, double H) {
	return atan(-1.0);
}

Fortran

real(8) function code(v, h)
    real(8), intent (in) :: v
    real(8), intent (in) :: h
    code = atan((-1.0d0))
end function

Java

public static double code(double v, double H) {
	return Math.atan(-1.0);
}

Python

def code(v, H):
	return math.atan(-1.0)

Julia

function code(v, H)
	return atan(-1.0)
end

MATLAB

function tmp = code(v, H)
	tmp = atan(-1.0);
end

Wolfram

code[v_, H_] := N[ArcTan[-1.0], $MachinePrecision]

Derivation

1. Initial program 67.3%

   \[\tan^{-1} \left(\frac{v}{\sqrt{v \cdot v - \left(2 \cdot 9.8\right) \cdot H}}\right) \]
2. Add Preprocessing

3. Taylor expanded in v around -inf

   \[\leadsto \tan^{-1} \color{blue}{-1} \]
4. Step-by-step derivation

5. Simplified 34.4%

   \[\leadsto \tan^{-1} \color{blue}{-1} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024204 
(FPCore (v H)
  :name "Optimal throwing angle"
  :precision binary64
  (atan (/ v (sqrt (- (* v v) (* (* 2.0 9.8) H))))))