Spherical law of cosines

Percentage Accurate: 73.4% → 93.7%

Time: 32.7s

Alternatives: 22

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 73.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 93.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\right)\right) \cdot R \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (*
  (acos
   (fma
    (sin phi1)
    (sin phi2)
    (*
     (cos phi1)
     (*
      (cos phi2)
      (+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2)))))))
  R))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))))) * R;
}

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))))))) * R)
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $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[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]

Derivation

1. Initial program 73.4%

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

   1. fma-def 73.4%

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

   2. associate-*l* 73.4%

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

3. Simplified 73.4%

   \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R} \]
4. Step-by-step derivation

   1. cos-diff 95.1%

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

   2. +-commutative 95.1%

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

5. Applied egg-rr 95.1%

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

6. Final simplification 95.1%

   \[\leadsto \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\right)\right) \cdot R \]

Alternative 2: 83.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq -5.8 \cdot 10^{-6} \lor \neg \left(\phi_2 \leq 6 \cdot 10^{-5}\right):\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (or (<= phi2 -5.8e-6) (not (<= phi2 6e-5)))
   (*
    R
    (acos
     (fma
      (cos phi1)
      (* (cos phi2) (cos (- lambda1 lambda2)))
      (* (sin phi1) (sin phi2)))))
   (*
    R
    (acos
     (fma
      (sin phi1)
      (sin phi2)
      (*
       (cos phi1)
       (+
        (* (sin lambda1) (sin lambda2))
        (* (cos lambda1) (cos lambda2)))))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((phi2 <= -5.8e-6) || !(phi2 <= 6e-5)) {
		tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda1 - lambda2))), (sin(phi1) * sin(phi2))));
	} else {
		tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
	}
	return tmp;
}

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if ((phi2 <= -5.8e-6) || !(phi2 <= 6e-5))
		tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))), Float64(sin(phi1) * sin(phi2)))));
	else
		tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2)))))));
	end
	return tmp
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -5.8e-6], N[Not[LessEqual[phi2, 6e-5]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < -5.8000000000000004e-6 or 6.00000000000000015e-5 < phi2

   1. Initial program 76.3%

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

      1. expm1-log1p-u 76.3%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

   3. Applied egg-rr 76.3%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

   4. Taylor expanded in phi1 around 0 76.3%

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

      1. fma-def 76.4%

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

      2. sub-neg 76.4%

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

      3. +-commutative 76.4%

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

      4. neg-mul-1 76.4%

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

      5. fma-def 76.3%

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

      6. fma-def 76.4%

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

      7. neg-mul-1 76.4%

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

      8. +-commutative 76.4%

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

      9. sub-neg 76.4%

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

      10. fma-def 76.3%

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

      11. associate-*r* 76.3%

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

      12. *-commutative 76.3%

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

   6. Simplified 76.4%

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

   if -5.8000000000000004e-6 < phi2 < 6.00000000000000015e-5

   1. Initial program 70.2%

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

      1. fma-def 70.2%

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

      2. associate-*l* 70.2%

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

   3. Simplified 70.2%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R} \]
   4. Step-by-step derivation

      1. cos-diff 90.7%

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

      2. +-commutative 90.7%

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

   5. Applied egg-rr 90.7%

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

   6. Taylor expanded in phi1 around 0 90.7%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\right)\right)} \cdot R \]
   7. Step-by-step derivation

      1. associate-*r* 90.7%

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

      2. +-commutative 90.7%

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

      3. fma-def 90.7%

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

      4. cos-neg 90.7%

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

      5. *-commutative 90.7%

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

      6. cos-neg 90.7%

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

   8. Simplified 90.7%

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

   9. Taylor expanded in phi2 around 0 90.6%

      \[\leadsto \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \color{blue}{\cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right)}\right)\right) \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -5.8 \cdot 10^{-6} \lor \neg \left(\phi_2 \leq 6 \cdot 10^{-5}\right):\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\right)\\ \end{array} \]

Alternative 3: 93.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right)\right) \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (*
  R
  (acos
   (+
    (* (sin phi1) (sin phi2))
    (*
     (+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2)))
     (* (cos phi1) (cos phi2)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * acos(((sin(phi1) * sin(phi2)) + (((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))) * (cos(phi1) * cos(phi2)))));
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * acos(((sin(phi1) * sin(phi2)) + (((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))) * (cos(phi1) * cos(phi2)))))
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda1) * Math.cos(lambda2))) * (Math.cos(phi1) * Math.cos(phi2)))));
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda1) * math.cos(lambda2))) * (math.cos(phi1) * math.cos(phi2)))))

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))) * Float64(cos(phi1) * cos(phi2))))))
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = R * acos(((sin(phi1) * sin(phi2)) + (((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))) * (cos(phi1) * cos(phi2)))));
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 73.4%

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

   1. cos-diff 95.1%

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

   2. +-commutative 95.1%

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

3. Applied egg-rr 95.1%

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

4. Final simplification 95.1%

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

Alternative 4: 81.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.9 \cdot 10^{+60} \lor \neg \left(\phi_1 \leq 1.05 \cdot 10^{-18}\right):\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right) + \phi_1 \cdot \sin \phi_2\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (or (<= phi1 -1.9e+60) (not (<= phi1 1.05e-18)))
   (*
    R
    (acos
     (fma
      (cos phi1)
      (* (cos phi2) (cos (- lambda1 lambda2)))
      (* (sin phi1) (sin phi2)))))
   (*
    R
    (acos
     (+
      (*
       (+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2)))
       (* (cos phi1) (cos phi2)))
      (* phi1 (sin phi2)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((phi1 <= -1.9e+60) || !(phi1 <= 1.05e-18)) {
		tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda1 - lambda2))), (sin(phi1) * sin(phi2))));
	} else {
		tmp = R * acos(((((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))) * (cos(phi1) * cos(phi2))) + (phi1 * sin(phi2))));
	}
	return tmp;
}

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if ((phi1 <= -1.9e+60) || !(phi1 <= 1.05e-18))
		tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))), Float64(sin(phi1) * sin(phi2)))));
	else
		tmp = Float64(R * acos(Float64(Float64(Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))) * Float64(cos(phi1) * cos(phi2))) + Float64(phi1 * sin(phi2)))));
	end
	return tmp
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi1, -1.9e+60], N[Not[LessEqual[phi1, 1.05e-18]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -1.90000000000000005e60 or 1.05e-18 < phi1

   1. Initial program 84.3%

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

      1. expm1-log1p-u 84.3%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

   3. Applied egg-rr 84.3%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

   4. Taylor expanded in phi1 around 0 84.3%

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

      1. fma-def 84.3%

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

      2. sub-neg 84.3%

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

      3. +-commutative 84.3%

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

      4. neg-mul-1 84.3%

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

      5. fma-def 84.3%

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

      6. fma-def 84.3%

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

      7. neg-mul-1 84.3%

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

      8. +-commutative 84.3%

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

      9. sub-neg 84.3%

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

      10. fma-def 84.3%

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

      11. associate-*r* 84.3%

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

      12. *-commutative 84.3%

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

   6. Simplified 84.4%

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

   if -1.90000000000000005e60 < phi1 < 1.05e-18

   1. Initial program 61.6%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 61.3%

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

      1. cos-diff 90.9%

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

      2. +-commutative 90.9%

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

   4. Applied egg-rr 89.3%

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

4. Final simplification 86.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.9 \cdot 10^{+60} \lor \neg \left(\phi_1 \leq 1.05 \cdot 10^{-18}\right):\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right) + \phi_1 \cdot \sin \phi_2\right)\\ \end{array} \]

Alternative 5: 75.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq -3.4 \cdot 10^{-156} \lor \neg \left(\phi_2 \leq 2.1 \cdot 10^{-128}\right):\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (or (<= phi2 -3.4e-156) (not (<= phi2 2.1e-128)))
   (*
    R
    (acos
     (fma
      (cos phi1)
      (* (cos phi2) (cos (- lambda1 lambda2)))
      (* (sin phi1) (sin phi2)))))
   (*
    R
    (acos
     (+
      (* phi1 phi2)
      (*
       (cos phi1)
       (+
        (* (sin lambda1) (sin lambda2))
        (* (cos lambda1) (cos lambda2)))))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((phi2 <= -3.4e-156) || !(phi2 <= 2.1e-128)) {
		tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda1 - lambda2))), (sin(phi1) * sin(phi2))));
	} else {
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
	}
	return tmp;
}

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if ((phi2 <= -3.4e-156) || !(phi2 <= 2.1e-128))
		tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))), Float64(sin(phi1) * sin(phi2)))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2)))))));
	end
	return tmp
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -3.4e-156], N[Not[LessEqual[phi2, 2.1e-128]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < -3.3999999999999999e-156 or 2.1000000000000001e-128 < phi2

   1. Initial program 74.4%

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

      1. expm1-log1p-u 74.4%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

   3. Applied egg-rr 74.4%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

   4. Taylor expanded in phi1 around 0 74.4%

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

      1. fma-def 74.4%

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

      2. sub-neg 74.4%

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

      3. +-commutative 74.4%

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

      4. neg-mul-1 74.4%

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

      5. fma-def 74.4%

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

      6. fma-def 74.4%

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

      7. neg-mul-1 74.4%

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

      8. +-commutative 74.4%

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

      9. sub-neg 74.4%

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

      10. fma-def 74.4%

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

      11. associate-*r* 74.4%

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

      12. *-commutative 74.4%

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

   6. Simplified 74.5%

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

   if -3.3999999999999999e-156 < phi2 < 2.1000000000000001e-128

   1. Initial program 70.8%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 54.5%

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

   3. Taylor expanded in phi2 around 0 54.5%

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

   4. Taylor expanded in phi2 around 0 54.5%

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

      1. cos-diff 90.7%

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

      2. +-commutative 90.7%

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

   6. Applied egg-rr 74.4%

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

4. Final simplification 74.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -3.4 \cdot 10^{-156} \lor \neg \left(\phi_2 \leq 2.1 \cdot 10^{-128}\right):\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\\ \end{array} \]

Alternative 6: 75.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq -4.5 \cdot 10^{-155} \lor \neg \left(\phi_2 \leq 3.9 \cdot 10^{-129}\right):\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (or (<= phi2 -4.5e-155) (not (<= phi2 3.9e-129)))
   (*
    R
    (acos
     (+
      (* (sin phi1) (sin phi2))
      (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))
   (*
    R
    (acos
     (+
      (* phi1 phi2)
      (*
       (cos phi1)
       (+
        (* (sin lambda1) (sin lambda2))
        (* (cos lambda1) (cos lambda2)))))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((phi2 <= -4.5e-155) || !(phi2 <= 3.9e-129)) {
		tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
	} else {
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
	}
	return tmp;
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if ((phi2 <= (-4.5d-155)) .or. (.not. (phi2 <= 3.9d-129))) then
        tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
    else
        tmp = r * acos(((phi1 * phi2) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))))
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((phi2 <= -4.5e-155) || !(phi2 <= 3.9e-129)) {
		tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))));
	} else {
		tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda1) * Math.cos(lambda2))))));
	}
	return tmp;
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if (phi2 <= -4.5e-155) or not (phi2 <= 3.9e-129):
		tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2)))))
	else:
		tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda1) * math.cos(lambda2))))))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if ((phi2 <= -4.5e-155) || !(phi2 <= 3.9e-129))
		tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2)))))));
	end
	return tmp
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if ((phi2 <= -4.5e-155) || ~((phi2 <= 3.9e-129)))
		tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
	else
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -4.5e-155], N[Not[LessEqual[phi2, 3.9e-129]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < -4.5000000000000004e-155 or 3.9000000000000001e-129 < phi2

   1. Initial program 74.4%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   if -4.5000000000000004e-155 < phi2 < 3.9000000000000001e-129

   1. Initial program 70.8%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 54.5%

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

   3. Taylor expanded in phi2 around 0 54.5%

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

   4. Taylor expanded in phi2 around 0 54.5%

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

      1. cos-diff 90.7%

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

      2. +-commutative 90.7%

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

   6. Applied egg-rr 74.4%

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

4. Final simplification 74.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -4.5 \cdot 10^{-155} \lor \neg \left(\phi_2 \leq 3.9 \cdot 10^{-129}\right):\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\\ \end{array} \]

Alternative 7: 58.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\lambda_2 \leq 9.5 \cdot 10^{-8}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \lambda_1 \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda2 9.5e-8)
   (*
    R
    (acos
     (+
      (* (sin phi1) (sin phi2))
      (* (cos lambda1) (* (cos phi1) (cos phi2))))))
   (*
    R
    (acos
     (fma (sin phi1) (sin phi2) (* (cos phi2) (cos (- lambda2 lambda1))))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda2 <= 9.5e-8) {
		tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(lambda1) * (cos(phi1) * cos(phi2)))));
	} else {
		tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * cos((lambda2 - lambda1)))));
	}
	return tmp;
}

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda2 <= 9.5e-8)
		tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(lambda1) * Float64(cos(phi1) * cos(phi2))))));
	else
		tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))));
	end
	return tmp
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 9.5e-8], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < 9.50000000000000036e-8

   1. Initial program 78.9%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in lambda2 around 0 61.9%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \color{blue}{\cos \lambda_1}\right) \cdot R \]

   if 9.50000000000000036e-8 < lambda2

   1. Initial program 57.2%

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

      1. fma-def 57.2%

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

      2. associate-*l* 57.2%

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

   3. Simplified 57.2%

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

   4. Taylor expanded in phi1 around 0 36.8%

      \[\leadsto \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \color{blue}{\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_2}\right)\right) \cdot R \]
   5. Step-by-step derivation

      1. sub-neg 36.8%

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

      2. +-commutative 36.8%

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

      3. neg-mul-1 36.8%

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

      4. neg-mul-1 36.8%

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

      5. remove-double-neg 36.8%

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

      6. mul-1-neg 36.8%

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

      7. distribute-neg-in 36.8%

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

      8. +-commutative 36.8%

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

      9. cos-neg 36.8%

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

      10. +-commutative 36.8%

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

      11. mul-1-neg 36.8%

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

      12. unsub-neg 36.8%

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

   6. Simplified 36.8%

      \[\leadsto \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \color{blue}{\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_2}\right)\right) \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 55.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq 9.5 \cdot 10^{-8}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \lambda_1 \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\\ \end{array} \]

Alternative 8: 63.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \phi_1 \cdot \cos \phi_2\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\lambda_1 \leq -0.004:\\ \;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \lambda_1 \cdot t_0\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \lambda_2 \cdot t_0\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= lambda1 -0.004)
     (* R (acos (+ t_1 (* (cos lambda1) t_0))))
     (* R (acos (+ t_1 (* (cos lambda2) t_0)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos(phi1) * cos(phi2);
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (lambda1 <= -0.004) {
		tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
	} else {
		tmp = R * acos((t_1 + (cos(lambda2) * t_0)));
	}
	return tmp;
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    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(phi1) * cos(phi2)
    t_1 = sin(phi1) * sin(phi2)
    if (lambda1 <= (-0.004d0)) then
        tmp = r * acos((t_1 + (cos(lambda1) * t_0)))
    else
        tmp = r * acos((t_1 + (cos(lambda2) * t_0)))
    end if
    code = tmp
end function

Java

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

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos(phi1) * math.cos(phi2)
	t_1 = math.sin(phi1) * math.sin(phi2)
	tmp = 0
	if lambda1 <= -0.004:
		tmp = R * math.acos((t_1 + (math.cos(lambda1) * t_0)))
	else:
		tmp = R * math.acos((t_1 + (math.cos(lambda2) * t_0)))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(cos(phi1) * cos(phi2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (lambda1 <= -0.004)
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(lambda1) * t_0))));
	else
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(lambda2) * t_0))));
	end
	return tmp
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(phi1) * cos(phi2);
	t_1 = sin(phi1) * sin(phi2);
	tmp = 0.0;
	if (lambda1 <= -0.004)
		tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
	else
		tmp = R * acos((t_1 + (cos(lambda2) * t_0)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -0.004], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[lambda1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[lambda2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -0.0040000000000000001

   1. Initial program 60.0%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in lambda2 around 0 60.0%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \color{blue}{\cos \lambda_1}\right) \cdot R \]

   if -0.0040000000000000001 < lambda1

   1. Initial program 78.6%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in lambda1 around 0 66.5%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \color{blue}{\cos \left(-\lambda_2\right)}\right) \cdot R \]
   3. Step-by-step derivation

      1. cos-neg 21.9%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \lambda_2} \cdot \cos \phi_1\right) \cdot R \]

   4. Simplified 66.5%

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

4. Final simplification 64.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -0.004:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \lambda_1 \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \lambda_2 \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right)\right)\\ \end{array} \]

Alternative 9: 73.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (*
  R
  (acos
   (+
    (* (sin phi1) (sin phi2))
    (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
end function

Java

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

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2)))))

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))))
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 73.4%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

2. Final simplification 73.4%

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

Alternative 10: 57.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.05:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -1.05)
   (*
    R
    (acos
     (fma (sin phi1) (sin phi2) (* (cos phi1) (cos (- lambda2 lambda1))))))
   (*
    R
    (acos
     (+
      (* phi1 (sin phi2))
      (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.05) {
		tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * cos((lambda2 - lambda1)))));
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
	}
	return tmp;
}

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -1.05)
		tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))));
	end
	return tmp
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.05], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -1.05000000000000004

   1. Initial program 69.9%

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

      1. fma-def 70.0%

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

      2. associate-*l* 69.9%

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

   3. Simplified 69.9%

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

   4. Taylor expanded in phi2 around 0 52.0%

      \[\leadsto \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \color{blue}{\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1}\right)\right) \cdot R \]
   5. Step-by-step derivation

      1. sub-neg 52.0%

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

      2. +-commutative 52.0%

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

      3. neg-mul-1 52.0%

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

      4. neg-mul-1 52.0%

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

      5. remove-double-neg 52.0%

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

      6. mul-1-neg 52.0%

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

      7. distribute-neg-in 52.0%

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

      8. +-commutative 52.0%

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

      9. cos-neg 52.0%

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

      10. +-commutative 52.0%

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

      11. mul-1-neg 52.0%

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

      12. unsub-neg 52.0%

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

   6. Simplified 52.0%

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

   if -1.05000000000000004 < phi1

   1. Initial program 74.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 42.9%

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

4. Final simplification 44.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.05:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]

Alternative 11: 57.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\ \mathbf{if}\;\phi_2 \leq 2.2 \cdot 10^{-37}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot t_0\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot t_0\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (cos (- lambda2 lambda1))))
   (if (<= phi2 2.2e-37)
     (* R (acos (fma (sin phi1) (sin phi2) (* (cos phi1) t_0))))
     (* R (acos (fma (sin phi1) (sin phi2) (* (cos phi2) t_0)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos((lambda2 - lambda1));
	double tmp;
	if (phi2 <= 2.2e-37) {
		tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * t_0)));
	} else {
		tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * t_0)));
	}
	return tmp;
}

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda2 - lambda1))
	tmp = 0.0
	if (phi2 <= 2.2e-37)
		tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * t_0))));
	else
		tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * t_0))));
	end
	return tmp
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 2.2e-37], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 2.20000000000000002e-37

   1. Initial program 71.1%

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

      1. fma-def 71.1%

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

      2. associate-*l* 71.1%

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

   3. Simplified 71.1%

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

   4. Taylor expanded in phi2 around 0 51.1%

      \[\leadsto \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \color{blue}{\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1}\right)\right) \cdot R \]
   5. Step-by-step derivation

      1. sub-neg 51.1%

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

      2. +-commutative 51.1%

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

      3. neg-mul-1 51.1%

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

      4. neg-mul-1 51.1%

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

      5. remove-double-neg 51.1%

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

      6. mul-1-neg 51.1%

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

      7. distribute-neg-in 51.1%

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

      8. +-commutative 51.1%

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

      9. cos-neg 51.1%

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

      10. +-commutative 51.1%

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

      11. mul-1-neg 51.1%

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

      12. unsub-neg 51.1%

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

   6. Simplified 51.1%

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

   if 2.20000000000000002e-37 < phi2

   1. Initial program 79.7%

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

      1. fma-def 79.8%

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

      2. associate-*l* 79.8%

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

   3. Simplified 79.8%

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

   4. Taylor expanded in phi1 around 0 43.3%

      \[\leadsto \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \color{blue}{\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_2}\right)\right) \cdot R \]
   5. Step-by-step derivation

      1. sub-neg 43.3%

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

      2. +-commutative 43.3%

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

      3. neg-mul-1 43.3%

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

      4. neg-mul-1 43.3%

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

      5. remove-double-neg 43.3%

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

      6. mul-1-neg 43.3%

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

      7. distribute-neg-in 43.3%

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

      8. +-commutative 43.3%

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

      9. cos-neg 43.3%

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

      10. +-commutative 43.3%

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

      11. mul-1-neg 43.3%

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

      12. unsub-neg 43.3%

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

   6. Simplified 43.3%

      \[\leadsto \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \color{blue}{\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_2}\right)\right) \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 49.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq 2.2 \cdot 10^{-37}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\\ \end{array} \]

Alternative 12: 49.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \phi_1 \cdot \cos \phi_2\\ \mathbf{if}\;\phi_1 \leq -3 \cdot 10^{+60}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_1 \cdot t_0 + \sin \phi_1 \cdot \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (cos phi1) (cos phi2))))
   (if (<= phi1 -3e+60)
     (* R (acos (+ (* (cos lambda1) t_0) (* (sin phi1) phi2))))
     (* R (acos (+ (* phi1 (sin phi2)) (* t_0 (cos (- lambda1 lambda2)))))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos(phi1) * cos(phi2);
	double tmp;
	if (phi1 <= -3e+60) {
		tmp = R * acos(((cos(lambda1) * t_0) + (sin(phi1) * phi2)));
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + (t_0 * cos((lambda1 - lambda2)))));
	}
	return tmp;
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    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(phi1) * cos(phi2)
    if (phi1 <= (-3d+60)) then
        tmp = r * acos(((cos(lambda1) * t_0) + (sin(phi1) * phi2)))
    else
        tmp = r * acos(((phi1 * sin(phi2)) + (t_0 * cos((lambda1 - lambda2)))))
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos(phi1) * Math.cos(phi2);
	double tmp;
	if (phi1 <= -3e+60) {
		tmp = R * Math.acos(((Math.cos(lambda1) * t_0) + (Math.sin(phi1) * phi2)));
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (t_0 * Math.cos((lambda1 - lambda2)))));
	}
	return tmp;
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos(phi1) * math.cos(phi2)
	tmp = 0
	if phi1 <= -3e+60:
		tmp = R * math.acos(((math.cos(lambda1) * t_0) + (math.sin(phi1) * phi2)))
	else:
		tmp = R * math.acos(((phi1 * math.sin(phi2)) + (t_0 * math.cos((lambda1 - lambda2)))))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(cos(phi1) * cos(phi2))
	tmp = 0.0
	if (phi1 <= -3e+60)
		tmp = Float64(R * acos(Float64(Float64(cos(lambda1) * t_0) + Float64(sin(phi1) * phi2))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(t_0 * cos(Float64(lambda1 - lambda2))))));
	end
	return tmp
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(phi1) * cos(phi2);
	tmp = 0.0;
	if (phi1 <= -3e+60)
		tmp = R * acos(((cos(lambda1) * t_0) + (sin(phi1) * phi2)));
	else
		tmp = R * acos(((phi1 * sin(phi2)) + (t_0 * cos((lambda1 - lambda2)))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -3e+60], N[(R * N[ArcCos[N[(N[(N[Cos[lambda1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -2.9999999999999998e60

   1. Initial program 72.4%

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

      1. expm1-log1p-u 72.3%

         \[\leadsto \cos^{-1} \left(\color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)\right)} + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

      2. expm1-udef 72.3%

         \[\leadsto \cos^{-1} \left(\color{blue}{\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right)} + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Applied egg-rr 72.3%

      \[\leadsto \cos^{-1} \left(\color{blue}{\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right)} + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   4. Taylor expanded in lambda2 around 0 55.0%

      \[\leadsto \cos^{-1} \left(\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right) + \color{blue}{\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \lambda_1\right)}\right) \cdot R \]
   5. Step-by-step derivation

      1. associate-*r* 55.0%

         \[\leadsto \cos^{-1} \left(\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right) + \color{blue}{\left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \lambda_1}\right) \cdot R \]

   6. Simplified 55.0%

      \[\leadsto \cos^{-1} \left(\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right) + \color{blue}{\left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \lambda_1}\right) \cdot R \]

   7. Taylor expanded in phi2 around 0 31.7%

      \[\leadsto \cos^{-1} \left(\color{blue}{\sin \phi_1 \cdot \phi_2} + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \lambda_1\right) \cdot R \]

   if -2.9999999999999998e60 < phi1

   1. Initial program 73.6%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 43.0%

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

4. Final simplification 41.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -3 \cdot 10^{+60}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_1 \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right) + \sin \phi_1 \cdot \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]

Alternative 13: 53.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} t_0 := \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\phi_1 \leq -1 \cdot 10^{+59}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t_0 + \sin \phi_1 \cdot \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + t_0\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
   (if (<= phi1 -1e+59)
     (* R (acos (+ t_0 (* (sin phi1) phi2))))
     (* R (acos (+ (* phi1 (sin phi2)) t_0))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2));
	double tmp;
	if (phi1 <= -1e+59) {
		tmp = R * acos((t_0 + (sin(phi1) * phi2)));
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + t_0));
	}
	return tmp;
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    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(phi1) * cos(phi2)) * cos((lambda1 - lambda2))
    if (phi1 <= (-1d+59)) then
        tmp = r * acos((t_0 + (sin(phi1) * phi2)))
    else
        tmp = r * acos(((phi1 * sin(phi2)) + t_0))
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2));
	double tmp;
	if (phi1 <= -1e+59) {
		tmp = R * Math.acos((t_0 + (Math.sin(phi1) * phi2)));
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + t_0));
	}
	return tmp;
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = (math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))
	tmp = 0
	if phi1 <= -1e+59:
		tmp = R * math.acos((t_0 + (math.sin(phi1) * phi2)))
	else:
		tmp = R * math.acos(((phi1 * math.sin(phi2)) + t_0))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))
	tmp = 0.0
	if (phi1 <= -1e+59)
		tmp = Float64(R * acos(Float64(t_0 + Float64(sin(phi1) * phi2))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + t_0)));
	end
	return tmp
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = (cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2));
	tmp = 0.0;
	if (phi1 <= -1e+59)
		tmp = R * acos((t_0 + (sin(phi1) * phi2)));
	else
		tmp = R * acos(((phi1 * sin(phi2)) + t_0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -1e+59], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -9.99999999999999972e58

   1. Initial program 72.4%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi2 around 0 43.7%

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

   if -9.99999999999999972e58 < phi1

   1. Initial program 73.6%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 43.0%

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

4. Final simplification 43.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1 \cdot 10^{+59}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right) + \sin \phi_1 \cdot \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]

Alternative 14: 43.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\phi_1 \leq -1.4 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_1 \cdot t_0\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot t_0\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (cos (- lambda1 lambda2))))
   (if (<= phi1 -1.4e-5)
     (* R (acos (+ (* phi1 phi2) (log1p (expm1 (* (cos phi1) t_0))))))
     (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) t_0)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos((lambda1 - lambda2));
	double tmp;
	if (phi1 <= -1.4e-5) {
		tmp = R * acos(((phi1 * phi2) + log1p(expm1((cos(phi1) * t_0)))));
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)));
	}
	return tmp;
}

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos((lambda1 - lambda2));
	double tmp;
	if (phi1 <= -1.4e-5) {
		tmp = R * Math.acos(((phi1 * phi2) + Math.log1p(Math.expm1((Math.cos(phi1) * t_0)))));
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * t_0)));
	}
	return tmp;
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((lambda1 - lambda2))
	tmp = 0
	if phi1 <= -1.4e-5:
		tmp = R * math.acos(((phi1 * phi2) + math.log1p(math.expm1((math.cos(phi1) * t_0)))))
	else:
		tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * t_0)))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (phi1 <= -1.4e-5)
		tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + log1p(expm1(Float64(cos(phi1) * t_0))))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * t_0))));
	end
	return tmp
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -1.4e-5], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[Log[1 + N[(Exp[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -1.39999999999999998e-5

   1. Initial program 69.9%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 21.8%

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

   3. Taylor expanded in phi2 around 0 21.8%

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

   4. Taylor expanded in phi2 around 0 21.8%

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

      1. *-commutative 21.8%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \color{blue}{\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)}\right) \cdot R \]

      2. log1p-expm1-u 21.8%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

   6. Applied egg-rr 21.8%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

   if -1.39999999999999998e-5 < phi1

   1. Initial program 74.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 42.9%

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

   3. Taylor expanded in phi1 around 0 38.2%

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

4. Final simplification 34.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.4 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]

Alternative 15: 48.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.4 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_1 \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right) + \sin \phi_1 \cdot \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -1.4e-5)
   (*
    R
    (acos (+ (* (cos lambda1) (* (cos phi1) (cos phi2))) (* (sin phi1) phi2))))
   (*
    R
    (acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos (- lambda1 lambda2))))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.4e-5) {
		tmp = R * acos(((cos(lambda1) * (cos(phi1) * cos(phi2))) + (sin(phi1) * phi2)));
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
	}
	return tmp;
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (phi1 <= (-1.4d-5)) then
        tmp = r * acos(((cos(lambda1) * (cos(phi1) * cos(phi2))) + (sin(phi1) * phi2)))
    else
        tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))))
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.4e-5) {
		tmp = R * Math.acos(((Math.cos(lambda1) * (Math.cos(phi1) * Math.cos(phi2))) + (Math.sin(phi1) * phi2)));
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos((lambda1 - lambda2)))));
	}
	return tmp;
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi1 <= -1.4e-5:
		tmp = R * math.acos(((math.cos(lambda1) * (math.cos(phi1) * math.cos(phi2))) + (math.sin(phi1) * phi2)))
	else:
		tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos((lambda1 - lambda2)))))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -1.4e-5)
		tmp = Float64(R * acos(Float64(Float64(cos(lambda1) * Float64(cos(phi1) * cos(phi2))) + Float64(sin(phi1) * phi2))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))));
	end
	return tmp
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi1 <= -1.4e-5)
		tmp = R * acos(((cos(lambda1) * (cos(phi1) * cos(phi2))) + (sin(phi1) * phi2)));
	else
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.4e-5], N[(R * N[ArcCos[N[(N[(N[Cos[lambda1], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $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 phi1 < -1.39999999999999998e-5

   1. Initial program 69.9%

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

      1. expm1-log1p-u 69.8%

         \[\leadsto \cos^{-1} \left(\color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)\right)} + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

      2. expm1-udef 69.8%

         \[\leadsto \cos^{-1} \left(\color{blue}{\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right)} + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Applied egg-rr 69.8%

      \[\leadsto \cos^{-1} \left(\color{blue}{\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right)} + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   4. Taylor expanded in lambda2 around 0 52.0%

      \[\leadsto \cos^{-1} \left(\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right) + \color{blue}{\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \lambda_1\right)}\right) \cdot R \]
   5. Step-by-step derivation

      1. associate-*r* 52.0%

         \[\leadsto \cos^{-1} \left(\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right) + \color{blue}{\left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \lambda_1}\right) \cdot R \]

   6. Simplified 52.0%

      \[\leadsto \cos^{-1} \left(\left(e^{\mathsf{log1p}\left(\sin \phi_1 \cdot \sin \phi_2\right)} - 1\right) + \color{blue}{\left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \lambda_1}\right) \cdot R \]

   7. Taylor expanded in phi2 around 0 31.1%

      \[\leadsto \cos^{-1} \left(\color{blue}{\sin \phi_1 \cdot \phi_2} + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \lambda_1\right) \cdot R \]

   if -1.39999999999999998e-5 < phi1

   1. Initial program 74.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 42.9%

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

   3. Taylor expanded in phi1 around 0 38.2%

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

4. Final simplification 36.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.4 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_1 \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right) + \sin \phi_1 \cdot \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]

Alternative 16: 43.4% accurate, 1.5× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\phi_1 \leq -1.4 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot t_0\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot t_0\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (cos (- lambda1 lambda2))))
   (if (<= phi1 -1.4e-5)
     (* R (acos (+ (* phi1 phi2) (* (cos phi1) t_0))))
     (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) t_0)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos((lambda1 - lambda2));
	double tmp;
	if (phi1 <= -1.4e-5) {
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * t_0)));
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)));
	}
	return tmp;
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    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 (phi1 <= (-1.4d-5)) then
        tmp = r * acos(((phi1 * phi2) + (cos(phi1) * t_0)))
    else
        tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)))
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos((lambda1 - lambda2));
	double tmp;
	if (phi1 <= -1.4e-5) {
		tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * t_0)));
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * t_0)));
	}
	return tmp;
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((lambda1 - lambda2))
	tmp = 0
	if phi1 <= -1.4e-5:
		tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * t_0)))
	else:
		tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * t_0)))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (phi1 <= -1.4e-5)
		tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * t_0))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * t_0))));
	end
	return tmp
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((lambda1 - lambda2));
	tmp = 0.0;
	if (phi1 <= -1.4e-5)
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * t_0)));
	else
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -1.4e-5], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -1.39999999999999998e-5

   1. Initial program 69.9%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 21.8%

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

   3. Taylor expanded in phi2 around 0 21.8%

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

   4. Taylor expanded in phi2 around 0 21.8%

      \[\leadsto \cos^{-1} \left(\color{blue}{\phi_1 \cdot \phi_2} + \cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1\right) \cdot R \]

   if -1.39999999999999998e-5 < phi1

   1. Initial program 74.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 42.9%

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

   3. Taylor expanded in phi1 around 0 38.2%

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

4. Final simplification 34.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.4 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]

Alternative 17: 23.2% accurate, 1.5× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} t_0 := \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\lambda_1 \leq -0.0055:\\ \;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_2\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* phi1 (sin phi2))))
   (if (<= lambda1 -0.0055)
     (* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
     (* R (acos (+ t_0 (* (cos phi1) (cos lambda2))))))))

C

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

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    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 = phi1 * sin(phi2)
    if (lambda1 <= (-0.0055d0)) then
        tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
    else
        tmp = r * acos((t_0 + (cos(phi1) * cos(lambda2))))
    end if
    code = tmp
end function

Java

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

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = phi1 * math.sin(phi2)
	tmp = 0
	if lambda1 <= -0.0055:
		tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1))))
	else:
		tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda2))))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(phi1 * sin(phi2))
	tmp = 0.0
	if (lambda1 <= -0.0055)
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1)))));
	else
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda2)))));
	end
	return tmp
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = phi1 * sin(phi2);
	tmp = 0.0;
	if (lambda1 <= -0.0055)
		tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
	else
		tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -0.0055], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -0.0054999999999999997

   1. Initial program 60.0%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 32.6%

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

   3. Taylor expanded in phi2 around 0 25.1%

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

   4. Taylor expanded in lambda2 around 0 25.2%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \lambda_1} \cdot \cos \phi_1\right) \cdot R \]

   if -0.0054999999999999997 < lambda1

   1. Initial program 78.6%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 40.8%

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

   3. Taylor expanded in phi2 around 0 25.7%

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

   4. Taylor expanded in lambda1 around 0 21.9%

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

      1. cos-neg 21.9%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \lambda_2} \cdot \cos \phi_1\right) \cdot R \]

   6. Simplified 21.9%

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

4. Final simplification 22.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -0.0055:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \lambda_2\right)\\ \end{array} \]

Alternative 18: 27.8% accurate, 1.5× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi1) (cos (- lambda1 lambda2)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda1 - lambda2)))));
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda1 - lambda2)))))
end function

Java

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

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi1) * math.cos((lambda1 - lambda2)))))

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * cos(Float64(lambda1 - lambda2))))))
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda1 - lambda2)))));
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 73.4%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

2. Taylor expanded in phi1 around 0 38.5%

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

3. Taylor expanded in phi2 around 0 25.5%

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

4. Final simplification 25.5%

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

Alternative 19: 23.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.8 \cdot 10^{-24}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\lambda_2 - \lambda_1\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -1.8e-24)
   (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos lambda1)))))
   (* R (acos (+ (* phi1 phi2) (cos (- lambda2 lambda1)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.8e-24) {
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))));
	} else {
		tmp = R * acos(((phi1 * phi2) + cos((lambda2 - lambda1))));
	}
	return tmp;
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (phi1 <= (-1.8d-24)) then
        tmp = r * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))))
    else
        tmp = r * acos(((phi1 * phi2) + cos((lambda2 - lambda1))))
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.8e-24) {
		tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos(lambda1))));
	} else {
		tmp = R * Math.acos(((phi1 * phi2) + Math.cos((lambda2 - lambda1))));
	}
	return tmp;
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi1 <= -1.8e-24:
		tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos(lambda1))))
	else:
		tmp = R * math.acos(((phi1 * phi2) + math.cos((lambda2 - lambda1))))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -1.8e-24)
		tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(lambda1)))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + cos(Float64(lambda2 - lambda1)))));
	end
	return tmp
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi1 <= -1.8e-24)
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))));
	else
		tmp = R * acos(((phi1 * phi2) + cos((lambda2 - lambda1))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.8e-24], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -1.8e-24

   1. Initial program 69.4%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 24.7%

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

   3. Taylor expanded in phi2 around 0 21.3%

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

   4. Taylor expanded in phi2 around 0 20.2%

      \[\leadsto \cos^{-1} \left(\color{blue}{\phi_1 \cdot \phi_2} + \cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1\right) \cdot R \]

   5. Taylor expanded in lambda2 around 0 15.6%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \color{blue}{\cos \phi_1 \cdot \cos \lambda_1}\right) \cdot R \]

   if -1.8e-24 < phi1

   1. Initial program 74.5%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 42.5%

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

   3. Taylor expanded in phi2 around 0 26.8%

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

   4. Taylor expanded in phi2 around 0 24.5%

      \[\leadsto \cos^{-1} \left(\color{blue}{\phi_1 \cdot \phi_2} + \cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1\right) \cdot R \]

   5. Taylor expanded in phi1 around 0 19.7%

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

      1. sub-neg 19.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)}\right) \cdot R \]

      2. +-commutative 19.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(\left(-\lambda_2\right) + \lambda_1\right)}\right) \cdot R \]

      3. neg-mul-1 19.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\color{blue}{-1 \cdot \lambda_2} + \lambda_1\right)\right) \cdot R \]

      4. neg-mul-1 19.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\color{blue}{\left(-\lambda_2\right)} + \lambda_1\right)\right) \cdot R \]

      5. remove-double-neg 19.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\left(-\lambda_2\right) + \color{blue}{\left(-\left(-\lambda_1\right)\right)}\right)\right) \cdot R \]

      6. mul-1-neg 19.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\left(-\lambda_2\right) + \left(-\color{blue}{-1 \cdot \lambda_1}\right)\right)\right) \cdot R \]

      7. distribute-neg-in 19.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(-\left(\lambda_2 + -1 \cdot \lambda_1\right)\right)}\right) \cdot R \]

      8. +-commutative 19.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(-\color{blue}{\left(-1 \cdot \lambda_1 + \lambda_2\right)}\right)\right) \cdot R \]

      9. cos-neg 19.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \color{blue}{\cos \left(-1 \cdot \lambda_1 + \lambda_2\right)}\right) \cdot R \]

      10. +-commutative 19.7%

          \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) \cdot R \]

      11. mul-1-neg 19.7%

          \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right)\right) \cdot R \]

      12. unsub-neg 19.7%

          \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(\lambda_2 - \lambda_1\right)}\right) \cdot R \]

   7. Simplified 19.7%

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

4. Final simplification 18.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.8 \cdot 10^{-24}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\lambda_2 - \lambda_1\right)\right)\\ \end{array} \]

Alternative 20: 21.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -3.8 \cdot 10^{+20}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_2\right)\\ \end{array} \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda1 -3.8e+20)
   (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos lambda1)))))
   (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos lambda2)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda1 <= -3.8e+20) {
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))));
	} else {
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda2))));
	}
	return tmp;
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (lambda1 <= (-3.8d+20)) then
        tmp = r * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))))
    else
        tmp = r * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda2))))
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda1 <= -3.8e+20) {
		tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos(lambda1))));
	} else {
		tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos(lambda2))));
	}
	return tmp;
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda1 <= -3.8e+20:
		tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos(lambda1))))
	else:
		tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos(lambda2))))
	return tmp

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda1 <= -3.8e+20)
		tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(lambda1)))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(lambda2)))));
	end
	return tmp
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (lambda1 <= -3.8e+20)
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))));
	else
		tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda2))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -3.8e+20], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -3.8e20

   1. Initial program 60.0%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 32.6%

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

   3. Taylor expanded in phi2 around 0 25.1%

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

   4. Taylor expanded in phi2 around 0 21.2%

      \[\leadsto \cos^{-1} \left(\color{blue}{\phi_1 \cdot \phi_2} + \cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1\right) \cdot R \]

   5. Taylor expanded in lambda2 around 0 21.2%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \color{blue}{\cos \phi_1 \cdot \cos \lambda_1}\right) \cdot R \]

   if -3.8e20 < lambda1

   1. Initial program 78.6%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   2. Taylor expanded in phi1 around 0 40.8%

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

   3. Taylor expanded in phi2 around 0 25.7%

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

   4. Taylor expanded in phi2 around 0 24.4%

      \[\leadsto \cos^{-1} \left(\color{blue}{\phi_1 \cdot \phi_2} + \cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1\right) \cdot R \]

   5. Taylor expanded in lambda1 around 0 20.7%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \color{blue}{\cos \phi_1 \cdot \cos \left(-\lambda_2\right)}\right) \cdot R \]
   6. Step-by-step derivation

      1. cos-neg 20.7%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \color{blue}{\cos \lambda_2}\right) \cdot R \]

   7. Simplified 20.7%

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

4. Final simplification 20.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -3.8 \cdot 10^{+20}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_2\right)\\ \end{array} \]

Alternative 21: 25.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos (- lambda1 lambda2)))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda1 - lambda2)))));
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda1 - lambda2)))))
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos((lambda1 - lambda2)))));
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos((lambda1 - lambda2)))))

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(Float64(lambda1 - lambda2))))))
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda1 - lambda2)))));
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 73.4%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

2. Taylor expanded in phi1 around 0 38.5%

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

3. Taylor expanded in phi2 around 0 25.5%

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

4. Taylor expanded in phi2 around 0 23.5%

   \[\leadsto \cos^{-1} \left(\color{blue}{\phi_1 \cdot \phi_2} + \cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1\right) \cdot R \]

5. Final simplification 23.5%

   \[\leadsto R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \]

Alternative 22: 18.4% accurate, 2.9× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\lambda_2 - \lambda_1\right)\right) \end{array} \]

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (* R (acos (+ (* phi1 phi2) (cos (- lambda2 lambda1))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * acos(((phi1 * phi2) + cos((lambda2 - lambda1))));
}

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * acos(((phi1 * phi2) + cos((lambda2 - lambda1))))
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * Math.acos(((phi1 * phi2) + Math.cos((lambda2 - lambda1))));
}

Python

[phi1, phi2] = sort([phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((phi1 * phi2) + math.cos((lambda2 - lambda1))))

Julia

phi1, phi2 = sort([phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * acos(Float64(Float64(phi1 * phi2) + cos(Float64(lambda2 - lambda1)))))
end

MATLAB

phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = R * acos(((phi1 * phi2) + cos((lambda2 - lambda1))));
end

Wolfram

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 73.4%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

2. Taylor expanded in phi1 around 0 38.5%

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

3. Taylor expanded in phi2 around 0 25.5%

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

4. Taylor expanded in phi2 around 0 23.5%

   \[\leadsto \cos^{-1} \left(\color{blue}{\phi_1 \cdot \phi_2} + \cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1\right) \cdot R \]

5. Taylor expanded in phi1 around 0 16.4%

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

   1. sub-neg 16.4%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)}\right) \cdot R \]

   2. +-commutative 16.4%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(\left(-\lambda_2\right) + \lambda_1\right)}\right) \cdot R \]

   3. neg-mul-1 16.4%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\color{blue}{-1 \cdot \lambda_2} + \lambda_1\right)\right) \cdot R \]

   4. neg-mul-1 16.4%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\color{blue}{\left(-\lambda_2\right)} + \lambda_1\right)\right) \cdot R \]

   5. remove-double-neg 16.4%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\left(-\lambda_2\right) + \color{blue}{\left(-\left(-\lambda_1\right)\right)}\right)\right) \cdot R \]

   6. mul-1-neg 16.4%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\left(-\lambda_2\right) + \left(-\color{blue}{-1 \cdot \lambda_1}\right)\right)\right) \cdot R \]

   7. distribute-neg-in 16.4%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(-\left(\lambda_2 + -1 \cdot \lambda_1\right)\right)}\right) \cdot R \]

   8. +-commutative 16.4%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(-\color{blue}{\left(-1 \cdot \lambda_1 + \lambda_2\right)}\right)\right) \cdot R \]

   9. cos-neg 16.4%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \color{blue}{\cos \left(-1 \cdot \lambda_1 + \lambda_2\right)}\right) \cdot R \]

   10. +-commutative 16.4%

       \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right) \cdot R \]

   11. mul-1-neg 16.4%

       \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right)\right) \cdot R \]

   12. unsub-neg 16.4%

       \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \color{blue}{\left(\lambda_2 - \lambda_1\right)}\right) \cdot R \]

7. Simplified 16.4%

   \[\leadsto \cos^{-1} \left(\phi_1 \cdot \phi_2 + \color{blue}{\cos \left(\lambda_2 - \lambda_1\right)}\right) \cdot R \]

8. Final simplification 16.4%

   \[\leadsto R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\lambda_2 - \lambda_1\right)\right) \]

Reproduce

herbie shell --seed 2023252 
(FPCore (R lambda1 lambda2 phi1 phi2)
  :name "Spherical law of cosines"
  :precision binary64
  (* (acos (+ (* (sin phi1) (sin phi2)) (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))) R))