Equirectangular approximation to distance on a great circle

Percentage Accurate: 59.7% → 99.9%

Time: 21.1s

Alternatives: 11

Speedup: 1.6×

• 30.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\ R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))))
   (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
	return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}

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
    real(8) :: t_0
    t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
    code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
	return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))
	return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0)))
	return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2)))))
end

MATLAB

function tmp = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
	tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Initial Program: 59.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\ R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))))
   (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
	return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}

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
    real(8) :: t_0
    t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
    code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
	return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))
	return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0)))
	return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2)))))
end

MATLAB

function tmp = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
	tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Alternative 1: 99.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{fma}\left(\cos \left(\phi_2 \cdot 0.5\right), \cos \left(0.5 \cdot \phi_1\right), \sin \left(\phi_2 \cdot 0.5\right) \cdot \left(-\sin \left(0.5 \cdot \phi_1\right)\right)\right), \phi_1 - \phi_2\right) \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (*
  R
  (hypot
   (*
    (- lambda1 lambda2)
    (fma
     (cos (* phi2 0.5))
     (cos (* 0.5 phi1))
     (* (sin (* phi2 0.5)) (- (sin (* 0.5 phi1))))))
   (- phi1 phi2))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * hypot(((lambda1 - lambda2) * fma(cos((phi2 * 0.5)), cos((0.5 * phi1)), (sin((phi2 * 0.5)) * -sin((0.5 * phi1))))), (phi1 - phi2));
}

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * fma(cos(Float64(phi2 * 0.5)), cos(Float64(0.5 * phi1)), Float64(sin(Float64(phi2 * 0.5)) * Float64(-sin(Float64(0.5 * phi1)))))), Float64(phi1 - phi2)))
end

Wolfram

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

Derivation

1. Initial program 57.0%

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

   1. hypot-define 96.6%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

3. Simplified 96.6%

   \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. log1p-expm1-u 96.5%

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

   2. div-inv 96.5%

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

   3. metadata-eval 96.5%

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

6. Applied egg-rr 96.5%

   \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\cos \left(\left(\phi_1 + \phi_2\right) \cdot 0.5\right)\right)\right)}, \phi_1 - \phi_2\right) \]
7. Step-by-step derivation

   1. *-commutative 96.5%

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

   2. +-commutative 96.5%

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

   3. distribute-rgt-in 96.5%

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

   4. cos-sum 99.9%

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

8. Applied egg-rr 99.9%

   \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(\color{blue}{\cos \left(\phi_2 \cdot 0.5\right) \cdot \cos \left(\phi_1 \cdot 0.5\right) - \sin \left(\phi_2 \cdot 0.5\right) \cdot \sin \left(\phi_1 \cdot 0.5\right)}\right)\right), \phi_1 - \phi_2\right) \]
9. Step-by-step derivation

   1. log1p-expm1-u 99.9%

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

   2. cancel-sign-sub-inv 99.9%

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

   3. fma-define 99.9%

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

   4. *-commutative 99.9%

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

   5. *-commutative 99.9%

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

10. Applied egg-rr 99.9%

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

11. Final simplification 99.9%

    \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{fma}\left(\cos \left(\phi_2 \cdot 0.5\right), \cos \left(0.5 \cdot \phi_1\right), \sin \left(\phi_2 \cdot 0.5\right) \cdot \left(-\sin \left(0.5 \cdot \phi_1\right)\right)\right), \phi_1 - \phi_2\right) \]
12. Add Preprocessing

Alternative 2: 93.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -0.032:\\ \;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -0.032)
   (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2)))
   (* R (hypot (* (- lambda1 lambda2) (cos (* phi2 0.5))) (- phi1 phi2)))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -0.032) {
		tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
	} else {
		tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2));
	}
	return tmp;
}

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -0.032) {
		tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), (phi1 - phi2));
	} else {
		tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi2 * 0.5))), (phi1 - phi2));
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi1 <= -0.032:
		tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2))
	else:
		tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi2 * 0.5))), (phi1 - phi2))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -0.032)
		tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2)));
	else
		tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi1 <= -0.032)
		tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
	else
		tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2));
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.032], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -0.032000000000000001

   1. Initial program 46.1%

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

      1. hypot-define 91.5%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 91.5%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around 0 91.4%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\cos \left(0.5 \cdot \phi_1\right)}, \phi_1 - \phi_2\right) \]

   if -0.032000000000000001 < phi1

   1. Initial program 60.1%

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

      1. hypot-define 98.0%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 98.0%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 95.1%

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

4. Final simplification 94.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -0.032:\\ \;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.0% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_2 + \phi_1}{2}\right), \phi_1 - \phi_2\right) \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (*
  R
  (hypot (* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0))) (- phi1 phi2))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2))

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2)))
end

MATLAB

function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 57.0%

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

   1. hypot-define 96.6%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

3. Simplified 96.6%

   \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
4. Add Preprocessing

5. Final simplification 96.6%

   \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_2 + \phi_1}{2}\right), \phi_1 - \phi_2\right) \]
6. Add Preprocessing

Alternative 4: 90.4% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right) \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
}

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2))

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2)))
end

MATLAB

function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
end

Wolfram

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

Derivation

1. Initial program 57.0%

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

   1. hypot-define 96.6%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

3. Simplified 96.6%

   \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
4. Add Preprocessing

5. Taylor expanded in phi2 around 0 90.2%

   \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\cos \left(0.5 \cdot \phi_1\right)}, \phi_1 - \phi_2\right) \]
6. Add Preprocessing

Alternative 5: 34.3% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_2 \leq 5.8 \cdot 10^{+141}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{elif}\;\lambda_2 \leq 7.8 \cdot 10^{+155} \lor \neg \left(\lambda_2 \leq 2.65 \cdot 10^{+183}\right):\\ \;\;\;\;R \cdot \left(\lambda_2 \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda2 5.8e+141)
   (* R (- phi2 phi1))
   (if (or (<= lambda2 7.8e+155) (not (<= lambda2 2.65e+183)))
     (* R (* lambda2 (cos (* 0.5 (+ phi2 phi1)))))
     (* R (* phi1 (+ (/ phi2 phi1) -1.0))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda2 <= 5.8e+141) {
		tmp = R * (phi2 - phi1);
	} else if ((lambda2 <= 7.8e+155) || !(lambda2 <= 2.65e+183)) {
		tmp = R * (lambda2 * cos((0.5 * (phi2 + phi1))));
	} else {
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
	}
	return tmp;
}

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
    real(8) :: tmp
    if (lambda2 <= 5.8d+141) then
        tmp = r * (phi2 - phi1)
    else if ((lambda2 <= 7.8d+155) .or. (.not. (lambda2 <= 2.65d+183))) then
        tmp = r * (lambda2 * cos((0.5d0 * (phi2 + phi1))))
    else
        tmp = r * (phi1 * ((phi2 / phi1) + (-1.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda2 <= 5.8e+141) {
		tmp = R * (phi2 - phi1);
	} else if ((lambda2 <= 7.8e+155) || !(lambda2 <= 2.65e+183)) {
		tmp = R * (lambda2 * Math.cos((0.5 * (phi2 + phi1))));
	} else {
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda2 <= 5.8e+141:
		tmp = R * (phi2 - phi1)
	elif (lambda2 <= 7.8e+155) or not (lambda2 <= 2.65e+183):
		tmp = R * (lambda2 * math.cos((0.5 * (phi2 + phi1))))
	else:
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda2 <= 5.8e+141)
		tmp = Float64(R * Float64(phi2 - phi1));
	elseif ((lambda2 <= 7.8e+155) || !(lambda2 <= 2.65e+183))
		tmp = Float64(R * Float64(lambda2 * cos(Float64(0.5 * Float64(phi2 + phi1)))));
	else
		tmp = Float64(R * Float64(phi1 * Float64(Float64(phi2 / phi1) + -1.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (lambda2 <= 5.8e+141)
		tmp = R * (phi2 - phi1);
	elseif ((lambda2 <= 7.8e+155) || ~((lambda2 <= 2.65e+183)))
		tmp = R * (lambda2 * cos((0.5 * (phi2 + phi1))));
	else
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 5.8e+141], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[lambda2, 7.8e+155], N[Not[LessEqual[lambda2, 2.65e+183]], $MachinePrecision]], N[(R * N[(lambda2 * N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi1 * N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if lambda2 < 5.80000000000000013e141

   1. Initial program 58.7%

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

      1. hypot-define 96.1%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 96.1%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around inf 28.5%

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

      1. mul-1-neg 28.5%

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

      2. unsub-neg 28.5%

         \[\leadsto R \cdot \left(\phi_2 \cdot \color{blue}{\left(1 - \frac{\phi_1}{\phi_2}\right)}\right) \]

   7. Simplified 28.5%

      \[\leadsto R \cdot \color{blue}{\left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)} \]

   8. Taylor expanded in phi2 around 0 31.5%

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

      1. mul-1-neg 31.5%

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

      2. unsub-neg 31.5%

         \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]

   10. Simplified 31.5%

       \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]

   if 5.80000000000000013e141 < lambda2 < 7.7999999999999996e155 or 2.6500000000000001e183 < lambda2

   1. Initial program 45.0%

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

      1. hypot-define 99.1%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 99.1%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in lambda2 around inf 62.1%

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

      1. *-commutative 62.1%

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

      2. +-commutative 62.1%

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

   7. Simplified 62.1%

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

   if 7.7999999999999996e155 < lambda2 < 2.6500000000000001e183

   1. Initial program 52.8%

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

      1. hypot-define 100.0%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around inf 33.7%

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

      1. mul-1-neg 33.7%

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

      2. unsub-neg 33.7%

         \[\leadsto R \cdot \left(\phi_2 \cdot \color{blue}{\left(1 - \frac{\phi_1}{\phi_2}\right)}\right) \]

   7. Simplified 33.7%

      \[\leadsto R \cdot \color{blue}{\left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)} \]

   8. Taylor expanded in phi1 around inf 33.6%

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

4. Final simplification 34.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq 5.8 \cdot 10^{+141}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{elif}\;\lambda_2 \leq 7.8 \cdot 10^{+155} \lor \neg \left(\lambda_2 \leq 2.65 \cdot 10^{+183}\right):\\ \;\;\;\;R \cdot \left(\lambda_2 \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 34.3% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\\ \mathbf{if}\;\lambda_2 \leq 9.2 \cdot 10^{+141}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{elif}\;\lambda_2 \leq 1.26 \cdot 10^{+157}:\\ \;\;\;\;R \cdot \left(\lambda_2 \cdot t\_0\right)\\ \mathbf{elif}\;\lambda_2 \leq 3.2 \cdot 10^{+185}:\\ \;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0 \cdot \left(R \cdot \lambda_2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (cos (* 0.5 (+ phi2 phi1)))))
   (if (<= lambda2 9.2e+141)
     (* R (- phi2 phi1))
     (if (<= lambda2 1.26e+157)
       (* R (* lambda2 t_0))
       (if (<= lambda2 3.2e+185)
         (* R (* phi1 (+ (/ phi2 phi1) -1.0)))
         (* t_0 (* R lambda2)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos((0.5 * (phi2 + phi1)));
	double tmp;
	if (lambda2 <= 9.2e+141) {
		tmp = R * (phi2 - phi1);
	} else if (lambda2 <= 1.26e+157) {
		tmp = R * (lambda2 * t_0);
	} else if (lambda2 <= 3.2e+185) {
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
	} else {
		tmp = t_0 * (R * lambda2);
	}
	return tmp;
}

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
    real(8) :: t_0
    real(8) :: tmp
    t_0 = cos((0.5d0 * (phi2 + phi1)))
    if (lambda2 <= 9.2d+141) then
        tmp = r * (phi2 - phi1)
    else if (lambda2 <= 1.26d+157) then
        tmp = r * (lambda2 * t_0)
    else if (lambda2 <= 3.2d+185) then
        tmp = r * (phi1 * ((phi2 / phi1) + (-1.0d0)))
    else
        tmp = t_0 * (r * lambda2)
    end if
    code = tmp
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos((0.5 * (phi2 + phi1)));
	double tmp;
	if (lambda2 <= 9.2e+141) {
		tmp = R * (phi2 - phi1);
	} else if (lambda2 <= 1.26e+157) {
		tmp = R * (lambda2 * t_0);
	} else if (lambda2 <= 3.2e+185) {
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
	} else {
		tmp = t_0 * (R * lambda2);
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((0.5 * (phi2 + phi1)))
	tmp = 0
	if lambda2 <= 9.2e+141:
		tmp = R * (phi2 - phi1)
	elif lambda2 <= 1.26e+157:
		tmp = R * (lambda2 * t_0)
	elif lambda2 <= 3.2e+185:
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0))
	else:
		tmp = t_0 * (R * lambda2)
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(0.5 * Float64(phi2 + phi1)))
	tmp = 0.0
	if (lambda2 <= 9.2e+141)
		tmp = Float64(R * Float64(phi2 - phi1));
	elseif (lambda2 <= 1.26e+157)
		tmp = Float64(R * Float64(lambda2 * t_0));
	elseif (lambda2 <= 3.2e+185)
		tmp = Float64(R * Float64(phi1 * Float64(Float64(phi2 / phi1) + -1.0)));
	else
		tmp = Float64(t_0 * Float64(R * lambda2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((0.5 * (phi2 + phi1)));
	tmp = 0.0;
	if (lambda2 <= 9.2e+141)
		tmp = R * (phi2 - phi1);
	elseif (lambda2 <= 1.26e+157)
		tmp = R * (lambda2 * t_0);
	elseif (lambda2 <= 3.2e+185)
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
	else
		tmp = t_0 * (R * lambda2);
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda2, 9.2e+141], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 1.26e+157], N[(R * N[(lambda2 * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 3.2e+185], N[(R * N[(phi1 * N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(R * lambda2), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if lambda2 < 9.2000000000000006e141

   1. Initial program 58.7%

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

      1. hypot-define 96.1%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 96.1%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around inf 28.5%

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

      1. mul-1-neg 28.5%

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

      2. unsub-neg 28.5%

         \[\leadsto R \cdot \left(\phi_2 \cdot \color{blue}{\left(1 - \frac{\phi_1}{\phi_2}\right)}\right) \]

   7. Simplified 28.5%

      \[\leadsto R \cdot \color{blue}{\left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)} \]

   8. Taylor expanded in phi2 around 0 31.5%

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

      1. mul-1-neg 31.5%

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

      2. unsub-neg 31.5%

         \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]

   10. Simplified 31.5%

       \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]

   if 9.2000000000000006e141 < lambda2 < 1.25999999999999996e157

   1. Initial program 94.0%

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

      1. hypot-define 94.0%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 94.0%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in lambda2 around inf 75.2%

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

      1. *-commutative 75.2%

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

      2. +-commutative 75.2%

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

   7. Simplified 75.2%

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

   if 1.25999999999999996e157 < lambda2 < 3.20000000000000006e185

   1. Initial program 46.3%

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

      1. hypot-define 100.0%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around inf 28.9%

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

      1. mul-1-neg 28.9%

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

      2. unsub-neg 28.9%

         \[\leadsto R \cdot \left(\phi_2 \cdot \color{blue}{\left(1 - \frac{\phi_1}{\phi_2}\right)}\right) \]

   7. Simplified 28.9%

      \[\leadsto R \cdot \color{blue}{\left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)} \]

   8. Taylor expanded in phi1 around inf 28.9%

      \[\leadsto R \cdot \color{blue}{\left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} - 1\right)\right)} \]

   if 3.20000000000000006e185 < lambda2

   1. Initial program 38.2%

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

      1. hypot-define 99.9%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in lambda2 around inf 62.5%

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

      1. associate-*r* 62.5%

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

      2. +-commutative 62.5%

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

   7. Simplified 62.5%

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

4. Final simplification 34.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq 9.2 \cdot 10^{+141}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{elif}\;\lambda_2 \leq 1.26 \cdot 10^{+157}:\\ \;\;\;\;R \cdot \left(\lambda_2 \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\right)\\ \mathbf{elif}\;\lambda_2 \leq 3.2 \cdot 10^{+185}:\\ \;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right) \cdot \left(R \cdot \lambda_2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 30.1% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\\ \mathbf{if}\;\lambda_1 \leq -4.6 \cdot 10^{+189}:\\ \;\;\;\;R \cdot \left(t\_0 \cdot \left(-\lambda_1\right)\right)\\ \mathbf{elif}\;\lambda_1 \leq 2.2 \cdot 10^{-72}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\lambda_2 \cdot t\_0\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (cos (* 0.5 (+ phi2 phi1)))))
   (if (<= lambda1 -4.6e+189)
     (* R (* t_0 (- lambda1)))
     (if (<= lambda1 2.2e-72) (* R (- phi2 phi1)) (* R (* lambda2 t_0))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos((0.5 * (phi2 + phi1)));
	double tmp;
	if (lambda1 <= -4.6e+189) {
		tmp = R * (t_0 * -lambda1);
	} else if (lambda1 <= 2.2e-72) {
		tmp = R * (phi2 - phi1);
	} else {
		tmp = R * (lambda2 * t_0);
	}
	return tmp;
}

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
    real(8) :: t_0
    real(8) :: tmp
    t_0 = cos((0.5d0 * (phi2 + phi1)))
    if (lambda1 <= (-4.6d+189)) then
        tmp = r * (t_0 * -lambda1)
    else if (lambda1 <= 2.2d-72) then
        tmp = r * (phi2 - phi1)
    else
        tmp = r * (lambda2 * t_0)
    end if
    code = tmp
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos((0.5 * (phi2 + phi1)));
	double tmp;
	if (lambda1 <= -4.6e+189) {
		tmp = R * (t_0 * -lambda1);
	} else if (lambda1 <= 2.2e-72) {
		tmp = R * (phi2 - phi1);
	} else {
		tmp = R * (lambda2 * t_0);
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((0.5 * (phi2 + phi1)))
	tmp = 0
	if lambda1 <= -4.6e+189:
		tmp = R * (t_0 * -lambda1)
	elif lambda1 <= 2.2e-72:
		tmp = R * (phi2 - phi1)
	else:
		tmp = R * (lambda2 * t_0)
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(0.5 * Float64(phi2 + phi1)))
	tmp = 0.0
	if (lambda1 <= -4.6e+189)
		tmp = Float64(R * Float64(t_0 * Float64(-lambda1)));
	elseif (lambda1 <= 2.2e-72)
		tmp = Float64(R * Float64(phi2 - phi1));
	else
		tmp = Float64(R * Float64(lambda2 * t_0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((0.5 * (phi2 + phi1)));
	tmp = 0.0;
	if (lambda1 <= -4.6e+189)
		tmp = R * (t_0 * -lambda1);
	elseif (lambda1 <= 2.2e-72)
		tmp = R * (phi2 - phi1);
	else
		tmp = R * (lambda2 * t_0);
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda1, -4.6e+189], N[(R * N[(t$95$0 * (-lambda1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, 2.2e-72], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 * t$95$0), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if lambda1 < -4.6e189

   1. Initial program 45.1%

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

      1. hypot-define 99.8%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in lambda1 around -inf 57.7%

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

      1. mul-1-neg 57.7%

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

      2. distribute-rgt-neg-in 57.7%

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

      3. *-commutative 57.7%

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

      4. distribute-rgt-neg-in 57.7%

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

      5. +-commutative 57.7%

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

   7. Simplified 57.7%

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

   if -4.6e189 < lambda1 < 2.20000000000000002e-72

   1. Initial program 61.4%

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

      1. hypot-define 97.3%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 97.3%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around inf 33.2%

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

      1. mul-1-neg 33.2%

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

      2. unsub-neg 33.2%

         \[\leadsto R \cdot \left(\phi_2 \cdot \color{blue}{\left(1 - \frac{\phi_1}{\phi_2}\right)}\right) \]

   7. Simplified 33.2%

      \[\leadsto R \cdot \color{blue}{\left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)} \]

   8. Taylor expanded in phi2 around 0 36.9%

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

      1. mul-1-neg 36.9%

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

      2. unsub-neg 36.9%

         \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]

   10. Simplified 36.9%

       \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]

   if 2.20000000000000002e-72 < lambda1

   1. Initial program 52.3%

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

      1. hypot-define 93.8%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 93.8%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in lambda2 around inf 16.8%

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

      1. *-commutative 16.8%

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

      2. +-commutative 16.8%

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

   7. Simplified 16.8%

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

4. Final simplification 33.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -4.6 \cdot 10^{+189}:\\ \;\;\;\;R \cdot \left(\cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right) \cdot \left(-\lambda_1\right)\right)\\ \mathbf{elif}\;\lambda_1 \leq 2.2 \cdot 10^{-72}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\lambda_2 \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 31.2% accurate, 23.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -4.3 \cdot 10^{+40}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;\phi_2 \cdot \left(R - R \cdot \frac{\phi_1}{\phi_2}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -4.3e+40)
   (* R (- phi2 phi1))
   (* phi2 (- R (* R (/ phi1 phi2))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -4.3e+40) {
		tmp = R * (phi2 - phi1);
	} else {
		tmp = phi2 * (R - (R * (phi1 / phi2)));
	}
	return tmp;
}

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
    real(8) :: tmp
    if (phi1 <= (-4.3d+40)) then
        tmp = r * (phi2 - phi1)
    else
        tmp = phi2 * (r - (r * (phi1 / phi2)))
    end if
    code = tmp
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -4.3e+40) {
		tmp = R * (phi2 - phi1);
	} else {
		tmp = phi2 * (R - (R * (phi1 / phi2)));
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi1 <= -4.3e+40:
		tmp = R * (phi2 - phi1)
	else:
		tmp = phi2 * (R - (R * (phi1 / phi2)))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -4.3e+40)
		tmp = Float64(R * Float64(phi2 - phi1));
	else
		tmp = Float64(phi2 * Float64(R - Float64(R * Float64(phi1 / phi2))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi1 <= -4.3e+40)
		tmp = R * (phi2 - phi1);
	else
		tmp = phi2 * (R - (R * (phi1 / phi2)));
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -4.3e+40], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(R * N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -4.3000000000000002e40

   1. Initial program 47.2%

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

      1. hypot-define 92.1%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 92.1%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around inf 56.8%

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

      1. mul-1-neg 56.8%

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

      2. unsub-neg 56.8%

         \[\leadsto R \cdot \left(\phi_2 \cdot \color{blue}{\left(1 - \frac{\phi_1}{\phi_2}\right)}\right) \]

   7. Simplified 56.8%

      \[\leadsto R \cdot \color{blue}{\left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)} \]

   8. Taylor expanded in phi2 around 0 70.1%

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

      1. mul-1-neg 70.1%

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

      2. unsub-neg 70.1%

         \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]

   10. Simplified 70.1%

       \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]

   if -4.3000000000000002e40 < phi1

   1. Initial program 59.4%

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

      1. hypot-define 97.6%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 97.6%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around inf 19.7%

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

      1. mul-1-neg 19.7%

         \[\leadsto \phi_2 \cdot \left(R + \color{blue}{\left(-\frac{R \cdot \phi_1}{\phi_2}\right)}\right) \]

      2. unsub-neg 19.7%

         \[\leadsto \phi_2 \cdot \color{blue}{\left(R - \frac{R \cdot \phi_1}{\phi_2}\right)} \]

      3. associate-/l* 20.1%

         \[\leadsto \phi_2 \cdot \left(R - \color{blue}{R \cdot \frac{\phi_1}{\phi_2}}\right) \]

   7. Simplified 20.1%

      \[\leadsto \color{blue}{\phi_2 \cdot \left(R - R \cdot \frac{\phi_1}{\phi_2}\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 29.3% accurate, 36.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq 1.7 \cdot 10^{-48}:\\ \;\;\;\;R \cdot \left(-\phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \phi_2\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 1.7e-48) (* R (- phi1)) (* R phi2)))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 1.7e-48) {
		tmp = R * -phi1;
	} else {
		tmp = R * phi2;
	}
	return tmp;
}

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
    real(8) :: tmp
    if (phi2 <= 1.7d-48) then
        tmp = r * -phi1
    else
        tmp = r * phi2
    end if
    code = tmp
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 1.7e-48) {
		tmp = R * -phi1;
	} else {
		tmp = R * phi2;
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi2 <= 1.7e-48:
		tmp = R * -phi1
	else:
		tmp = R * phi2
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi2 <= 1.7e-48)
		tmp = Float64(R * Float64(-phi1));
	else
		tmp = Float64(R * phi2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi2 <= 1.7e-48)
		tmp = R * -phi1;
	else
		tmp = R * phi2;
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.7e-48], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.70000000000000014e-48

   1. Initial program 55.6%

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

      1. hypot-define 96.9%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 96.9%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around -inf 17.1%

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

      1. mul-1-neg 17.1%

         \[\leadsto \color{blue}{-R \cdot \phi_1} \]

      2. *-commutative 17.1%

         \[\leadsto -\color{blue}{\phi_1 \cdot R} \]

      3. distribute-rgt-neg-in 17.1%

         \[\leadsto \color{blue}{\phi_1 \cdot \left(-R\right)} \]

   7. Simplified 17.1%

      \[\leadsto \color{blue}{\phi_1 \cdot \left(-R\right)} \]

   if 1.70000000000000014e-48 < phi2

   1. Initial program 60.9%

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

      1. hypot-define 95.7%

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

   3. Simplified 95.7%

      \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around inf 59.8%

      \[\leadsto \color{blue}{R \cdot \phi_2} \]
   6. Step-by-step derivation

      1. *-commutative 59.8%

         \[\leadsto \color{blue}{\phi_2 \cdot R} \]

   7. Simplified 59.8%

      \[\leadsto \color{blue}{\phi_2 \cdot R} \]
3. Recombined 2 regimes into one program.

4. Final simplification 28.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq 1.7 \cdot 10^{-48}:\\ \;\;\;\;R \cdot \left(-\phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \phi_2\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 30.7% accurate, 65.8× speedup

Math

\[\begin{array}{l} \\ R \cdot \left(\phi_2 - \phi_1\right) \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (- phi2 phi1)))

C

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

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 = r * (phi2 - phi1)
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	return R * (phi2 - phi1)

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * Float64(phi2 - phi1))
end

MATLAB

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

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 57.0%

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

   1. hypot-define 96.6%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

3. Simplified 96.6%

   \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
4. Add Preprocessing

5. Taylor expanded in phi2 around inf 26.6%

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

   1. mul-1-neg 26.6%

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

   2. unsub-neg 26.6%

      \[\leadsto R \cdot \left(\phi_2 \cdot \color{blue}{\left(1 - \frac{\phi_1}{\phi_2}\right)}\right) \]

7. Simplified 26.6%

   \[\leadsto R \cdot \color{blue}{\left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)} \]

8. Taylor expanded in phi2 around 0 29.2%

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

   1. mul-1-neg 29.2%

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

   2. unsub-neg 29.2%

      \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]

10. Simplified 29.2%

    \[\leadsto R \cdot \color{blue}{\left(\phi_2 - \phi_1\right)} \]
11. Add Preprocessing

Alternative 11: 18.2% accurate, 109.7× speedup

Math

\[\begin{array}{l} \\ R \cdot \phi_2 \end{array} \]

FPCore

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

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * phi2;
}

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 = r * phi2
end function

Java

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

Python

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

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * phi2)
end

MATLAB

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

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * phi2), $MachinePrecision]

Derivation

1. Initial program 57.0%

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

   1. hypot-define 96.6%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]

3. Simplified 96.6%

   \[\leadsto \color{blue}{R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)} \]
4. Add Preprocessing

5. Taylor expanded in phi2 around inf 18.9%

   \[\leadsto \color{blue}{R \cdot \phi_2} \]
6. Step-by-step derivation

   1. *-commutative 18.9%

      \[\leadsto \color{blue}{\phi_2 \cdot R} \]

7. Simplified 18.9%

   \[\leadsto \color{blue}{\phi_2 \cdot R} \]

8. Final simplification 18.9%

   \[\leadsto R \cdot \phi_2 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024096 
(FPCore (R lambda1 lambda2 phi1 phi2)
  :name "Equirectangular approximation to distance on a great circle"
  :precision binary64
  (* R (sqrt (+ (* (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))) (* (- phi1 phi2) (- phi1 phi2))))))