Midpoint on a great circle

Percentage Accurate: 98.5% → 98.6%

Time: 30.5s

Alternatives: 19

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (+
  lambda1
  (atan2
   (* (cos phi2) (sin (- lambda1 lambda2)))
   (+ (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos((lambda1 - lambda2)))));
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos((lambda1 - lambda2)))))
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + Math.atan2((Math.cos(phi2) * Math.sin((lambda1 - lambda2))), (Math.cos(phi1) + (Math.cos(phi2) * Math.cos((lambda1 - lambda2)))));
}

Python

def code(lambda1, lambda2, phi1, phi2):
	return lambda1 + math.atan2((math.cos(phi2) * math.sin((lambda1 - lambda2))), (math.cos(phi1) + (math.cos(phi2) * math.cos((lambda1 - lambda2)))))

Julia

function code(lambda1, lambda2, phi1, phi2)
	return Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(lambda1 - lambda2))), Float64(cos(phi1) + Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))
end

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos((lambda1 - lambda2)))));
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 98.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (+
  lambda1
  (atan2
   (* (cos phi2) (sin (- lambda1 lambda2)))
   (+ (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos((lambda1 - lambda2)))));
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos((lambda1 - lambda2)))))
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + Math.atan2((Math.cos(phi2) * Math.sin((lambda1 - lambda2))), (Math.cos(phi1) + (Math.cos(phi2) * Math.cos((lambda1 - lambda2)))));
}

Python

def code(lambda1, lambda2, phi1, phi2):
	return lambda1 + math.atan2((math.cos(phi2) * math.sin((lambda1 - lambda2))), (math.cos(phi1) + (math.cos(phi2) * math.cos((lambda1 - lambda2)))))

Julia

function code(lambda1, lambda2, phi1, phi2)
	return Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(lambda1 - lambda2))), Float64(cos(phi1) + Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))
end

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos((lambda1 - lambda2)))));
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \cos \phi_1\right)} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (+
  lambda1
  (atan2
   (* (cos phi2) (sin (- lambda1 lambda2)))
   (fma (cos phi2) (cos (- lambda1 lambda2)) (cos phi1)))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), fma(cos(phi2), cos((lambda1 - lambda2)), cos(phi1)));
}

Julia

function code(lambda1, lambda2, phi1, phi2)
	return Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(lambda1 - lambda2))), fma(cos(phi2), cos(Float64(lambda1 - lambda2)), cos(phi1))))
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
2. Step-by-step derivation

   1. +-commutative 99.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

   2. fma-define 99.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \cos \phi_1\right)}} \]

3. Simplified 99.4%

   \[\leadsto \color{blue}{\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \cos \phi_1\right)}} \]
4. Add Preprocessing

5. Final simplification 99.4%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \cos \phi_1\right)} \]
6. Add Preprocessing

Alternative 2: 97.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -1600000 \lor \neg \left(\lambda_2 \leq 2 \cdot 10^{-74}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (or (<= lambda2 -1600000.0) (not (<= lambda2 2e-74)))
   (+
    lambda1
    (atan2
     (* (cos phi2) (sin (- lambda2)))
     (+ (cos phi1) (* (cos phi2) (cos lambda2)))))
   (+
    lambda1
    (atan2
     (* (cos phi2) (sin (- lambda1 lambda2)))
     (+ (cos phi2) (cos phi1))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda2 <= -1600000.0) || !(lambda2 <= 2e-74)) {
		tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi1) + (cos(phi2) * cos(lambda2))));
	} else {
		tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi2) + cos(phi1)));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if ((lambda2 <= (-1600000.0d0)) .or. (.not. (lambda2 <= 2d-74))) then
        tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi1) + (cos(phi2) * cos(lambda2))))
    else
        tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi2) + cos(phi1)))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda2 <= -1600000.0) || !(lambda2 <= 2e-74)) {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * Math.sin(-lambda2)), (Math.cos(phi1) + (Math.cos(phi2) * Math.cos(lambda2))));
	} else {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * Math.sin((lambda1 - lambda2))), (Math.cos(phi2) + Math.cos(phi1)));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	tmp = 0
	if (lambda2 <= -1600000.0) or not (lambda2 <= 2e-74):
		tmp = lambda1 + math.atan2((math.cos(phi2) * math.sin(-lambda2)), (math.cos(phi1) + (math.cos(phi2) * math.cos(lambda2))))
	else:
		tmp = lambda1 + math.atan2((math.cos(phi2) * math.sin((lambda1 - lambda2))), (math.cos(phi2) + math.cos(phi1)))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if ((lambda2 <= -1600000.0) || !(lambda2 <= 2e-74))
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(-lambda2))), Float64(cos(phi1) + Float64(cos(phi2) * cos(lambda2)))));
	else
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(lambda1 - lambda2))), Float64(cos(phi2) + cos(phi1))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if ((lambda2 <= -1600000.0) || ~((lambda2 <= 2e-74)))
		tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi1) + (cos(phi2) * cos(lambda2))));
	else
		tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi2) + cos(phi1)));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[lambda2, -1600000.0], N[Not[LessEqual[lambda2, 2e-74]], $MachinePrecision]], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[(-lambda2)], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < -1.6e6 or 1.99999999999999992e-74 < lambda2

   1. Initial program 99.1%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 99.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 99.1%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 99.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda1 around 0 99.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2} \]

   if -1.6e6 < lambda2 < 1.99999999999999992e-74

   1. Initial program 99.7%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 98.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 98.1%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 98.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 98.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 98.1%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 98.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -1600000 \lor \neg \left(\lambda_2 \leq 2 \cdot 10^{-74}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 87.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\cos \phi_1 \leq 0.99995:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_2 \cdot \cos \lambda_2 + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (cos phi2) (sin (- lambda1 lambda2)))))
   (if (<= (cos phi1) 0.99995)
     (+ lambda1 (atan2 t_0 (+ (cos phi2) (cos phi1))))
     (+ lambda1 (atan2 t_0 (+ (* (cos phi2) (cos lambda2)) 1.0))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos(phi2) * sin((lambda1 - lambda2));
	double tmp;
	if (cos(phi1) <= 0.99995) {
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	} else {
		tmp = lambda1 + atan2(t_0, ((cos(phi2) * cos(lambda2)) + 1.0));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = cos(phi2) * sin((lambda1 - lambda2))
    if (cos(phi1) <= 0.99995d0) then
        tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)))
    else
        tmp = lambda1 + atan2(t_0, ((cos(phi2) * cos(lambda2)) + 1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos(phi2) * Math.sin((lambda1 - lambda2));
	double tmp;
	if (Math.cos(phi1) <= 0.99995) {
		tmp = lambda1 + Math.atan2(t_0, (Math.cos(phi2) + Math.cos(phi1)));
	} else {
		tmp = lambda1 + Math.atan2(t_0, ((Math.cos(phi2) * Math.cos(lambda2)) + 1.0));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = math.cos(phi2) * math.sin((lambda1 - lambda2))
	tmp = 0
	if math.cos(phi1) <= 0.99995:
		tmp = lambda1 + math.atan2(t_0, (math.cos(phi2) + math.cos(phi1)))
	else:
		tmp = lambda1 + math.atan2(t_0, ((math.cos(phi2) * math.cos(lambda2)) + 1.0))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = Float64(cos(phi2) * sin(Float64(lambda1 - lambda2)))
	tmp = 0.0
	if (cos(phi1) <= 0.99995)
		tmp = Float64(lambda1 + atan(t_0, Float64(cos(phi2) + cos(phi1))));
	else
		tmp = Float64(lambda1 + atan(t_0, Float64(Float64(cos(phi2) * cos(lambda2)) + 1.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = cos(phi2) * sin((lambda1 - lambda2));
	tmp = 0.0;
	if (cos(phi1) <= 0.99995)
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	else
		tmp = lambda1 + atan2(t_0, ((cos(phi2) * cos(lambda2)) + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi2], $MachinePrecision] * N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Cos[phi1], $MachinePrecision], 0.99995], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi1) < 0.999950000000000006

   1. Initial program 99.7%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 98.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 98.1%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 98.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 82.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 82.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 82.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   if 0.999950000000000006 < (cos.f64 phi1)

   1. Initial program 99.1%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 99.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 99.1%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 99.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in phi1 around 0 98.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \lambda_2 \cdot \cos \phi_2}} \]
   7. Step-by-step derivation

      1. *-commutative 98.8%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{1 + \color{blue}{\cos \phi_2 \cdot \cos \lambda_2}} \]

   8. Simplified 98.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \phi_2 \cdot \cos \lambda_2}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_1 \leq 0.99995:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 \cdot \cos \lambda_2 + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 88.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\cos \phi_2 \leq 0.999:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_1 + \cos \left(\lambda_2 - \lambda_1\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (cos phi2) (sin (- lambda1 lambda2)))))
   (if (<= (cos phi2) 0.999)
     (+ lambda1 (atan2 t_0 (+ (cos phi2) (cos phi1))))
     (+ lambda1 (atan2 t_0 (+ (cos phi1) (cos (- lambda2 lambda1))))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos(phi2) * sin((lambda1 - lambda2));
	double tmp;
	if (cos(phi2) <= 0.999) {
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	} else {
		tmp = lambda1 + atan2(t_0, (cos(phi1) + cos((lambda2 - lambda1))));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = cos(phi2) * sin((lambda1 - lambda2))
    if (cos(phi2) <= 0.999d0) then
        tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)))
    else
        tmp = lambda1 + atan2(t_0, (cos(phi1) + cos((lambda2 - lambda1))))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos(phi2) * Math.sin((lambda1 - lambda2));
	double tmp;
	if (Math.cos(phi2) <= 0.999) {
		tmp = lambda1 + Math.atan2(t_0, (Math.cos(phi2) + Math.cos(phi1)));
	} else {
		tmp = lambda1 + Math.atan2(t_0, (Math.cos(phi1) + Math.cos((lambda2 - lambda1))));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = math.cos(phi2) * math.sin((lambda1 - lambda2))
	tmp = 0
	if math.cos(phi2) <= 0.999:
		tmp = lambda1 + math.atan2(t_0, (math.cos(phi2) + math.cos(phi1)))
	else:
		tmp = lambda1 + math.atan2(t_0, (math.cos(phi1) + math.cos((lambda2 - lambda1))))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = Float64(cos(phi2) * sin(Float64(lambda1 - lambda2)))
	tmp = 0.0
	if (cos(phi2) <= 0.999)
		tmp = Float64(lambda1 + atan(t_0, Float64(cos(phi2) + cos(phi1))));
	else
		tmp = Float64(lambda1 + atan(t_0, Float64(cos(phi1) + cos(Float64(lambda2 - lambda1)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = cos(phi2) * sin((lambda1 - lambda2));
	tmp = 0.0;
	if (cos(phi2) <= 0.999)
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	else
		tmp = lambda1 + atan2(t_0, (cos(phi1) + cos((lambda2 - lambda1))));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi2], $MachinePrecision] * N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Cos[phi2], $MachinePrecision], 0.999], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[Cos[phi1], $MachinePrecision] + N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi2) < 0.998999999999999999

   1. Initial program 99.1%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 99.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 99.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 99.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 80.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 80.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 80.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   if 0.998999999999999999 < (cos.f64 phi2)

   1. Initial program 99.6%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0 99.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
   4. Step-by-step derivation

      1. +-commutative 99.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

      2. sub-neg 99.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

      3. remove-double-neg 99.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      4. mul-1-neg 99.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      5. distribute-neg-in 99.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

      6. +-commutative 99.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

      7. cos-neg 99.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

      8. mul-1-neg 99.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

      9. unsub-neg 99.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

   5. Simplified 99.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 91.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_2 \leq 0.999:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \left(\lambda_2 - \lambda_1\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 83.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \phi_2 \leq 0.995:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= (cos phi2) 0.995)
   (+
    lambda1
    (atan2 (* (cos phi2) (sin (- lambda2))) (+ (cos phi2) (cos phi1))))
   (+
    lambda1
    (atan2
     (sin (- lambda1 lambda2))
     (+ (cos phi1) (* (cos phi2) (cos lambda2)))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (cos(phi2) <= 0.995) {
		tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi2) + cos(phi1)));
	} else {
		tmp = lambda1 + atan2(sin((lambda1 - lambda2)), (cos(phi1) + (cos(phi2) * cos(lambda2))));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (cos(phi2) <= 0.995d0) then
        tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi2) + cos(phi1)))
    else
        tmp = lambda1 + atan2(sin((lambda1 - lambda2)), (cos(phi1) + (cos(phi2) * cos(lambda2))))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (Math.cos(phi2) <= 0.995) {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * Math.sin(-lambda2)), (Math.cos(phi2) + Math.cos(phi1)));
	} else {
		tmp = lambda1 + Math.atan2(Math.sin((lambda1 - lambda2)), (Math.cos(phi1) + (Math.cos(phi2) * Math.cos(lambda2))));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	tmp = 0
	if math.cos(phi2) <= 0.995:
		tmp = lambda1 + math.atan2((math.cos(phi2) * math.sin(-lambda2)), (math.cos(phi2) + math.cos(phi1)))
	else:
		tmp = lambda1 + math.atan2(math.sin((lambda1 - lambda2)), (math.cos(phi1) + (math.cos(phi2) * math.cos(lambda2))))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (cos(phi2) <= 0.995)
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(-lambda2))), Float64(cos(phi2) + cos(phi1))));
	else
		tmp = Float64(lambda1 + atan(sin(Float64(lambda1 - lambda2)), Float64(cos(phi1) + Float64(cos(phi2) * cos(lambda2)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (cos(phi2) <= 0.995)
		tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi2) + cos(phi1)));
	else
		tmp = lambda1 + atan2(sin((lambda1 - lambda2)), (cos(phi1) + (cos(phi2) * cos(lambda2))));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[N[Cos[phi2], $MachinePrecision], 0.995], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[(-lambda2)], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] / N[(N[Cos[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi2) < 0.994999999999999996

   1. Initial program 99.1%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 99.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 99.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 99.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 79.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 79.8%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 79.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in lambda1 around 0 68.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \color{blue}{\sin \left(-\lambda_2\right)}}{\cos \phi_2 + \cos \phi_1} \]

   if 0.994999999999999996 < (cos.f64 phi2)

   1. Initial program 99.6%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 98.2%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 98.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 98.2%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in phi2 around 0 97.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 85.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_2 \leq 0.995:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 83.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos \phi_2 \leq 0.85:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \lambda_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= (cos phi2) 0.85)
   (+
    lambda1
    (atan2 (* (cos phi2) (sin (- lambda2))) (+ (cos phi2) (cos phi1))))
   (+
    lambda1
    (atan2
     (* (cos phi2) (sin (- lambda1 lambda2)))
     (+ (cos phi1) (cos lambda2))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (cos(phi2) <= 0.85) {
		tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi2) + cos(phi1)));
	} else {
		tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + cos(lambda2)));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (cos(phi2) <= 0.85d0) then
        tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi2) + cos(phi1)))
    else
        tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + cos(lambda2)))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (Math.cos(phi2) <= 0.85) {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * Math.sin(-lambda2)), (Math.cos(phi2) + Math.cos(phi1)));
	} else {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * Math.sin((lambda1 - lambda2))), (Math.cos(phi1) + Math.cos(lambda2)));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	tmp = 0
	if math.cos(phi2) <= 0.85:
		tmp = lambda1 + math.atan2((math.cos(phi2) * math.sin(-lambda2)), (math.cos(phi2) + math.cos(phi1)))
	else:
		tmp = lambda1 + math.atan2((math.cos(phi2) * math.sin((lambda1 - lambda2))), (math.cos(phi1) + math.cos(lambda2)))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (cos(phi2) <= 0.85)
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(-lambda2))), Float64(cos(phi2) + cos(phi1))));
	else
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(lambda1 - lambda2))), Float64(cos(phi1) + cos(lambda2))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (cos(phi2) <= 0.85)
		tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi2) + cos(phi1)));
	else
		tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + cos(lambda2)));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[N[Cos[phi2], $MachinePrecision], 0.85], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[(-lambda2)], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi1], $MachinePrecision] + N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi2) < 0.849999999999999978

   1. Initial program 98.9%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 98.9%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 98.9%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 98.9%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 80.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 80.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 80.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in lambda1 around 0 70.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \color{blue}{\sin \left(-\lambda_2\right)}}{\cos \phi_2 + \cos \phi_1} \]

   if 0.849999999999999978 < (cos.f64 phi2)

   1. Initial program 99.7%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0 94.5%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
   4. Step-by-step derivation

      1. +-commutative 94.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

      2. sub-neg 94.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

      3. remove-double-neg 94.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      4. mul-1-neg 94.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      5. distribute-neg-in 94.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

      6. +-commutative 94.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

      7. cos-neg 94.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

      8. mul-1-neg 94.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

      9. unsub-neg 94.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

   5. Simplified 94.5%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]

   6. Taylor expanded in lambda1 around 0 93.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \lambda_2 + \cos \phi_1}} \]
   7. Step-by-step derivation

      1. +-commutative 93.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \lambda_2}} \]

   8. Simplified 93.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \lambda_2}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 85.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_2 \leq 0.85:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \lambda_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 88.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\cos \phi_2 \leq 0.999:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot t\_0}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (sin (- lambda1 lambda2))))
   (if (<= (cos phi2) 0.999)
     (+ lambda1 (atan2 (* (cos phi2) t_0) (+ (cos phi2) (cos phi1))))
     (+ lambda1 (atan2 t_0 (+ (cos phi1) (* (cos phi2) (cos lambda2))))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = sin((lambda1 - lambda2));
	double tmp;
	if (cos(phi2) <= 0.999) {
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(phi2) + cos(phi1)));
	} else {
		tmp = lambda1 + atan2(t_0, (cos(phi1) + (cos(phi2) * cos(lambda2))));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sin((lambda1 - lambda2))
    if (cos(phi2) <= 0.999d0) then
        tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(phi2) + cos(phi1)))
    else
        tmp = lambda1 + atan2(t_0, (cos(phi1) + (cos(phi2) * cos(lambda2))))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.sin((lambda1 - lambda2));
	double tmp;
	if (Math.cos(phi2) <= 0.999) {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * t_0), (Math.cos(phi2) + Math.cos(phi1)));
	} else {
		tmp = lambda1 + Math.atan2(t_0, (Math.cos(phi1) + (Math.cos(phi2) * Math.cos(lambda2))));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = math.sin((lambda1 - lambda2))
	tmp = 0
	if math.cos(phi2) <= 0.999:
		tmp = lambda1 + math.atan2((math.cos(phi2) * t_0), (math.cos(phi2) + math.cos(phi1)))
	else:
		tmp = lambda1 + math.atan2(t_0, (math.cos(phi1) + (math.cos(phi2) * math.cos(lambda2))))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = sin(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (cos(phi2) <= 0.999)
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * t_0), Float64(cos(phi2) + cos(phi1))));
	else
		tmp = Float64(lambda1 + atan(t_0, Float64(cos(phi1) + Float64(cos(phi2) * cos(lambda2)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = sin((lambda1 - lambda2));
	tmp = 0.0;
	if (cos(phi2) <= 0.999)
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(phi2) + cos(phi1)));
	else
		tmp = lambda1 + atan2(t_0, (cos(phi1) + (cos(phi2) * cos(lambda2))));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Cos[phi2], $MachinePrecision], 0.999], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[Cos[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi2) < 0.998999999999999999

   1. Initial program 99.1%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 99.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 99.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 99.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 80.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 80.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 80.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   if 0.998999999999999999 < (cos.f64 phi2)

   1. Initial program 99.6%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 98.2%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 98.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 98.2%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in phi2 around 0 98.2%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_2 \leq 0.999:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 98.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (+
  lambda1
  (atan2
   (* (cos phi2) (sin (- lambda1 lambda2)))
   (+ (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos((lambda1 - lambda2)))));
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos((lambda1 - lambda2)))))
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + Math.atan2((Math.cos(phi2) * Math.sin((lambda1 - lambda2))), (Math.cos(phi1) + (Math.cos(phi2) * Math.cos((lambda1 - lambda2)))));
}

Python

def code(lambda1, lambda2, phi1, phi2):
	return lambda1 + math.atan2((math.cos(phi2) * math.sin((lambda1 - lambda2))), (math.cos(phi1) + (math.cos(phi2) * math.cos((lambda1 - lambda2)))))

Julia

function code(lambda1, lambda2, phi1, phi2)
	return Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(lambda1 - lambda2))), Float64(cos(phi1) + Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))
end

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos((lambda1 - lambda2)))));
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
2. Add Preprocessing

3. Final simplification 99.4%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
4. Add Preprocessing

Alternative 9: 97.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (+
  lambda1
  (atan2
   (* (cos phi2) (sin (- lambda1 lambda2)))
   (+ (cos phi1) (* (cos phi2) (cos lambda2))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos(lambda2))));
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos(lambda2))))
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + Math.atan2((Math.cos(phi2) * Math.sin((lambda1 - lambda2))), (Math.cos(phi1) + (Math.cos(phi2) * Math.cos(lambda2))));
}

Python

def code(lambda1, lambda2, phi1, phi2):
	return lambda1 + math.atan2((math.cos(phi2) * math.sin((lambda1 - lambda2))), (math.cos(phi1) + (math.cos(phi2) * math.cos(lambda2))))

Julia

function code(lambda1, lambda2, phi1, phi2)
	return Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(lambda1 - lambda2))), Float64(cos(phi1) + Float64(cos(phi2) * cos(lambda2)))))
end

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * cos(lambda2))));
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
2. Add Preprocessing

3. Taylor expanded in lambda1 around 0 98.6%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
4. Step-by-step derivation

   1. cos-neg 98.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

5. Simplified 98.6%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

6. Final simplification 98.6%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2} \]
7. Add Preprocessing

Alternative 10: 80.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \phi_2 + \cos \phi_1\\ t_1 := \cos \phi_2 \cdot \sin \left(-\lambda_2\right)\\ t_2 := \lambda_1 + \tan^{-1}_* \frac{t\_1}{\cos \phi_1 + \cos \lambda_2}\\ \mathbf{if}\;\lambda_2 \leq -1600000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;\lambda_2 \leq -2.6 \cdot 10^{-149}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_1}{t\_0}\\ \mathbf{elif}\;\lambda_2 \leq 1.6 \cdot 10^{-132}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \lambda_1}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (+ (cos phi2) (cos phi1)))
        (t_1 (* (cos phi2) (sin (- lambda2))))
        (t_2 (+ lambda1 (atan2 t_1 (+ (cos phi1) (cos lambda2))))))
   (if (<= lambda2 -1600000.0)
     t_2
     (if (<= lambda2 -2.6e-149)
       (+ lambda1 (atan2 t_1 t_0))
       (if (<= lambda2 1.6e-132)
         (+ lambda1 (atan2 (* (cos phi2) (sin lambda1)) t_0))
         t_2)))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos(phi2) + cos(phi1);
	double t_1 = cos(phi2) * sin(-lambda2);
	double t_2 = lambda1 + atan2(t_1, (cos(phi1) + cos(lambda2)));
	double tmp;
	if (lambda2 <= -1600000.0) {
		tmp = t_2;
	} else if (lambda2 <= -2.6e-149) {
		tmp = lambda1 + atan2(t_1, t_0);
	} else if (lambda2 <= 1.6e-132) {
		tmp = lambda1 + atan2((cos(phi2) * sin(lambda1)), t_0);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_0 = cos(phi2) + cos(phi1)
    t_1 = cos(phi2) * sin(-lambda2)
    t_2 = lambda1 + atan2(t_1, (cos(phi1) + cos(lambda2)))
    if (lambda2 <= (-1600000.0d0)) then
        tmp = t_2
    else if (lambda2 <= (-2.6d-149)) then
        tmp = lambda1 + atan2(t_1, t_0)
    else if (lambda2 <= 1.6d-132) then
        tmp = lambda1 + atan2((cos(phi2) * sin(lambda1)), t_0)
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos(phi2) + Math.cos(phi1);
	double t_1 = Math.cos(phi2) * Math.sin(-lambda2);
	double t_2 = lambda1 + Math.atan2(t_1, (Math.cos(phi1) + Math.cos(lambda2)));
	double tmp;
	if (lambda2 <= -1600000.0) {
		tmp = t_2;
	} else if (lambda2 <= -2.6e-149) {
		tmp = lambda1 + Math.atan2(t_1, t_0);
	} else if (lambda2 <= 1.6e-132) {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * Math.sin(lambda1)), t_0);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = math.cos(phi2) + math.cos(phi1)
	t_1 = math.cos(phi2) * math.sin(-lambda2)
	t_2 = lambda1 + math.atan2(t_1, (math.cos(phi1) + math.cos(lambda2)))
	tmp = 0
	if lambda2 <= -1600000.0:
		tmp = t_2
	elif lambda2 <= -2.6e-149:
		tmp = lambda1 + math.atan2(t_1, t_0)
	elif lambda2 <= 1.6e-132:
		tmp = lambda1 + math.atan2((math.cos(phi2) * math.sin(lambda1)), t_0)
	else:
		tmp = t_2
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = Float64(cos(phi2) + cos(phi1))
	t_1 = Float64(cos(phi2) * sin(Float64(-lambda2)))
	t_2 = Float64(lambda1 + atan(t_1, Float64(cos(phi1) + cos(lambda2))))
	tmp = 0.0
	if (lambda2 <= -1600000.0)
		tmp = t_2;
	elseif (lambda2 <= -2.6e-149)
		tmp = Float64(lambda1 + atan(t_1, t_0));
	elseif (lambda2 <= 1.6e-132)
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * sin(lambda1)), t_0));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = cos(phi2) + cos(phi1);
	t_1 = cos(phi2) * sin(-lambda2);
	t_2 = lambda1 + atan2(t_1, (cos(phi1) + cos(lambda2)));
	tmp = 0.0;
	if (lambda2 <= -1600000.0)
		tmp = t_2;
	elseif (lambda2 <= -2.6e-149)
		tmp = lambda1 + atan2(t_1, t_0);
	elseif (lambda2 <= 1.6e-132)
		tmp = lambda1 + atan2((cos(phi2) * sin(lambda1)), t_0);
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi2], $MachinePrecision] * N[Sin[(-lambda2)], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(lambda1 + N[ArcTan[t$95$1 / N[(N[Cos[phi1], $MachinePrecision] + N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, -1600000.0], t$95$2, If[LessEqual[lambda2, -2.6e-149], N[(lambda1 + N[ArcTan[t$95$1 / t$95$0], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 1.6e-132], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] / t$95$0], $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]

Derivation

1. Split input into 3 regimes

2. if lambda2 < -1.6e6 or 1.6000000000000001e-132 < lambda2

   1. Initial program 99.1%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 99.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 99.1%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 99.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda1 around 0 98.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2} \]

   7. Taylor expanded in phi2 around 0 81.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_1 + \color{blue}{\cos \lambda_2}} \]

   if -1.6e6 < lambda2 < -2.59999999999999999e-149

   1. Initial program 99.9%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 98.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 98.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 98.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 98.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 98.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 98.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in lambda1 around 0 93.9%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \color{blue}{\sin \left(-\lambda_2\right)}}{\cos \phi_2 + \cos \phi_1} \]

   if -2.59999999999999999e-149 < lambda2 < 1.6000000000000001e-132

   1. Initial program 99.6%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 97.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 97.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 97.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 97.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 97.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 97.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in lambda2 around 0 90.5%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \color{blue}{\sin \lambda_1}}{\cos \phi_2 + \cos \phi_1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 86.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -1600000:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_1 + \cos \lambda_2}\\ \mathbf{elif}\;\lambda_2 \leq -2.6 \cdot 10^{-149}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{elif}\;\lambda_2 \leq 1.6 \cdot 10^{-132}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \lambda_1}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_1 + \cos \lambda_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 77.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -2.6 \cdot 10^{-132} \lor \neg \left(\lambda_2 \leq 3 \cdot 10^{-159}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(-\lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \lambda_1}{\cos \phi_2 + \cos \phi_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (or (<= lambda2 -2.6e-132) (not (<= lambda2 3e-159)))
   (+
    lambda1
    (atan2 (sin (- lambda2)) (+ (cos phi1) (* (cos phi2) (cos lambda2)))))
   (+ lambda1 (atan2 (* (cos phi2) (sin lambda1)) (+ (cos phi2) (cos phi1))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda2 <= -2.6e-132) || !(lambda2 <= 3e-159)) {
		tmp = lambda1 + atan2(sin(-lambda2), (cos(phi1) + (cos(phi2) * cos(lambda2))));
	} else {
		tmp = lambda1 + atan2((cos(phi2) * sin(lambda1)), (cos(phi2) + cos(phi1)));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if ((lambda2 <= (-2.6d-132)) .or. (.not. (lambda2 <= 3d-159))) then
        tmp = lambda1 + atan2(sin(-lambda2), (cos(phi1) + (cos(phi2) * cos(lambda2))))
    else
        tmp = lambda1 + atan2((cos(phi2) * sin(lambda1)), (cos(phi2) + cos(phi1)))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda2 <= -2.6e-132) || !(lambda2 <= 3e-159)) {
		tmp = lambda1 + Math.atan2(Math.sin(-lambda2), (Math.cos(phi1) + (Math.cos(phi2) * Math.cos(lambda2))));
	} else {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * Math.sin(lambda1)), (Math.cos(phi2) + Math.cos(phi1)));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	tmp = 0
	if (lambda2 <= -2.6e-132) or not (lambda2 <= 3e-159):
		tmp = lambda1 + math.atan2(math.sin(-lambda2), (math.cos(phi1) + (math.cos(phi2) * math.cos(lambda2))))
	else:
		tmp = lambda1 + math.atan2((math.cos(phi2) * math.sin(lambda1)), (math.cos(phi2) + math.cos(phi1)))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if ((lambda2 <= -2.6e-132) || !(lambda2 <= 3e-159))
		tmp = Float64(lambda1 + atan(sin(Float64(-lambda2)), Float64(cos(phi1) + Float64(cos(phi2) * cos(lambda2)))));
	else
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * sin(lambda1)), Float64(cos(phi2) + cos(phi1))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if ((lambda2 <= -2.6e-132) || ~((lambda2 <= 3e-159)))
		tmp = lambda1 + atan2(sin(-lambda2), (cos(phi1) + (cos(phi2) * cos(lambda2))));
	else
		tmp = lambda1 + atan2((cos(phi2) * sin(lambda1)), (cos(phi2) + cos(phi1)));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[lambda2, -2.6e-132], N[Not[LessEqual[lambda2, 3e-159]], $MachinePrecision]], N[(lambda1 + N[ArcTan[N[Sin[(-lambda2)], $MachinePrecision] / N[(N[Cos[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < -2.6000000000000001e-132 or 3.00000000000000009e-159 < lambda2

   1. Initial program 99.3%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 99.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 99.1%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 99.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda1 around 0 96.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2} \]

   7. Taylor expanded in phi2 around 0 80.5%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(-\lambda_2\right)}}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2} \]

   if -2.6000000000000001e-132 < lambda2 < 3.00000000000000009e-159

   1. Initial program 99.6%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 97.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 97.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 97.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 97.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 97.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 97.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in lambda2 around 0 90.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \color{blue}{\sin \lambda_1}}{\cos \phi_2 + \cos \phi_1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -2.6 \cdot 10^{-132} \lor \neg \left(\lambda_2 \leq 3 \cdot 10^{-159}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(-\lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \lambda_1}{\cos \phi_2 + \cos \phi_1}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 79.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -5.2 \cdot 10^{-110} \lor \neg \left(\lambda_2 \leq 2.45 \cdot 10^{-132}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_1 + \cos \lambda_2}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \lambda_1}{\cos \phi_2 + \cos \phi_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (or (<= lambda2 -5.2e-110) (not (<= lambda2 2.45e-132)))
   (+
    lambda1
    (atan2 (* (cos phi2) (sin (- lambda2))) (+ (cos phi1) (cos lambda2))))
   (+ lambda1 (atan2 (* (cos phi2) (sin lambda1)) (+ (cos phi2) (cos phi1))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda2 <= -5.2e-110) || !(lambda2 <= 2.45e-132)) {
		tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi1) + cos(lambda2)));
	} else {
		tmp = lambda1 + atan2((cos(phi2) * sin(lambda1)), (cos(phi2) + cos(phi1)));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if ((lambda2 <= (-5.2d-110)) .or. (.not. (lambda2 <= 2.45d-132))) then
        tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi1) + cos(lambda2)))
    else
        tmp = lambda1 + atan2((cos(phi2) * sin(lambda1)), (cos(phi2) + cos(phi1)))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda2 <= -5.2e-110) || !(lambda2 <= 2.45e-132)) {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * Math.sin(-lambda2)), (Math.cos(phi1) + Math.cos(lambda2)));
	} else {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * Math.sin(lambda1)), (Math.cos(phi2) + Math.cos(phi1)));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	tmp = 0
	if (lambda2 <= -5.2e-110) or not (lambda2 <= 2.45e-132):
		tmp = lambda1 + math.atan2((math.cos(phi2) * math.sin(-lambda2)), (math.cos(phi1) + math.cos(lambda2)))
	else:
		tmp = lambda1 + math.atan2((math.cos(phi2) * math.sin(lambda1)), (math.cos(phi2) + math.cos(phi1)))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if ((lambda2 <= -5.2e-110) || !(lambda2 <= 2.45e-132))
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * sin(Float64(-lambda2))), Float64(cos(phi1) + cos(lambda2))));
	else
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * sin(lambda1)), Float64(cos(phi2) + cos(phi1))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if ((lambda2 <= -5.2e-110) || ~((lambda2 <= 2.45e-132)))
		tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi1) + cos(lambda2)));
	else
		tmp = lambda1 + atan2((cos(phi2) * sin(lambda1)), (cos(phi2) + cos(phi1)));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[lambda2, -5.2e-110], N[Not[LessEqual[lambda2, 2.45e-132]], $MachinePrecision]], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[(-lambda2)], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi1], $MachinePrecision] + N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < -5.19999999999999979e-110 or 2.4499999999999999e-132 < lambda2

   1. Initial program 99.3%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 99.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 99.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 99.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda1 around 0 97.9%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2} \]

   7. Taylor expanded in phi2 around 0 80.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_1 + \color{blue}{\cos \lambda_2}} \]

   if -5.19999999999999979e-110 < lambda2 < 2.4499999999999999e-132

   1. Initial program 99.7%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 97.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 97.7%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 97.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 97.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 97.7%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 97.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in lambda2 around 0 89.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \color{blue}{\sin \lambda_1}}{\cos \phi_2 + \cos \phi_1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -5.2 \cdot 10^{-110} \lor \neg \left(\lambda_2 \leq 2.45 \cdot 10^{-132}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(-\lambda_2\right)}{\cos \phi_1 + \cos \lambda_2}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \lambda_1}{\cos \phi_2 + \cos \phi_1}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 67.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\cos \phi_1 \leq 1:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot t\_0}{\cos \left(\lambda_2 - \lambda_1\right) + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (sin (- lambda1 lambda2))))
   (if (<= (cos phi1) 1.0)
     (+ lambda1 (atan2 t_0 (+ (cos phi2) (cos phi1))))
     (+
      lambda1
      (atan2 (* (cos phi2) t_0) (+ (cos (- lambda2 lambda1)) 1.0))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = sin((lambda1 - lambda2));
	double tmp;
	if (cos(phi1) <= 1.0) {
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	} else {
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos((lambda2 - lambda1)) + 1.0));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sin((lambda1 - lambda2))
    if (cos(phi1) <= 1.0d0) then
        tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)))
    else
        tmp = lambda1 + atan2((cos(phi2) * t_0), (cos((lambda2 - lambda1)) + 1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.sin((lambda1 - lambda2));
	double tmp;
	if (Math.cos(phi1) <= 1.0) {
		tmp = lambda1 + Math.atan2(t_0, (Math.cos(phi2) + Math.cos(phi1)));
	} else {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * t_0), (Math.cos((lambda2 - lambda1)) + 1.0));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = math.sin((lambda1 - lambda2))
	tmp = 0
	if math.cos(phi1) <= 1.0:
		tmp = lambda1 + math.atan2(t_0, (math.cos(phi2) + math.cos(phi1)))
	else:
		tmp = lambda1 + math.atan2((math.cos(phi2) * t_0), (math.cos((lambda2 - lambda1)) + 1.0))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = sin(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (cos(phi1) <= 1.0)
		tmp = Float64(lambda1 + atan(t_0, Float64(cos(phi2) + cos(phi1))));
	else
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * t_0), Float64(cos(Float64(lambda2 - lambda1)) + 1.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = sin((lambda1 - lambda2));
	tmp = 0.0;
	if (cos(phi1) <= 1.0)
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	else
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos((lambda2 - lambda1)) + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Cos[phi1], $MachinePrecision], 1.0], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] / N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi1) < 1

   1. Initial program 99.4%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 98.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 98.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 98.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 81.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 81.8%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 81.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in phi2 around 0 72.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{\cos \phi_2 + \cos \phi_1} \]

   if 1 < (cos.f64 phi1)

   1. Initial program 99.4%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
   4. Step-by-step derivation

      1. +-commutative 81.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

      2. sub-neg 81.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

      3. remove-double-neg 81.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      4. mul-1-neg 81.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      5. distribute-neg-in 81.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

      6. +-commutative 81.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

      7. cos-neg 81.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

      8. mul-1-neg 81.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

      9. unsub-neg 81.0%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

   5. Simplified 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]

   6. Taylor expanded in phi1 around 0 71.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \left(\lambda_2 - \lambda_1\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 72.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_1 \leq 1:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 - \lambda_1\right) + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 67.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\cos \phi_1 \leq 1:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot t\_0}{\cos \phi_2 + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (sin (- lambda1 lambda2))))
   (if (<= (cos phi1) 1.0)
     (+ lambda1 (atan2 t_0 (+ (cos phi2) (cos phi1))))
     (+ lambda1 (atan2 (* (cos phi2) t_0) (+ (cos phi2) 1.0))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = sin((lambda1 - lambda2));
	double tmp;
	if (cos(phi1) <= 1.0) {
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	} else {
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(phi2) + 1.0));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sin((lambda1 - lambda2))
    if (cos(phi1) <= 1.0d0) then
        tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)))
    else
        tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(phi2) + 1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.sin((lambda1 - lambda2));
	double tmp;
	if (Math.cos(phi1) <= 1.0) {
		tmp = lambda1 + Math.atan2(t_0, (Math.cos(phi2) + Math.cos(phi1)));
	} else {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * t_0), (Math.cos(phi2) + 1.0));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = math.sin((lambda1 - lambda2))
	tmp = 0
	if math.cos(phi1) <= 1.0:
		tmp = lambda1 + math.atan2(t_0, (math.cos(phi2) + math.cos(phi1)))
	else:
		tmp = lambda1 + math.atan2((math.cos(phi2) * t_0), (math.cos(phi2) + 1.0))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = sin(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (cos(phi1) <= 1.0)
		tmp = Float64(lambda1 + atan(t_0, Float64(cos(phi2) + cos(phi1))));
	else
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * t_0), Float64(cos(phi2) + 1.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = sin((lambda1 - lambda2));
	tmp = 0.0;
	if (cos(phi1) <= 1.0)
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	else
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(phi2) + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Cos[phi1], $MachinePrecision], 1.0], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] / N[(N[Cos[phi2], $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi1) < 1

   1. Initial program 99.4%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 98.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 98.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 98.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 81.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 81.8%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 81.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in phi2 around 0 72.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{\cos \phi_2 + \cos \phi_1} \]

   if 1 < (cos.f64 phi1)

   1. Initial program 99.4%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 98.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 98.6%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 98.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 81.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 81.8%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 81.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in phi1 around 0 71.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \phi_2}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 72.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_1 \leq 1:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 69.1% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\phi_1 \leq 2.9 \cdot 10^{-21}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \left(\lambda_2 - \lambda_1\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_2 + \cos \phi_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (sin (- lambda1 lambda2))))
   (if (<= phi1 2.9e-21)
     (+ lambda1 (atan2 t_0 (+ (cos (- lambda2 lambda1)) 1.0)))
     (+ lambda1 (atan2 t_0 (+ (cos phi2) (cos phi1)))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = sin((lambda1 - lambda2));
	double tmp;
	if (phi1 <= 2.9e-21) {
		tmp = lambda1 + atan2(t_0, (cos((lambda2 - lambda1)) + 1.0));
	} else {
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sin((lambda1 - lambda2))
    if (phi1 <= 2.9d-21) then
        tmp = lambda1 + atan2(t_0, (cos((lambda2 - lambda1)) + 1.0d0))
    else
        tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.sin((lambda1 - lambda2));
	double tmp;
	if (phi1 <= 2.9e-21) {
		tmp = lambda1 + Math.atan2(t_0, (Math.cos((lambda2 - lambda1)) + 1.0));
	} else {
		tmp = lambda1 + Math.atan2(t_0, (Math.cos(phi2) + Math.cos(phi1)));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = math.sin((lambda1 - lambda2))
	tmp = 0
	if phi1 <= 2.9e-21:
		tmp = lambda1 + math.atan2(t_0, (math.cos((lambda2 - lambda1)) + 1.0))
	else:
		tmp = lambda1 + math.atan2(t_0, (math.cos(phi2) + math.cos(phi1)))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = sin(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (phi1 <= 2.9e-21)
		tmp = Float64(lambda1 + atan(t_0, Float64(cos(Float64(lambda2 - lambda1)) + 1.0)));
	else
		tmp = Float64(lambda1 + atan(t_0, Float64(cos(phi2) + cos(phi1))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = sin((lambda1 - lambda2));
	tmp = 0.0;
	if (phi1 <= 2.9e-21)
		tmp = lambda1 + atan2(t_0, (cos((lambda2 - lambda1)) + 1.0));
	else
		tmp = lambda1 + atan2(t_0, (cos(phi2) + cos(phi1)));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, 2.9e-21], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[Cos[phi2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi1 < 2.9e-21

   1. Initial program 99.3%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0 83.2%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
   4. Step-by-step derivation

      1. +-commutative 83.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

      2. sub-neg 83.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

      3. remove-double-neg 83.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      4. mul-1-neg 83.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      5. distribute-neg-in 83.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

      6. +-commutative 83.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

      7. cos-neg 83.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

      8. mul-1-neg 83.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

      9. unsub-neg 83.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

   5. Simplified 83.2%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]

   6. Taylor expanded in phi1 around 0 75.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \left(\lambda_2 - \lambda_1\right)}} \]

   7. Taylor expanded in phi2 around 0 74.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

   if 2.9e-21 < phi1

   1. Initial program 99.6%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0 99.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \left(-\lambda_2\right)}} \]
   4. Step-by-step derivation

      1. cos-neg 99.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   5. Simplified 99.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \color{blue}{\cos \lambda_2}} \]

   6. Taylor expanded in lambda2 around 0 84.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \phi_2}} \]
   7. Step-by-step derivation

      1. +-commutative 84.8%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   8. Simplified 84.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_2 + \cos \phi_1}} \]

   9. Taylor expanded in phi2 around 0 74.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{\cos \phi_2 + \cos \phi_1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 74.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq 2.9 \cdot 10^{-21}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 - \lambda_1\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_2 + \cos \phi_1}\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 64.8% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(\lambda_2 - \lambda_1\right) + 1\\ \mathbf{if}\;\lambda_2 \leq -2.35 \cdot 10^{-119} \lor \neg \left(\lambda_2 \leq 3.4 \cdot 10^{-159}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(-\lambda_2\right)}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \lambda_1}{t\_0}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (+ (cos (- lambda2 lambda1)) 1.0)))
   (if (or (<= lambda2 -2.35e-119) (not (<= lambda2 3.4e-159)))
     (+ lambda1 (atan2 (sin (- lambda2)) t_0))
     (+ lambda1 (atan2 (sin lambda1) t_0)))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos((lambda2 - lambda1)) + 1.0;
	double tmp;
	if ((lambda2 <= -2.35e-119) || !(lambda2 <= 3.4e-159)) {
		tmp = lambda1 + atan2(sin(-lambda2), t_0);
	} else {
		tmp = lambda1 + atan2(sin(lambda1), t_0);
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = cos((lambda2 - lambda1)) + 1.0d0
    if ((lambda2 <= (-2.35d-119)) .or. (.not. (lambda2 <= 3.4d-159))) then
        tmp = lambda1 + atan2(sin(-lambda2), t_0)
    else
        tmp = lambda1 + atan2(sin(lambda1), t_0)
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos((lambda2 - lambda1)) + 1.0;
	double tmp;
	if ((lambda2 <= -2.35e-119) || !(lambda2 <= 3.4e-159)) {
		tmp = lambda1 + Math.atan2(Math.sin(-lambda2), t_0);
	} else {
		tmp = lambda1 + Math.atan2(Math.sin(lambda1), t_0);
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((lambda2 - lambda1)) + 1.0
	tmp = 0
	if (lambda2 <= -2.35e-119) or not (lambda2 <= 3.4e-159):
		tmp = lambda1 + math.atan2(math.sin(-lambda2), t_0)
	else:
		tmp = lambda1 + math.atan2(math.sin(lambda1), t_0)
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = Float64(cos(Float64(lambda2 - lambda1)) + 1.0)
	tmp = 0.0
	if ((lambda2 <= -2.35e-119) || !(lambda2 <= 3.4e-159))
		tmp = Float64(lambda1 + atan(sin(Float64(-lambda2)), t_0));
	else
		tmp = Float64(lambda1 + atan(sin(lambda1), t_0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = cos((lambda2 - lambda1)) + 1.0;
	tmp = 0.0;
	if ((lambda2 <= -2.35e-119) || ~((lambda2 <= 3.4e-159)))
		tmp = lambda1 + atan2(sin(-lambda2), t_0);
	else
		tmp = lambda1 + atan2(sin(lambda1), t_0);
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]}, If[Or[LessEqual[lambda2, -2.35e-119], N[Not[LessEqual[lambda2, 3.4e-159]], $MachinePrecision]], N[(lambda1 + N[ArcTan[N[Sin[(-lambda2)], $MachinePrecision] / t$95$0], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[N[Sin[lambda1], $MachinePrecision] / t$95$0], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < -2.35000000000000001e-119 or 3.39999999999999984e-159 < lambda2

   1. Initial program 99.3%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0 81.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
   4. Step-by-step derivation

      1. +-commutative 81.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

      2. sub-neg 81.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

      3. remove-double-neg 81.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      4. mul-1-neg 81.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      5. distribute-neg-in 81.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

      6. +-commutative 81.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

      7. cos-neg 81.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

      8. mul-1-neg 81.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

      9. unsub-neg 81.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

   5. Simplified 81.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]

   6. Taylor expanded in phi1 around 0 71.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \left(\lambda_2 - \lambda_1\right)}} \]

   7. Taylor expanded in phi2 around 0 70.2%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

   8. Taylor expanded in lambda1 around 0 70.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(-\lambda_2\right)}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

   if -2.35000000000000001e-119 < lambda2 < 3.39999999999999984e-159

   1. Initial program 99.6%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0 80.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
   4. Step-by-step derivation

      1. +-commutative 80.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

      2. sub-neg 80.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

      3. remove-double-neg 80.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      4. mul-1-neg 80.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      5. distribute-neg-in 80.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

      6. +-commutative 80.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

      7. cos-neg 80.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

      8. mul-1-neg 80.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

      9. unsub-neg 80.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

   5. Simplified 80.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]

   6. Taylor expanded in phi1 around 0 70.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \left(\lambda_2 - \lambda_1\right)}} \]

   7. Taylor expanded in phi2 around 0 70.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

   8. Taylor expanded in lambda2 around 0 67.2%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \lambda_1}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 69.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -2.35 \cdot 10^{-119} \lor \neg \left(\lambda_2 \leq 3.4 \cdot 10^{-159}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(-\lambda_2\right)}{\cos \left(\lambda_2 - \lambda_1\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \lambda_1}{\cos \left(\lambda_2 - \lambda_1\right) + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 17: 66.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -1.4 \cdot 10^{-63} \lor \neg \left(\lambda_2 \leq 10^{-74}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(-\lambda_2\right)}{\cos \left(\lambda_2 - \lambda_1\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{1 + \cos \left(-\lambda_1\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (or (<= lambda2 -1.4e-63) (not (<= lambda2 1e-74)))
   (+ lambda1 (atan2 (sin (- lambda2)) (+ (cos (- lambda2 lambda1)) 1.0)))
   (+ lambda1 (atan2 (sin (- lambda1 lambda2)) (+ 1.0 (cos (- lambda1)))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda2 <= -1.4e-63) || !(lambda2 <= 1e-74)) {
		tmp = lambda1 + atan2(sin(-lambda2), (cos((lambda2 - lambda1)) + 1.0));
	} else {
		tmp = lambda1 + atan2(sin((lambda1 - lambda2)), (1.0 + cos(-lambda1)));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if ((lambda2 <= (-1.4d-63)) .or. (.not. (lambda2 <= 1d-74))) then
        tmp = lambda1 + atan2(sin(-lambda2), (cos((lambda2 - lambda1)) + 1.0d0))
    else
        tmp = lambda1 + atan2(sin((lambda1 - lambda2)), (1.0d0 + cos(-lambda1)))
    end if
    code = tmp
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda2 <= -1.4e-63) || !(lambda2 <= 1e-74)) {
		tmp = lambda1 + Math.atan2(Math.sin(-lambda2), (Math.cos((lambda2 - lambda1)) + 1.0));
	} else {
		tmp = lambda1 + Math.atan2(Math.sin((lambda1 - lambda2)), (1.0 + Math.cos(-lambda1)));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	tmp = 0
	if (lambda2 <= -1.4e-63) or not (lambda2 <= 1e-74):
		tmp = lambda1 + math.atan2(math.sin(-lambda2), (math.cos((lambda2 - lambda1)) + 1.0))
	else:
		tmp = lambda1 + math.atan2(math.sin((lambda1 - lambda2)), (1.0 + math.cos(-lambda1)))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if ((lambda2 <= -1.4e-63) || !(lambda2 <= 1e-74))
		tmp = Float64(lambda1 + atan(sin(Float64(-lambda2)), Float64(cos(Float64(lambda2 - lambda1)) + 1.0)));
	else
		tmp = Float64(lambda1 + atan(sin(Float64(lambda1 - lambda2)), Float64(1.0 + cos(Float64(-lambda1)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if ((lambda2 <= -1.4e-63) || ~((lambda2 <= 1e-74)))
		tmp = lambda1 + atan2(sin(-lambda2), (cos((lambda2 - lambda1)) + 1.0));
	else
		tmp = lambda1 + atan2(sin((lambda1 - lambda2)), (1.0 + cos(-lambda1)));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[lambda2, -1.4e-63], N[Not[LessEqual[lambda2, 1e-74]], $MachinePrecision]], N[(lambda1 + N[ArcTan[N[Sin[(-lambda2)], $MachinePrecision] / N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] / N[(1.0 + N[Cos[(-lambda1)], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < -1.4000000000000001e-63 or 9.99999999999999958e-75 < lambda2

   1. Initial program 99.2%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0 82.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
   4. Step-by-step derivation

      1. +-commutative 82.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

      2. sub-neg 82.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

      3. remove-double-neg 82.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      4. mul-1-neg 82.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      5. distribute-neg-in 82.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

      6. +-commutative 82.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

      7. cos-neg 82.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

      8. mul-1-neg 82.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

      9. unsub-neg 82.3%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

   5. Simplified 82.3%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]

   6. Taylor expanded in phi1 around 0 72.8%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \left(\lambda_2 - \lambda_1\right)}} \]

   7. Taylor expanded in phi2 around 0 71.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

   8. Taylor expanded in lambda1 around 0 71.1%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(-\lambda_2\right)}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

   if -1.4000000000000001e-63 < lambda2 < 9.99999999999999958e-75

   1. Initial program 99.7%

      \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0 79.5%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
   4. Step-by-step derivation

      1. +-commutative 79.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

      2. sub-neg 79.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

      3. remove-double-neg 79.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      4. mul-1-neg 79.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

      5. distribute-neg-in 79.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

      6. +-commutative 79.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

      7. cos-neg 79.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

      8. mul-1-neg 79.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

      9. unsub-neg 79.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

   5. Simplified 79.5%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]

   6. Taylor expanded in phi1 around 0 69.6%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \left(\lambda_2 - \lambda_1\right)}} \]

   7. Taylor expanded in phi2 around 0 69.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

   8. Taylor expanded in lambda2 around 0 69.4%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{1 + \color{blue}{\cos \left(-\lambda_1\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 70.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -1.4 \cdot 10^{-63} \lor \neg \left(\lambda_2 \leq 10^{-74}\right):\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(-\lambda_2\right)}{\cos \left(\lambda_2 - \lambda_1\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{1 + \cos \left(-\lambda_1\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 18: 66.5% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 - \lambda_1\right) + 1} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (+
  lambda1
  (atan2 (sin (- lambda1 lambda2)) (+ (cos (- lambda2 lambda1)) 1.0))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2(sin((lambda1 - lambda2)), (cos((lambda2 - lambda1)) + 1.0));
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = lambda1 + atan2(sin((lambda1 - lambda2)), (cos((lambda2 - lambda1)) + 1.0d0))
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + Math.atan2(Math.sin((lambda1 - lambda2)), (Math.cos((lambda2 - lambda1)) + 1.0));
}

Python

def code(lambda1, lambda2, phi1, phi2):
	return lambda1 + math.atan2(math.sin((lambda1 - lambda2)), (math.cos((lambda2 - lambda1)) + 1.0))

Julia

function code(lambda1, lambda2, phi1, phi2)
	return Float64(lambda1 + atan(sin(Float64(lambda1 - lambda2)), Float64(cos(Float64(lambda2 - lambda1)) + 1.0)))
end

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2(sin((lambda1 - lambda2)), (cos((lambda2 - lambda1)) + 1.0));
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := N[(lambda1 + N[ArcTan[N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] / N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
2. Add Preprocessing

3. Taylor expanded in phi2 around 0 81.0%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
4. Step-by-step derivation

   1. +-commutative 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

   2. sub-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

   3. remove-double-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

   4. mul-1-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

   5. distribute-neg-in 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

   6. +-commutative 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

   7. cos-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

   8. mul-1-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

   9. unsub-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

5. Simplified 81.0%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]

6. Taylor expanded in phi1 around 0 71.4%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \left(\lambda_2 - \lambda_1\right)}} \]

7. Taylor expanded in phi2 around 0 70.3%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

8. Final simplification 70.3%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 - \lambda_1\right) + 1} \]
9. Add Preprocessing

Alternative 19: 55.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\sin \lambda_1}{\cos \left(\lambda_2 - \lambda_1\right) + 1} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (+ lambda1 (atan2 (sin lambda1) (+ (cos (- lambda2 lambda1)) 1.0))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2(sin(lambda1), (cos((lambda2 - lambda1)) + 1.0));
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = lambda1 + atan2(sin(lambda1), (cos((lambda2 - lambda1)) + 1.0d0))
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + Math.atan2(Math.sin(lambda1), (Math.cos((lambda2 - lambda1)) + 1.0));
}

Python

def code(lambda1, lambda2, phi1, phi2):
	return lambda1 + math.atan2(math.sin(lambda1), (math.cos((lambda2 - lambda1)) + 1.0))

Julia

function code(lambda1, lambda2, phi1, phi2)
	return Float64(lambda1 + atan(sin(lambda1), Float64(cos(Float64(lambda2 - lambda1)) + 1.0)))
end

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2(sin(lambda1), (cos((lambda2 - lambda1)) + 1.0));
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := N[(lambda1 + N[ArcTan[N[Sin[lambda1], $MachinePrecision] / N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \phi_1 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)} \]
2. Add Preprocessing

3. Taylor expanded in phi2 around 0 81.0%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}} \]
4. Step-by-step derivation

   1. +-commutative 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_1 - \lambda_2\right) + \cos \phi_1}} \]

   2. sub-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)} + \cos \phi_1} \]

   3. remove-double-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

   4. mul-1-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right) + \cos \phi_1} \]

   5. distribute-neg-in 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)} + \cos \phi_1} \]

   6. +-commutative 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) + \cos \phi_1} \]

   7. cos-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)} + \cos \phi_1} \]

   8. mul-1-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right) + \cos \phi_1} \]

   9. unsub-neg 81.0%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \color{blue}{\left(\lambda_2 - \lambda_1\right)} + \cos \phi_1} \]

5. Simplified 81.0%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{\cos \left(\lambda_2 - \lambda_1\right) + \cos \phi_1}} \]

6. Taylor expanded in phi1 around 0 71.4%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\color{blue}{1 + \cos \left(\lambda_2 - \lambda_1\right)}} \]

7. Taylor expanded in phi2 around 0 70.3%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \left(\lambda_1 - \lambda_2\right)}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

8. Taylor expanded in lambda2 around 0 59.3%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\color{blue}{\sin \lambda_1}}{1 + \cos \left(\lambda_2 - \lambda_1\right)} \]

9. Final simplification 59.3%

   \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\sin \lambda_1}{\cos \left(\lambda_2 - \lambda_1\right) + 1} \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024100 
(FPCore (lambda1 lambda2 phi1 phi2)
  :name "Midpoint on a great circle"
  :precision binary64
  (+ lambda1 (atan2 (* (cos phi2) (sin (- lambda1 lambda2))) (+ (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))