Optimal throwing angle

Percentage Accurate: 67.3% → 99.6%

Time: 6.8s

Alternatives: 5

Speedup: 1.3×

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.3% 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.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (v H)
 :precision binary64
 (if (<= v -1e+153)
   (atan -1.0)
   (if (<= v 8.3e+130) (atan (/ v (sqrt (fma H -19.6 (* v v))))) (atan 1.0))))

C

double code(double v, double H) {
	double tmp;
	if (v <= -1e+153) {
		tmp = atan(-1.0);
	} else if (v <= 8.3e+130) {
		tmp = atan((v / sqrt(fma(H, -19.6, (v * v)))));
	} else {
		tmp = atan(1.0);
	}
	return tmp;
}

Julia

function code(v, H)
	tmp = 0.0
	if (v <= -1e+153)
		tmp = atan(-1.0);
	elseif (v <= 8.3e+130)
		tmp = atan(Float64(v / sqrt(fma(H, -19.6, Float64(v * v)))));
	else
		tmp = atan(1.0);
	end
	return tmp
end

Wolfram

code[v_, H_] := If[LessEqual[v, -1e+153], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 8.3e+130], N[ArcTan[N[(v / N[Sqrt[N[(H * -19.6 + N[(v * v), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[ArcTan[1.0], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if v < -1e153

   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 -1e153 < v < 8.29999999999999959e130

   1. Initial program 98.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. 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. +-commutative N/A

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

      3. *-commutative N/A

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

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

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

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

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

      6. metadata-eval N/A

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

      7. metadata-eval N/A

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

      8. *-lowering-*.f64 98.6

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

   4. Applied egg-rr 98.6%

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

   if 8.29999999999999959e130 < v

   1. Initial program 17.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 100.0%

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

Alternative 2: 89.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq -3.05 \cdot 10^{-51}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 1.7 \cdot 10^{-48}:\\ \;\;\;\;\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 -3.05e-51)
   (atan -1.0)
   (if (<= v 1.7e-48)
     (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 <= -3.05e-51) {
		tmp = atan(-1.0);
	} else if (v <= 1.7e-48) {
		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 <= -3.05e-51)
		tmp = atan(-1.0);
	elseif (v <= 1.7e-48)
		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, -3.05e-51], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 1.7e-48], 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 < -3.05000000000000017e-51

   1. Initial program 50.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 91.1%

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

   if -3.05000000000000017e-51 < v < 1.70000000000000014e-48

   1. Initial program 98.4%

      \[\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 98.4%

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

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

   7. Simplified 85.4%

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

   if 1.70000000000000014e-48 < v

   1. Initial program 52.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 94.8

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

   5. Simplified 94.8%

      \[\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 90.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq -3.05 \cdot 10^{-51}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 1.7 \cdot 10^{-48}:\\ \;\;\;\;\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.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq -1.28 \cdot 10^{-54}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 8.6 \cdot 10^{-47}:\\ \;\;\;\;\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 -1.28e-54)
   (atan -1.0)
   (if (<= v 8.6e-47)
     (atan (* v (sqrt (/ -0.05102040816326531 H))))
     (atan 1.0))))

C

double code(double v, double H) {
	double tmp;
	if (v <= -1.28e-54) {
		tmp = atan(-1.0);
	} else if (v <= 8.6e-47) {
		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 <= (-1.28d-54)) then
        tmp = atan((-1.0d0))
    else if (v <= 8.6d-47) 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 <= -1.28e-54) {
		tmp = Math.atan(-1.0);
	} else if (v <= 8.6e-47) {
		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 <= -1.28e-54:
		tmp = math.atan(-1.0)
	elif v <= 8.6e-47:
		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 <= -1.28e-54)
		tmp = atan(-1.0);
	elseif (v <= 8.6e-47)
		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 <= -1.28e-54)
		tmp = atan(-1.0);
	elseif (v <= 8.6e-47)
		tmp = atan((v * sqrt((-0.05102040816326531 / H))));
	else
		tmp = atan(1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[v_, H_] := If[LessEqual[v, -1.28e-54], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 8.6e-47], 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 < -1.2800000000000001e-54

   1. Initial program 50.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 91.1%

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

   if -1.2800000000000001e-54 < v < 8.5999999999999995e-47

   1. Initial program 98.4%

      \[\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 98.4%

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

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

   7. Simplified 85.4%

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

   if 8.5999999999999995e-47 < v

   1. Initial program 52.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 94.6%

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

4. Final simplification 90.6%

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

Alternative 4: 68.1% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (v H) :precision binary64 (if (<= v 3e-303) (atan -1.0) (atan 1.0)))

C

double code(double v, double H) {
	double tmp;
	if (v <= 3e-303) {
		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 <= 3d-303) 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 <= 3e-303) {
		tmp = Math.atan(-1.0);
	} else {
		tmp = Math.atan(1.0);
	}
	return tmp;
}

Python

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

Julia

function code(v, H)
	tmp = 0.0
	if (v <= 3e-303)
		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 <= 3e-303)
		tmp = atan(-1.0);
	else
		tmp = atan(1.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if v < 3.00000000000000028e-303

   1. Initial program 63.2%

      \[\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 72.7%

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

   if 3.00000000000000028e-303 < 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 69.7%

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

Alternative 5: 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 65.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 36.2%

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

Reproduce

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