Midpoint on a great circle

Percentage Accurate: 98.6% → 99.6%

Time: 17.9s

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.6% 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.4%

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

   1. sin-diff 99.4%

      \[\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 \cos \left(\lambda_1 - \lambda_2\right)} \]

4. Applied egg-rr 99.4%

   \[\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 \cos \left(\lambda_1 - \lambda_2\right)} \]
5. Step-by-step derivation

   1. cos-diff 99.6%

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

   2. +-commutative 99.6%

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

   3. *-commutative 99.6%

      \[\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 + \color{blue}{\cos \lambda_2 \cdot \cos \lambda_1}\right)} \]

6. Applied egg-rr 99.6%

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

Alternative 2: 98.7% accurate, 0.7× 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 \cos \left(\lambda_1 - \lambda_2\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) (cos (- lambda1 lambda2)))))))

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) * 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) * cos(lambda2)) - (cos(lambda1) * sin(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) * Math.cos(lambda2)) - (Math.cos(lambda1) * Math.sin(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) * math.cos(lambda2)) - (math.cos(lambda1) * math.sin(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) * Float64(Float64(sin(lambda1) * cos(lambda2)) - Float64(cos(lambda1) * sin(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) * cos(lambda2)) - (cos(lambda1) * sin(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[(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[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.4%

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

   1. sin-diff 99.4%

      \[\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 \cos \left(\lambda_1 - \lambda_2\right)} \]

4. Applied egg-rr 99.4%

   \[\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 \cos \left(\lambda_1 - \lambda_2\right)} \]
5. Add Preprocessing

Alternative 3: 98.6% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

   1. cos-neg 99.4%

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

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

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

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

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

   6. fma-define 99.4%

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

3. Simplified 99.4%

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

Alternative 4: 77.7% 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.26:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot t\_0}{\cos \phi_1 + \cos \lambda_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi2) < 0.26000000000000001

   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. Add Preprocessing

   3. Taylor expanded in phi2 around 0 57.5%

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

   4. Taylor expanded in lambda2 around 0 57.5%

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

   if 0.26000000000000001 < (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. Add Preprocessing

   3. Taylor expanded in phi2 around 0 88.0%

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

   4. Taylor expanded in phi2 around 0 87.9%

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

Alternative 5: 79.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 1:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot t\_0}{\cos \phi_1 + \cos \phi_2}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_1 + \cos \left(\lambda_1 - \lambda_2\right)}\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi2) < 1

   1. Initial program 99.4%

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

      1. cos-neg 99.4%

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

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

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

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

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

      6. fma-define 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in lambda2 around 0 78.0%

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

   6. Taylor expanded in lambda1 around 0 77.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}} \]

   if 1 < (cos.f64 phi2)

   1. Initial program 99.4%

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

   3. Taylor expanded in phi2 around 0 78.2%

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

   4. Taylor expanded in phi2 around 0 76.5%

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

Alternative 6: 98.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

Alternative 7: 97.9% 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_2\right)} \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(Float64(-lambda2))))))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in lambda1 around 0 98.6%

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

Alternative 8: 82.5% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < 0.0719999999999999946

   1. Initial program 99.3%

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

   3. Taylor expanded in phi1 around 0 89.5%

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

   if 0.0719999999999999946 < phi1

   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. Add Preprocessing

   3. Taylor expanded in phi2 around 0 81.4%

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

Alternative 9: 77.7% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi2) < 0.304999999999999993

   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. Add Preprocessing

   3. Taylor expanded in phi2 around 0 57.5%

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

   4. Taylor expanded in phi1 around 0 57.4%

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

   if 0.304999999999999993 < (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. Add Preprocessing

   3. Taylor expanded in phi2 around 0 88.0%

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

   4. Taylor expanded in phi2 around 0 87.9%

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

Alternative 10: 66.8% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi1) < 0.28000000000000003

   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. Add Preprocessing

   3. Taylor expanded in phi2 around 0 83.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)}} \]

   4. Taylor expanded in phi2 around 0 83.5%

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

   5. Taylor expanded in lambda2 around 0 60.5%

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

   if 0.28000000000000003 < (cos.f64 phi1)

   1. Initial program 99.3%

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

   3. Taylor expanded in phi2 around 0 76.2%

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

   4. Taylor expanded in phi2 around 0 73.9%

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

   5. Taylor expanded in phi1 around 0 69.4%

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

Alternative 11: 75.9% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = lambda1 + math.atan2(math.sin(-lambda2), (math.cos(phi1) + math.cos((lambda1 - lambda2))))
	tmp = 0
	if lambda2 <= -11000000000000.0:
		tmp = t_0
	elif lambda2 <= 6.5e-5:
		tmp = lambda1 + math.atan2(math.sin((lambda1 - lambda2)), (math.cos(phi1) + math.cos(lambda1)))
	else:
		tmp = t_0
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = Float64(lambda1 + atan(sin(Float64(-lambda2)), Float64(cos(phi1) + cos(Float64(lambda1 - lambda2)))))
	tmp = 0.0
	if (lambda2 <= -11000000000000.0)
		tmp = t_0;
	elseif (lambda2 <= 6.5e-5)
		tmp = Float64(lambda1 + atan(sin(Float64(lambda1 - lambda2)), Float64(cos(phi1) + cos(lambda1))));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = lambda1 + atan2(sin(-lambda2), (cos(phi1) + cos((lambda1 - lambda2))));
	tmp = 0.0;
	if (lambda2 <= -11000000000000.0)
		tmp = t_0;
	elseif (lambda2 <= 6.5e-5)
		tmp = lambda1 + atan2(sin((lambda1 - lambda2)), (cos(phi1) + cos(lambda1)));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if lambda2 < -1.1e13 or 6.49999999999999943e-5 < lambda2

   1. Initial program 99.3%

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

   3. Taylor expanded in phi2 around 0 80.2%

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

   4. Taylor expanded in phi2 around 0 77.5%

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

   5. Taylor expanded in lambda1 around 0 77.5%

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

   if -1.1e13 < lambda2 < 6.49999999999999943e-5

   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. Add Preprocessing

   3. Taylor expanded in phi2 around 0 75.9%

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

   4. Taylor expanded in phi2 around 0 75.3%

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

   5. Taylor expanded in lambda2 around 0 75.3%

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

Alternative 12: 68.4% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if phi1 < 6e11

   1. Initial program 99.3%

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

   3. Taylor expanded in phi2 around 0 77.0%

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

   4. Taylor expanded in phi2 around 0 74.9%

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

   5. Taylor expanded in phi1 around 0 68.8%

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

   if 6e11 < phi1

   1. Initial program 99.4%

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

   3. Taylor expanded in phi2 around 0 81.6%

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

   4. Taylor expanded in phi2 around 0 81.0%

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

   5. Taylor expanded in lambda2 around 0 67.7%

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

Alternative 13: 76.3% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in phi2 around 0 78.2%

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

4. Taylor expanded in phi2 around 0 76.5%

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

Alternative 14: 76.0% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in phi2 around 0 78.2%

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

4. Taylor expanded in phi2 around 0 76.5%

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

   1. +-commutative 76.5%

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

   2. add-sqr-sqrt 44.7%

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

   3. fma-define 44.7%

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

6. Applied egg-rr 44.7%

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

7. Taylor expanded in lambda1 around 0 75.9%

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

Alternative 15: 63.0% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sin \left(\lambda_1 - \lambda_2\right)\\ t_1 := 1 + \cos \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\lambda_1 \leq -1.55 \cdot 10^{-13}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \lambda_1}{t\_1}\\ \mathbf{elif}\;\lambda_1 \leq 5 \cdot 10^{-136}:\\ \;\;\;\;\tan^{-1}_* \frac{t\_0}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{1 + \cos \lambda_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (sin (- lambda1 lambda2)))
        (t_1 (+ 1.0 (cos (- lambda1 lambda2)))))
   (if (<= lambda1 -1.55e-13)
     (+ lambda1 (atan2 (sin lambda1) t_1))
     (if (<= lambda1 5e-136)
       (atan2 t_0 t_1)
       (+ lambda1 (atan2 t_0 (+ 1.0 (cos lambda1))))))))

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = sin((lambda1 - lambda2));
	double t_1 = 1.0 + cos((lambda1 - lambda2));
	double tmp;
	if (lambda1 <= -1.55e-13) {
		tmp = lambda1 + atan2(sin(lambda1), t_1);
	} else if (lambda1 <= 5e-136) {
		tmp = atan2(t_0, t_1);
	} else {
		tmp = lambda1 + atan2(t_0, (1.0 + cos(lambda1)));
	}
	return tmp;
}

Fortran

real(8) function code(lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = sin((lambda1 - lambda2))
    t_1 = 1.0d0 + cos((lambda1 - lambda2))
    if (lambda1 <= (-1.55d-13)) then
        tmp = lambda1 + atan2(sin(lambda1), t_1)
    else if (lambda1 <= 5d-136) then
        tmp = atan2(t_0, t_1)
    else
        tmp = lambda1 + atan2(t_0, (1.0d0 + cos(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 t_1 = 1.0 + Math.cos((lambda1 - lambda2));
	double tmp;
	if (lambda1 <= -1.55e-13) {
		tmp = lambda1 + Math.atan2(Math.sin(lambda1), t_1);
	} else if (lambda1 <= 5e-136) {
		tmp = Math.atan2(t_0, t_1);
	} else {
		tmp = lambda1 + Math.atan2(t_0, (1.0 + Math.cos(lambda1)));
	}
	return tmp;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	t_0 = math.sin((lambda1 - lambda2))
	t_1 = 1.0 + math.cos((lambda1 - lambda2))
	tmp = 0
	if lambda1 <= -1.55e-13:
		tmp = lambda1 + math.atan2(math.sin(lambda1), t_1)
	elif lambda1 <= 5e-136:
		tmp = math.atan2(t_0, t_1)
	else:
		tmp = lambda1 + math.atan2(t_0, (1.0 + math.cos(lambda1)))
	return tmp

Julia

function code(lambda1, lambda2, phi1, phi2)
	t_0 = sin(Float64(lambda1 - lambda2))
	t_1 = Float64(1.0 + cos(Float64(lambda1 - lambda2)))
	tmp = 0.0
	if (lambda1 <= -1.55e-13)
		tmp = Float64(lambda1 + atan(sin(lambda1), t_1));
	elseif (lambda1 <= 5e-136)
		tmp = atan(t_0, t_1);
	else
		tmp = Float64(lambda1 + atan(t_0, Float64(1.0 + cos(lambda1))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(lambda1, lambda2, phi1, phi2)
	t_0 = sin((lambda1 - lambda2));
	t_1 = 1.0 + cos((lambda1 - lambda2));
	tmp = 0.0;
	if (lambda1 <= -1.55e-13)
		tmp = lambda1 + atan2(sin(lambda1), t_1);
	elseif (lambda1 <= 5e-136)
		tmp = atan2(t_0, t_1);
	else
		tmp = lambda1 + atan2(t_0, (1.0 + cos(lambda1)));
	end
	tmp_2 = tmp;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -1.55e-13], N[(lambda1 + N[ArcTan[N[Sin[lambda1], $MachinePrecision] / t$95$1], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, 5e-136], N[ArcTan[t$95$0 / t$95$1], $MachinePrecision], N[(lambda1 + N[ArcTan[t$95$0 / N[(1.0 + N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if lambda1 < -1.55e-13

   1. Initial program 99.2%

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

   3. Taylor expanded in phi2 around 0 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 \left(\lambda_1 - \lambda_2\right)}} \]

   4. 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 \left(\lambda_1 - \lambda_2\right)} \]

   5. Taylor expanded in phi1 around 0 96.6%

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

   6. Taylor expanded in lambda2 around 0 96.7%

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

   if -1.55e-13 < lambda1 < 5.0000000000000002e-136

   1. Initial program 99.2%

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

   3. Taylor expanded in phi2 around 0 57.1%

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

   4. Taylor expanded in phi2 around 0 53.4%

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

   5. Taylor expanded in phi1 around 0 35.4%

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

   6. Taylor expanded in lambda1 around 0 33.5%

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

   if 5.0000000000000002e-136 < lambda1

   1. Initial program 99.7%

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

   3. Taylor expanded in phi2 around 0 86.3%

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

   4. Taylor expanded in phi2 around 0 85.5%

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

   5. Taylor expanded in phi1 around 0 75.5%

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

   6. Taylor expanded in lambda2 around 0 73.8%

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

Alternative 16: 66.0% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in phi2 around 0 78.2%

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

4. Taylor expanded in phi2 around 0 76.5%

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

5. Taylor expanded in phi1 around 0 65.3%

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

Alternative 17: 65.9% 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\right)} \end{array} \]

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in phi2 around 0 78.2%

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

4. Taylor expanded in phi2 around 0 76.5%

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

5. Taylor expanded in phi1 around 0 65.3%

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

6. Taylor expanded in lambda1 around 0 65.0%

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

Alternative 18: 54.9% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in phi2 around 0 78.2%

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

4. Taylor expanded in phi2 around 0 76.5%

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

5. Taylor expanded in phi1 around 0 65.3%

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

6. Taylor expanded in lambda2 around 0 53.2%

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

Alternative 19: 61.2% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in phi2 around 0 78.2%

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

4. Taylor expanded in phi2 around 0 76.5%

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

5. Taylor expanded in phi1 around 0 65.3%

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

6. Taylor expanded in lambda2 around 0 59.5%

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

Alternative 20: 52.3% accurate, 614.0× speedup

Math

\[\begin{array}{l} \\ \lambda_1 \end{array} \]

FPCore

(FPCore (lambda1 lambda2 phi1 phi2) :precision binary64 lambda1)

C

double code(double lambda1, double lambda2, double phi1, double phi2) {
	return 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
end function

Java

public static double code(double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1;
}

Python

def code(lambda1, lambda2, phi1, phi2):
	return lambda1

Julia

function code(lambda1, lambda2, phi1, phi2)
	return lambda1
end

MATLAB

function tmp = code(lambda1, lambda2, phi1, phi2)
	tmp = lambda1;
end

Wolfram

code[lambda1_, lambda2_, phi1_, phi2_] := lambda1

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in phi2 around 0 78.2%

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

4. Taylor expanded in phi2 around 0 76.5%

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

5. Taylor expanded in phi1 around 0 65.3%

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

6. Taylor expanded in lambda1 around inf 51.1%

   \[\leadsto \color{blue}{\lambda_1} \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024034 -o generate:simplify
(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)))))))