Equirectangular approximation to distance on a great circle

Percentage Accurate: 60.6% → 99.9%

Time: 18.4s

Alternatives: 16

Speedup: 1.6×

• 31.6% 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: 60.6% 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 56.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 97.4%

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

   \[\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. expm1-log1p-u 97.3%

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

   2. div-inv 97.3%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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 97.3%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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 97.3%

   \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\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 97.3%

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

   2. +-commutative 97.3%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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 97.3%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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.8%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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.8%

   \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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. expm1-log1p-u 99.8%

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

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

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

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

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

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

    \[\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: 99.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right) - \sin \left(\phi_2 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\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)) (cos (* phi2 0.5)))
     (* (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) * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((phi2 * 0.5)) * sin((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)) * Math.cos((phi2 * 0.5))) - (Math.sin((phi2 * 0.5)) * Math.sin((0.5 * phi1))))), (phi1 - phi2));
}

Python

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

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * Float64(Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) - Float64(sin(Float64(phi2 * 0.5)) * sin(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)) * cos((phi2 * 0.5))) - (sin((phi2 * 0.5)) * sin((0.5 * phi1))))), (phi1 - phi2));
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $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 56.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 97.4%

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

   \[\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. expm1-log1p-u 97.3%

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

   2. div-inv 97.3%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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 97.3%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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 97.3%

   \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\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 97.3%

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

   2. +-commutative 97.3%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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 97.3%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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.8%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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.8%

   \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\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. Taylor expanded in phi2 around inf 99.8%

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

    1. *-commutative 99.8%

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

11. Simplified 99.8%

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

12. Final simplification 99.8%

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

Alternative 3: 93.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq 1.7 \cdot 10^{-7}:\\ \;\;\;\;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 (<= phi2 1.7e-7)
   (* 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 (phi2 <= 1.7e-7) {
		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 (phi2 <= 1.7e-7) {
		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 phi2 <= 1.7e-7:
		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 (phi2 <= 1.7e-7)
		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 (phi2 <= 1.7e-7)
		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[phi2, 1.7e-7], 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 phi2 < 1.69999999999999987e-7

   1. Initial program 56.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 97.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 97.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 0 93.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) \]

   if 1.69999999999999987e-7 < phi2

   1. Initial program 53.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 98.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 98.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 phi1 around 0 98.6%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq 1.7 \cdot 10^{-7}:\\ \;\;\;\;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 4: 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 56.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 97.4%

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

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

   \[\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 5: 90.9% 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 56.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 97.4%

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

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

   \[\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 6: 32.0% accurate, 17.3× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 1e-191)
   (* phi1 (* phi2 (/ R (- phi2))))
   (if (<= phi2 6e+52)
     (* phi1 (- (* R (/ phi2 phi1)) R))
     (* R (* phi2 (- 1.0 (/ phi1 phi2)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 1e-191) {
		tmp = phi1 * (phi2 * (R / -phi2));
	} else if (phi2 <= 6e+52) {
		tmp = phi1 * ((R * (phi2 / phi1)) - R);
	} else {
		tmp = R * (phi2 * (1.0 - (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 (phi2 <= 1d-191) then
        tmp = phi1 * (phi2 * (r / -phi2))
    else if (phi2 <= 6d+52) then
        tmp = phi1 * ((r * (phi2 / phi1)) - r)
    else
        tmp = r * (phi2 * (1.0d0 - (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 (phi2 <= 1e-191) {
		tmp = phi1 * (phi2 * (R / -phi2));
	} else if (phi2 <= 6e+52) {
		tmp = phi1 * ((R * (phi2 / phi1)) - R);
	} else {
		tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi2 <= 1e-191:
		tmp = phi1 * (phi2 * (R / -phi2))
	elif phi2 <= 6e+52:
		tmp = phi1 * ((R * (phi2 / phi1)) - R)
	else:
		tmp = R * (phi2 * (1.0 - (phi1 / phi2)))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi2 <= 1e-191)
		tmp = Float64(phi1 * Float64(phi2 * Float64(R / Float64(-phi2))));
	elseif (phi2 <= 6e+52)
		tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R));
	else
		tmp = Float64(R * Float64(phi2 * Float64(1.0 - Float64(phi1 / phi2))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi2 <= 1e-191)
		tmp = phi1 * (phi2 * (R / -phi2));
	elseif (phi2 <= 6e+52)
		tmp = phi1 * ((R * (phi2 / phi1)) - R);
	else
		tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1e-191], N[(phi1 * N[(phi2 * N[(R / (-phi2)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 6e+52], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < 1e-191

   1. Initial program 54.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.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 phi1 around -inf 13.9%

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

      1. associate-*r* 13.9%

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

      2. mul-1-neg 13.9%

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

      3. mul-1-neg 13.9%

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

      4. unsub-neg 13.9%

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

      5. *-commutative 13.9%

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

      6. associate-/l* 16.5%

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

   7. Simplified 16.5%

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

   8. Taylor expanded in phi2 around inf 17.6%

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

   9. Taylor expanded in phi2 around 0 19.6%

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

   if 1e-191 < phi2 < 6e52

   1. Initial program 69.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.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 99.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 phi1 around -inf 35.7%

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

      1. associate-*r* 35.7%

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

      2. mul-1-neg 35.7%

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

      3. mul-1-neg 35.7%

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

      4. unsub-neg 35.7%

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

      5. *-commutative 35.7%

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

      6. associate-/l* 33.9%

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

   7. Simplified 33.9%

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

   8. Taylor expanded in phi2 around inf 33.8%

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

   9. Taylor expanded in phi1 around inf 35.7%

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

       1. +-commutative 35.7%

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

       2. mul-1-neg 35.7%

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

       3. unsub-neg 35.7%

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

       4. associate-/l* 35.7%

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

   11. Simplified 35.7%

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

   if 6e52 < phi2

   1. Initial program 48.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 98.4%

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

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

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

      2. unsub-neg 74.2%

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

   7. Simplified 74.2%

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

4. Final simplification 34.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq 10^{-191}:\\ \;\;\;\;\phi_1 \cdot \left(\phi_2 \cdot \frac{R}{-\phi_2}\right)\\ \mathbf{elif}\;\phi_2 \leq 6 \cdot 10^{+52}:\\ \;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 30.1% accurate, 18.3× speedup

Math

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

FPCore

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

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (R <= 1.42e+132) {
		tmp = (R * phi2) - (R * phi1);
	} else {
		tmp = phi1 * (phi2 * ((R / phi1) * ((phi2 - 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 (r <= 1.42d+132) then
        tmp = (r * phi2) - (r * phi1)
    else
        tmp = phi1 * (phi2 * ((r / phi1) * ((phi2 - 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 (R <= 1.42e+132) {
		tmp = (R * phi2) - (R * phi1);
	} else {
		tmp = phi1 * (phi2 * ((R / phi1) * ((phi2 - phi1) / phi2)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if R < 1.41999999999999988e132

   1. Initial program 49.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 97.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 97.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 -inf 27.6%

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

      1. associate-*r* 27.6%

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

      2. mul-1-neg 27.6%

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

      3. mul-1-neg 27.6%

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

      4. unsub-neg 27.6%

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

      5. *-commutative 27.6%

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

      6. associate-/l* 25.7%

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

   7. Simplified 25.7%

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

   8. Taylor expanded in phi1 around 0 28.8%

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

      1. +-commutative 28.8%

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

      2. mul-1-neg 28.8%

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

      3. unsub-neg 28.8%

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

      4. *-commutative 28.8%

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

      5. *-commutative 28.8%

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

   10. Simplified 28.8%

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

   if 1.41999999999999988e132 < R

   1. Initial program 100.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 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 phi1 around -inf 41.7%

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

      1. associate-*r* 41.7%

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

      2. mul-1-neg 41.7%

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

      3. mul-1-neg 41.7%

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

      4. unsub-neg 41.7%

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

      5. *-commutative 41.7%

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

      6. associate-/l* 50.6%

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

   7. Simplified 50.6%

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

   8. Taylor expanded in phi2 around inf 47.5%

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

      1. frac-sub 44.5%

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

      2. *-commutative 44.5%

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

   10. Applied egg-rr 44.5%

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

       1. distribute-rgt-out-- 44.5%

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

       2. *-commutative 44.5%

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

       3. times-frac 50.8%

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

   12. Simplified 50.8%

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

4. Final simplification 31.6%

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

Alternative 8: 30.1% accurate, 18.3× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= R 4.8e+128)
   (- (* R phi2) (* R phi1))
   (* phi1 (* phi2 (* R (+ (/ 1.0 phi1) (/ -1.0 phi2)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (R <= 4.8e+128) {
		tmp = (R * phi2) - (R * phi1);
	} else {
		tmp = phi1 * (phi2 * (R * ((1.0 / phi1) + (-1.0 / 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 (r <= 4.8d+128) then
        tmp = (r * phi2) - (r * phi1)
    else
        tmp = phi1 * (phi2 * (r * ((1.0d0 / phi1) + ((-1.0d0) / 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 (R <= 4.8e+128) {
		tmp = (R * phi2) - (R * phi1);
	} else {
		tmp = phi1 * (phi2 * (R * ((1.0 / phi1) + (-1.0 / phi2))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if R < 4.8000000000000004e128

   1. Initial program 49.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 97.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 97.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 -inf 27.6%

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

      1. associate-*r* 27.6%

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

      2. mul-1-neg 27.6%

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

      3. mul-1-neg 27.6%

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

      4. unsub-neg 27.6%

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

      5. *-commutative 27.6%

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

      6. associate-/l* 25.7%

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

   7. Simplified 25.7%

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

   8. Taylor expanded in phi1 around 0 28.8%

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

      1. +-commutative 28.8%

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

      2. mul-1-neg 28.8%

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

      3. unsub-neg 28.8%

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

      4. *-commutative 28.8%

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

      5. *-commutative 28.8%

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

   10. Simplified 28.8%

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

   if 4.8000000000000004e128 < R

   1. Initial program 100.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 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 phi1 around -inf 41.7%

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

      1. associate-*r* 41.7%

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

      2. mul-1-neg 41.7%

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

      3. mul-1-neg 41.7%

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

      4. unsub-neg 41.7%

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

      5. *-commutative 41.7%

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

      6. associate-/l* 50.6%

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

   7. Simplified 50.6%

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

   8. Taylor expanded in phi2 around inf 47.5%

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

   9. Taylor expanded in R around 0 50.8%

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

4. Final simplification 31.6%

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

Alternative 9: 31.1% accurate, 23.5× speedup

Math

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

FPCore

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

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1e+49) {
		tmp = phi1 * ((R * (phi2 - phi1)) / phi1);
	} else {
		tmp = phi2 * (R - (phi1 * (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 (phi1 <= (-1d+49)) then
        tmp = phi1 * ((r * (phi2 - phi1)) / phi1)
    else
        tmp = phi2 * (r - (phi1 * (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 (phi1 <= -1e+49) {
		tmp = phi1 * ((R * (phi2 - phi1)) / phi1);
	} else {
		tmp = phi2 * (R - (phi1 * (R / phi2)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < -9.99999999999999946e48

   1. Initial program 53.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.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 93.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 phi1 around -inf 69.1%

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

      1. associate-*r* 69.1%

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

      2. mul-1-neg 69.1%

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

      3. mul-1-neg 69.1%

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

      4. unsub-neg 69.1%

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

      5. *-commutative 69.1%

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

      6. associate-/l* 69.5%

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

   7. Simplified 69.5%

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

   8. Taylor expanded in phi1 around 0 69.1%

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

      1. distribute-lft-out-- 73.2%

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

   10. Simplified 73.2%

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

   if -9.99999999999999946e48 < phi1

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

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

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

      2. unsub-neg 23.0%

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

      3. *-commutative 23.0%

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

      4. associate-/l* 25.6%

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

   7. Simplified 25.6%

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

4. Final simplification 34.7%

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

Alternative 10: 31.1% accurate, 23.5× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -1e+49)
   (* R (* phi1 (+ (/ phi2 phi1) -1.0)))
   (* phi2 (- R (* phi1 (/ R phi2))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1e+49) {
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
	} else {
		tmp = phi2 * (R - (phi1 * (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 (phi1 <= (-1d+49)) then
        tmp = r * (phi1 * ((phi2 / phi1) + (-1.0d0)))
    else
        tmp = phi2 * (r - (phi1 * (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 (phi1 <= -1e+49) {
		tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
	} else {
		tmp = phi2 * (R - (phi1 * (R / phi2)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < -9.99999999999999946e48

   1. Initial program 53.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.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 93.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 phi1 around -inf 73.2%

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

      1. mul-1-neg 73.2%

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

      2. distribute-rgt-neg-in 73.2%

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

      3. mul-1-neg 73.2%

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

      4. unsub-neg 73.2%

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

   7. Simplified 73.2%

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

   if -9.99999999999999946e48 < phi1

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

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

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

      2. unsub-neg 23.0%

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

      3. *-commutative 23.0%

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

      4. associate-/l* 25.6%

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

   7. Simplified 25.6%

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

4. Final simplification 34.7%

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

Alternative 11: 31.1% accurate, 23.5× speedup

Math

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

FPCore

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

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -4e+49) {
		tmp = phi1 * ((R * (phi2 / phi1)) - R);
	} else {
		tmp = phi2 * (R - (phi1 * (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 (phi1 <= (-4d+49)) then
        tmp = phi1 * ((r * (phi2 / phi1)) - r)
    else
        tmp = phi2 * (r - (phi1 * (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 (phi1 <= -4e+49) {
		tmp = phi1 * ((R * (phi2 / phi1)) - R);
	} else {
		tmp = phi2 * (R - (phi1 * (R / phi2)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < -3.99999999999999979e49

   1. Initial program 53.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.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 93.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 phi1 around -inf 69.1%

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

      1. associate-*r* 69.1%

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

      2. mul-1-neg 69.1%

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

      3. mul-1-neg 69.1%

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

      4. unsub-neg 69.1%

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

      5. *-commutative 69.1%

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

      6. associate-/l* 69.5%

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

   7. Simplified 69.5%

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

   8. Taylor expanded in phi2 around inf 63.2%

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

   9. Taylor expanded in phi1 around inf 69.1%

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

       1. +-commutative 69.1%

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

       2. mul-1-neg 69.1%

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

       3. unsub-neg 69.1%

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

       4. associate-/l* 73.1%

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

   11. Simplified 73.1%

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

   if -3.99999999999999979e49 < phi1

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

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

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

      2. unsub-neg 23.0%

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

      3. *-commutative 23.0%

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

      4. associate-/l* 25.6%

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

   7. Simplified 25.6%

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

Alternative 12: 31.2% accurate, 23.5× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 1.5e-162)
   (* phi1 (* phi2 (/ R (- phi2))))
   (* R (* phi2 (- 1.0 (/ phi1 phi2))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 1.5e-162) {
		tmp = phi1 * (phi2 * (R / -phi2));
	} else {
		tmp = R * (phi2 * (1.0 - (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 (phi2 <= 1.5d-162) then
        tmp = phi1 * (phi2 * (r / -phi2))
    else
        tmp = r * (phi2 * (1.0d0 - (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 (phi2 <= 1.5e-162) {
		tmp = phi1 * (phi2 * (R / -phi2));
	} else {
		tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi2 <= 1.5e-162:
		tmp = phi1 * (phi2 * (R / -phi2))
	else:
		tmp = R * (phi2 * (1.0 - (phi1 / phi2)))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi2 <= 1.5e-162)
		tmp = phi1 * (phi2 * (R / -phi2));
	else
		tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.49999999999999999e-162

   1. Initial program 55.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 96.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 96.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 phi1 around -inf 15.8%

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

      1. associate-*r* 15.8%

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

      2. mul-1-neg 15.8%

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

      3. mul-1-neg 15.8%

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

      4. unsub-neg 15.8%

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

      5. *-commutative 15.8%

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

      6. associate-/l* 18.3%

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

   7. Simplified 18.3%

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

   8. Taylor expanded in phi2 around inf 19.3%

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

   9. Taylor expanded in phi2 around 0 21.1%

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

   if 1.49999999999999999e-162 < phi2

   1. Initial program 57.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 99.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 99.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 53.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 53.7%

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

      2. unsub-neg 53.7%

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

   7. Simplified 53.7%

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

4. Final simplification 33.7%

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

Alternative 13: 31.1% accurate, 25.3× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 1.1e-165)
   (* phi1 (* phi2 (/ R (- phi2))))
   (- (* R phi2) (* R phi1))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 1.1e-165) {
		tmp = phi1 * (phi2 * (R / -phi2));
	} else {
		tmp = (R * phi2) - (R * phi1);
	}
	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.1d-165) then
        tmp = phi1 * (phi2 * (r / -phi2))
    else
        tmp = (r * phi2) - (r * phi1)
    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.1e-165) {
		tmp = phi1 * (phi2 * (R / -phi2));
	} else {
		tmp = (R * phi2) - (R * phi1);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.0999999999999999e-165

   1. Initial program 55.5%

      \[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.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 96.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 phi1 around -inf 15.2%

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

      1. associate-*r* 15.2%

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

      2. mul-1-neg 15.2%

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

      3. mul-1-neg 15.2%

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

      4. unsub-neg 15.2%

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

      5. *-commutative 15.2%

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

      6. associate-/l* 17.7%

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

   7. Simplified 17.7%

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

   8. Taylor expanded in phi2 around inf 18.8%

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

   9. Taylor expanded in phi2 around 0 20.6%

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

   if 1.0999999999999999e-165 < phi2

   1. Initial program 57.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.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 99.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 -inf 51.5%

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

      1. associate-*r* 51.5%

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

      2. mul-1-neg 51.5%

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

      3. mul-1-neg 51.5%

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

      4. unsub-neg 51.5%

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

      5. *-commutative 51.5%

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

      6. associate-/l* 46.2%

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

   7. Simplified 46.2%

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

   8. Taylor expanded in phi1 around 0 54.1%

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

      1. +-commutative 54.1%

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

      2. mul-1-neg 54.1%

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

      3. unsub-neg 54.1%

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

      4. *-commutative 54.1%

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

      5. *-commutative 54.1%

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

   10. Simplified 54.1%

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

4. Final simplification 33.7%

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

Alternative 14: 28.8% accurate, 36.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -5.2 \cdot 10^{+23}:\\ \;\;\;\;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 (<= phi1 -5.2e+23) (* R (- phi1)) (* R phi2)))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -5.2e+23) {
		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 (phi1 <= (-5.2d+23)) 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 (phi1 <= -5.2e+23) {
		tmp = R * -phi1;
	} else {
		tmp = R * phi2;
	}
	return tmp;
}

Python

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

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -5.2e+23)
		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 (phi1 <= -5.2e+23)
		tmp = R * -phi1;
	else
		tmp = R * phi2;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < -5.19999999999999983e23

   1. Initial program 56.5%

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

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

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

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

      1. mul-1-neg 60.6%

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

   7. Simplified 60.6%

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

   if -5.19999999999999983e23 < phi1

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

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

      1. *-commutative 20.3%

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

   7. Simplified 20.3%

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

4. Final simplification 29.6%

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

Alternative 15: 28.6% accurate, 47.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 56.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 97.4%

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

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

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

   1. associate-*r* 29.4%

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

   2. mul-1-neg 29.4%

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

   3. mul-1-neg 29.4%

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

   4. unsub-neg 29.4%

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

   5. *-commutative 29.4%

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

   6. associate-/l* 28.8%

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

7. Simplified 28.8%

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

8. Taylor expanded in phi1 around 0 30.0%

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

   1. +-commutative 30.0%

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

   2. mul-1-neg 30.0%

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

   3. unsub-neg 30.0%

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

   4. *-commutative 30.0%

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

   5. *-commutative 30.0%

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

10. Simplified 30.0%

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

11. Final simplification 30.0%

    \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]
12. Add Preprocessing

Alternative 16: 17.4% 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 56.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 97.4%

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

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

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

   1. *-commutative 18.6%

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

7. Simplified 18.6%

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

8. Final simplification 18.6%

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

Reproduce

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