Equirectangular approximation to distance on a great circle

Percentage Accurate: 59.4% → 96.0%

Time: 6.6s

Alternatives: 16

Speedup: 4.3×

• 30.0% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
    code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 59.4% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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: 96.0% accurate, 1.7× speedup

Math

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

FPCore

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

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) * 0.5))), (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(((phi1 + phi2) * 0.5))), (phi1 - phi2));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 59.4%

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

   1. lift-sqrt.f64 N/A

      \[\leadsto R \cdot \color{blue}{\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. lift-+.f64 N/A

      \[\leadsto R \cdot \sqrt{\color{blue}{\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)}} \]

3. Applied rewrites 96.0%

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

Alternative 2: 93.1% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < -5.19999999999999998e-7

   1. Initial program 59.4%

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

      1. lift-sqrt.f64 N/A

         \[\leadsto R \cdot \color{blue}{\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. lift-+.f64 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\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)}} \]

   3. Applied rewrites 96.0%

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

   4. Taylor expanded in phi2 around 0

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

      1. lower-*.f64 N/A

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

      2. lower-cos.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 90.3

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

   6. Applied rewrites 90.3%

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

   if -5.19999999999999998e-7 < phi1

   1. Initial program 59.4%

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

      1. lift-sqrt.f64 N/A

         \[\leadsto R \cdot \color{blue}{\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. lift-+.f64 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\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)}} \]

   3. Applied rewrites 96.0%

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

   4. Taylor expanded in phi1 around 0

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

      1. lower-*.f64 N/A

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

      2. lower-cos.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 90.2

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

   6. Applied rewrites 90.2%

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

Alternative 3: 90.3% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 59.4%

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

   1. lift-sqrt.f64 N/A

      \[\leadsto R \cdot \color{blue}{\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. lift-+.f64 N/A

      \[\leadsto R \cdot \sqrt{\color{blue}{\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)}} \]

3. Applied rewrites 96.0%

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

4. Taylor expanded in phi2 around 0

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

   1. lower-*.f64 N/A

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

   2. lower-cos.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lift--.f64 90.3

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

6. Applied rewrites 90.3%

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

Alternative 4: 85.3% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda1 -1.32e+151)
   (* R (hypot (* lambda1 (cos (* 0.5 phi1))) (- phi1 phi2)))
   (* R (hypot (* 1.0 (- lambda1 lambda2)) (- phi1 phi2)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if lambda1 < -1.31999999999999992e151

   1. Initial program 59.4%

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

      1. lift-sqrt.f64 N/A

         \[\leadsto R \cdot \color{blue}{\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. lift-+.f64 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\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)}} \]

   3. Applied rewrites 96.0%

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

   4. Taylor expanded in phi2 around 0

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

      1. lower-*.f64 N/A

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

      2. lower-cos.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 90.3

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

   6. Applied rewrites 90.3%

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

   7. Taylor expanded in lambda1 around inf

      \[\leadsto R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \color{blue}{\cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1 - \phi_2\right) \]
   8. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lift-cos.f64 N/A

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

      3. lift-*.f64 74.3

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

   9. Applied rewrites 74.3%

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

   if -1.31999999999999992e151 < lambda1

   1. Initial program 59.4%

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

      1. lift-sqrt.f64 N/A

         \[\leadsto R \cdot \color{blue}{\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. lift-+.f64 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\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)}} \]

   3. Applied rewrites 96.0%

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

   4. Taylor expanded in phi2 around 0

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

      1. lower-*.f64 N/A

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

      2. lower-cos.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 90.3

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

   6. Applied rewrites 90.3%

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

   7. Taylor expanded in phi1 around 0

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

   9. Applied rewrites 84.6%

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

Alternative 5: 84.6% accurate, 4.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 59.4%

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

   1. lift-sqrt.f64 N/A

      \[\leadsto R \cdot \color{blue}{\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. lift-+.f64 N/A

      \[\leadsto R \cdot \sqrt{\color{blue}{\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)}} \]

3. Applied rewrites 96.0%

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

4. Taylor expanded in phi2 around 0

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

   1. lower-*.f64 N/A

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

   2. lower-cos.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lift--.f64 90.3

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

6. Applied rewrites 90.3%

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

7. Taylor expanded in phi1 around 0

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

9. Applied rewrites 84.6%

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

Alternative 6: 32.9% accurate, 5.2× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= R 1.05e+30)
   (- (* R phi2) (* R phi1))
   (if (<= R 3.1e+179)
     (* phi1 (- (/ (* R phi2) phi1) R))
     (* phi2 (* R (- 1.0 (/ phi1 phi2)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (R <= 1.05e+30) {
		tmp = (R * phi2) - (R * phi1);
	} else if (R <= 3.1e+179) {
		tmp = phi1 * (((R * phi2) / phi1) - R);
	} else {
		tmp = phi2 * (R * (1.0 - (phi1 / phi2)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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.05d+30) then
        tmp = (r * phi2) - (r * phi1)
    else if (r <= 3.1d+179) then
        tmp = phi1 * (((r * phi2) / phi1) - r)
    else
        tmp = phi2 * (r * (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 (R <= 1.05e+30) {
		tmp = (R * phi2) - (R * phi1);
	} else if (R <= 3.1e+179) {
		tmp = phi1 * (((R * phi2) / phi1) - R);
	} else {
		tmp = phi2 * (R * (1.0 - (phi1 / phi2)));
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if R <= 1.05e+30:
		tmp = (R * phi2) - (R * phi1)
	elif R <= 3.1e+179:
		tmp = phi1 * (((R * phi2) / phi1) - R)
	else:
		tmp = phi2 * (R * (1.0 - (phi1 / phi2)))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (R <= 1.05e+30)
		tmp = Float64(Float64(R * phi2) - Float64(R * phi1));
	elseif (R <= 3.1e+179)
		tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R));
	else
		tmp = Float64(phi2 * Float64(R * Float64(1.0 - Float64(phi1 / phi2))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (R <= 1.05e+30)
		tmp = (R * phi2) - (R * phi1);
	elseif (R <= 3.1e+179)
		tmp = phi1 * (((R * phi2) / phi1) - R);
	else
		tmp = phi2 * (R * (1.0 - (phi1 / phi2)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if R < 1.05e30

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in phi2 around 0

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

      1. lower--.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

      3. lower-*.f64 29.0

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

   7. Applied rewrites 29.0%

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

   if 1.05e30 < R < 3.1e179

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in phi1 around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 29.2

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

   7. Applied rewrites 29.2%

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

   if 3.1e179 < R

   1. Initial program 59.4%

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

   2. Taylor expanded in phi2 around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \phi_2 \cdot \left(R + \left(\mathsf{neg}\left(\frac{R \cdot \phi_1}{\phi_2}\right)\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 29.4

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

   4. Applied rewrites 29.4%

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

   5. Taylor expanded in R around 0

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 28.0

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

   7. Applied rewrites 28.0%

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

Alternative 7: 30.5% accurate, 5.0× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= R 1.05e+30)
   (- (* R phi2) (* R phi1))
   (if (<= R 3.1e+179)
     (- (* phi1 (* R (- 1.0 (/ phi2 phi1)))))
     (* phi2 (* R (- 1.0 (/ phi1 phi2)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (R <= 1.05e+30) {
		tmp = (R * phi2) - (R * phi1);
	} else if (R <= 3.1e+179) {
		tmp = -(phi1 * (R * (1.0 - (phi2 / phi1))));
	} else {
		tmp = phi2 * (R * (1.0 - (phi1 / phi2)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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.05d+30) then
        tmp = (r * phi2) - (r * phi1)
    else if (r <= 3.1d+179) then
        tmp = -(phi1 * (r * (1.0d0 - (phi2 / phi1))))
    else
        tmp = phi2 * (r * (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 (R <= 1.05e+30) {
		tmp = (R * phi2) - (R * phi1);
	} else if (R <= 3.1e+179) {
		tmp = -(phi1 * (R * (1.0 - (phi2 / phi1))));
	} else {
		tmp = phi2 * (R * (1.0 - (phi1 / phi2)));
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if R <= 1.05e+30:
		tmp = (R * phi2) - (R * phi1)
	elif R <= 3.1e+179:
		tmp = -(phi1 * (R * (1.0 - (phi2 / phi1))))
	else:
		tmp = phi2 * (R * (1.0 - (phi1 / phi2)))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (R <= 1.05e+30)
		tmp = Float64(Float64(R * phi2) - Float64(R * phi1));
	elseif (R <= 3.1e+179)
		tmp = Float64(-Float64(phi1 * Float64(R * Float64(1.0 - Float64(phi2 / phi1)))));
	else
		tmp = Float64(phi2 * Float64(R * Float64(1.0 - Float64(phi1 / phi2))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (R <= 1.05e+30)
		tmp = (R * phi2) - (R * phi1);
	elseif (R <= 3.1e+179)
		tmp = -(phi1 * (R * (1.0 - (phi2 / phi1))));
	else
		tmp = phi2 * (R * (1.0 - (phi1 / phi2)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if R < 1.05e30

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in phi2 around 0

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

      1. lower--.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

      3. lower-*.f64 29.0

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

   7. Applied rewrites 29.0%

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

   if 1.05e30 < R < 3.1e179

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in R around 0

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 27.4

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

   7. Applied rewrites 27.4%

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

   if 3.1e179 < R

   1. Initial program 59.4%

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

   2. Taylor expanded in phi2 around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \phi_2 \cdot \left(R + \left(\mathsf{neg}\left(\frac{R \cdot \phi_1}{\phi_2}\right)\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 29.4

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

   4. Applied rewrites 29.4%

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

   5. Taylor expanded in R around 0

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 28.0

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

   7. Applied rewrites 28.0%

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

Alternative 8: 30.3% accurate, 5.1× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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 <= 7.5d+58) then
        tmp = (r * phi2) - (r * phi1)
    else
        tmp = -(phi1 * (phi2 * ((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 (R <= 7.5e+58) {
		tmp = (R * phi2) - (R * phi1);
	} else {
		tmp = -(phi1 * (phi2 * ((R / phi2) - (R / phi1))));
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if R < 7.5000000000000001e58

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in phi2 around 0

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

      1. lower--.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

      3. lower-*.f64 29.0

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

   7. Applied rewrites 29.0%

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

   if 7.5000000000000001e58 < R

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in phi2 around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 28.1

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

   7. Applied rewrites 28.1%

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

Alternative 9: 30.3% accurate, 5.3× speedup

Math

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

FPCore

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

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -4e-55) {
		tmp = -(R * (phi1 * (1.0 - (phi2 / phi1))));
	} else {
		tmp = phi2 * (phi1 * ((R / phi1) - (R / phi2)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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-55)) then
        tmp = -(r * (phi1 * (1.0d0 - (phi2 / phi1))))
    else
        tmp = phi2 * (phi1 * ((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-55) {
		tmp = -(R * (phi1 * (1.0 - (phi2 / phi1))));
	} else {
		tmp = phi2 * (phi1 * ((R / phi1) - (R / phi2)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < -3.99999999999999998e-55

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in R around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 26.9

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

   7. Applied rewrites 26.9%

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

   if -3.99999999999999998e-55 < phi1

   1. Initial program 59.4%

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

   2. Taylor expanded in phi2 around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \phi_2 \cdot \left(R + \left(\mathsf{neg}\left(\frac{R \cdot \phi_1}{\phi_2}\right)\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 29.4

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

   4. Applied rewrites 29.4%

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

   5. Taylor expanded in phi1 around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 28.3

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

   7. Applied rewrites 28.3%

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

Alternative 10: 30.0% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\ \mathbf{if}\;\phi_2 \leq -5.2 \cdot 10^{+44}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\phi_2 \leq 6.2 \cdot 10^{+106}:\\ \;\;\;\;\phi_1 \cdot \left(\frac{R \cdot \phi_2}{\phi_1} - R\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* R (* phi2 (- 1.0 (/ phi1 phi2))))))
   (if (<= phi2 -5.2e+44)
     t_0
     (if (<= phi2 6.2e+106) (* phi1 (- (/ (* R phi2) phi1) R)) t_0))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = R * (phi2 * (1.0 - (phi1 / phi2)));
	double tmp;
	if (phi2 <= -5.2e+44) {
		tmp = t_0;
	} else if (phi2 <= 6.2e+106) {
		tmp = phi1 * (((R * phi2) / phi1) - R);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = r * (phi2 * (1.0d0 - (phi1 / phi2)))
    if (phi2 <= (-5.2d+44)) then
        tmp = t_0
    else if (phi2 <= 6.2d+106) then
        tmp = phi1 * (((r * phi2) / phi1) - r)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = R * (phi2 * (1.0 - (phi1 / phi2)));
	double tmp;
	if (phi2 <= -5.2e+44) {
		tmp = t_0;
	} else if (phi2 <= 6.2e+106) {
		tmp = phi1 * (((R * phi2) / phi1) - R);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = R * (phi2 * (1.0 - (phi1 / phi2)))
	tmp = 0
	if phi2 <= -5.2e+44:
		tmp = t_0
	elif phi2 <= 6.2e+106:
		tmp = phi1 * (((R * phi2) / phi1) - R)
	else:
		tmp = t_0
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(R * Float64(phi2 * Float64(1.0 - Float64(phi1 / phi2))))
	tmp = 0.0
	if (phi2 <= -5.2e+44)
		tmp = t_0;
	elseif (phi2 <= 6.2e+106)
		tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = R * (phi2 * (1.0 - (phi1 / phi2)));
	tmp = 0.0;
	if (phi2 <= -5.2e+44)
		tmp = t_0;
	elseif (phi2 <= 6.2e+106)
		tmp = phi1 * (((R * phi2) / phi1) - R);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -5.2e+44], t$95$0, If[LessEqual[phi2, 6.2e+106], N[(phi1 * N[(N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if phi2 < -5.1999999999999998e44 or 6.1999999999999999e106 < phi2

   1. Initial program 59.4%

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

   2. Taylor expanded in phi2 around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \phi_2 \cdot \left(R + \left(\mathsf{neg}\left(\frac{R \cdot \phi_1}{\phi_2}\right)\right)\right) \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 29.4

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

   4. Applied rewrites 29.4%

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

   5. Taylor expanded in R around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 27.5

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

   7. Applied rewrites 27.5%

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

   if -5.1999999999999998e44 < phi2 < 6.1999999999999999e106

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in phi1 around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 29.2

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

   7. Applied rewrites 29.2%

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

Alternative 11: 29.7% accurate, 6.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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.05d+30) then
        tmp = (r * phi2) - (r * phi1)
    else
        tmp = phi1 * (((r * phi2) / phi1) - r)
    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.05e+30) {
		tmp = (R * phi2) - (R * phi1);
	} else {
		tmp = phi1 * (((R * phi2) / phi1) - R);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if R < 1.05e30

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in phi2 around 0

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

      1. lower--.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

      3. lower-*.f64 29.0

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

   7. Applied rewrites 29.0%

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

   if 1.05e30 < R

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in phi1 around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 29.2

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

   7. Applied rewrites 29.2%

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

Alternative 12: 29.7% accurate, 8.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1 \cdot 10^{-261}:\\ \;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\ \mathbf{else}:\\ \;\;\;\;R \cdot \phi_2\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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-261)) then
        tmp = (r * phi2) - (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 <= -1e-261) {
		tmp = (R * phi2) - (R * phi1);
	} else {
		tmp = R * phi2;
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < -9.99999999999999984e-262

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 29.2

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

   4. Applied rewrites 29.2%

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

   5. Taylor expanded in phi2 around 0

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

      1. lower--.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

      3. lower-*.f64 29.0

         \[\leadsto R \cdot \phi_2 - R \cdot \phi_1 \]

   7. Applied rewrites 29.0%

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

   if -9.99999999999999984e-262 < phi1

   1. Initial program 59.4%

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

   2. Taylor expanded in phi2 around inf

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

      1. lower-*.f64 18.0

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

   4. Applied rewrites 18.0%

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

Alternative 13: 29.5% accurate, 12.2× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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 <= 0.31d0) then
        tmp = r * -phi1
    else
        tmp = r * phi2
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi2 < 0.309999999999999998

   1. Initial program 59.4%

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

   2. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

         \[\leadsto R \cdot \left(\mathsf{neg}\left(\phi_1\right)\right) \]

      2. lower-neg.f64 17.1

         \[\leadsto R \cdot \left(-\phi_1\right) \]

   4. Applied rewrites 17.1%

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

   if 0.309999999999999998 < phi2

   1. Initial program 59.4%

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

   2. Taylor expanded in phi2 around inf

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

      1. lower-*.f64 18.0

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

   4. Applied rewrites 18.0%

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

Alternative 14: 28.8% accurate, 12.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq -4 \cdot 10^{-310}:\\ \;\;\;\;-R \cdot \phi_2\\ \mathbf{else}:\\ \;\;\;\;R \cdot \phi_2\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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 <= (-4d-310)) then
        tmp = -(r * phi2)
    else
        tmp = r * phi2
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi2 < -3.999999999999988e-310

   1. Initial program 59.4%

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

   2. Taylor expanded in phi2 around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(R \cdot \phi_2\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -R \cdot \phi_2 \]

      3. lower-*.f64 17.0

         \[\leadsto -R \cdot \phi_2 \]

   4. Applied rewrites 17.0%

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

   if -3.999999999999988e-310 < phi2

   1. Initial program 59.4%

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

   2. Taylor expanded in phi2 around inf

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

      1. lower-*.f64 18.0

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

   4. Applied rewrites 18.0%

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

Alternative 15: 18.0% accurate, 27.0× 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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 59.4%

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

2. Taylor expanded in phi2 around inf

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

   1. lower-*.f64 18.0

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

4. Applied rewrites 18.0%

   \[\leadsto \color{blue}{R \cdot \phi_2} \]
5. Add Preprocessing

Alternative 16: 17.7% accurate, 27.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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 * phi1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 59.4%

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

2. Taylor expanded in phi1 around inf

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

   1. lower-*.f64 17.7

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

4. Applied rewrites 17.7%

   \[\leadsto \color{blue}{R \cdot \phi_1} \]
5. Add Preprocessing

Reproduce

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