
(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 21 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: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(*
(cos phi2)
(*
(cos phi1)
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1)))))))
R))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * (cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))))) * R;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * (cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))))) * r
end function
assert phi1 < phi2;
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(phi2) * (Math.cos(phi1) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1))))))) * R;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi2) * (math.cos(phi1) * ((math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1))))))) * R
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))) * R) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * (cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))))) * R;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\right) \cdot R
\end{array}
Initial program 70.7%
cos-diff93.9%
+-commutative93.9%
Applied egg-rr93.9%
Taylor expanded in lambda1 around inf 93.9%
Final simplification93.9%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (cos (- lambda1 lambda2))))
(if (<= phi1 -7.8e-5)
(*
R
(pow
(pow (acos (fma t_1 (* (cos phi2) (cos phi1)) t_0)) 3.0)
0.3333333333333333))
(if (<= phi1 5e-21)
(*
R
(acos
(+
t_0
(*
(cos phi2)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))
(*
R
(acos
(fma (sin phi1) (sin phi2) (* (cos phi1) (* (cos phi2) t_1)))))))))assert(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 <= -7.8e-5) {
tmp = R * pow(pow(acos(fma(t_1, (cos(phi2) * cos(phi1)), t_0)), 3.0), 0.3333333333333333);
} else if (phi1 <= 5e-21) {
tmp = R * acos((t_0 + (cos(phi2) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * t_1))));
}
return tmp;
}
phi1, phi2 = sort([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 <= -7.8e-5) tmp = Float64(R * ((acos(fma(t_1, Float64(cos(phi2) * cos(phi1)), t_0)) ^ 3.0) ^ 0.3333333333333333)); elseif (phi1 <= 5e-21) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * t_1))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -7.8e-5], N[(R * N[Power[N[Power[N[ArcCos[N[(t$95$1 * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision], 3.0], $MachinePrecision], 0.3333333333333333], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 5e-21], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([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 -7.8 \cdot 10^{-5}:\\
\;\;\;\;R \cdot {\left({\cos^{-1} \left(\mathsf{fma}\left(t_1, \cos \phi_2 \cdot \cos \phi_1, t_0\right)\right)}^{3}\right)}^{0.3333333333333333}\\
\mathbf{elif}\;\phi_1 \leq 5 \cdot 10^{-21}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t_1\right)\right)\right)\\
\end{array}
\end{array}
if phi1 < -7.7999999999999999e-5Initial program 71.2%
add-cbrt-cube70.8%
pow1/371.2%
Applied egg-rr71.2%
if -7.7999999999999999e-5 < phi1 < 4.99999999999999973e-21Initial program 68.4%
cos-diff90.1%
+-commutative90.1%
Applied egg-rr90.1%
Taylor expanded in phi1 around 0 89.7%
if 4.99999999999999973e-21 < phi1 Initial program 74.6%
fma-def74.7%
associate-*l*74.7%
Simplified74.7%
Final simplification81.1%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2)))
(t_1 (* (cos phi2) (cos (- lambda1 lambda2)))))
(if (<= phi1 -7.8e-5)
(* R (acos (fma (cos phi1) t_1 t_0)))
(if (<= phi1 5e-21)
(*
R
(acos
(+
t_0
(*
(cos phi2)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi1) t_1))))))))assert(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(phi2) * cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -7.8e-5) {
tmp = R * acos(fma(cos(phi1), t_1, t_0));
} else if (phi1 <= 5e-21) {
tmp = R * acos((t_0 + (cos(phi2) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * t_1)));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi1 <= -7.8e-5) tmp = Float64(R * acos(fma(cos(phi1), t_1, t_0))); elseif (phi1 <= 5e-21) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * t_1)))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -7.8e-5], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$1 + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 5e-21], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -7.8 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, t_1, t_0\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 5 \cdot 10^{-21}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot t_1\right)\right)\\
\end{array}
\end{array}
if phi1 < -7.7999999999999999e-5Initial program 71.2%
associate-*r*71.2%
log1p-expm1-u71.2%
associate-*r*71.2%
*-commutative71.2%
Applied egg-rr71.2%
Taylor expanded in phi1 around 0 71.2%
fma-def71.2%
sub-neg71.2%
+-commutative71.2%
neg-mul-171.2%
fma-def71.2%
fma-def71.2%
neg-mul-171.2%
+-commutative71.2%
sub-neg71.2%
fma-def71.2%
associate-*r*71.2%
*-commutative71.2%
Simplified71.2%
if -7.7999999999999999e-5 < phi1 < 4.99999999999999973e-21Initial program 68.4%
cos-diff90.1%
+-commutative90.1%
Applied egg-rr90.1%
Taylor expanded in phi1 around 0 89.7%
if 4.99999999999999973e-21 < phi1 Initial program 74.6%
fma-def74.7%
associate-*l*74.7%
Simplified74.7%
Final simplification81.1%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi2 -8e-183)
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(log1p (expm1 (* t_0 (* (cos phi2) (cos phi1))))))))
(if (<= phi2 5.4e-222)
(*
R
(acos
(+
(* phi1 (sin phi2))
(*
(cos phi1)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))
(*
R
(acos
(fma (sin phi1) (sin phi2) (* (cos phi1) (* (cos phi2) t_0)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -8e-183) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + log1p(expm1((t_0 * (cos(phi2) * cos(phi1)))))));
} else if (phi2 <= 5.4e-222) {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * t_0))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -8e-183) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + log1p(expm1(Float64(t_0 * Float64(cos(phi2) * cos(phi1)))))))); elseif (phi2 <= 5.4e-222) tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * t_0))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -8e-183], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[Log[1 + N[(Exp[N[(t$95$0 * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 5.4e-222], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -8 \cdot 10^{-183}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \mathsf{log1p}\left(\mathsf{expm1}\left(t_0 \cdot \left(\cos \phi_2 \cdot \cos \phi_1\right)\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 5.4 \cdot 10^{-222}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t_0\right)\right)\right)\\
\end{array}
\end{array}
if phi2 < -8.00000000000000004e-183Initial program 73.1%
associate-*r*73.1%
log1p-expm1-u73.1%
associate-*r*73.1%
*-commutative73.1%
Applied egg-rr73.1%
if -8.00000000000000004e-183 < phi2 < 5.4e-222Initial program 60.0%
Taylor expanded in phi2 around 0 60.0%
sub-neg60.0%
+-commutative60.0%
neg-mul-160.0%
neg-mul-160.0%
remove-double-neg60.0%
mul-1-neg60.0%
distribute-neg-in60.0%
+-commutative60.0%
cos-neg60.0%
+-commutative60.0%
mul-1-neg60.0%
unsub-neg60.0%
Simplified60.0%
Taylor expanded in phi1 around 0 54.2%
cos-diff85.3%
*-commutative85.3%
*-commutative85.3%
+-commutative85.3%
Applied egg-rr85.3%
if 5.4e-222 < phi2 Initial program 71.6%
fma-def71.6%
associate-*l*71.6%
Simplified71.6%
Final simplification74.1%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi2 -2.2e-184)
(*
R
(acos (+ (* (sin phi1) (sin phi2)) (* t_0 (* (cos phi2) (cos phi1))))))
(if (<= phi2 3.3e-221)
(*
R
(acos
(+
(* phi1 (sin phi2))
(*
(cos phi1)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))
(*
R
(acos
(fma (sin phi1) (sin phi2) (* (cos phi1) (* (cos phi2) t_0)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -2.2e-184) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (t_0 * (cos(phi2) * cos(phi1)))));
} else if (phi2 <= 3.3e-221) {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * t_0))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -2.2e-184) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(t_0 * Float64(cos(phi2) * cos(phi1)))))); elseif (phi2 <= 3.3e-221) tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * t_0))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -2.2e-184], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(t$95$0 * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3.3e-221], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -2.2 \cdot 10^{-184}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + t_0 \cdot \left(\cos \phi_2 \cdot \cos \phi_1\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 3.3 \cdot 10^{-221}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t_0\right)\right)\right)\\
\end{array}
\end{array}
if phi2 < -2.19999999999999992e-184Initial program 73.1%
if -2.19999999999999992e-184 < phi2 < 3.2999999999999999e-221Initial program 60.0%
Taylor expanded in phi2 around 0 60.0%
sub-neg60.0%
+-commutative60.0%
neg-mul-160.0%
neg-mul-160.0%
remove-double-neg60.0%
mul-1-neg60.0%
distribute-neg-in60.0%
+-commutative60.0%
cos-neg60.0%
+-commutative60.0%
mul-1-neg60.0%
unsub-neg60.0%
Simplified60.0%
Taylor expanded in phi1 around 0 54.2%
cos-diff85.3%
*-commutative85.3%
*-commutative85.3%
+-commutative85.3%
Applied egg-rr85.3%
if 3.2999999999999999e-221 < phi2 Initial program 71.6%
fma-def71.6%
associate-*l*71.6%
Simplified71.6%
Final simplification74.1%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= lambda1 -1.65e+55)
(* R (acos (+ t_0 (* (cos phi2) (cos (- lambda2 lambda1))))))
(if (<= lambda1 -3e-7)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda2))))))))))assert(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 <= -1.65e+55) {
tmp = R * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))));
} else if (lambda1 <= -3e-7) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (lambda1 <= (-1.65d+55)) then
tmp = r * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))))
else if (lambda1 <= (-3d-7)) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))))
end if
code = tmp
end function
assert 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 (lambda1 <= -1.65e+55) {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos((lambda2 - lambda1)))));
} else if (lambda1 <= -3e-7) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda2)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda1 <= -1.65e+55: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos((lambda2 - lambda1))))) elif lambda1 <= -3e-7: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * (math.cos(phi1) * math.cos(lambda2))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda1 <= -1.65e+55) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(Float64(lambda2 - lambda1)))))); elseif (lambda1 <= -3e-7) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * Float64(cos(phi1) * cos(lambda2)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda1 <= -1.65e+55)
tmp = R * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))));
elseif (lambda1 <= -3e-7)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -1.65e+55], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, -3e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -1.65 \cdot 10^{+55}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{elif}\;\lambda_1 \leq -3 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \lambda_2\right)\right)\\
\end{array}
\end{array}
if lambda1 < -1.65e55Initial program 50.0%
Taylor expanded in phi1 around 0 38.7%
sub-neg38.7%
+-commutative38.7%
neg-mul-138.7%
neg-mul-138.7%
remove-double-neg38.7%
mul-1-neg38.7%
distribute-neg-in38.7%
+-commutative38.7%
cos-neg38.7%
+-commutative38.7%
mul-1-neg38.7%
unsub-neg38.7%
Simplified38.7%
if -1.65e55 < lambda1 < -2.9999999999999999e-7Initial program 60.0%
Taylor expanded in phi2 around 0 42.9%
sub-neg42.9%
+-commutative42.9%
neg-mul-142.9%
neg-mul-142.9%
remove-double-neg42.9%
mul-1-neg42.9%
distribute-neg-in42.9%
+-commutative42.9%
cos-neg42.9%
+-commutative42.9%
mul-1-neg42.9%
unsub-neg42.9%
Simplified42.9%
Taylor expanded in lambda2 around 0 43.2%
cos-neg14.0%
Simplified43.2%
if -2.9999999999999999e-7 < lambda1 Initial program 77.5%
Taylor expanded in lambda1 around 0 61.4%
*-commutative61.4%
cos-neg61.4%
Simplified61.4%
Final simplification55.6%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= lambda1 -3e-7)
(* R (acos (+ t_0 (* (cos lambda1) (* (cos phi2) (cos phi1))))))
(* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda2)))))))))assert(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 <= -3e-7) {
tmp = R * acos((t_0 + (cos(lambda1) * (cos(phi2) * cos(phi1)))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (lambda1 <= (-3d-7)) then
tmp = r * acos((t_0 + (cos(lambda1) * (cos(phi2) * cos(phi1)))))
else
tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))))
end if
code = tmp
end function
assert 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 (lambda1 <= -3e-7) {
tmp = R * Math.acos((t_0 + (Math.cos(lambda1) * (Math.cos(phi2) * Math.cos(phi1)))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda2)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda1 <= -3e-7: tmp = R * math.acos((t_0 + (math.cos(lambda1) * (math.cos(phi2) * math.cos(phi1))))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * (math.cos(phi1) * math.cos(lambda2))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda1 <= -3e-7) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(lambda1) * Float64(cos(phi2) * cos(phi1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * Float64(cos(phi1) * cos(lambda2)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda1 <= -3e-7)
tmp = R * acos((t_0 + (cos(lambda1) * (cos(phi2) * cos(phi1)))));
else
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -3e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[lambda1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -3 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \lambda_1 \cdot \left(\cos \phi_2 \cdot \cos \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \lambda_2\right)\right)\\
\end{array}
\end{array}
if lambda1 < -2.9999999999999999e-7Initial program 52.4%
Taylor expanded in lambda2 around 0 52.5%
if -2.9999999999999999e-7 < lambda1 Initial program 77.5%
Taylor expanded in lambda1 around 0 61.4%
*-commutative61.4%
cos-neg61.4%
Simplified61.4%
Final simplification59.0%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (cos (- lambda1 lambda2)) (* (cos phi2) (cos phi1)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + (cos((lambda1 - lambda2)) * (cos(phi2) * cos(phi1)))));
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((sin(phi1) * sin(phi2)) + (cos((lambda1 - lambda2)) * (cos(phi2) * cos(phi1)))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos((lambda1 - lambda2)) * (Math.cos(phi2) * Math.cos(phi1)))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos((lambda1 - lambda2)) * (math.cos(phi2) * math.cos(phi1)))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(Float64(lambda1 - lambda2)) * Float64(cos(phi2) * cos(phi1)))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos((lambda1 - lambda2)) * (cos(phi2) * cos(phi1)))));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \phi_2 \cdot \cos \phi_1\right)\right)
\end{array}
Initial program 70.7%
Final simplification70.7%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi1 -2.5e-43)
(*
R
(acos
(+
(/ (- (cos (- phi1 phi2)) (cos (+ phi1 phi2))) 2.0)
(* (cos phi1) t_0))))
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -2.5e-43) {
tmp = R * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0) + (cos(phi1) * t_0)));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
if (phi1 <= (-2.5d-43)) then
tmp = r * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0d0) + (cos(phi1) * t_0)))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * t_0)))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -2.5e-43) {
tmp = R * Math.acos((((Math.cos((phi1 - phi2)) - Math.cos((phi1 + phi2))) / 2.0) + (Math.cos(phi1) * t_0)));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi2) * t_0)));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi1 <= -2.5e-43: tmp = R * math.acos((((math.cos((phi1 - phi2)) - math.cos((phi1 + phi2))) / 2.0) + (math.cos(phi1) * t_0))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi2) * t_0))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi1 <= -2.5e-43) tmp = Float64(R * acos(Float64(Float64(Float64(cos(Float64(phi1 - phi2)) - cos(Float64(phi1 + phi2))) / 2.0) + Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * t_0)))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi1 <= -2.5e-43)
tmp = R * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0) + (cos(phi1) * t_0)));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -2.5e-43], N[(R * N[ArcCos[N[(N[(N[(N[Cos[N[(phi1 - phi2), $MachinePrecision]], $MachinePrecision] - N[Cos[N[(phi1 + phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_1 \leq -2.5 \cdot 10^{-43}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\frac{\cos \left(\phi_1 - \phi_2\right) - \cos \left(\phi_1 + \phi_2\right)}{2} + \cos \phi_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
if phi1 < -2.50000000000000009e-43Initial program 70.0%
Taylor expanded in phi2 around 0 50.9%
sub-neg50.9%
+-commutative50.9%
neg-mul-150.9%
neg-mul-150.9%
remove-double-neg50.9%
mul-1-neg50.9%
distribute-neg-in50.9%
+-commutative50.9%
cos-neg50.9%
+-commutative50.9%
mul-1-neg50.9%
unsub-neg50.9%
Simplified50.9%
sin-mult50.4%
Applied egg-rr50.4%
+-commutative50.4%
Simplified50.4%
if -2.50000000000000009e-43 < phi1 Initial program 71.0%
Taylor expanded in phi1 around 0 51.7%
sub-neg51.7%
+-commutative51.7%
neg-mul-151.7%
neg-mul-151.7%
remove-double-neg51.7%
mul-1-neg51.7%
distribute-neg-in51.7%
+-commutative51.7%
cos-neg51.7%
+-commutative51.7%
mul-1-neg51.7%
unsub-neg51.7%
Simplified51.7%
Final simplification51.3%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi2 7.5e-6)
(* R (acos (+ t_1 (* (cos phi1) t_0))))
(* R (acos (+ t_1 (* (cos phi2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= 7.5e-6) {
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
} else {
tmp = R * acos((t_1 + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
t_1 = sin(phi1) * sin(phi2)
if (phi2 <= 7.5d-6) then
tmp = r * acos((t_1 + (cos(phi1) * t_0)))
else
tmp = r * acos((t_1 + (cos(phi2) * t_0)))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (phi2 <= 7.5e-6) {
tmp = R * Math.acos((t_1 + (Math.cos(phi1) * t_0)));
} else {
tmp = R * Math.acos((t_1 + (Math.cos(phi2) * t_0)));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if phi2 <= 7.5e-6: tmp = R * math.acos((t_1 + (math.cos(phi1) * t_0))) else: tmp = R * math.acos((t_1 + (math.cos(phi2) * t_0))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= 7.5e-6) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi2) * t_0)))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (phi2 <= 7.5e-6)
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
else
tmp = R * acos((t_1 + (cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 7.5e-6], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq 7.5 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \phi_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
if phi2 < 7.50000000000000019e-6Initial program 70.2%
Taylor expanded in phi2 around 0 47.1%
sub-neg47.1%
+-commutative47.1%
neg-mul-147.1%
neg-mul-147.1%
remove-double-neg47.1%
mul-1-neg47.1%
distribute-neg-in47.1%
+-commutative47.1%
cos-neg47.1%
+-commutative47.1%
mul-1-neg47.1%
unsub-neg47.1%
Simplified47.1%
if 7.50000000000000019e-6 < phi2 Initial program 72.3%
Taylor expanded in phi1 around 0 49.1%
sub-neg49.1%
+-commutative49.1%
neg-mul-149.1%
neg-mul-149.1%
remove-double-neg49.1%
mul-1-neg49.1%
distribute-neg-in49.1%
+-commutative49.1%
cos-neg49.1%
+-commutative49.1%
mul-1-neg49.1%
unsub-neg49.1%
Simplified49.1%
Final simplification47.6%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 7.8)
(*
R
(acos (+ (* (cos phi1) (cos (- lambda2 lambda1))) (* (sin phi1) phi2))))
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi1) (cos lambda1)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.8) {
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(lambda1))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 7.8d0) then
tmp = r * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(lambda1))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.8) {
tmp = R * Math.acos(((Math.cos(phi1) * Math.cos((lambda2 - lambda1))) + (Math.sin(phi1) * phi2)));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos(lambda1))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 7.8: tmp = R * math.acos(((math.cos(phi1) * math.cos((lambda2 - lambda1))) + (math.sin(phi1) * phi2))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * math.cos(lambda1)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 7.8) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * cos(lambda1))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 7.8)
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 7.8], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 7.8:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right) + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi2 < 7.79999999999999982Initial program 70.3%
Taylor expanded in phi2 around 0 47.3%
sub-neg47.3%
+-commutative47.3%
neg-mul-147.3%
neg-mul-147.3%
remove-double-neg47.3%
mul-1-neg47.3%
distribute-neg-in47.3%
+-commutative47.3%
cos-neg47.3%
+-commutative47.3%
mul-1-neg47.3%
unsub-neg47.3%
Simplified47.3%
Taylor expanded in phi2 around 0 43.2%
if 7.79999999999999982 < phi2 Initial program 71.9%
Taylor expanded in phi2 around 0 15.5%
sub-neg15.5%
+-commutative15.5%
neg-mul-115.5%
neg-mul-115.5%
remove-double-neg15.5%
mul-1-neg15.5%
distribute-neg-in15.5%
+-commutative15.5%
cos-neg15.5%
+-commutative15.5%
mul-1-neg15.5%
unsub-neg15.5%
Simplified15.5%
Taylor expanded in lambda2 around 0 12.5%
cos-neg5.6%
Simplified12.5%
Final simplification35.5%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= lambda2 8.2e-31)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi1) (cos lambda2))))))))assert(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 <= 8.2e-31) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (lambda2 <= 8.2d-31) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda2))))
end if
code = tmp
end function
assert 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 <= 8.2e-31) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda2 <= 8.2e-31: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda2 <= 8.2e-31) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda2 <= 8.2e-31)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 8.2e-31], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 8.2 \cdot 10^{-31}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 8.1999999999999993e-31Initial program 76.3%
Taylor expanded in phi2 around 0 42.2%
sub-neg42.2%
+-commutative42.2%
neg-mul-142.2%
neg-mul-142.2%
remove-double-neg42.2%
mul-1-neg42.2%
distribute-neg-in42.2%
+-commutative42.2%
cos-neg42.2%
+-commutative42.2%
mul-1-neg42.2%
unsub-neg42.2%
Simplified42.2%
Taylor expanded in lambda2 around 0 36.6%
cos-neg16.7%
Simplified36.6%
if 8.1999999999999993e-31 < lambda2 Initial program 58.2%
Taylor expanded in phi2 around 0 32.8%
sub-neg32.8%
+-commutative32.8%
neg-mul-132.8%
neg-mul-132.8%
remove-double-neg32.8%
mul-1-neg32.8%
distribute-neg-in32.8%
+-commutative32.8%
cos-neg32.8%
+-commutative32.8%
mul-1-neg32.8%
unsub-neg32.8%
Simplified32.8%
Taylor expanded in lambda1 around 0 32.4%
Final simplification35.3%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi1) (cos (- lambda2 lambda1)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))));
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * math.cos((lambda2 - lambda1)))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)
\end{array}
Initial program 70.7%
Taylor expanded in phi2 around 0 39.3%
sub-neg39.3%
+-commutative39.3%
neg-mul-139.3%
neg-mul-139.3%
remove-double-neg39.3%
mul-1-neg39.3%
distribute-neg-in39.3%
+-commutative39.3%
cos-neg39.3%
+-commutative39.3%
mul-1-neg39.3%
unsub-neg39.3%
Simplified39.3%
Final simplification39.3%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 7.5e-6)
(*
R
(acos (+ (* (cos phi1) (cos (- lambda2 lambda1))) (* (sin phi1) phi2))))
(*
R
(acos
(+
(* phi1 (sin phi2))
(/
(+
(cos (- (+ phi1 lambda2) lambda1))
(cos (- lambda2 (+ phi1 lambda1))))
2.0))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.5e-6) {
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + ((cos(((phi1 + lambda2) - lambda1)) + cos((lambda2 - (phi1 + lambda1)))) / 2.0)));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 7.5d-6) then
tmp = r * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)))
else
tmp = r * acos(((phi1 * sin(phi2)) + ((cos(((phi1 + lambda2) - lambda1)) + cos((lambda2 - (phi1 + lambda1)))) / 2.0d0)))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.5e-6) {
tmp = R * Math.acos(((Math.cos(phi1) * Math.cos((lambda2 - lambda1))) + (Math.sin(phi1) * phi2)));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + ((Math.cos(((phi1 + lambda2) - lambda1)) + Math.cos((lambda2 - (phi1 + lambda1)))) / 2.0)));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 7.5e-6: tmp = R * math.acos(((math.cos(phi1) * math.cos((lambda2 - lambda1))) + (math.sin(phi1) * phi2))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + ((math.cos(((phi1 + lambda2) - lambda1)) + math.cos((lambda2 - (phi1 + lambda1)))) / 2.0))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 7.5e-6) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(Float64(cos(Float64(Float64(phi1 + lambda2) - lambda1)) + cos(Float64(lambda2 - Float64(phi1 + lambda1)))) / 2.0)))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 7.5e-6)
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)));
else
tmp = R * acos(((phi1 * sin(phi2)) + ((cos(((phi1 + lambda2) - lambda1)) + cos((lambda2 - (phi1 + lambda1)))) / 2.0)));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 7.5e-6], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[N[(N[(phi1 + lambda2), $MachinePrecision] - lambda1), $MachinePrecision]], $MachinePrecision] + N[Cos[N[(lambda2 - N[(phi1 + lambda1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 7.5 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right) + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \frac{\cos \left(\left(\phi_1 + \lambda_2\right) - \lambda_1\right) + \cos \left(\lambda_2 - \left(\phi_1 + \lambda_1\right)\right)}{2}\right)\\
\end{array}
\end{array}
if phi2 < 7.50000000000000019e-6Initial program 70.2%
Taylor expanded in phi2 around 0 47.1%
sub-neg47.1%
+-commutative47.1%
neg-mul-147.1%
neg-mul-147.1%
remove-double-neg47.1%
mul-1-neg47.1%
distribute-neg-in47.1%
+-commutative47.1%
cos-neg47.1%
+-commutative47.1%
mul-1-neg47.1%
unsub-neg47.1%
Simplified47.1%
Taylor expanded in phi2 around 0 43.0%
if 7.50000000000000019e-6 < phi2 Initial program 72.3%
Taylor expanded in phi2 around 0 16.4%
sub-neg16.4%
+-commutative16.4%
neg-mul-116.4%
neg-mul-116.4%
remove-double-neg16.4%
mul-1-neg16.4%
distribute-neg-in16.4%
+-commutative16.4%
cos-neg16.4%
+-commutative16.4%
mul-1-neg16.4%
unsub-neg16.4%
Simplified16.4%
Taylor expanded in phi1 around 0 9.1%
cos-mult9.1%
Applied egg-rr9.1%
+-commutative9.1%
associate-+r-9.1%
associate--l-9.1%
+-commutative9.1%
Simplified9.1%
Final simplification34.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi2 7.5e-6)
(* R (acos (+ (* (cos phi1) t_0) (* (sin phi1) phi2))))
(* R (acos (+ (* phi1 (sin phi2)) t_0))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 7.5e-6) {
tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + t_0));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
if (phi2 <= 7.5d-6) then
tmp = r * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)))
else
tmp = r * acos(((phi1 * sin(phi2)) + t_0))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 7.5e-6) {
tmp = R * Math.acos(((Math.cos(phi1) * t_0) + (Math.sin(phi1) * phi2)));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + t_0));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi2 <= 7.5e-6: tmp = R * math.acos(((math.cos(phi1) * t_0) + (math.sin(phi1) * phi2))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + t_0)) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 7.5e-6) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_0) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + t_0))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi2 <= 7.5e-6)
tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
else
tmp = R * acos(((phi1 * sin(phi2)) + t_0));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 7.5e-6], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 7.5 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t_0 + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + t_0\right)\\
\end{array}
\end{array}
if phi2 < 7.50000000000000019e-6Initial program 70.2%
Taylor expanded in phi2 around 0 47.1%
sub-neg47.1%
+-commutative47.1%
neg-mul-147.1%
neg-mul-147.1%
remove-double-neg47.1%
mul-1-neg47.1%
distribute-neg-in47.1%
+-commutative47.1%
cos-neg47.1%
+-commutative47.1%
mul-1-neg47.1%
unsub-neg47.1%
Simplified47.1%
Taylor expanded in phi2 around 0 43.0%
if 7.50000000000000019e-6 < phi2 Initial program 72.3%
Taylor expanded in phi2 around 0 16.4%
sub-neg16.4%
+-commutative16.4%
neg-mul-116.4%
neg-mul-116.4%
remove-double-neg16.4%
mul-1-neg16.4%
distribute-neg-in16.4%
+-commutative16.4%
cos-neg16.4%
+-commutative16.4%
mul-1-neg16.4%
unsub-neg16.4%
Simplified16.4%
Taylor expanded in phi1 around 0 9.1%
Taylor expanded in phi1 around 0 9.1%
Final simplification34.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= phi1 -4.45e-7)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ t_0 (cos (- lambda2 lambda1))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (phi1 <= -4.45e-7) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + cos((lambda2 - lambda1))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (phi1 <= (-4.45d-7)) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((t_0 + cos((lambda2 - lambda1))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (phi1 <= -4.45e-7) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + Math.cos((lambda2 - lambda1))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if phi1 <= -4.45e-7: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + math.cos((lambda2 - lambda1)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (phi1 <= -4.45e-7) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + cos(Float64(lambda2 - lambda1))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (phi1 <= -4.45e-7)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((t_0 + cos((lambda2 - lambda1))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -4.45e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -4.45 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi1 < -4.45e-7Initial program 70.9%
Taylor expanded in phi2 around 0 51.7%
sub-neg51.7%
+-commutative51.7%
neg-mul-151.7%
neg-mul-151.7%
remove-double-neg51.7%
mul-1-neg51.7%
distribute-neg-in51.7%
+-commutative51.7%
cos-neg51.7%
+-commutative51.7%
mul-1-neg51.7%
unsub-neg51.7%
Simplified51.7%
Taylor expanded in phi1 around 0 20.0%
Taylor expanded in lambda2 around 0 17.2%
cos-neg17.2%
Simplified17.2%
if -4.45e-7 < phi1 Initial program 70.6%
Taylor expanded in phi2 around 0 34.9%
sub-neg34.9%
+-commutative34.9%
neg-mul-134.9%
neg-mul-134.9%
remove-double-neg34.9%
mul-1-neg34.9%
distribute-neg-in34.9%
+-commutative34.9%
cos-neg34.9%
+-commutative34.9%
mul-1-neg34.9%
unsub-neg34.9%
Simplified34.9%
Taylor expanded in phi1 around 0 26.0%
Taylor expanded in phi1 around 0 23.4%
Final simplification21.8%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= lambda2 2.7e-60)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi1) (cos lambda2))))))))assert(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.7e-60) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (lambda2 <= 2.7d-60) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (lambda2 <= 2.7e-60) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda2 <= 2.7e-60: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda2 <= 2.7e-60) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda2 <= 2.7e-60)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 2.7e-60], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 2.7 \cdot 10^{-60}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 2.7e-60Initial program 75.5%
Taylor expanded in phi2 around 0 42.2%
sub-neg42.2%
+-commutative42.2%
neg-mul-142.2%
neg-mul-142.2%
remove-double-neg42.2%
mul-1-neg42.2%
distribute-neg-in42.2%
+-commutative42.2%
cos-neg42.2%
+-commutative42.2%
mul-1-neg42.2%
unsub-neg42.2%
Simplified42.2%
Taylor expanded in phi1 around 0 26.9%
Taylor expanded in lambda2 around 0 23.8%
cos-neg23.8%
Simplified23.8%
if 2.7e-60 < lambda2 Initial program 61.1%
Taylor expanded in phi2 around 0 33.5%
sub-neg33.5%
+-commutative33.5%
neg-mul-133.5%
neg-mul-133.5%
remove-double-neg33.5%
mul-1-neg33.5%
distribute-neg-in33.5%
+-commutative33.5%
cos-neg33.5%
+-commutative33.5%
mul-1-neg33.5%
unsub-neg33.5%
Simplified33.5%
Taylor expanded in phi1 around 0 19.6%
Taylor expanded in lambda1 around 0 18.6%
Final simplification22.0%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi1) (cos (- lambda2 lambda1)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))));
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi1) * math.cos((lambda2 - lambda1)))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)
\end{array}
Initial program 70.7%
Taylor expanded in phi2 around 0 39.3%
sub-neg39.3%
+-commutative39.3%
neg-mul-139.3%
neg-mul-139.3%
remove-double-neg39.3%
mul-1-neg39.3%
distribute-neg-in39.3%
+-commutative39.3%
cos-neg39.3%
+-commutative39.3%
mul-1-neg39.3%
unsub-neg39.3%
Simplified39.3%
Taylor expanded in phi1 around 0 24.5%
Final simplification24.5%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= lambda1 -3e-7)
(* R (acos (+ (cos lambda1) t_0)))
(* R (acos (+ (cos lambda2) t_0))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (lambda1 <= -3e-7) {
tmp = R * acos((cos(lambda1) + t_0));
} else {
tmp = R * acos((cos(lambda2) + t_0));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (lambda1 <= (-3d-7)) then
tmp = r * acos((cos(lambda1) + t_0))
else
tmp = r * acos((cos(lambda2) + t_0))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (lambda1 <= -3e-7) {
tmp = R * Math.acos((Math.cos(lambda1) + t_0));
} else {
tmp = R * Math.acos((Math.cos(lambda2) + t_0));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda1 <= -3e-7: tmp = R * math.acos((math.cos(lambda1) + t_0)) else: tmp = R * math.acos((math.cos(lambda2) + t_0)) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda1 <= -3e-7) tmp = Float64(R * acos(Float64(cos(lambda1) + t_0))); else tmp = Float64(R * acos(Float64(cos(lambda2) + t_0))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda1 <= -3e-7)
tmp = R * acos((cos(lambda1) + t_0));
else
tmp = R * acos((cos(lambda2) + t_0));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -3e-7], N[(R * N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[lambda2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -3 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_1 + t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_2 + t_0\right)\\
\end{array}
\end{array}
if lambda1 < -2.9999999999999999e-7Initial program 52.4%
Taylor expanded in phi2 around 0 32.3%
sub-neg32.3%
+-commutative32.3%
neg-mul-132.3%
neg-mul-132.3%
remove-double-neg32.3%
mul-1-neg32.3%
distribute-neg-in32.3%
+-commutative32.3%
cos-neg32.3%
+-commutative32.3%
mul-1-neg32.3%
unsub-neg32.3%
Simplified32.3%
Taylor expanded in phi1 around 0 22.3%
Taylor expanded in phi1 around 0 18.4%
Taylor expanded in lambda2 around 0 18.5%
cos-neg18.5%
Simplified18.5%
if -2.9999999999999999e-7 < lambda1 Initial program 77.5%
Taylor expanded in phi2 around 0 41.9%
sub-neg41.9%
+-commutative41.9%
neg-mul-141.9%
neg-mul-141.9%
remove-double-neg41.9%
mul-1-neg41.9%
distribute-neg-in41.9%
+-commutative41.9%
cos-neg41.9%
+-commutative41.9%
mul-1-neg41.9%
unsub-neg41.9%
Simplified41.9%
Taylor expanded in phi1 around 0 25.2%
Taylor expanded in phi1 around 0 18.6%
Taylor expanded in lambda1 around 0 11.4%
Final simplification13.3%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* phi1 (sin phi2)) (cos (- lambda2 lambda1))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi1 * sin(phi2)) + cos((lambda2 - lambda1))));
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((phi1 * sin(phi2)) + cos((lambda2 - lambda1))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi1 * Math.sin(phi2)) + Math.cos((lambda2 - lambda1))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * math.sin(phi2)) + math.cos((lambda2 - lambda1))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + cos(Float64(lambda2 - lambda1))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi1 * sin(phi2)) + cos((lambda2 - lambda1))));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \left(\lambda_2 - \lambda_1\right)\right)
\end{array}
Initial program 70.7%
Taylor expanded in phi2 around 0 39.3%
sub-neg39.3%
+-commutative39.3%
neg-mul-139.3%
neg-mul-139.3%
remove-double-neg39.3%
mul-1-neg39.3%
distribute-neg-in39.3%
+-commutative39.3%
cos-neg39.3%
+-commutative39.3%
mul-1-neg39.3%
unsub-neg39.3%
Simplified39.3%
Taylor expanded in phi1 around 0 24.5%
Taylor expanded in phi1 around 0 18.5%
Final simplification18.5%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (cos (- lambda2 lambda1)) (* phi1 phi2)))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)));
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos((Math.cos((lambda2 - lambda1)) + (phi1 * phi2)));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos((math.cos((lambda2 - lambda1)) + (phi1 * phi2)))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(cos(Float64(lambda2 - lambda1)) + Float64(phi1 * phi2)))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \left(\lambda_2 - \lambda_1\right) + \phi_1 \cdot \phi_2\right)
\end{array}
Initial program 70.7%
Taylor expanded in phi2 around 0 39.3%
sub-neg39.3%
+-commutative39.3%
neg-mul-139.3%
neg-mul-139.3%
remove-double-neg39.3%
mul-1-neg39.3%
distribute-neg-in39.3%
+-commutative39.3%
cos-neg39.3%
+-commutative39.3%
mul-1-neg39.3%
unsub-neg39.3%
Simplified39.3%
Taylor expanded in phi1 around 0 24.5%
Taylor expanded in phi1 around 0 18.5%
Taylor expanded in phi2 around 0 16.2%
Final simplification16.2%
herbie shell --seed 2023227
(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))