
(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: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(exp
(log
(acos
(fma
(cos phi2)
(* (cos phi1) (* (cos lambda2) (cos lambda1)))
(fma
(sin phi1)
(sin phi2)
(* (cos phi2) (* (sin lambda2) (* (cos phi1) (sin lambda1)))))))))
R))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return exp(log(acos(fma(cos(phi2), (cos(phi1) * (cos(lambda2) * cos(lambda1))), fma(sin(phi1), sin(phi2), (cos(phi2) * (sin(lambda2) * (cos(phi1) * sin(lambda1))))))))) * R;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(exp(log(acos(fma(cos(phi2), Float64(cos(phi1) * Float64(cos(lambda2) * cos(lambda1))), fma(sin(phi1), sin(phi2), Float64(cos(phi2) * Float64(sin(lambda2) * Float64(cos(phi1) * sin(lambda1))))))))) * R) end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[Exp[N[Log[N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Sin[lambda2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
e^{\log \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1\right), \mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \left(\sin \lambda_2 \cdot \left(\cos \phi_1 \cdot \sin \lambda_1\right)\right)\right)\right)\right)} \cdot R
\end{array}
Initial program 74.9%
cos-diff94.9%
distribute-lft-in94.9%
Applied egg-rr94.9%
Taylor expanded in phi1 around inf 94.9%
add-exp-log94.9%
fma-def94.9%
fma-def94.9%
Applied egg-rr94.9%
Final simplification94.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 phi2) (* (cos phi1) (* (cos lambda2) (cos lambda1))))
(+
(* (cos phi2) (* (sin lambda2) (* (cos phi1) (sin lambda1))))
(* (sin phi1) (sin phi2)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((cos(phi2) * (cos(phi1) * (cos(lambda2) * cos(lambda1)))) + ((cos(phi2) * (sin(lambda2) * (cos(phi1) * sin(lambda1)))) + (sin(phi1) * sin(phi2)))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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(phi2) * (cos(phi1) * (cos(lambda2) * cos(lambda1)))) + ((cos(phi2) * (sin(lambda2) * (cos(phi1) * sin(lambda1)))) + (sin(phi1) * sin(phi2)))))
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.cos(phi2) * (Math.cos(phi1) * (Math.cos(lambda2) * Math.cos(lambda1)))) + ((Math.cos(phi2) * (Math.sin(lambda2) * (Math.cos(phi1) * Math.sin(lambda1)))) + (Math.sin(phi1) * Math.sin(phi2)))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.cos(phi2) * (math.cos(phi1) * (math.cos(lambda2) * math.cos(lambda1)))) + ((math.cos(phi2) * (math.sin(lambda2) * (math.cos(phi1) * math.sin(lambda1)))) + (math.sin(phi1) * math.sin(phi2)))))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(cos(phi2) * Float64(cos(phi1) * Float64(cos(lambda2) * cos(lambda1)))) + Float64(Float64(cos(phi2) * Float64(sin(lambda2) * Float64(cos(phi1) * sin(lambda1)))) + Float64(sin(phi1) * sin(phi2)))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((cos(phi2) * (cos(phi1) * (cos(lambda2) * cos(lambda1)))) + ((cos(phi2) * (sin(lambda2) * (cos(phi1) * sin(lambda1)))) + (sin(phi1) * sin(phi2)))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. 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[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[(N[Sin[lambda2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1\right)\right) + \left(\cos \phi_2 \cdot \left(\sin \lambda_2 \cdot \left(\cos \phi_1 \cdot \sin \lambda_1\right)\right) + \sin \phi_1 \cdot \sin \phi_2\right)\right)
\end{array}
Initial program 74.9%
cos-diff94.9%
distribute-lft-in94.9%
Applied egg-rr94.9%
Taylor expanded in phi1 around inf 94.9%
Final simplification94.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 phi2) (cos phi1))
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda2) (sin lambda1))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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(phi2) * cos(phi1)) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))))
end function
assert lambda1 < lambda2;
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(phi2) * Math.cos(phi1)) * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda2) * Math.sin(lambda1))))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi2) * math.cos(phi1)) * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda2) * math.sin(lambda1))))))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi2) * cos(phi1)) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1))))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. 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[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right)\right)
\end{array}
Initial program 74.9%
cos-diff94.9%
+-commutative94.9%
Applied egg-rr94.9%
Final simplification94.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi1 -1.5e-7)
(* R (acos (+ t_1 (* (* (cos phi2) (cos phi1)) t_0))))
(if (<= phi1 5.5e-10)
(*
R
(acos
(+
(* phi1 (sin phi2))
(*
(cos phi2)
(+
(* (cos lambda2) (cos lambda1))
(* (sin lambda2) (sin lambda1)))))))
(* R (acos (fma (cos phi2) (* (cos phi1) t_0) t_1)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi1 <= -1.5e-7) {
tmp = R * acos((t_1 + ((cos(phi2) * cos(phi1)) * t_0)));
} else if (phi1 <= 5.5e-10) {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))));
} else {
tmp = R * acos(fma(cos(phi2), (cos(phi1) * t_0), t_1));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi1 <= -1.5e-7) tmp = Float64(R * acos(Float64(t_1 + Float64(Float64(cos(phi2) * cos(phi1)) * t_0)))); elseif (phi1 <= 5.5e-10) tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1))))))); else tmp = Float64(R * acos(fma(cos(phi2), Float64(cos(phi1) * t_0), t_1))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -1.5e-7], N[(R * N[ArcCos[N[(t$95$1 + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 5.5e-10], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -1.5 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot t_0\right)\\
\mathbf{elif}\;\phi_1 \leq 5.5 \cdot 10^{-10}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1 \cdot t_0, t_1\right)\right)\\
\end{array}
\end{array}
if phi1 < -1.4999999999999999e-7Initial program 89.5%
if -1.4999999999999999e-7 < phi1 < 5.4999999999999996e-10Initial program 70.6%
cos-diff90.5%
distribute-lft-in90.5%
Applied egg-rr90.5%
Taylor expanded in phi1 around inf 90.5%
Taylor expanded in phi1 around 0 90.5%
+-commutative90.5%
associate-+l+90.5%
distribute-lft-in90.5%
fma-def90.5%
Simplified90.5%
Taylor expanded in lambda2 around inf 90.5%
if 5.4999999999999996e-10 < phi1 Initial program 69.2%
associate-*r*69.2%
expm1-log1p-u69.2%
associate-*r*69.1%
*-commutative69.1%
Applied egg-rr69.1%
Taylor expanded in phi1 around 0 69.2%
fma-def69.2%
sub-neg69.2%
remove-double-neg69.2%
distribute-neg-in69.2%
neg-mul-169.2%
fma-def69.2%
*-commutative69.2%
cos-neg69.2%
neg-mul-169.2%
+-commutative69.2%
sub-neg69.2%
associate-*r*69.2%
Simplified69.3%
Final simplification84.8%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi1 -2.9e-16)
(* R (acos (+ t_1 (* (* (cos phi2) (cos phi1)) t_0))))
(if (<= phi1 9.2e-11)
(*
R
(acos
(+
(* (cos phi2) (* (sin lambda2) (sin lambda1)))
(* (cos phi2) (* (cos lambda2) (cos lambda1))))))
(* R (acos (fma (cos phi2) (* (cos phi1) t_0) t_1)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi1 <= -2.9e-16) {
tmp = R * acos((t_1 + ((cos(phi2) * cos(phi1)) * t_0)));
} else if (phi1 <= 9.2e-11) {
tmp = R * acos(((cos(phi2) * (sin(lambda2) * sin(lambda1))) + (cos(phi2) * (cos(lambda2) * cos(lambda1)))));
} else {
tmp = R * acos(fma(cos(phi2), (cos(phi1) * t_0), t_1));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi1 <= -2.9e-16) tmp = Float64(R * acos(Float64(t_1 + Float64(Float64(cos(phi2) * cos(phi1)) * t_0)))); elseif (phi1 <= 9.2e-11) tmp = Float64(R * acos(Float64(Float64(cos(phi2) * Float64(sin(lambda2) * sin(lambda1))) + Float64(cos(phi2) * Float64(cos(lambda2) * cos(lambda1)))))); else tmp = Float64(R * acos(fma(cos(phi2), Float64(cos(phi1) * t_0), t_1))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -2.9e-16], N[(R * N[ArcCos[N[(t$95$1 + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 9.2e-11], N[(R * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -2.9 \cdot 10^{-16}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot t_0\right)\\
\mathbf{elif}\;\phi_1 \leq 9.2 \cdot 10^{-11}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1\right) + \cos \phi_2 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1 \cdot t_0, t_1\right)\right)\\
\end{array}
\end{array}
if phi1 < -2.8999999999999998e-16Initial program 88.8%
if -2.8999999999999998e-16 < phi1 < 9.20000000000000054e-11Initial program 70.5%
cos-diff90.3%
distribute-lft-in90.3%
Applied egg-rr90.3%
Taylor expanded in phi1 around inf 90.3%
Taylor expanded in phi1 around 0 90.3%
if 9.20000000000000054e-11 < phi1 Initial program 69.2%
associate-*r*69.2%
expm1-log1p-u69.2%
associate-*r*69.1%
*-commutative69.1%
Applied egg-rr69.1%
Taylor expanded in phi1 around 0 69.2%
fma-def69.2%
sub-neg69.2%
remove-double-neg69.2%
distribute-neg-in69.2%
neg-mul-169.2%
fma-def69.2%
*-commutative69.2%
cos-neg69.2%
neg-mul-169.2%
+-commutative69.2%
sub-neg69.2%
associate-*r*69.2%
Simplified69.3%
Final simplification84.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi1 -2.9e-16)
(* R (acos (+ t_1 (* (* (cos phi2) (cos phi1)) t_0))))
(if (<= phi1 2.6e-10)
(*
R
(acos
(*
(cos phi2)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))
(* R (acos (fma (cos phi2) (* (cos phi1) t_0) t_1)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi1 <= -2.9e-16) {
tmp = R * acos((t_1 + ((cos(phi2) * cos(phi1)) * t_0)));
} else if (phi1 <= 2.6e-10) {
tmp = R * acos((cos(phi2) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R * acos(fma(cos(phi2), (cos(phi1) * t_0), t_1));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi1 <= -2.9e-16) tmp = Float64(R * acos(Float64(t_1 + Float64(Float64(cos(phi2) * cos(phi1)) * t_0)))); elseif (phi1 <= 2.6e-10) tmp = Float64(R * acos(Float64(cos(phi2) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R * acos(fma(cos(phi2), Float64(cos(phi1) * t_0), t_1))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -2.9e-16], N[(R * N[ArcCos[N[(t$95$1 + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 2.6e-10], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -2.9 \cdot 10^{-16}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot t_0\right)\\
\mathbf{elif}\;\phi_1 \leq 2.6 \cdot 10^{-10}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1 \cdot t_0, t_1\right)\right)\\
\end{array}
\end{array}
if phi1 < -2.8999999999999998e-16Initial program 88.8%
if -2.8999999999999998e-16 < phi1 < 2.59999999999999981e-10Initial program 70.5%
cos-diff90.3%
distribute-lft-in90.3%
Applied egg-rr90.3%
Taylor expanded in phi1 around inf 90.3%
Taylor expanded in phi1 around 0 90.3%
distribute-lft-out90.3%
+-commutative90.3%
fma-def90.3%
Simplified90.3%
if 2.59999999999999981e-10 < phi1 Initial program 69.2%
associate-*r*69.2%
expm1-log1p-u69.2%
associate-*r*69.1%
*-commutative69.1%
Applied egg-rr69.1%
Taylor expanded in phi1 around 0 69.2%
fma-def69.2%
sub-neg69.2%
remove-double-neg69.2%
distribute-neg-in69.2%
neg-mul-169.2%
fma-def69.2%
*-commutative69.2%
cos-neg69.2%
neg-mul-169.2%
+-commutative69.2%
sub-neg69.2%
associate-*r*69.2%
Simplified69.3%
Final simplification84.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -9.5e-16) (not (<= phi2 1.25e-9)))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi2) (cos phi1)) (cos (- lambda1 lambda2))))))
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -9.5e-16) || !(phi2 <= 1.25e-9)) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
} else {
tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -9.5e-16) || !(phi2 <= 1.25e-9)) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2)))))); else tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -9.5e-16], N[Not[LessEqual[phi2, 1.25e-9]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -9.5 \cdot 10^{-16} \lor \neg \left(\phi_2 \leq 1.25 \cdot 10^{-9}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -9.5000000000000005e-16 or 1.25e-9 < phi2 Initial program 80.9%
if -9.5000000000000005e-16 < phi2 < 1.25e-9Initial program 68.5%
cos-diff90.1%
distribute-lft-in90.1%
Applied egg-rr90.1%
Taylor expanded in phi1 around inf 90.1%
Taylor expanded in phi2 around 0 90.0%
associate-*r*90.0%
*-commutative90.0%
associate-*r*89.9%
distribute-lft-out89.9%
fma-def89.9%
Simplified89.9%
Final simplification85.3%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 (<= phi1 -2.9e-16)
(*
R
(acos (+ t_0 (* (* (cos phi2) (cos phi1)) (cos (- lambda1 lambda2))))))
(if (<= phi1 1.5e-10)
(*
R
(acos
(*
(cos phi2)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))
(*
R
(acos
(+
t_0
(+
(+ 1.0 (* (cos phi2) (* (cos phi1) (cos (- lambda2 lambda1)))))
-1.0))))))))assert(lambda1 < 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 (phi1 <= -2.9e-16) {
tmp = R * acos((t_0 + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
} else if (phi1 <= 1.5e-10) {
tmp = R * acos((cos(phi2) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R * acos((t_0 + ((1.0 + (cos(phi2) * (cos(phi1) * cos((lambda2 - lambda1))))) + -1.0)));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi1 <= -2.9e-16) tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2)))))); elseif (phi1 <= 1.5e-10) tmp = Float64(R * acos(Float64(cos(phi2) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(1.0 + Float64(cos(phi2) * Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))) + -1.0)))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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[phi1, -2.9e-16], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.5e-10], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(1.0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -2.9 \cdot 10^{-16}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 1.5 \cdot 10^{-10}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \left(\left(1 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right) + -1\right)\right)\\
\end{array}
\end{array}
if phi1 < -2.8999999999999998e-16Initial program 88.8%
if -2.8999999999999998e-16 < phi1 < 1.5e-10Initial program 70.5%
cos-diff90.3%
distribute-lft-in90.3%
Applied egg-rr90.3%
Taylor expanded in phi1 around inf 90.3%
Taylor expanded in phi1 around 0 90.3%
distribute-lft-out90.3%
+-commutative90.3%
fma-def90.3%
Simplified90.3%
if 1.5e-10 < phi1 Initial program 69.2%
associate-*r*69.2%
expm1-log1p-u69.2%
associate-*r*69.1%
*-commutative69.1%
Applied egg-rr69.1%
expm1-udef69.0%
log1p-expm1-u69.0%
log1p-udef69.0%
add-exp-log69.0%
expm1-log1p-u69.0%
associate-*r*69.0%
*-commutative69.0%
*-commutative69.0%
cos-diff98.8%
*-commutative98.8%
*-commutative98.8%
cos-diff69.0%
Applied egg-rr69.0%
Final simplification84.4%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 -0.0115)
(* R (acos (+ t_0 (* (cos phi2) (cos (- lambda2 lambda1))))))
(* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda2)))))))))assert(lambda1 < 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 <= -0.0115) {
tmp = R * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 <= (-0.0115d0)) then
tmp = r * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))))
else
tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
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 <= -0.0115) {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos((lambda2 - lambda1)))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda2)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda1 <= -0.0115: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos((lambda2 - lambda1))))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * (math.cos(phi1) * math.cos(lambda2))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda1 <= -0.0115) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * Float64(cos(phi1) * cos(lambda2)))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
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 <= -0.0115)
tmp = R * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))));
else
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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, -0.0115], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -0.0115:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_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 < -0.0115Initial program 58.7%
Taylor expanded in phi1 around 0 41.0%
sub-neg41.0%
+-commutative41.0%
neg-mul-141.0%
neg-mul-141.0%
remove-double-neg41.0%
mul-1-neg41.0%
distribute-neg-in41.0%
+-commutative41.0%
cos-neg41.0%
+-commutative41.0%
mul-1-neg41.0%
unsub-neg41.0%
Simplified41.0%
if -0.0115 < lambda1 Initial program 81.5%
Taylor expanded in lambda1 around 0 70.1%
*-commutative70.1%
cos-neg70.1%
Simplified70.1%
Final simplification61.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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.55e-6)
(* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda1))))))
(* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda2)))))))))assert(lambda1 < 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.55e-6) {
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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.55d-6)) then
tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))))
else
tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
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.55e-6) {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda1)))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda2)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [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.55e-6: tmp = R * math.acos((t_0 + (math.cos(phi2) * (math.cos(phi1) * math.cos(lambda1))))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * (math.cos(phi1) * math.cos(lambda2))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) 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.55e-6) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * 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
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
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.55e-6)
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
else
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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.55e-6], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -1.55 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \lambda_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 < -1.55e-6Initial program 59.2%
Taylor expanded in lambda2 around 0 58.3%
if -1.55e-6 < lambda1 Initial program 81.4%
Taylor expanded in lambda1 around 0 70.2%
*-commutative70.2%
cos-neg70.2%
Simplified70.2%
Final simplification66.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 phi2) (cos phi1)) (cos (- lambda1 lambda2)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))))
end function
assert lambda1 < lambda2;
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(phi2) * Math.cos(phi1)) * Math.cos((lambda1 - lambda2)))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi2) * math.cos(phi1)) * math.cos((lambda1 - lambda2)))))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2)))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. 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[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)
\end{array}
Initial program 74.9%
Final simplification74.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 0.053)
(*
R
(acos
(+ (* (sin phi1) (sin phi2)) (* (cos phi1) (cos (- lambda2 lambda1))))))
(* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos lambda1)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.053) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda1))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 <= 0.053d0) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))))
else
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda1))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.053) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos(lambda1))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.053: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos(lambda1)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.053) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(lambda1))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 0.053)
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))));
else
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.053], 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], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.053:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi2 < 0.0529999999999999985Initial program 72.2%
Taylor expanded in phi2 around 0 52.5%
sub-neg52.5%
+-commutative52.5%
neg-mul-152.5%
neg-mul-152.5%
remove-double-neg52.5%
mul-1-neg52.5%
distribute-neg-in52.5%
+-commutative52.5%
cos-neg52.5%
+-commutative52.5%
mul-1-neg52.5%
unsub-neg52.5%
Simplified52.5%
if 0.0529999999999999985 < phi2 Initial program 82.7%
cos-diff99.3%
distribute-lft-in99.3%
Applied egg-rr99.3%
Taylor expanded in phi1 around inf 99.3%
Taylor expanded in phi1 around 0 47.1%
+-commutative47.1%
associate-+l+47.1%
distribute-lft-in47.2%
fma-def47.2%
Simplified47.2%
Taylor expanded in lambda2 around 0 32.7%
Final simplification47.4%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 0.000166)
(* R (acos (+ t_1 (* (cos phi1) t_0))))
(* R (acos (+ t_1 (* (cos phi2) t_0)))))))assert(lambda1 < lambda2);
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 <= 0.000166) {
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
} else {
tmp = R * acos((t_1 + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 <= 0.000166d0) 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 lambda1 < lambda2;
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 <= 0.000166) {
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;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [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 <= 0.000166: 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
lambda1, lambda2 = sort([lambda1, lambda2]) 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 <= 0.000166) 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
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
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 <= 0.000166)
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: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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, 0.000166], 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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[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 0.000166:\\
\;\;\;\;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 < 1.65999999999999996e-4Initial program 72.2%
Taylor expanded in phi2 around 0 52.5%
sub-neg52.5%
+-commutative52.5%
neg-mul-152.5%
neg-mul-152.5%
remove-double-neg52.5%
mul-1-neg52.5%
distribute-neg-in52.5%
+-commutative52.5%
cos-neg52.5%
+-commutative52.5%
mul-1-neg52.5%
unsub-neg52.5%
Simplified52.5%
if 1.65999999999999996e-4 < phi2 Initial program 82.7%
Taylor expanded in phi1 around 0 51.0%
sub-neg51.0%
+-commutative51.0%
neg-mul-151.0%
neg-mul-151.0%
remove-double-neg51.0%
mul-1-neg51.0%
distribute-neg-in51.0%
+-commutative51.0%
cos-neg51.0%
+-commutative51.0%
mul-1-neg51.0%
unsub-neg51.0%
Simplified51.0%
Final simplification52.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 -0.76)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(if (<= phi1 -1.2e-164)
(*
R
(acos
(+ t_0 (* (cos (- lambda1 lambda2)) (+ 1.0 (* -0.5 (* phi1 phi1)))))))
(* R (acos (+ t_0 (* (cos phi2) (cos lambda1)))))))))assert(lambda1 < 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 (phi1 <= -0.76) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else if (phi1 <= -1.2e-164) {
tmp = R * acos((t_0 + (cos((lambda1 - lambda2)) * (1.0 + (-0.5 * (phi1 * phi1))))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 <= (-0.76d0)) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else if (phi1 <= (-1.2d-164)) then
tmp = r * acos((t_0 + (cos((lambda1 - lambda2)) * (1.0d0 + ((-0.5d0) * (phi1 * phi1))))))
else
tmp = r * acos((t_0 + (cos(phi2) * cos(lambda1))))
end if
code = tmp
end function
assert lambda1 < lambda2;
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 <= -0.76) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else if (phi1 <= -1.2e-164) {
tmp = R * Math.acos((t_0 + (Math.cos((lambda1 - lambda2)) * (1.0 + (-0.5 * (phi1 * phi1))))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda1))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if phi1 <= -0.76: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) elif phi1 <= -1.2e-164: tmp = R * math.acos((t_0 + (math.cos((lambda1 - lambda2)) * (1.0 + (-0.5 * (phi1 * phi1)))))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda1)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (phi1 <= -0.76) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); elseif (phi1 <= -1.2e-164) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(Float64(lambda1 - lambda2)) * Float64(1.0 + Float64(-0.5 * Float64(phi1 * phi1))))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda1))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
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 <= -0.76)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
elseif (phi1 <= -1.2e-164)
tmp = R * acos((t_0 + (cos((lambda1 - lambda2)) * (1.0 + (-0.5 * (phi1 * phi1))))));
else
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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, -0.76], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -1.2e-164], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.76:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{elif}\;\phi_1 \leq -1.2 \cdot 10^{-164}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \left(\lambda_1 - \lambda_2\right) \cdot \left(1 + -0.5 \cdot \left(\phi_1 \cdot \phi_1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -0.76000000000000001Initial program 89.2%
Taylor expanded in phi2 around 0 55.6%
sub-neg55.6%
+-commutative55.6%
neg-mul-155.6%
neg-mul-155.6%
remove-double-neg55.6%
mul-1-neg55.6%
distribute-neg-in55.6%
+-commutative55.6%
cos-neg55.6%
+-commutative55.6%
mul-1-neg55.6%
unsub-neg55.6%
Simplified55.6%
Taylor expanded in phi1 around 0 24.7%
Taylor expanded in lambda2 around 0 20.1%
cos-neg20.1%
Simplified20.1%
if -0.76000000000000001 < phi1 < -1.19999999999999992e-164Initial program 69.1%
Taylor expanded in phi2 around 0 45.6%
sub-neg45.6%
+-commutative45.6%
neg-mul-145.6%
neg-mul-145.6%
remove-double-neg45.6%
mul-1-neg45.6%
distribute-neg-in45.6%
+-commutative45.6%
cos-neg45.6%
+-commutative45.6%
mul-1-neg45.6%
unsub-neg45.6%
Simplified45.6%
Taylor expanded in phi1 around 0 45.6%
Taylor expanded in phi1 around 0 45.6%
+-commutative45.6%
*-lft-identity45.6%
associate-*r*45.6%
distribute-rgt-out45.6%
sub-neg45.6%
+-commutative45.6%
neg-mul-145.6%
cos-neg45.6%
neg-mul-145.6%
distribute-neg-in45.6%
unsub-neg45.6%
remove-double-neg45.6%
unpow245.6%
Simplified45.6%
if -1.19999999999999992e-164 < phi1 Initial program 70.7%
cos-diff94.7%
distribute-lft-in94.7%
Applied egg-rr94.7%
Taylor expanded in phi1 around inf 94.7%
Taylor expanded in phi1 around 0 57.5%
+-commutative57.5%
associate-+l+57.5%
distribute-lft-in57.5%
fma-def57.5%
Simplified57.5%
Taylor expanded in lambda2 around 0 32.7%
Final simplification31.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 (<= phi2 2.25e-41)
(* R (acos (+ t_0 (* (cos phi1) (cos (- lambda2 lambda1))))))
(* R (acos (+ t_0 (* (cos phi2) (cos lambda1))))))))assert(lambda1 < 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 (phi2 <= 2.25e-41) {
tmp = R * acos((t_0 + (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 (phi2 <= 2.25d-41) then
tmp = r * acos((t_0 + (cos(phi1) * cos((lambda2 - lambda1)))))
else
tmp = r * acos((t_0 + (cos(phi2) * cos(lambda1))))
end if
code = tmp
end function
assert lambda1 < lambda2;
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 (phi2 <= 2.25e-41) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda1))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if phi2 <= 2.25e-41: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda1)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (phi2 <= 2.25e-41) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda1))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (phi2 <= 2.25e-41)
tmp = R * acos((t_0 + (cos(phi1) * cos((lambda2 - lambda1)))));
else
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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[phi2, 2.25e-41], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq 2.25 \cdot 10^{-41}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi2 < 2.25e-41Initial program 72.8%
Taylor expanded in phi2 around 0 52.1%
sub-neg52.1%
+-commutative52.1%
neg-mul-152.1%
neg-mul-152.1%
remove-double-neg52.1%
mul-1-neg52.1%
distribute-neg-in52.1%
+-commutative52.1%
cos-neg52.1%
+-commutative52.1%
mul-1-neg52.1%
unsub-neg52.1%
Simplified52.1%
Taylor expanded in phi1 around 0 38.5%
if 2.25e-41 < phi2 Initial program 80.0%
cos-diff98.1%
distribute-lft-in98.1%
Applied egg-rr98.1%
Taylor expanded in phi1 around inf 98.1%
Taylor expanded in phi1 around 0 46.9%
+-commutative46.9%
associate-+l+46.9%
distribute-lft-in46.9%
fma-def46.9%
Simplified46.9%
Taylor expanded in lambda2 around 0 30.9%
Final simplification36.3%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 0.061)
(*
R
(acos (+ (* (cos phi1) (cos (- lambda2 lambda1))) (* phi2 (sin phi1)))))
(* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos lambda1)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.061) {
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (phi2 * sin(phi1))));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda1))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 <= 0.061d0) then
tmp = r * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (phi2 * sin(phi1))))
else
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda1))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.061) {
tmp = R * Math.acos(((Math.cos(phi1) * Math.cos((lambda2 - lambda1))) + (phi2 * Math.sin(phi1))));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos(lambda1))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.061: tmp = R * math.acos(((math.cos(phi1) * math.cos((lambda2 - lambda1))) + (phi2 * math.sin(phi1)))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos(lambda1)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.061) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))) + Float64(phi2 * sin(phi1))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(lambda1))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 0.061)
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (phi2 * sin(phi1))));
else
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.061], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.061:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right) + \phi_2 \cdot \sin \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi2 < 0.060999999999999999Initial program 72.2%
Taylor expanded in phi2 around 0 52.5%
sub-neg52.5%
+-commutative52.5%
neg-mul-152.5%
neg-mul-152.5%
remove-double-neg52.5%
mul-1-neg52.5%
distribute-neg-in52.5%
+-commutative52.5%
cos-neg52.5%
+-commutative52.5%
mul-1-neg52.5%
unsub-neg52.5%
Simplified52.5%
Taylor expanded in phi2 around 0 47.4%
if 0.060999999999999999 < phi2 Initial program 82.7%
cos-diff99.3%
distribute-lft-in99.3%
Applied egg-rr99.3%
Taylor expanded in phi1 around inf 99.3%
Taylor expanded in phi1 around 0 47.1%
+-commutative47.1%
associate-+l+47.1%
distribute-lft-in47.2%
fma-def47.2%
Simplified47.2%
Taylor expanded in lambda2 around 0 32.7%
Final simplification43.6%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 -0.76)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(*
R
(acos
(+
t_0
(* (cos (- lambda1 lambda2)) (+ 1.0 (* -0.5 (* phi1 phi1))))))))))assert(lambda1 < 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 (phi1 <= -0.76) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos((lambda1 - lambda2)) * (1.0 + (-0.5 * (phi1 * phi1))))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 <= (-0.76d0)) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos((lambda1 - lambda2)) * (1.0d0 + ((-0.5d0) * (phi1 * phi1))))))
end if
code = tmp
end function
assert lambda1 < lambda2;
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 <= -0.76) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos((lambda1 - lambda2)) * (1.0 + (-0.5 * (phi1 * phi1))))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if phi1 <= -0.76: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos((lambda1 - lambda2)) * (1.0 + (-0.5 * (phi1 * phi1)))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (phi1 <= -0.76) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(Float64(lambda1 - lambda2)) * Float64(1.0 + Float64(-0.5 * Float64(phi1 * phi1))))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
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 <= -0.76)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos((lambda1 - lambda2)) * (1.0 + (-0.5 * (phi1 * phi1))))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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, -0.76], 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[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.76:\\
\;\;\;\;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_1 - \lambda_2\right) \cdot \left(1 + -0.5 \cdot \left(\phi_1 \cdot \phi_1\right)\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.76000000000000001Initial program 89.2%
Taylor expanded in phi2 around 0 55.6%
sub-neg55.6%
+-commutative55.6%
neg-mul-155.6%
neg-mul-155.6%
remove-double-neg55.6%
mul-1-neg55.6%
distribute-neg-in55.6%
+-commutative55.6%
cos-neg55.6%
+-commutative55.6%
mul-1-neg55.6%
unsub-neg55.6%
Simplified55.6%
Taylor expanded in phi1 around 0 24.7%
Taylor expanded in lambda2 around 0 20.1%
cos-neg20.1%
Simplified20.1%
if -0.76000000000000001 < phi1 Initial program 70.4%
Taylor expanded in phi2 around 0 39.0%
sub-neg39.0%
+-commutative39.0%
neg-mul-139.0%
neg-mul-139.0%
remove-double-neg39.0%
mul-1-neg39.0%
distribute-neg-in39.0%
+-commutative39.0%
cos-neg39.0%
+-commutative39.0%
mul-1-neg39.0%
unsub-neg39.0%
Simplified39.0%
Taylor expanded in phi1 around 0 31.9%
Taylor expanded in phi1 around 0 27.2%
+-commutative27.2%
*-lft-identity27.2%
associate-*r*27.2%
distribute-rgt-out27.2%
sub-neg27.2%
+-commutative27.2%
neg-mul-127.2%
cos-neg27.2%
neg-mul-127.2%
distribute-neg-in27.2%
unsub-neg27.2%
remove-double-neg27.2%
unpow227.2%
Simplified27.2%
Final simplification25.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 -0.003)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi1) (cos lambda2))))))))assert(lambda1 < 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 (lambda1 <= -0.003) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 <= (-0.003d0)) 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 lambda1 < lambda2;
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 <= -0.003) {
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;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda1 <= -0.003: 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
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda1 <= -0.003) 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
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
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 <= -0.003)
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: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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, -0.003], 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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -0.003:\\
\;\;\;\;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 lambda1 < -0.0030000000000000001Initial program 58.7%
Taylor expanded in phi2 around 0 42.1%
sub-neg42.1%
+-commutative42.1%
neg-mul-142.1%
neg-mul-142.1%
remove-double-neg42.1%
mul-1-neg42.1%
distribute-neg-in42.1%
+-commutative42.1%
cos-neg42.1%
+-commutative42.1%
mul-1-neg42.1%
unsub-neg42.1%
Simplified42.1%
Taylor expanded in phi1 around 0 32.5%
Taylor expanded in lambda2 around 0 31.7%
cos-neg31.7%
Simplified31.7%
if -0.0030000000000000001 < lambda1 Initial program 81.5%
Taylor expanded in phi2 around 0 43.3%
sub-neg43.3%
+-commutative43.3%
neg-mul-143.3%
neg-mul-143.3%
remove-double-neg43.3%
mul-1-neg43.3%
distribute-neg-in43.3%
+-commutative43.3%
cos-neg43.3%
+-commutative43.3%
mul-1-neg43.3%
unsub-neg43.3%
Simplified43.3%
Taylor expanded in phi1 around 0 29.2%
Taylor expanded in lambda1 around 0 23.6%
Final simplification25.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 -0.003)
(* R (acos (+ t_0 (* (cos phi2) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi2) (cos lambda2))))))))assert(lambda1 < 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 (lambda1 <= -0.003) {
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 <= (-0.003d0)) then
tmp = r * acos((t_0 + (cos(phi2) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos(phi2) * cos(lambda2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
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 <= -0.003) {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda1 <= -0.003: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda1 <= -0.003) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
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 <= -0.003)
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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, -0.003], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -0.003:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda1 < -0.0030000000000000001Initial program 58.7%
cos-diff98.9%
distribute-lft-in98.9%
Applied egg-rr98.9%
Taylor expanded in phi1 around inf 98.9%
Taylor expanded in phi1 around 0 52.7%
+-commutative52.7%
associate-+l+52.7%
distribute-lft-in52.7%
fma-def52.7%
Simplified52.7%
Taylor expanded in lambda2 around 0 33.7%
if -0.0030000000000000001 < lambda1 Initial program 81.5%
cos-diff93.3%
distribute-lft-in93.3%
Applied egg-rr93.3%
Taylor expanded in phi1 around inf 93.3%
Taylor expanded in phi1 around 0 45.5%
+-commutative45.5%
associate-+l+45.5%
distribute-lft-in45.5%
fma-def45.5%
Simplified45.5%
Taylor expanded in lambda1 around 0 32.1%
Final simplification32.6%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. 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(lambda1 < lambda2);
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: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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 lambda1 < lambda2;
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))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * math.sin(phi2)) + math.cos((lambda2 - lambda1))))
lambda1, lambda2 = sort([lambda1, lambda2]) 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
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
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: lambda1 and lambda2 should be sorted in increasing order before calling this function. 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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[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 74.9%
Taylor expanded in phi2 around 0 43.0%
sub-neg43.0%
+-commutative43.0%
neg-mul-143.0%
neg-mul-143.0%
remove-double-neg43.0%
mul-1-neg43.0%
distribute-neg-in43.0%
+-commutative43.0%
cos-neg43.0%
+-commutative43.0%
mul-1-neg43.0%
unsub-neg43.0%
Simplified43.0%
Taylor expanded in phi1 around 0 30.2%
Taylor expanded in phi1 around 0 22.5%
Final simplification22.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. 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)) (* phi2 phi1)))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos((cos((lambda2 - lambda1)) + (phi2 * phi1)));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
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)) + (phi2 * phi1)))
end function
assert lambda1 < lambda2;
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)) + (phi2 * phi1)));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos((math.cos((lambda2 - lambda1)) + (phi2 * phi1)))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(cos(Float64(lambda2 - lambda1)) + Float64(phi2 * phi1)))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos((cos((lambda2 - lambda1)) + (phi2 * phi1)));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. 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[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \left(\lambda_2 - \lambda_1\right) + \phi_2 \cdot \phi_1\right)
\end{array}
Initial program 74.9%
Taylor expanded in phi2 around 0 43.0%
sub-neg43.0%
+-commutative43.0%
neg-mul-143.0%
neg-mul-143.0%
remove-double-neg43.0%
mul-1-neg43.0%
distribute-neg-in43.0%
+-commutative43.0%
cos-neg43.0%
+-commutative43.0%
mul-1-neg43.0%
unsub-neg43.0%
Simplified43.0%
Taylor expanded in phi1 around 0 30.2%
Taylor expanded in phi1 around 0 22.5%
Taylor expanded in phi2 around 0 20.8%
*-commutative20.8%
Simplified20.8%
Final simplification20.8%
herbie shell --seed 2023174
(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))