Midpoint on a great circle

Percentage Accurate: 98.5% → 99.6%

Time: 24.4s

Alternatives: 17

Speedup: 1.0×

• Rival profile vector overflowed, profile may not be complete

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 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 98.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. Step-by-step derivation

   1. sin-diff 98.8%

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

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

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

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

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

   \[\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.9% 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(\cos \lambda_2 \cdot \cos \lambda_1 + \lambda_1 \cdot \sin \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 lambda2) (cos lambda1)) (* lambda1 (sin 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(lambda2) * cos(lambda1)) + (lambda1 * sin(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(lambda2) * cos(lambda1)) + (lambda1 * sin(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(lambda2) * Math.cos(lambda1)) + (lambda1 * Math.sin(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(lambda2) * math.cos(lambda1)) + (lambda1 * math.sin(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) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(lambda1 * sin(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(lambda2) * cos(lambda1)) + (lambda1 * sin(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[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(lambda1 * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 98.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. Step-by-step derivation

   1. sin-diff 98.8%

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

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

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

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

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

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

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

8. Final simplification 99.2%

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

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

   1. sin-diff 98.8%

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

   \[\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 4: 88.9% accurate, 0.9× 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.9995:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_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.9995)
     (+ lambda1 (atan2 t_0 (+ (cos phi1) (* (cos phi2) (cos lambda1)))))
     (+
      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.9995) {
		tmp = lambda1 + atan2(t_0, (cos(phi1) + (cos(phi2) * cos(lambda1))));
	} 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.9995d0) then
        tmp = lambda1 + atan2(t_0, (cos(phi1) + (cos(phi2) * cos(lambda1))))
    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.9995) {
		tmp = lambda1 + Math.atan2(t_0, (Math.cos(phi1) + (Math.cos(phi2) * Math.cos(lambda1))));
	} 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.9995:
		tmp = lambda1 + math.atan2(t_0, (math.cos(phi1) + (math.cos(phi2) * math.cos(lambda1))))
	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.9995)
		tmp = Float64(lambda1 + atan(t_0, Float64(cos(phi1) + Float64(cos(phi2) * cos(lambda1)))));
	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.9995)
		tmp = lambda1 + atan2(t_0, (cos(phi1) + (cos(phi2) * cos(lambda1))));
	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.9995], N[(lambda1 + N[ArcTan[t$95$0 / N[(N[Cos[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $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.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. Add Preprocessing

   3. Taylor expanded in lambda2 around 0 79.5%

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

      1. +-commutative 79.5%

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

      2. *-commutative 79.5%

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

   5. Simplified 79.5%

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

   if 0.99950000000000006 < (cos.f64 phi1)

   1. Initial program 98.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 98.0%

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

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

Alternative 5: 87.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_1 \leq 0.9995:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{t\_0}{\cos \phi_1 + \cos \phi_2 \cdot \cos \lambda_2}\\ \mathbf{else}:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\cos \phi_2 \cdot 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 (sin (- lambda1 lambda2))))
   (if (<= (cos phi1) 0.9995)
     (+ lambda1 (atan2 t_0 (+ (cos phi1) (* (cos phi2) (cos lambda2)))))
     (+
      lambda1
      (atan2
       (* (cos phi2) t_0)
       (+ (* (cos phi2) (cos (- lambda1 lambda2))) 1.0))))))

C

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

Python

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

Julia

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

   3. Taylor expanded in phi2 around 0 77.4%

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

   4. Taylor expanded in lambda1 around 0 77.4%

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

      1. +-commutative 98.5%

         \[\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_2\right) + \cos \phi_1}} \]

      2. cos-neg 98.5%

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

   6. Simplified 77.4%

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

   if 0.99950000000000006 < (cos.f64 phi1)

   1. Initial program 98.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 98.0%

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

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

Alternative 6: 87.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi1) < 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. Add Preprocessing

   3. Taylor expanded in phi2 around 0 77.4%

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

   4. Taylor expanded in lambda1 around 0 77.4%

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

      1. +-commutative 98.5%

         \[\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_2\right) + \cos \phi_1}} \]

      2. cos-neg 98.5%

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

   6. Simplified 77.4%

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

   if 0.99950000000000006 < (cos.f64 phi1)

   1. Initial program 98.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 98.0%

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

      1. +-commutative 98.0%

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

      2. fma-define 98.0%

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

   5. Simplified 98.0%

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

   6. Taylor expanded in lambda1 around 0 97.3%

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

      1. cos-neg 97.3%

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

   8. Simplified 97.3%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \phi_1 \leq 0.9995:\\ \;\;\;\;\lambda_1 + \tan^{-1}_* \frac{\sin \left(\lambda_1 - \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 \cdot \cos \lambda_2 + 1}\\ \end{array} \]
5. Add Preprocessing

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

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi2) < 0.99199999999999999

   1. Initial program 97.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 phi1 around 0 79.7%

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

      1. +-commutative 79.7%

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

      2. fma-define 79.7%

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

   5. Simplified 79.7%

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

   6. Taylor expanded in lambda2 around 0 68.1%

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

      1. *-commutative 68.1%

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

   8. Simplified 68.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 \lambda_1}} \]

   if 0.99199999999999999 < (cos.f64 phi2)

   1. Initial program 99.8%

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

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

4. Final simplification 80.8%

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

Alternative 8: 98.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.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. Add Preprocessing

Alternative 9: 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 \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 98.7%

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

3. Taylor expanded in lambda1 around 0 98.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 \cdot \cos \left(-\lambda_2\right)}} \]
4. Step-by-step derivation

   1. +-commutative 98.0%

      \[\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_2\right) + \cos \phi_1}} \]

   2. cos-neg 98.0%

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

5. Simplified 98.0%

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

6. Final simplification 98.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} \]
7. Add Preprocessing

Alternative 10: 66.6% 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.835:\\ \;\;\;\;\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)}{t\_0 + 1}\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if (cos.f64 phi1) < 0.83499999999999996

   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 76.7%

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

      1. +-commutative 76.7%

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

      2. fma-undefine 76.7%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\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. add-exp-log 37.2%

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

   5. Applied egg-rr 37.2%

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

   6. Taylor expanded in phi2 around 0 75.0%

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

      1. +-commutative 75.0%

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

   8. Simplified 75.0%

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

   9. Taylor expanded in lambda2 around 0 63.7%

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

   if 0.83499999999999996 < (cos.f64 phi1)

   1. Initial program 98.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 73.5%

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

      1. +-commutative 73.5%

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

      2. fma-undefine 73.5%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\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. add-exp-log 72.9%

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

   5. Applied egg-rr 72.9%

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

   6. Taylor expanded in phi2 around 0 72.6%

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

      1. +-commutative 72.6%

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

   8. Simplified 72.6%

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

   9. Taylor expanded in phi1 around 0 71.6%

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

       1. +-commutative 71.6%

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

   11. Simplified 71.6%

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

4. Final simplification 68.5%

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

Alternative 11: 76.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\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
   (sin (- lambda1 lambda2))
   (+ (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))

C

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

Julia

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

Derivation

1. Initial program 98.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 74.7%

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

Alternative 12: 76.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\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
   (sin (- lambda1 lambda2))
   (+ (cos phi1) (* (cos phi2) (cos lambda2))))))

C

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Initial program 98.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 74.7%

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

4. Taylor expanded in lambda1 around 0 74.6%

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

   1. +-commutative 98.0%

      \[\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_2\right) + \cos \phi_1}} \]

   2. cos-neg 98.0%

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

6. Simplified 74.6%

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

7. Final simplification 74.6%

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

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < 4.00000000000000033e-5

   1. Initial program 98.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 74.2%

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

      1. +-commutative 74.2%

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

      2. fma-undefine 74.2%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\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. add-exp-log 65.2%

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

   5. Applied egg-rr 65.2%

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

   6. Taylor expanded in phi2 around 0 64.0%

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

      1. +-commutative 64.0%

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

   8. Simplified 64.0%

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

   9. Taylor expanded in phi1 around 0 68.3%

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

       1. +-commutative 68.3%

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

   11. Simplified 68.3%

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

   if 4.00000000000000033e-5 < phi1

   1. Initial program 98.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 76.4%

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

      1. +-commutative 76.4%

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

      2. fma-undefine 76.4%

         \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\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. add-exp-log 41.7%

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

   5. Applied egg-rr 41.7%

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

   6. Taylor expanded in phi2 around 0 44.5%

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

      1. +-commutative 44.5%

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

   8. Simplified 44.5%

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

   9. Taylor expanded in lambda2 around 0 66.1%

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

       1. +-commutative 66.1%

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

   11. Simplified 66.1%

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

4. Final simplification 67.7%

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

Alternative 14: 75.8% 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 98.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 74.7%

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

4. Taylor expanded in phi2 around 0 74.0%

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

Alternative 15: 75.5% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \lambda_1 + \tan^{-1}_* \frac{\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 (sin (- lambda1 lambda2)) (+ (cos lambda2) (cos phi1)))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.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 74.7%

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

   1. +-commutative 74.7%

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

   2. fma-undefine 74.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\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. add-exp-log 58.9%

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

5. Applied egg-rr 58.9%

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

6. Taylor expanded in phi2 around 0 58.8%

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

   1. +-commutative 58.8%

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

8. Simplified 58.8%

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

9. Taylor expanded in lambda1 around 0 73.9%

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

    1. cos-neg 73.9%

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

11. Simplified 73.9%

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

12. Final simplification 73.9%

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

Alternative 16: 65.8% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.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 74.7%

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

   1. +-commutative 74.7%

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

   2. fma-undefine 74.7%

      \[\leadsto \lambda_1 + \tan^{-1}_* \frac{\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. add-exp-log 58.9%

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

5. Applied egg-rr 58.9%

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

6. Taylor expanded in phi2 around 0 58.8%

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

   1. +-commutative 58.8%

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

8. Simplified 58.8%

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

9. Taylor expanded in phi1 around 0 66.8%

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

    1. +-commutative 66.8%

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

11. Simplified 66.8%

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

Alternative 17: 51.6% 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 98.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. Step-by-step derivation

   1. add-log-exp 98.7%

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

4. Applied egg-rr 98.7%

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

5. Taylor expanded in lambda1 around inf 54.8%

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

Reproduce

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