
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 26 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(fma
(cos phi2)
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi1))
(* (sin phi1) (sin phi2))))
R))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(fma(cos(phi2), (fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi1)), (sin(phi1) * sin(phi2)))) * R;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(fma(cos(phi2), Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi1)), Float64(sin(phi1) * sin(phi2)))) * R) end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R
\end{array}
Initial program 77.2%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6494.1
Applied egg-rr94.1%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified94.1%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified94.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(fma
(cos phi1)
(*
(cos phi2)
(fma (cos lambda1) (cos lambda2) (* (sin lambda1) (sin lambda2))))
(* (sin phi1) (sin phi2))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(fma(cos(phi1), (cos(phi2) * fma(cos(lambda1), cos(lambda2), (sin(lambda1) * sin(lambda2)))), (sin(phi1) * sin(phi2))));
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * fma(cos(lambda1), cos(lambda2), Float64(sin(lambda1) * sin(lambda2)))), Float64(sin(phi1) * sin(phi2))))) end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_1 \cdot \sin \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)
\end{array}
Initial program 77.2%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6494.1
Applied egg-rr94.1%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified94.1%
Final simplification94.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(*
R
(fma
(cbrt (* PI PI))
(* (cbrt PI) 0.5)
(-
(fma
(* 0.5 (sqrt PI))
(sqrt PI)
(-
(acos
(fma
(cos phi1)
(* (cos phi2) (cos (- lambda2 lambda1)))
(* (sin phi1) (sin phi2)))))))))))
(if (<= phi2 -0.00115)
t_0
(if (<= phi2 2e-21)
(*
R
(acos
(fma
(cos phi2)
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi1))
(* phi2 (sin phi1)))))
t_0))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * fma(cbrt((((double) M_PI) * ((double) M_PI))), (cbrt(((double) M_PI)) * 0.5), -fma((0.5 * sqrt(((double) M_PI))), sqrt(((double) M_PI)), -acos(fma(cos(phi1), (cos(phi2) * cos((lambda2 - lambda1))), (sin(phi1) * sin(phi2))))));
double tmp;
if (phi2 <= -0.00115) {
tmp = t_0;
} else if (phi2 <= 2e-21) {
tmp = R * acos(fma(cos(phi2), (fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi1)), (phi2 * sin(phi1))));
} else {
tmp = t_0;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * fma(cbrt(Float64(pi * pi)), Float64(cbrt(pi) * 0.5), Float64(-fma(Float64(0.5 * sqrt(pi)), sqrt(pi), Float64(-acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))), Float64(sin(phi1) * sin(phi2))))))))) tmp = 0.0 if (phi2 <= -0.00115) tmp = t_0; elseif (phi2 <= 2e-21) tmp = Float64(R * acos(fma(cos(phi2), Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi1)), Float64(phi2 * sin(phi1))))); else tmp = t_0; end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * N[(N[Power[N[(Pi * Pi), $MachinePrecision], 1/3], $MachinePrecision] * N[(N[Power[Pi, 1/3], $MachinePrecision] * 0.5), $MachinePrecision] + (-N[(N[(0.5 * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[Sqrt[Pi], $MachinePrecision] + (-N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision])), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.00115], t$95$0, If[LessEqual[phi2, 2e-21], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := R \cdot \mathsf{fma}\left(\sqrt[3]{\pi \cdot \pi}, \sqrt[3]{\pi} \cdot 0.5, -\mathsf{fma}\left(0.5 \cdot \sqrt{\pi}, \sqrt{\pi}, -\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)\right)\right)\\
\mathbf{if}\;\phi_2 \leq -0.00115:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 2 \cdot 10^{-21}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1, \phi_2 \cdot \sin \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi2 < -0.00115 or 1.99999999999999982e-21 < phi2 Initial program 81.8%
lift-sin.f64N/A
lift-sin.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-cos.f64N/A
lift--.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
acos-asinN/A
sub-negN/A
Applied egg-rr81.1%
Applied egg-rr81.7%
if -0.00115 < phi2 < 1.99999999999999982e-21Initial program 71.9%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6488.3
Applied egg-rr88.3%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified88.3%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified88.3%
Taylor expanded in phi2 around 0
lower-*.f64N/A
lower-sin.f6488.3
Simplified88.3%
Final simplification84.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= phi2 -0.00115)
(* R (acos (fma (cos phi1) (* (cos phi2) (cos (- lambda2 lambda1))) t_0)))
(if (<= phi2 2e-21)
(*
R
(acos
(fma
(cos phi2)
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi1))
(* phi2 (sin phi1)))))
(*
R
(fma
(cbrt (* PI PI))
(* 0.5 (cbrt (* (sqrt PI) (sqrt PI))))
(-
(asin
(fma
(cos (- lambda1 lambda2))
(* (cos phi2) (cos phi1))
t_0)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -0.00115) {
tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda2 - lambda1))), t_0));
} else if (phi2 <= 2e-21) {
tmp = R * acos(fma(cos(phi2), (fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi1)), (phi2 * sin(phi1))));
} else {
tmp = R * fma(cbrt((((double) M_PI) * ((double) M_PI))), (0.5 * cbrt((sqrt(((double) M_PI)) * sqrt(((double) M_PI))))), -asin(fma(cos((lambda1 - lambda2)), (cos(phi2) * cos(phi1)), t_0)));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -0.00115) tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))), t_0))); elseif (phi2 <= 2e-21) tmp = Float64(R * acos(fma(cos(phi2), Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi1)), Float64(phi2 * sin(phi1))))); else tmp = Float64(R * fma(cbrt(Float64(pi * pi)), Float64(0.5 * cbrt(Float64(sqrt(pi) * sqrt(pi)))), Float64(-asin(fma(cos(Float64(lambda1 - lambda2)), Float64(cos(phi2) * cos(phi1)), t_0))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.00115], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2e-21], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(N[Power[N[(Pi * Pi), $MachinePrecision], 1/3], $MachinePrecision] * N[(0.5 * N[Power[N[(N[Sqrt[Pi], $MachinePrecision] * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision] + (-N[ArcSin[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -0.00115:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right), t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 2 \cdot 10^{-21}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1, \phi_2 \cdot \sin \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\sqrt[3]{\pi \cdot \pi}, 0.5 \cdot \sqrt[3]{\sqrt{\pi} \cdot \sqrt{\pi}}, -\sin^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_1 - \lambda_2\right), \cos \phi_2 \cdot \cos \phi_1, t\_0\right)\right)\right)\\
\end{array}
\end{array}
if phi2 < -0.00115Initial program 83.2%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6499.3
Applied egg-rr99.3%
Applied egg-rr83.4%
if -0.00115 < phi2 < 1.99999999999999982e-21Initial program 71.9%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6488.3
Applied egg-rr88.3%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified88.3%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified88.3%
Taylor expanded in phi2 around 0
lower-*.f64N/A
lower-sin.f6488.3
Simplified88.3%
if 1.99999999999999982e-21 < phi2 Initial program 80.7%
lift-sin.f64N/A
lift-sin.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-cos.f64N/A
lift--.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
acos-asinN/A
sub-negN/A
Applied egg-rr80.0%
add-sqr-sqrtN/A
lower-*.f64N/A
lift-PI.f64N/A
lower-sqrt.f64N/A
lift-PI.f64N/A
lower-sqrt.f6480.6
Applied egg-rr80.6%
Final simplification84.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(fma
(cos phi1)
(* (cos phi2) (cos (- lambda2 lambda1)))
(* (sin phi1) (sin phi2)))))
(if (<= phi2 -0.00115)
(* R (acos t_0))
(if (<= phi2 2e-21)
(*
R
(acos
(fma
(cos phi2)
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi1))
(* phi2 (sin phi1)))))
(*
R
(fma
(* 0.5 (sqrt (sqrt PI)))
(sqrt (* PI (sqrt PI)))
(- (asin t_0))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = fma(cos(phi1), (cos(phi2) * cos((lambda2 - lambda1))), (sin(phi1) * sin(phi2)));
double tmp;
if (phi2 <= -0.00115) {
tmp = R * acos(t_0);
} else if (phi2 <= 2e-21) {
tmp = R * acos(fma(cos(phi2), (fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi1)), (phi2 * sin(phi1))));
} else {
tmp = R * fma((0.5 * sqrt(sqrt(((double) M_PI)))), sqrt((((double) M_PI) * sqrt(((double) M_PI)))), -asin(t_0));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))), Float64(sin(phi1) * sin(phi2))) tmp = 0.0 if (phi2 <= -0.00115) tmp = Float64(R * acos(t_0)); elseif (phi2 <= 2e-21) tmp = Float64(R * acos(fma(cos(phi2), Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi1)), Float64(phi2 * sin(phi1))))); else tmp = Float64(R * fma(Float64(0.5 * sqrt(sqrt(pi))), sqrt(Float64(pi * sqrt(pi))), Float64(-asin(t_0)))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.00115], N[(R * N[ArcCos[t$95$0], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2e-21], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(N[(0.5 * N[Sqrt[N[Sqrt[Pi], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(Pi * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + (-N[ArcSin[t$95$0], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right), \sin \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{if}\;\phi_2 \leq -0.00115:\\
\;\;\;\;R \cdot \cos^{-1} t\_0\\
\mathbf{elif}\;\phi_2 \leq 2 \cdot 10^{-21}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1, \phi_2 \cdot \sin \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(0.5 \cdot \sqrt{\sqrt{\pi}}, \sqrt{\pi \cdot \sqrt{\pi}}, -\sin^{-1} t\_0\right)\\
\end{array}
\end{array}
if phi2 < -0.00115Initial program 83.2%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6499.3
Applied egg-rr99.3%
Applied egg-rr83.4%
if -0.00115 < phi2 < 1.99999999999999982e-21Initial program 71.9%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6488.3
Applied egg-rr88.3%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified88.3%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified88.3%
Taylor expanded in phi2 around 0
lower-*.f64N/A
lower-sin.f6488.3
Simplified88.3%
if 1.99999999999999982e-21 < phi2 Initial program 80.7%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6499.2
Applied egg-rr99.2%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified99.2%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified99.1%
Applied egg-rr80.5%
Final simplification84.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2)))
(t_1 (fma (cos phi1) (* (cos phi2) (cos (- lambda2 lambda1))) t_0)))
(if (<= phi2 -1.4e-6)
(* R (acos t_1))
(if (<= phi2 2e-21)
(*
R
(acos
(fma
(cos phi1)
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
t_0)))
(*
R
(fma
(* 0.5 (sqrt (sqrt PI)))
(sqrt (* PI (sqrt PI)))
(- (asin t_1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = fma(cos(phi1), (cos(phi2) * cos((lambda2 - lambda1))), t_0);
double tmp;
if (phi2 <= -1.4e-6) {
tmp = R * acos(t_1);
} else if (phi2 <= 2e-21) {
tmp = R * acos(fma(cos(phi1), fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))), t_0));
} else {
tmp = R * fma((0.5 * sqrt(sqrt(((double) M_PI)))), sqrt((((double) M_PI) * sqrt(((double) M_PI)))), -asin(t_1));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))), t_0) tmp = 0.0 if (phi2 <= -1.4e-6) tmp = Float64(R * acos(t_1)); elseif (phi2 <= 2e-21) tmp = Float64(R * acos(fma(cos(phi1), fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))), t_0))); else tmp = Float64(R * fma(Float64(0.5 * sqrt(sqrt(pi))), sqrt(Float64(pi * sqrt(pi))), Float64(-asin(t_1)))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]}, If[LessEqual[phi2, -1.4e-6], N[(R * N[ArcCos[t$95$1], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2e-21], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(N[(0.5 * N[Sqrt[N[Sqrt[Pi], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(Pi * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + (-N[ArcSin[t$95$1], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right), t\_0\right)\\
\mathbf{if}\;\phi_2 \leq -1.4 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} t\_1\\
\mathbf{elif}\;\phi_2 \leq 2 \cdot 10^{-21}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right), t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(0.5 \cdot \sqrt{\sqrt{\pi}}, \sqrt{\pi \cdot \sqrt{\pi}}, -\sin^{-1} t\_1\right)\\
\end{array}
\end{array}
if phi2 < -1.39999999999999994e-6Initial program 82.1%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6499.3
Applied egg-rr99.3%
Applied egg-rr82.3%
if -1.39999999999999994e-6 < phi2 < 1.99999999999999982e-21Initial program 72.4%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6488.2
Applied egg-rr88.2%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified88.2%
Taylor expanded in phi2 around 0
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6488.2
Simplified88.2%
if 1.99999999999999982e-21 < phi2 Initial program 80.7%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6499.2
Applied egg-rr99.2%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified99.2%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified99.1%
Applied egg-rr80.5%
Final simplification84.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= lambda2 2.4e-9)
(* R (acos (fma (cos phi2) (* (cos lambda1) (cos phi1)) t_0)))
(* R (acos (fma (cos phi1) (* (cos phi2) (cos lambda2)) t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (lambda2 <= 2.4e-9) {
tmp = R * acos(fma(cos(phi2), (cos(lambda1) * cos(phi1)), t_0));
} else {
tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos(lambda2)), t_0));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda2 <= 2.4e-9) tmp = Float64(R * acos(fma(cos(phi2), Float64(cos(lambda1) * cos(phi1)), t_0))); else tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(lambda2)), t_0))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 2.4e-9], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 2.4 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \lambda_1 \cdot \cos \phi_1, t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \lambda_2, t\_0\right)\right)\\
\end{array}
\end{array}
if lambda2 < 2.4e-9Initial program 80.4%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6492.5
Applied egg-rr92.5%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified92.5%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
Simplified92.5%
Taylor expanded in lambda2 around 0
lower-cos.f6469.8
Simplified69.8%
if 2.4e-9 < lambda2 Initial program 67.1%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6499.2
Applied egg-rr99.2%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified99.2%
Taylor expanded in lambda1 around 0
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6467.0
Simplified67.0%
Final simplification69.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= lambda2 2.4e-9)
(* R (acos (fma (cos phi1) (* (cos phi2) (cos lambda1)) t_0)))
(* R (acos (fma (cos phi1) (* (cos phi2) (cos lambda2)) t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (lambda2 <= 2.4e-9) {
tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos(lambda1)), t_0));
} else {
tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos(lambda2)), t_0));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda2 <= 2.4e-9) tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(lambda1)), t_0))); else tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(lambda2)), t_0))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 2.4e-9], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 2.4 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \lambda_1, t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \lambda_2, t\_0\right)\right)\\
\end{array}
\end{array}
if lambda2 < 2.4e-9Initial program 80.4%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6492.5
Applied egg-rr92.5%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified92.5%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6469.8
Simplified69.8%
if 2.4e-9 < lambda2 Initial program 67.1%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6499.2
Applied egg-rr99.2%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified99.2%
Taylor expanded in lambda1 around 0
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6467.0
Simplified67.0%
Final simplification69.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 2900.0)
(*
R
(acos
(fma (cos phi1) (* (cos phi2) (cos lambda1)) (* (sin phi1) (sin phi2)))))
(*
R
(acos
(+
(* 0.5 (- (cos (- phi1 phi2)) (cos (+ phi2 phi1))))
(* (cos phi1) (cos (- lambda2 lambda1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2900.0) {
tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos(lambda1)), (sin(phi1) * sin(phi2))));
} else {
tmp = R * acos(((0.5 * (cos((phi1 - phi2)) - cos((phi2 + phi1)))) + (cos(phi1) * cos((lambda2 - lambda1)))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2900.0) tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(lambda1)), Float64(sin(phi1) * sin(phi2))))); else tmp = Float64(R * acos(Float64(Float64(0.5 * Float64(cos(Float64(phi1 - phi2)) - cos(Float64(phi2 + phi1)))) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2900.0], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(0.5 * N[(N[Cos[N[(phi1 - phi2), $MachinePrecision]], $MachinePrecision] - N[Cos[N[(phi2 + phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2900:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \lambda_1, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(0.5 \cdot \left(\cos \left(\phi_1 - \phi_2\right) - \cos \left(\phi_2 + \phi_1\right)\right) + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if lambda2 < 2900Initial program 80.2%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6492.6
Applied egg-rr92.6%
Taylor expanded in phi1 around 0
distribute-lft-inN/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-+r+N/A
Simplified92.6%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6469.7
Simplified69.7%
if 2900 < lambda2 Initial program 67.4%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6437.8
Simplified37.8%
sin-multN/A
div-invN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-+.f6437.5
Applied egg-rr37.5%
Final simplification62.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(fma
(cos phi1)
(* (cos phi2) (cos (- lambda2 lambda1)))
(* (sin phi1) (sin phi2))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda2 - lambda1))), (sin(phi1) * sin(phi2))));
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))), Float64(sin(phi1) * sin(phi2))))) end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)
\end{array}
Initial program 77.2%
cos-diffN/A
*-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6494.1
Applied egg-rr94.1%
Applied egg-rr77.2%
Final simplification77.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= phi1 -0.145)
(* R (acos (fma (cos phi1) (cos (- lambda1 lambda2)) t_0)))
(if (<= phi1 1.05)
(*
R
(acos
(+
t_0
(*
(* (cos phi2) (cos (- lambda2 lambda1)))
(+
1.0
(*
(* phi1 phi1)
(fma (* phi1 phi1) 0.041666666666666664 -0.5)))))))
(* R (acos (+ t_0 (* (cos phi2) (cos phi1)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (phi1 <= -0.145) {
tmp = R * acos(fma(cos(phi1), cos((lambda1 - lambda2)), t_0));
} else if (phi1 <= 1.05) {
tmp = R * acos((t_0 + ((cos(phi2) * cos((lambda2 - lambda1))) * (1.0 + ((phi1 * phi1) * fma((phi1 * phi1), 0.041666666666666664, -0.5))))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(phi1))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi1 <= -0.145) tmp = Float64(R * acos(fma(cos(phi1), cos(Float64(lambda1 - lambda2)), t_0))); elseif (phi1 <= 1.05) tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))) * Float64(1.0 + Float64(Float64(phi1 * phi1) * fma(Float64(phi1 * phi1), 0.041666666666666664, -0.5))))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(phi1))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.145], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.05], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(phi1 * phi1), $MachinePrecision] * N[(N[(phi1 * phi1), $MachinePrecision] * 0.041666666666666664 + -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.145:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \left(\lambda_1 - \lambda_2\right), t\_0\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 1.05:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right) \cdot \left(1 + \left(\phi_1 \cdot \phi_1\right) \cdot \mathsf{fma}\left(\phi_1 \cdot \phi_1, 0.041666666666666664, -0.5\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_2 \cdot \cos \phi_1\right)\\
\end{array}
\end{array}
if phi1 < -0.14499999999999999Initial program 82.9%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6453.5
Simplified53.5%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
sub-negN/A
remove-double-negN/A
distribute-neg-inN/A
+-commutativeN/A
neg-mul-1N/A
lower-fma.f64N/A
lower-cos.f64N/A
cos-negN/A
lower-cos.f64N/A
neg-mul-1N/A
sub-negN/A
lower--.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6453.5
Simplified53.5%
if -0.14499999999999999 < phi1 < 1.05000000000000004Initial program 70.6%
Taylor expanded in phi1 around 0
Simplified70.6%
if 1.05000000000000004 < phi1 Initial program 81.5%
Taylor expanded in lambda1 around 0
+-commutativeN/A
mul-1-negN/A
distribute-rgt-neg-inN/A
sin-negN/A
remove-double-negN/A
lower-fma.f64N/A
lower-sin.f64N/A
cos-negN/A
lower-cos.f6450.8
Simplified50.8%
Taylor expanded in lambda2 around 0
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6436.1
Simplified36.1%
Final simplification56.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (cos (- lambda1 lambda2))))
(if (<= phi1 -1.35e+17)
(* R (acos (fma (cos phi1) t_1 t_0)))
(if (<= phi1 3.5)
(*
R
(acos
(+
(* phi1 (* (sin phi2) (fma (* phi1 phi1) -0.16666666666666666 1.0)))
(* (cos phi2) (* (cos phi1) t_1)))))
(* R (acos (+ t_0 (* (cos phi2) (cos phi1)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -1.35e+17) {
tmp = R * acos(fma(cos(phi1), t_1, t_0));
} else if (phi1 <= 3.5) {
tmp = R * acos(((phi1 * (sin(phi2) * fma((phi1 * phi1), -0.16666666666666666, 1.0))) + (cos(phi2) * (cos(phi1) * t_1))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(phi1))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi1 <= -1.35e+17) tmp = Float64(R * acos(fma(cos(phi1), t_1, t_0))); elseif (phi1 <= 3.5) tmp = Float64(R * acos(Float64(Float64(phi1 * Float64(sin(phi2) * fma(Float64(phi1 * phi1), -0.16666666666666666, 1.0))) + Float64(cos(phi2) * Float64(cos(phi1) * t_1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(phi1))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -1.35e+17], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$1 + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 3.5], N[(R * N[ArcCos[N[(N[(phi1 * N[(N[Sin[phi2], $MachinePrecision] * N[(N[(phi1 * phi1), $MachinePrecision] * -0.16666666666666666 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -1.35 \cdot 10^{+17}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, t\_1, t\_0\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 3.5:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \left(\sin \phi_2 \cdot \mathsf{fma}\left(\phi_1 \cdot \phi_1, -0.16666666666666666, 1\right)\right) + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot t\_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_2 \cdot \cos \phi_1\right)\\
\end{array}
\end{array}
if phi1 < -1.35e17Initial program 82.9%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6453.5
Simplified53.5%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
sub-negN/A
remove-double-negN/A
distribute-neg-inN/A
+-commutativeN/A
neg-mul-1N/A
lower-fma.f64N/A
lower-cos.f64N/A
cos-negN/A
lower-cos.f64N/A
neg-mul-1N/A
sub-negN/A
lower--.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6453.5
Simplified53.5%
if -1.35e17 < phi1 < 3.5Initial program 70.6%
lift-cos.f64N/A
lift-cos.f64N/A
lift--.f64N/A
lift-cos.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6470.6
Applied egg-rr70.6%
Taylor expanded in phi1 around 0
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt1-inN/A
lower-*.f64N/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
lower-sin.f6470.6
Simplified70.6%
if 3.5 < phi1 Initial program 81.5%
Taylor expanded in lambda1 around 0
+-commutativeN/A
mul-1-negN/A
distribute-rgt-neg-inN/A
sin-negN/A
remove-double-negN/A
lower-fma.f64N/A
lower-sin.f64N/A
cos-negN/A
lower-cos.f6450.8
Simplified50.8%
Taylor expanded in lambda2 around 0
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6436.1
Simplified36.1%
Final simplification56.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi2) (cos phi1)))))))
(if (<= phi2 -0.24)
t_0
(if (<= phi2 0.0125)
(*
R
(acos
(+
(* (sin phi1) (fma phi2 (* -0.16666666666666666 (* phi2 phi2)) phi2))
(*
(cos phi1)
(* (cos (- lambda2 lambda1)) (fma -0.5 (* phi2 phi2) 1.0))))))
t_0))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos(phi1))));
double tmp;
if (phi2 <= -0.24) {
tmp = t_0;
} else if (phi2 <= 0.0125) {
tmp = R * acos(((sin(phi1) * fma(phi2, (-0.16666666666666666 * (phi2 * phi2)), phi2)) + (cos(phi1) * (cos((lambda2 - lambda1)) * fma(-0.5, (phi2 * phi2), 1.0)))));
} else {
tmp = t_0;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * cos(phi1))))) tmp = 0.0 if (phi2 <= -0.24) tmp = t_0; elseif (phi2 <= 0.0125) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * fma(phi2, Float64(-0.16666666666666666 * Float64(phi2 * phi2)), phi2)) + Float64(cos(phi1) * Float64(cos(Float64(lambda2 - lambda1)) * fma(-0.5, Float64(phi2 * phi2), 1.0)))))); else tmp = t_0; end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.24], t$95$0, If[LessEqual[phi2, 0.0125], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[(phi2 * N[(-0.16666666666666666 * N[(phi2 * phi2), $MachinePrecision]), $MachinePrecision] + phi2), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * N[(-0.5 * N[(phi2 * phi2), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \phi_1\right)\\
\mathbf{if}\;\phi_2 \leq -0.24:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 0.0125:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \mathsf{fma}\left(\phi_2, -0.16666666666666666 \cdot \left(\phi_2 \cdot \phi_2\right), \phi_2\right) + \cos \phi_1 \cdot \left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \mathsf{fma}\left(-0.5, \phi_2 \cdot \phi_2, 1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi2 < -0.23999999999999999 or 0.012500000000000001 < phi2 Initial program 81.3%
Taylor expanded in lambda1 around 0
+-commutativeN/A
mul-1-negN/A
distribute-rgt-neg-inN/A
sin-negN/A
remove-double-negN/A
lower-fma.f64N/A
lower-sin.f64N/A
cos-negN/A
lower-cos.f6455.9
Simplified55.9%
Taylor expanded in lambda2 around 0
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6441.4
Simplified41.4%
if -0.23999999999999999 < phi2 < 0.012500000000000001Initial program 73.1%
Taylor expanded in phi2 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
distribute-rgt1-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
Simplified72.5%
Taylor expanded in phi2 around 0
distribute-lft-inN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
distribute-lft1-inN/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6472.5
Simplified72.5%
Final simplification57.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= (- lambda1 lambda2) -0.002)
(* R (acos (fma (cos phi1) (cos (- lambda1 lambda2)) t_0)))
(* R (acos (+ t_0 (* (cos phi2) (cos phi1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if ((lambda1 - lambda2) <= -0.002) {
tmp = R * acos(fma(cos(phi1), cos((lambda1 - lambda2)), t_0));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(phi1))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (Float64(lambda1 - lambda2) <= -0.002) tmp = Float64(R * acos(fma(cos(phi1), cos(Float64(lambda1 - lambda2)), t_0))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(phi1))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -0.002], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 - \lambda_2 \leq -0.002:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \left(\lambda_1 - \lambda_2\right), t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_2 \cdot \cos \phi_1\right)\\
\end{array}
\end{array}
if (-.f64 lambda1 lambda2) < -2e-3Initial program 77.1%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6447.0
Simplified47.0%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
sub-negN/A
remove-double-negN/A
distribute-neg-inN/A
+-commutativeN/A
neg-mul-1N/A
lower-fma.f64N/A
lower-cos.f64N/A
cos-negN/A
lower-cos.f64N/A
neg-mul-1N/A
sub-negN/A
lower--.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6447.0
Simplified47.0%
if -2e-3 < (-.f64 lambda1 lambda2) Initial program 77.2%
Taylor expanded in lambda1 around 0
+-commutativeN/A
mul-1-negN/A
distribute-rgt-neg-inN/A
sin-negN/A
remove-double-negN/A
lower-fma.f64N/A
lower-sin.f64N/A
cos-negN/A
lower-cos.f6450.6
Simplified50.6%
Taylor expanded in lambda2 around 0
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6443.4
Simplified43.4%
Final simplification44.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= phi1 -2.6e-7)
(* R (acos (fma (cos phi1) (cos (- lambda1 lambda2)) t_0)))
(* R (acos (+ t_0 (* (cos phi2) (cos (- lambda2 lambda1)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (phi1 <= -2.6e-7) {
tmp = R * acos(fma(cos(phi1), cos((lambda1 - lambda2)), t_0));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi1 <= -2.6e-7) tmp = Float64(R * acos(fma(cos(phi1), cos(Float64(lambda1 - lambda2)), t_0))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(Float64(lambda2 - lambda1)))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -2.6e-7], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -2.6 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \left(\lambda_1 - \lambda_2\right), t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi1 < -2.59999999999999999e-7Initial program 82.1%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6454.2
Simplified54.2%
Taylor expanded in phi1 around 0
lower-acos.f64N/A
sub-negN/A
remove-double-negN/A
distribute-neg-inN/A
+-commutativeN/A
neg-mul-1N/A
lower-fma.f64N/A
lower-cos.f64N/A
cos-negN/A
lower-cos.f64N/A
neg-mul-1N/A
sub-negN/A
lower--.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6454.2
Simplified54.2%
if -2.59999999999999999e-7 < phi1 Initial program 75.0%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6450.0
Simplified50.0%
Final simplification51.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= lambda2 2.4e-9)
(* R (acos (+ t_0 (* (cos lambda1) (cos phi1)))))
(* R (acos (+ t_0 (* (cos lambda2) (cos phi1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (lambda2 <= 2.4e-9) {
tmp = R * acos((t_0 + (cos(lambda1) * cos(phi1))));
} else {
tmp = R * acos((t_0 + (cos(lambda2) * cos(phi1))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (lambda2 <= 2.4d-9) then
tmp = r * acos((t_0 + (cos(lambda1) * cos(phi1))))
else
tmp = r * acos((t_0 + (cos(lambda2) * cos(phi1))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda2 <= 2.4e-9) {
tmp = R * Math.acos((t_0 + (Math.cos(lambda1) * Math.cos(phi1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(lambda2) * Math.cos(phi1))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda2 <= 2.4e-9: tmp = R * math.acos((t_0 + (math.cos(lambda1) * math.cos(phi1)))) else: tmp = R * math.acos((t_0 + (math.cos(lambda2) * math.cos(phi1)))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda2 <= 2.4e-9) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(lambda1) * cos(phi1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(lambda2) * cos(phi1))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda2 <= 2.4e-9)
tmp = R * acos((t_0 + (cos(lambda1) * cos(phi1))));
else
tmp = R * acos((t_0 + (cos(lambda2) * cos(phi1))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 2.4e-9], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 2.4 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \lambda_1 \cdot \cos \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \lambda_2 \cdot \cos \phi_1\right)\\
\end{array}
\end{array}
if lambda2 < 2.4e-9Initial program 80.4%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6447.1
Simplified47.1%
Taylor expanded in lambda2 around 0
cos-negN/A
lower-cos.f6440.9
Simplified40.9%
if 2.4e-9 < lambda2 Initial program 67.1%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6436.9
Simplified36.9%
Taylor expanded in lambda1 around 0
lower-cos.f6437.1
Simplified37.1%
Final simplification40.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 2.25)
(*
R
(acos
(+
(* (sin phi1) (fma phi2 (* -0.16666666666666666 (* phi2 phi2)) phi2))
(*
(cos phi1)
(* (cos (- lambda2 lambda1)) (fma -0.5 (* phi2 phi2) 1.0))))))
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos lambda1) (cos phi1)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.25) {
tmp = R * acos(((sin(phi1) * fma(phi2, (-0.16666666666666666 * (phi2 * phi2)), phi2)) + (cos(phi1) * (cos((lambda2 - lambda1)) * fma(-0.5, (phi2 * phi2), 1.0)))));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(lambda1) * cos(phi1))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.25) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * fma(phi2, Float64(-0.16666666666666666 * Float64(phi2 * phi2)), phi2)) + Float64(cos(phi1) * Float64(cos(Float64(lambda2 - lambda1)) * fma(-0.5, Float64(phi2 * phi2), 1.0)))))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(lambda1) * cos(phi1))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.25], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[(phi2 * N[(-0.16666666666666666 * N[(phi2 * phi2), $MachinePrecision]), $MachinePrecision] + phi2), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * N[(-0.5 * N[(phi2 * phi2), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.25:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \mathsf{fma}\left(\phi_2, -0.16666666666666666 \cdot \left(\phi_2 \cdot \phi_2\right), \phi_2\right) + \cos \phi_1 \cdot \left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \mathsf{fma}\left(-0.5, \phi_2 \cdot \phi_2, 1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \lambda_1 \cdot \cos \phi_1\right)\\
\end{array}
\end{array}
if phi2 < 2.25Initial program 76.2%
Taylor expanded in phi2 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
distribute-rgt1-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
Simplified50.5%
Taylor expanded in phi2 around 0
distribute-lft-inN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
distribute-lft1-inN/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6450.5
Simplified50.5%
if 2.25 < phi2 Initial program 79.7%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6418.5
Simplified18.5%
Taylor expanded in lambda2 around 0
cos-negN/A
lower-cos.f6415.3
Simplified15.3%
Final simplification40.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi2 5.1)
(*
R
(acos
(+
(* (sin phi1) (fma phi2 (* -0.16666666666666666 (* phi2 phi2)) phi2))
(* (cos phi1) (* t_0 (fma -0.5 (* phi2 phi2) 1.0))))))
(* R (acos (+ (* (cos phi1) t_0) (* phi1 (sin phi2))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 5.1) {
tmp = R * acos(((sin(phi1) * fma(phi2, (-0.16666666666666666 * (phi2 * phi2)), phi2)) + (cos(phi1) * (t_0 * fma(-0.5, (phi2 * phi2), 1.0)))));
} else {
tmp = R * acos(((cos(phi1) * t_0) + (phi1 * sin(phi2))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 5.1) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * fma(phi2, Float64(-0.16666666666666666 * Float64(phi2 * phi2)), phi2)) + Float64(cos(phi1) * Float64(t_0 * fma(-0.5, Float64(phi2 * phi2), 1.0)))))); else tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_0) + Float64(phi1 * sin(phi2))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 5.1], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[(phi2 * N[(-0.16666666666666666 * N[(phi2 * phi2), $MachinePrecision]), $MachinePrecision] + phi2), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(t$95$0 * N[(-0.5 * N[(phi2 * phi2), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 5.1:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \mathsf{fma}\left(\phi_2, -0.16666666666666666 \cdot \left(\phi_2 \cdot \phi_2\right), \phi_2\right) + \cos \phi_1 \cdot \left(t\_0 \cdot \mathsf{fma}\left(-0.5, \phi_2 \cdot \phi_2, 1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_0 + \phi_1 \cdot \sin \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 5.0999999999999996Initial program 76.2%
Taylor expanded in phi2 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
distribute-rgt1-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
Simplified50.5%
Taylor expanded in phi2 around 0
distribute-lft-inN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
*-commutativeN/A
distribute-rgt1-inN/A
distribute-lft1-inN/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6450.5
Simplified50.5%
if 5.0999999999999996 < phi2 Initial program 79.7%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6418.5
Simplified18.5%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f647.1
Simplified7.1%
Final simplification38.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi2 2.25)
(*
R
(acos
(+
(* phi2 (sin phi1))
(* (cos phi1) (* t_0 (fma -0.5 (* phi2 phi2) 1.0))))))
(* R (acos (+ (* (cos phi1) t_0) (* phi1 (sin phi2))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 2.25) {
tmp = R * acos(((phi2 * sin(phi1)) + (cos(phi1) * (t_0 * fma(-0.5, (phi2 * phi2), 1.0)))));
} else {
tmp = R * acos(((cos(phi1) * t_0) + (phi1 * sin(phi2))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 2.25) tmp = Float64(R * acos(Float64(Float64(phi2 * sin(phi1)) + Float64(cos(phi1) * Float64(t_0 * fma(-0.5, Float64(phi2 * phi2), 1.0)))))); else tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_0) + Float64(phi1 * sin(phi2))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 2.25], N[(R * N[ArcCos[N[(N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(t$95$0 * N[(-0.5 * N[(phi2 * phi2), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 2.25:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \sin \phi_1 + \cos \phi_1 \cdot \left(t\_0 \cdot \mathsf{fma}\left(-0.5, \phi_2 \cdot \phi_2, 1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_0 + \phi_1 \cdot \sin \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 2.25Initial program 76.2%
Taylor expanded in phi2 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
distribute-rgt1-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-evalN/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
Simplified50.5%
Taylor expanded in phi2 around 0
lower-*.f64N/A
lower-sin.f6450.2
Simplified50.2%
if 2.25 < phi2 Initial program 79.7%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6418.5
Simplified18.5%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f647.1
Simplified7.1%
Final simplification38.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos (- lambda2 lambda1)))))
(if (<= phi1 -5e+31)
(* R (acos (+ (* phi2 (sin phi1)) t_0)))
(* R (acos (+ t_0 (* phi1 (sin phi2))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -5e+31) {
tmp = R * acos(((phi2 * sin(phi1)) + t_0));
} else {
tmp = R * acos((t_0 + (phi1 * sin(phi2))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos(phi1) * cos((lambda2 - lambda1))
if (phi1 <= (-5d+31)) then
tmp = r * acos(((phi2 * sin(phi1)) + t_0))
else
tmp = r * acos((t_0 + (phi1 * sin(phi2))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi1) * Math.cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -5e+31) {
tmp = R * Math.acos(((phi2 * Math.sin(phi1)) + t_0));
} else {
tmp = R * Math.acos((t_0 + (phi1 * Math.sin(phi2))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi1) * math.cos((lambda2 - lambda1)) tmp = 0 if phi1 <= -5e+31: tmp = R * math.acos(((phi2 * math.sin(phi1)) + t_0)) else: tmp = R * math.acos((t_0 + (phi1 * math.sin(phi2)))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))) tmp = 0.0 if (phi1 <= -5e+31) tmp = Float64(R * acos(Float64(Float64(phi2 * sin(phi1)) + t_0))); else tmp = Float64(R * acos(Float64(t_0 + Float64(phi1 * sin(phi2))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi1) * cos((lambda2 - lambda1));
tmp = 0.0;
if (phi1 <= -5e+31)
tmp = R * acos(((phi2 * sin(phi1)) + t_0));
else
tmp = R * acos((t_0 + (phi1 * sin(phi2))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -5e+31], N[(R * N[ArcCos[N[(N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_1 \leq -5 \cdot 10^{+31}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \sin \phi_1 + t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \phi_1 \cdot \sin \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -5.00000000000000027e31Initial program 83.3%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6452.6
Simplified52.6%
Taylor expanded in phi2 around 0
lower-*.f64N/A
lower-sin.f6442.9
Simplified42.9%
if -5.00000000000000027e31 < phi1 Initial program 74.9%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6441.7
Simplified41.7%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6430.8
Simplified30.8%
Final simplification34.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= lambda2 2.4e-9)
(* R (acos (+ (* (cos lambda1) (cos phi1)) t_0)))
(* R (acos (+ (* (cos lambda2) (cos phi1)) t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (lambda2 <= 2.4e-9) {
tmp = R * acos(((cos(lambda1) * cos(phi1)) + t_0));
} else {
tmp = R * acos(((cos(lambda2) * cos(phi1)) + t_0));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (lambda2 <= 2.4d-9) then
tmp = r * acos(((cos(lambda1) * cos(phi1)) + t_0))
else
tmp = r * acos(((cos(lambda2) * cos(phi1)) + t_0))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (lambda2 <= 2.4e-9) {
tmp = R * Math.acos(((Math.cos(lambda1) * Math.cos(phi1)) + t_0));
} else {
tmp = R * Math.acos(((Math.cos(lambda2) * Math.cos(phi1)) + t_0));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda2 <= 2.4e-9: tmp = R * math.acos(((math.cos(lambda1) * math.cos(phi1)) + t_0)) else: tmp = R * math.acos(((math.cos(lambda2) * math.cos(phi1)) + t_0)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda2 <= 2.4e-9) tmp = Float64(R * acos(Float64(Float64(cos(lambda1) * cos(phi1)) + t_0))); else tmp = Float64(R * acos(Float64(Float64(cos(lambda2) * cos(phi1)) + t_0))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda2 <= 2.4e-9)
tmp = R * acos(((cos(lambda1) * cos(phi1)) + t_0));
else
tmp = R * acos(((cos(lambda2) * cos(phi1)) + t_0));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 2.4e-9], N[(R * N[ArcCos[N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 2.4 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_1 \cdot \cos \phi_1 + t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_2 \cdot \cos \phi_1 + t\_0\right)\\
\end{array}
\end{array}
if lambda2 < 2.4e-9Initial program 80.4%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6447.1
Simplified47.1%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6427.4
Simplified27.4%
Taylor expanded in lambda2 around 0
cos-negN/A
lower-cos.f6422.7
Simplified22.7%
if 2.4e-9 < lambda2 Initial program 67.1%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6436.9
Simplified36.9%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6420.9
Simplified20.9%
Taylor expanded in lambda1 around 0
lower-cos.f6420.9
Simplified20.9%
Final simplification22.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* (cos phi1) (cos (- lambda2 lambda1))) (* phi1 (sin phi2))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (phi1 * sin(phi2))));
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (phi1 * sin(phi2))))
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.cos(phi1) * Math.cos((lambda2 - lambda1))) + (phi1 * Math.sin(phi2))));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.cos(phi1) * math.cos((lambda2 - lambda1))) + (phi1 * math.sin(phi2))))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))) + Float64(phi1 * sin(phi2))))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (phi1 * sin(phi2))));
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)
\end{array}
Initial program 77.2%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6444.7
Simplified44.7%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6425.9
Simplified25.9%
Final simplification25.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 1e-10) (* R (acos (+ (* (cos lambda1) (cos phi1)) (* phi2 phi1)))) (* R (acos (+ (* (cos lambda2) (cos phi1)) (* phi2 phi1))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1e-10) {
tmp = R * acos(((cos(lambda1) * cos(phi1)) + (phi2 * phi1)));
} else {
tmp = R * acos(((cos(lambda2) * cos(phi1)) + (phi2 * phi1)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 1d-10) then
tmp = r * acos(((cos(lambda1) * cos(phi1)) + (phi2 * phi1)))
else
tmp = r * acos(((cos(lambda2) * cos(phi1)) + (phi2 * phi1)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1e-10) {
tmp = R * Math.acos(((Math.cos(lambda1) * Math.cos(phi1)) + (phi2 * phi1)));
} else {
tmp = R * Math.acos(((Math.cos(lambda2) * Math.cos(phi1)) + (phi2 * phi1)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 1e-10: tmp = R * math.acos(((math.cos(lambda1) * math.cos(phi1)) + (phi2 * phi1))) else: tmp = R * math.acos(((math.cos(lambda2) * math.cos(phi1)) + (phi2 * phi1))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1e-10) tmp = Float64(R * acos(Float64(Float64(cos(lambda1) * cos(phi1)) + Float64(phi2 * phi1)))); else tmp = Float64(R * acos(Float64(Float64(cos(lambda2) * cos(phi1)) + Float64(phi2 * phi1)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 1e-10)
tmp = R * acos(((cos(lambda1) * cos(phi1)) + (phi2 * phi1)));
else
tmp = R * acos(((cos(lambda2) * cos(phi1)) + (phi2 * phi1)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1e-10], N[(R * N[ArcCos[N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 10^{-10}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_1 \cdot \cos \phi_1 + \phi_2 \cdot \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_2 \cdot \cos \phi_1 + \phi_2 \cdot \phi_1\right)\\
\end{array}
\end{array}
if lambda2 < 1.00000000000000004e-10Initial program 80.4%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6447.1
Simplified47.1%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6427.4
Simplified27.4%
Taylor expanded in phi2 around 0
lower-*.f6426.0
Simplified26.0%
Taylor expanded in lambda2 around 0
cos-negN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6421.6
Simplified21.6%
if 1.00000000000000004e-10 < lambda2 Initial program 67.1%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6436.9
Simplified36.9%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6420.9
Simplified20.9%
Taylor expanded in phi2 around 0
lower-*.f6418.2
Simplified18.2%
Taylor expanded in lambda1 around 0
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6418.3
Simplified18.3%
Final simplification20.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 13000000.0) (* R (acos (+ (* (cos lambda1) (cos phi1)) (* phi2 phi1)))) (* R (acos (+ (cos (- lambda1 lambda2)) (* phi2 phi1))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 13000000.0) {
tmp = R * acos(((cos(lambda1) * cos(phi1)) + (phi2 * phi1)));
} else {
tmp = R * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 13000000.0d0) then
tmp = r * acos(((cos(lambda1) * cos(phi1)) + (phi2 * phi1)))
else
tmp = r * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 13000000.0) {
tmp = R * Math.acos(((Math.cos(lambda1) * Math.cos(phi1)) + (phi2 * phi1)));
} else {
tmp = R * Math.acos((Math.cos((lambda1 - lambda2)) + (phi2 * phi1)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 13000000.0: tmp = R * math.acos(((math.cos(lambda1) * math.cos(phi1)) + (phi2 * phi1))) else: tmp = R * math.acos((math.cos((lambda1 - lambda2)) + (phi2 * phi1))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 13000000.0) tmp = Float64(R * acos(Float64(Float64(cos(lambda1) * cos(phi1)) + Float64(phi2 * phi1)))); else tmp = Float64(R * acos(Float64(cos(Float64(lambda1 - lambda2)) + Float64(phi2 * phi1)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 13000000.0)
tmp = R * acos(((cos(lambda1) * cos(phi1)) + (phi2 * phi1)));
else
tmp = R * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 13000000.0], N[(R * N[ArcCos[N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 13000000:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_1 \cdot \cos \phi_1 + \phi_2 \cdot \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) + \phi_2 \cdot \phi_1\right)\\
\end{array}
\end{array}
if lambda2 < 1.3e7Initial program 80.3%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6446.6
Simplified46.6%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6427.2
Simplified27.2%
Taylor expanded in phi2 around 0
lower-*.f6425.8
Simplified25.8%
Taylor expanded in lambda2 around 0
cos-negN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6421.4
Simplified21.4%
if 1.3e7 < lambda2 Initial program 66.8%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6438.1
Simplified38.1%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6421.3
Simplified21.3%
Taylor expanded in phi2 around 0
lower-*.f6418.6
Simplified18.6%
Taylor expanded in phi1 around 0
sub-negN/A
remove-double-negN/A
distribute-neg-inN/A
+-commutativeN/A
neg-mul-1N/A
cos-negN/A
lower-cos.f64N/A
neg-mul-1N/A
sub-negN/A
lower--.f6413.5
Simplified13.5%
Final simplification19.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* (cos phi1) (cos (- lambda2 lambda1))) (* phi2 phi1)))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (phi2 * phi1)));
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (phi2 * phi1)))
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.cos(phi1) * Math.cos((lambda2 - lambda1))) + (phi2 * phi1)));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.cos(phi1) * math.cos((lambda2 - lambda1))) + (phi2 * phi1)))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))) + Float64(phi2 * phi1)))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (phi2 * phi1)));
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right) + \phi_2 \cdot \phi_1\right)
\end{array}
Initial program 77.2%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6444.7
Simplified44.7%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6425.9
Simplified25.9%
Taylor expanded in phi2 around 0
lower-*.f6424.2
Simplified24.2%
Final simplification24.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (cos (- lambda1 lambda2)) (* phi2 phi1)))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)));
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)))
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos((Math.cos((lambda1 - lambda2)) + (phi2 * phi1)));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos((math.cos((lambda1 - lambda2)) + (phi2 * phi1)))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(cos(Float64(lambda1 - lambda2)) + Float64(phi2 * phi1)))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)));
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) + \phi_2 \cdot \phi_1\right)
\end{array}
Initial program 77.2%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
lower-cos.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-cos.f6444.7
Simplified44.7%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lower-sin.f6425.9
Simplified25.9%
Taylor expanded in phi2 around 0
lower-*.f6424.2
Simplified24.2%
Taylor expanded in phi1 around 0
sub-negN/A
remove-double-negN/A
distribute-neg-inN/A
+-commutativeN/A
neg-mul-1N/A
cos-negN/A
lower-cos.f64N/A
neg-mul-1N/A
sub-negN/A
lower--.f6416.0
Simplified16.0%
Final simplification16.0%
herbie shell --seed 2024215
(FPCore (R lambda1 lambda2 phi1 phi2)
:name "Spherical law of cosines"
:precision binary64
(* (acos (+ (* (sin phi1) (sin phi2)) (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))) R))