Midpoint on a great circle

Percentage Accurate: 98.7% → 99.6%

Time: 21.3s

Alternatives: 20

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.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 \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: 99.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

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) * cos(lambda2)) - (cos(lambda1) * sin(lambda2)))), (cos(phi1) + (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1))))))
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) * Math.cos(lambda2)) - (Math.cos(lambda1) * Math.sin(lambda2)))), (Math.cos(phi1) + (Math.cos(phi2) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1))))));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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. Step-by-step derivation

   1. cos-diff 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}{\left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_1 \cdot \sin \lambda_2\right)}} \]

   2. +-commutative 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}{\left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)}} \]

   3. *-commutative 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 \left(\sin \lambda_1 \cdot \sin \lambda_2 + \color{blue}{\cos \lambda_2 \cdot \cos \lambda_1}\right)} \]

3. Applied egg-rr 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}{\left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)}} \]
4. Step-by-step derivation

   1. sin-diff 99.7%

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

5. Applied egg-rr 99.7%

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

6. Final simplification 99.7%

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

Alternative 2: 98.7% accurate, 0.7× 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 \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)} \end{array} \]

FPCore

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

C

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

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) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1))))))
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.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1))))));
}

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.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1))))))

Julia

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

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1))))));
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[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

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. Step-by-step derivation

   1. cos-diff 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}{\left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_1 \cdot \sin \lambda_2\right)}} \]

   2. +-commutative 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}{\left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)}} \]

   3. *-commutative 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 \left(\sin \lambda_1 \cdot \sin \lambda_2 + \color{blue}{\cos \lambda_2 \cdot \cos \lambda_1}\right)} \]

3. Applied egg-rr 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}{\left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)}} \]

4. Final simplification 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 \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)} \]

Alternative 3: 98.7% 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.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. Step-by-step derivation

   1. cos-neg 99.3%

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

   2. cos-neg 99.3%

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

   3. cos-neg 99.3%

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

   4. +-commutative 99.3%

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

   5. cos-neg 99.3%

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

   6. fma-def 99.3%

      \[\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.3%

   \[\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. Final simplification 99.3%

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

Alternative 4: 98.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -2 \cdot 10^{-8} \lor \neg \left(\lambda_2 \leq 10^{-37}\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_1 + \cos \phi_2 \cdot \cos \lambda_1}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda2 <= -2e-8) || !(lambda2 <= 1e-37)) {
		tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi1) + (cos(phi2) * cos(lambda2))));
	} else {
		tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * 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 <= (-2d-8)) .or. (.not. (lambda2 <= 1d-37))) then
        tmp = lambda1 + atan2((cos(phi2) * sin(-lambda2)), (cos(phi1) + (cos(phi2) * cos(lambda2))))
    else
        tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(phi1) + (cos(phi2) * 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 <= -2e-8) || !(lambda2 <= 1e-37)) {
		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(phi1) + (Math.cos(phi2) * Math.cos(lambda1))));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	tmp = 0
	if (lambda2 <= -2e-8) or not (lambda2 <= 1e-37):
		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(phi1) + (math.cos(phi2) * math.cos(lambda1))))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if ((lambda2 <= -2e-8) || !(lambda2 <= 1e-37))
		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(phi1) + Float64(cos(phi2) * cos(lambda1)))));
	end
	return tmp
end

MATLAB

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

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[lambda2, -2e-8], N[Not[LessEqual[lambda2, 1e-37]], $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[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < -2e-8 or 1.00000000000000007e-37 < lambda2

   1. Initial program 99.0%

      \[\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. Taylor expanded in lambda1 around 0 98.8%

      \[\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)}} \]
   3. Step-by-step derivation

      1. cos-neg 98.8%

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

   4. Simplified 98.8%

      \[\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. Taylor expanded in lambda1 around 0 98.8%

      \[\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 -2e-8 < lambda2 < 1.00000000000000007e-37

   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. Taylor expanded in lambda2 around 0 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 \color{blue}{\cos \lambda_1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -2 \cdot 10^{-8} \lor \neg \left(\lambda_2 \leq 10^{-37}\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_1 + \cos \phi_2 \cdot \cos \lambda_1}\\ \end{array} \]

Alternative 5: 88.7% 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 \left(\lambda_1 - \lambda_2\right) + 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 (- lambda1 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((lambda1 - 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((lambda1 - 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((lambda1 - 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((lambda1 - 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(Float64(lambda1 - 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((lambda1 - 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[N[(lambda1 - lambda2), $MachinePrecision]], $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.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. Taylor expanded in lambda2 around 0 84.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}{\left(\cos \lambda_1 + \lambda_2 \cdot \sin \lambda_1\right)}} \]

   3. Taylor expanded in lambda1 around 0 84.5%

      \[\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}} \]
   4. Step-by-step derivation

      1. +-commutative 84.5%

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

   5. Simplified 84.5%

      \[\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.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. Taylor expanded in phi1 around 0 99.1%

      \[\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 \left(\lambda_1 - \lambda_2\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.5%

   \[\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 \left(\lambda_1 - \lambda_2\right) + 1}\\ \end{array} \]

Alternative 6: 98.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -6.2 \cdot 10^{-8} \lor \neg \left(\lambda_2 \leq 2 \cdot 10^{-36}\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 -6.2e-8) (not (<= lambda2 2e-36)))
   (+
    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 <= -6.2e-8) || !(lambda2 <= 2e-36)) {
		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 <= (-6.2d-8)) .or. (.not. (lambda2 <= 2d-36))) 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 <= -6.2e-8) || !(lambda2 <= 2e-36)) {
		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 <= -6.2e-8) or not (lambda2 <= 2e-36):
		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 <= -6.2e-8) || !(lambda2 <= 2e-36))
		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 <= -6.2e-8) || ~((lambda2 <= 2e-36)))
		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, -6.2e-8], N[Not[LessEqual[lambda2, 2e-36]], $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 < -6.2e-8 or 1.9999999999999999e-36 < lambda2

   1. Initial program 99.0%

      \[\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. Taylor expanded in lambda1 around 0 98.8%

      \[\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)}} \]
   3. Step-by-step derivation

      1. cos-neg 98.8%

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

   4. Simplified 98.8%

      \[\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. Taylor expanded in lambda1 around 0 98.8%

      \[\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 -6.2e-8 < lambda2 < 1.9999999999999999e-36

   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. Taylor expanded in lambda2 around 0 99.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}{\left(\cos \lambda_1 + \lambda_2 \cdot \sin \lambda_1\right)}} \]

   3. Taylor expanded in lambda1 around 0 99.2%

      \[\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}} \]
   4. Step-by-step derivation

      1. +-commutative 99.2%

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

   5. Simplified 99.2%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq -6.2 \cdot 10^{-8} \lor \neg \left(\lambda_2 \leq 2 \cdot 10^{-36}\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} \]

Alternative 7: 88.3% 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.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. Taylor expanded in lambda2 around 0 84.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}{\left(\cos \lambda_1 + \lambda_2 \cdot \sin \lambda_1\right)}} \]

   3. Taylor expanded in lambda1 around 0 84.5%

      \[\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}} \]
   4. Step-by-step derivation

      1. +-commutative 84.5%

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

   5. Simplified 84.5%

      \[\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.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. Taylor expanded in lambda1 around 0 98.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)}} \]
   3. Step-by-step derivation

      1. cos-neg 98.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}} \]

   4. Simplified 98.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. Taylor expanded in phi1 around 0 98.6%

      \[\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}} \]
   6. Step-by-step derivation

      1. *-commutative 98.6%

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

   7. Simplified 98.6%

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

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

Alternative 8: 98.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 \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.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. Final simplification 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 \cos \left(\lambda_1 - \lambda_2\right)} \]

Alternative 9: 78.4% 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.22:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot t_0}{\cos \lambda_2 + 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.22)
     (+ lambda1 (atan2 (* (cos phi2) t_0) (+ (cos lambda2) 1.0)))
     (+ 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.22) {
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(lambda2) + 1.0));
	} 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.22d0) then
        tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(lambda2) + 1.0d0))
    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.22) {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * t_0), (Math.cos(lambda2) + 1.0));
	} 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.22:
		tmp = lambda1 + math.atan2((math.cos(phi2) * t_0), (math.cos(lambda2) + 1.0))
	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.22)
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * t_0), Float64(cos(lambda2) + 1.0)));
	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.22)
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(lambda2) + 1.0));
	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.22], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] / N[(N[Cos[lambda2], $MachinePrecision] + 1.0), $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.220000000000000001

   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. Taylor expanded in phi2 around 0 54.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)}} \]
   3. Step-by-step derivation

      1. +-commutative 54.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 54.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 54.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 54.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 54.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 54.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 54.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 54.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 54.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} \]

   4. Simplified 54.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}} \]

   5. Taylor expanded in phi1 around 0 53.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)}} \]

   6. Taylor expanded in lambda1 around 0 53.9%

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

      1. +-commutative 48.4%

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

   8. Simplified 53.9%

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

   if 0.220000000000000001 < (cos.f64 phi2)

   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. 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)}} \]
   3. 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}} \]

   4. 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}} \]

   5. Taylor expanded in phi2 around 0 91.0%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_2 \leq 0.22:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \lambda_2 + 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} \]

Alternative 10: 78.5% 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.22:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot t_0}{\cos \lambda_1 + \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.22)
     (+ lambda1 (atan2 (* (cos phi2) t_0) (+ (cos lambda1) (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.22) {
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(lambda1) + 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.22d0) then
        tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(lambda1) + 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.22) {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * t_0), (Math.cos(lambda1) + 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.22:
		tmp = lambda1 + math.atan2((math.cos(phi2) * t_0), (math.cos(lambda1) + 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.22)
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * t_0), Float64(cos(lambda1) + 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.22)
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(lambda1) + 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.22], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] / N[(N[Cos[lambda1], $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.220000000000000001

   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. Taylor expanded in phi2 around 0 54.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)}} \]
   3. Step-by-step derivation

      1. +-commutative 54.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 54.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 54.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 54.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 54.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 54.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 54.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 54.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 54.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} \]

   4. Simplified 54.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}} \]

   5. Taylor expanded in lambda2 around 0 54.0%

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

      1. cos-neg 54.0%

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

   7. Simplified 54.0%

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

   if 0.220000000000000001 < (cos.f64 phi2)

   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. 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)}} \]
   3. 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}} \]

   4. 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}} \]

   5. Taylor expanded in phi2 around 0 91.0%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_2 \leq 0.22:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot \sin \left(\lambda_1 - \lambda_2\right)}{\cos \lambda_1 + \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} \]

Alternative 11: 88.1% 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.9995:\\ \;\;\;\;\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.9995)
     (+ 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.9995) {
		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.9995d0) 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.9995) {
		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.9995:
		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.9995)
		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.9995)
		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.9995], 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.99950000000000006

   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. Taylor expanded in lambda2 around 0 82.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}{\left(\cos \lambda_1 + \lambda_2 \cdot \sin \lambda_1\right)}} \]

   3. Taylor expanded in lambda1 around 0 83.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}} \]
   4. Step-by-step derivation

      1. +-commutative 83.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}} \]

   5. Simplified 83.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.99950000000000006 < (cos.f64 phi2)

   1. Initial program 99.5%

      \[\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. 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)}} \]
   3. 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}} \]

   4. 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}} \]

   5. Taylor expanded in phi2 around 0 99.1%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_2 \leq 0.9995:\\ \;\;\;\;\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} \]

Alternative 12: 98.1% 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.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. 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)}} \]
3. 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}} \]

4. 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}} \]

5. Final simplification 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 \cos \lambda_2} \]

Alternative 13: 68.1% accurate, 1.2× speedup

Math

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

FPCore

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

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = sin((lambda1 - lambda2));
	double tmp;
	if (cos(phi2) <= 0.59) {
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(lambda1) + 1.0));
	} else {
		tmp = lambda1 + atan2(t_0, (1.0 + 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 = sin((lambda1 - lambda2))
    if (cos(phi2) <= 0.59d0) then
        tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(lambda1) + 1.0d0))
    else
        tmp = lambda1 + atan2(t_0, (1.0d0 + 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.sin((lambda1 - lambda2));
	double tmp;
	if (Math.cos(phi2) <= 0.59) {
		tmp = lambda1 + Math.atan2((Math.cos(phi2) * t_0), (Math.cos(lambda1) + 1.0));
	} else {
		tmp = lambda1 + Math.atan2(t_0, (1.0 + Math.cos((lambda2 - lambda1))));
	}
	return tmp;
}

Python

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

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = sin(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (cos(phi2) <= 0.59)
		tmp = Float64(lambda1 + atan(Float64(cos(phi2) * t_0), Float64(cos(lambda1) + 1.0)));
	else
		tmp = Float64(lambda1 + atan(t_0, Float64(1.0 + cos(Float64(lambda2 - lambda1)))));
	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.59)
		tmp = lambda1 + atan2((cos(phi2) * t_0), (cos(lambda1) + 1.0));
	else
		tmp = lambda1 + atan2(t_0, (1.0 + cos((lambda2 - lambda1))));
	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.59], N[(lambda1 + N[ArcTan[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] / N[(N[Cos[lambda1], $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(lambda1 + N[ArcTan[t$95$0 / N[(1.0 + N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi2) < 0.589999999999999969

   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. Taylor expanded in phi2 around 0 54.7%

      \[\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)}} \]
   3. Step-by-step derivation

      1. +-commutative 54.7%

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

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

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

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

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

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

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

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

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

   4. Simplified 54.7%

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

   5. Taylor expanded in phi1 around 0 53.9%

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

   6. Taylor expanded in lambda2 around 0 53.8%

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

      1. cos-neg 49.0%

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

      2. +-commutative 49.0%

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

   8. Simplified 53.8%

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

   if 0.589999999999999969 < (cos.f64 phi2)

   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. Taylor expanded in phi2 around 0 92.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)}} \]
   3. Step-by-step derivation

      1. +-commutative 92.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 92.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 92.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 92.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 92.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 92.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 92.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 92.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 92.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} \]

   4. Simplified 92.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}} \]

   5. Taylor expanded in phi1 around 0 82.9%

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

   6. Taylor expanded in phi2 around 0 83.0%

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

4. Final simplification 73.5%

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

Alternative 14: 78.1% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

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(lambda2) + cos(phi1)))
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(lambda2) + Math.cos(phi1)));
}

Python

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

Julia

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

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(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[lambda2], $MachinePrecision] + N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

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. Taylor expanded in phi2 around 0 80.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)}} \]
3. Step-by-step derivation

   1. +-commutative 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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} \]

4. Simplified 80.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}} \]

5. Taylor expanded in lambda1 around 0 80.2%

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

6. Final simplification 80.2%

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

Alternative 15: 68.1% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

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))), (1.0d0 + cos((lambda2 - lambda1))))
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))), (1.0 + Math.cos((lambda2 - lambda1))));
}

Python

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

Julia

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

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (1.0 + cos((lambda2 - lambda1))));
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[(1.0 + N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

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. Taylor expanded in phi2 around 0 80.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)}} \]
3. Step-by-step derivation

   1. +-commutative 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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} \]

4. Simplified 80.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}} \]

5. Taylor expanded in phi1 around 0 73.5%

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

6. Final simplification 73.5%

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

Alternative 16: 67.9% accurate, 1.5× speedup

Math

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

FPCore

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

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(lambda2) + 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((cos(phi2) * sin((lambda1 - lambda2))), (cos(lambda2) + 1.0d0))
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(lambda2) + 1.0));
}

Python

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

Julia

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

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1 + atan2((cos(phi2) * sin((lambda1 - lambda2))), (cos(lambda2) + 1.0));
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[lambda2], $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

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. Taylor expanded in phi2 around 0 80.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)}} \]
3. Step-by-step derivation

   1. +-commutative 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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} \]

4. Simplified 80.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}} \]

5. Taylor expanded in phi1 around 0 73.5%

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

6. Taylor expanded in lambda1 around 0 73.3%

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

   1. +-commutative 71.8%

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

8. Simplified 73.3%

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

9. Final simplification 73.3%

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

Alternative 17: 66.6% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

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)), (1.0d0 + cos((lambda2 - lambda1))))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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. Taylor expanded in phi2 around 0 80.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)}} \]
3. Step-by-step derivation

   1. +-commutative 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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} \]

4. Simplified 80.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}} \]

5. Taylor expanded in phi1 around 0 73.5%

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

6. Taylor expanded in phi2 around 0 72.0%

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

7. Final simplification 72.0%

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

Alternative 18: 54.7% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

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), (1.0d0 + cos((lambda2 - lambda1))))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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. Taylor expanded in phi2 around 0 80.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)}} \]
3. Step-by-step derivation

   1. +-commutative 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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} \]

4. Simplified 80.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}} \]

5. Taylor expanded in phi1 around 0 73.5%

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

6. Taylor expanded in phi2 around 0 72.0%

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

7. Taylor expanded in lambda2 around 0 57.6%

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

8. Final simplification 57.6%

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

Alternative 19: 61.6% accurate, 2.0× speedup

Math

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

FPCore

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

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2(sin((lambda1 - lambda2)), (cos(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(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(lambda1) + 1.0));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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. Taylor expanded in phi2 around 0 80.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)}} \]
3. Step-by-step derivation

   1. +-commutative 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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} \]

4. Simplified 80.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}} \]

5. Taylor expanded in phi1 around 0 73.5%

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

6. Taylor expanded in phi2 around 0 72.0%

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

7. Taylor expanded in lambda2 around 0 63.8%

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

   1. cos-neg 63.8%

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

   2. +-commutative 63.8%

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

9. Simplified 63.8%

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

10. Final simplification 63.8%

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

Alternative 20: 66.4% accurate, 2.0× speedup

Math

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

FPCore

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

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 + atan2(sin((lambda1 - lambda2)), (cos(lambda2) + 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) + 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) + 1.0));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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. Taylor expanded in phi2 around 0 80.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)}} \]
3. Step-by-step derivation

   1. +-commutative 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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 80.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} \]

4. Simplified 80.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}} \]

5. Taylor expanded in phi1 around 0 73.5%

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

6. Taylor expanded in phi2 around 0 72.0%

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

7. Taylor expanded in lambda1 around 0 71.8%

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

   1. +-commutative 71.8%

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

9. Simplified 71.8%

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

10. Final simplification 71.8%

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

Reproduce

herbie shell --seed 2023307 
(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)))))))