Optimal throwing angle

Percentage Accurate: 68.2% → 99.7%

Time: 2.6s

Alternatives: 6

Speedup: 0.9×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(v, h)
use fmin_fmax_functions
    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: 68.2% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(v, h)
use fmin_fmax_functions
    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.7% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if v < -5.00000000000000004e154

   1. Initial program 3.1%

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

   2. Taylor expanded in v around -inf

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

   4. Applied rewrites 100.0%

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

   if -5.00000000000000004e154 < v < 5.0000000000000002e136

   1. Initial program 99.6%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. pow2 N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. pow2 N/A

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

      8. metadata-eval N/A

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

      9. metadata-eval N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-*.f64 99.6

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

   3. Applied rewrites 99.6%

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

   if 5.0000000000000002e136 < v

   1. Initial program 15.8%

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

   2. Taylor expanded in v around inf

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

   4. Applied rewrites 99.8%

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

Alternative 2: 88.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (v H)
 :precision binary64
 (if (<= v -4.8e-83)
   (atan -1.0)
   (if (<= v 20000000.0)
     (atan (/ v (sqrt (* -19.6 H))))
     (atan (/ v (fma (/ H v) -9.8 v))))))

C

double code(double v, double H) {
	double tmp;
	if (v <= -4.8e-83) {
		tmp = atan(-1.0);
	} else if (v <= 20000000.0) {
		tmp = atan((v / sqrt((-19.6 * H))));
	} else {
		tmp = atan((v / fma((H / v), -9.8, v)));
	}
	return tmp;
}

Julia

function code(v, H)
	tmp = 0.0
	if (v <= -4.8e-83)
		tmp = atan(-1.0);
	elseif (v <= 20000000.0)
		tmp = atan(Float64(v / sqrt(Float64(-19.6 * H))));
	else
		tmp = atan(Float64(v / fma(Float64(H / v), -9.8, v)));
	end
	return tmp
end

Wolfram

code[v_, H_] := If[LessEqual[v, -4.8e-83], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 20000000.0], N[ArcTan[N[(v / N[Sqrt[N[(-19.6 * H), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[ArcTan[N[(v / N[(N[(H / v), $MachinePrecision] * -9.8 + v), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if v < -4.8000000000000002e-83

   1. Initial program 57.7%

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

   2. Taylor expanded in v around -inf

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

   4. Applied rewrites 85.6%

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

   if -4.8000000000000002e-83 < v < 2e7

   1. Initial program 99.6%

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

   2. Taylor expanded in v around 0

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

      1. lower-*.f64 84.2

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

   4. Applied rewrites 84.2%

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

   if 2e7 < v

   1. Initial program 48.9%

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

   2. Taylor expanded in H around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 94.6

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

   4. Applied rewrites 94.6%

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

Alternative 3: 87.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq -4.8 \cdot 10^{-83}:\\ \;\;\;\;\tan^{-1} -1\\ \mathbf{elif}\;v \leq 20000000:\\ \;\;\;\;\tan^{-1} \left(\frac{v}{\sqrt{-19.6 \cdot H}}\right)\\ \mathbf{else}:\\ \;\;\;\;\tan^{-1} 1\\ \end{array} \end{array} \]

FPCore

(FPCore (v H)
 :precision binary64
 (if (<= v -4.8e-83)
   (atan -1.0)
   (if (<= v 20000000.0) (atan (/ v (sqrt (* -19.6 H)))) (atan 1.0))))

C

double code(double v, double H) {
	double tmp;
	if (v <= -4.8e-83) {
		tmp = atan(-1.0);
	} else if (v <= 20000000.0) {
		tmp = atan((v / sqrt((-19.6 * H))));
	} else {
		tmp = atan(1.0);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(v, h)
use fmin_fmax_functions
    real(8), intent (in) :: v
    real(8), intent (in) :: h
    real(8) :: tmp
    if (v <= (-4.8d-83)) then
        tmp = atan((-1.0d0))
    else if (v <= 20000000.0d0) then
        tmp = atan((v / sqrt(((-19.6d0) * 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 <= -4.8e-83) {
		tmp = Math.atan(-1.0);
	} else if (v <= 20000000.0) {
		tmp = Math.atan((v / Math.sqrt((-19.6 * H))));
	} else {
		tmp = Math.atan(1.0);
	}
	return tmp;
}

Python

def code(v, H):
	tmp = 0
	if v <= -4.8e-83:
		tmp = math.atan(-1.0)
	elif v <= 20000000.0:
		tmp = math.atan((v / math.sqrt((-19.6 * H))))
	else:
		tmp = math.atan(1.0)
	return tmp

Julia

function code(v, H)
	tmp = 0.0
	if (v <= -4.8e-83)
		tmp = atan(-1.0);
	elseif (v <= 20000000.0)
		tmp = atan(Float64(v / sqrt(Float64(-19.6 * H))));
	else
		tmp = atan(1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(v, H)
	tmp = 0.0;
	if (v <= -4.8e-83)
		tmp = atan(-1.0);
	elseif (v <= 20000000.0)
		tmp = atan((v / sqrt((-19.6 * H))));
	else
		tmp = atan(1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[v_, H_] := If[LessEqual[v, -4.8e-83], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 20000000.0], N[ArcTan[N[(v / N[Sqrt[N[(-19.6 * H), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[ArcTan[1.0], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if v < -4.8000000000000002e-83

   1. Initial program 57.7%

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

   2. Taylor expanded in v around -inf

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

   4. Applied rewrites 85.6%

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

   if -4.8000000000000002e-83 < v < 2e7

   1. Initial program 99.6%

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

   2. Taylor expanded in v around 0

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

      1. lower-*.f64 84.2

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

   4. Applied rewrites 84.2%

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

   if 2e7 < v

   1. Initial program 48.9%

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

   2. Taylor expanded in v around inf

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

   4. Applied rewrites 94.4%

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

Alternative 4: 87.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (v H)
 :precision binary64
 (if (<= v -4.8e-83)
   (atan -1.0)
   (if (<= v 20000000.0)
     (atan (* (sqrt (/ -0.05102040816326531 H)) v))
     (atan 1.0))))

C

double code(double v, double H) {
	double tmp;
	if (v <= -4.8e-83) {
		tmp = atan(-1.0);
	} else if (v <= 20000000.0) {
		tmp = atan((sqrt((-0.05102040816326531 / H)) * v));
	} else {
		tmp = atan(1.0);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(v, h)
use fmin_fmax_functions
    real(8), intent (in) :: v
    real(8), intent (in) :: h
    real(8) :: tmp
    if (v <= (-4.8d-83)) then
        tmp = atan((-1.0d0))
    else if (v <= 20000000.0d0) then
        tmp = atan((sqrt(((-0.05102040816326531d0) / h)) * v))
    else
        tmp = atan(1.0d0)
    end if
    code = tmp
end function

Java

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

Python

def code(v, H):
	tmp = 0
	if v <= -4.8e-83:
		tmp = math.atan(-1.0)
	elif v <= 20000000.0:
		tmp = math.atan((math.sqrt((-0.05102040816326531 / H)) * v))
	else:
		tmp = math.atan(1.0)
	return tmp

Julia

function code(v, H)
	tmp = 0.0
	if (v <= -4.8e-83)
		tmp = atan(-1.0);
	elseif (v <= 20000000.0)
		tmp = atan(Float64(sqrt(Float64(-0.05102040816326531 / H)) * v));
	else
		tmp = atan(1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(v, H)
	tmp = 0.0;
	if (v <= -4.8e-83)
		tmp = atan(-1.0);
	elseif (v <= 20000000.0)
		tmp = atan((sqrt((-0.05102040816326531 / H)) * v));
	else
		tmp = atan(1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[v_, H_] := If[LessEqual[v, -4.8e-83], N[ArcTan[-1.0], $MachinePrecision], If[LessEqual[v, 20000000.0], N[ArcTan[N[(N[Sqrt[N[(-0.05102040816326531 / H), $MachinePrecision]], $MachinePrecision] * v), $MachinePrecision]], $MachinePrecision], N[ArcTan[1.0], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if v < -4.8000000000000002e-83

   1. Initial program 57.7%

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

   2. Taylor expanded in v around -inf

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

   4. Applied rewrites 85.6%

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

   if -4.8000000000000002e-83 < v < 2e7

   1. Initial program 99.6%

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

   2. Taylor expanded in v around 0

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

      1. metadata-eval N/A

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

      2. fp-cancel-sub-sign-inv N/A

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

      3. metadata-eval N/A

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

      4. metadata-eval N/A

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

      5. +-commutative N/A

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

      6. lower-atan.f64 N/A

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

      7. *-commutative N/A

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

   4. Applied rewrites 99.5%

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

   6. Applied rewrites 99.5%

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

   7. Taylor expanded in v around 0

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

      1. lower-/.f64 84.3

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

   9. Applied rewrites 84.3%

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

   if 2e7 < v

   1. Initial program 48.9%

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

   2. Taylor expanded in v around inf

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

   4. Applied rewrites 94.4%

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

Alternative 5: 67.6% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (v H) :precision binary64 (if (<= v -7.5e-291) (atan -1.0) (atan 1.0)))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(v, h)
use fmin_fmax_functions
    real(8), intent (in) :: v
    real(8), intent (in) :: h
    real(8) :: tmp
    if (v <= (-7.5d-291)) 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 <= -7.5e-291) {
		tmp = Math.atan(-1.0);
	} else {
		tmp = Math.atan(1.0);
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if v < -7.49999999999999981e-291

   1. Initial program 67.3%

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

   2. Taylor expanded in v around -inf

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

   4. Applied rewrites 68.9%

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

   if -7.49999999999999981e-291 < v

   1. Initial program 69.0%

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

   2. Taylor expanded in v around inf

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

   4. Applied rewrites 66.3%

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

Alternative 6: 34.6% accurate, 6.5× 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(v, h)
use fmin_fmax_functions
    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 68.2%

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

2. Taylor expanded in v around -inf

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

4. Applied rewrites 34.6%

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

Reproduce

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