
(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 28 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(fma
(sin phi1)
(sin phi2)
(*
(cos phi1)
(*
(cos phi2)
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2)))))))
R))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))))) * R;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))))))) * R) end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\right)\right) \cdot R
\end{array}
Initial program 75.9%
fma-def75.9%
associate-*l*75.9%
Simplified75.9%
cos-diff94.6%
+-commutative94.6%
Applied egg-rr94.6%
Final simplification94.6%
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)
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin 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) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2)))))));
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))))))) end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\right)
\end{array}
Initial program 75.9%
cos-diff94.6%
distribute-lft-in94.6%
Applied egg-rr94.6%
distribute-lft-out94.6%
*-commutative94.6%
associate-*l*94.6%
cos-neg94.6%
*-commutative94.6%
fma-def94.6%
cos-neg94.6%
Simplified94.6%
Final simplification94.6%
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 -0.0065) (not (<= phi2 5.1e-8)))
(*
R
(log
(exp
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))))
(*
R
(acos
(+
(*
(cos phi2)
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2)))))
(* (sin phi1) phi2))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -0.0065) || !(phi2 <= 5.1e-8)) {
tmp = R * log(exp(acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))))));
} else {
tmp = R * acos(((cos(phi2) * (cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))))) + (sin(phi1) * phi2)));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -0.0065) || !(phi2 <= 5.1e-8)) tmp = Float64(R * log(exp(acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))))); else tmp = Float64(R * acos(Float64(Float64(cos(phi2) * Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))))) + Float64(sin(phi1) * phi2)))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -0.0065], N[Not[LessEqual[phi2, 5.1e-8]], $MachinePrecision]], N[(R * N[Log[N[Exp[N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -0.0065 \lor \neg \left(\phi_2 \leq 5.1 \cdot 10^{-8}\right):\\
\;\;\;\;R \cdot \log \left(e^{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right) + \sin \phi_1 \cdot \phi_2\right)\\
\end{array}
\end{array}
if phi2 < -0.0064999999999999997 or 5.10000000000000001e-8 < phi2 Initial program 80.5%
fma-def80.6%
associate-*l*80.6%
Simplified80.6%
cos-diff99.3%
+-commutative99.3%
Applied egg-rr99.3%
fma-udef99.3%
associate-*r*99.2%
+-commutative99.2%
cos-diff80.5%
*-commutative80.5%
log1p-expm1-u80.5%
log1p-def80.5%
+-commutative80.5%
log1p-def80.5%
log1p-expm1-u80.5%
fma-udef80.5%
Applied egg-rr80.6%
if -0.0064999999999999997 < phi2 < 5.10000000000000001e-8Initial program 71.1%
cos-diff89.8%
distribute-lft-in89.8%
Applied egg-rr89.8%
distribute-lft-out89.8%
*-commutative89.8%
associate-*l*89.8%
cos-neg89.8%
*-commutative89.8%
fma-def89.8%
cos-neg89.8%
Simplified89.8%
Taylor expanded in phi2 around 0 89.6%
Final simplification85.0%
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 -0.000155) (not (<= phi2 4.2e-8)))
(*
R
(log
(exp
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(cos phi1)
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -0.000155) || !(phi2 <= 4.2e-8)) {
tmp = R * log(exp(acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))))));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -0.000155) || !(phi2 <= 4.2e-8)) tmp = Float64(R * log(exp(acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -0.000155], N[Not[LessEqual[phi2, 4.2e-8]], $MachinePrecision]], N[(R * N[Log[N[Exp[N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -0.000155 \lor \neg \left(\phi_2 \leq 4.2 \cdot 10^{-8}\right):\\
\;\;\;\;R \cdot \log \left(e^{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.55e-4 or 4.19999999999999989e-8 < phi2 Initial program 80.7%
fma-def80.7%
associate-*l*80.7%
Simplified80.7%
cos-diff99.3%
+-commutative99.3%
Applied egg-rr99.3%
fma-udef99.2%
associate-*r*99.2%
+-commutative99.2%
cos-diff80.7%
*-commutative80.7%
log1p-expm1-u80.6%
log1p-def80.6%
+-commutative80.6%
log1p-def80.6%
log1p-expm1-u80.7%
fma-udef80.7%
Applied egg-rr80.7%
if -1.55e-4 < phi2 < 4.19999999999999989e-8Initial program 70.9%
Taylor expanded in phi2 around 0 70.6%
sub-neg70.6%
+-commutative70.6%
neg-mul-170.6%
neg-mul-170.6%
remove-double-neg70.6%
mul-1-neg70.6%
distribute-neg-in70.6%
+-commutative70.6%
cos-neg70.6%
+-commutative70.6%
mul-1-neg70.6%
unsub-neg70.6%
Simplified70.6%
cos-diff89.5%
*-commutative89.5%
*-commutative89.5%
+-commutative89.5%
fma-def89.5%
Applied egg-rr89.5%
Final simplification85.0%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(cos phi2)
(*
(cos phi1)
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos 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) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))))));
}
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) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi2) * (Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda1) * Math.cos(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.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda1) * math.cos(lambda2)))))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2)))))))) end
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) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))))));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\right)
\end{array}
Initial program 75.9%
cos-diff94.6%
distribute-lft-in94.6%
Applied egg-rr94.6%
distribute-lft-out94.6%
*-commutative94.6%
associate-*l*94.6%
cos-neg94.6%
*-commutative94.6%
fma-def94.6%
cos-neg94.6%
Simplified94.6%
Taylor expanded in lambda2 around inf 94.6%
Final simplification94.6%
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 -0.000155) (not (<= phi2 5.1e-8)))
(*
R
(log
(exp
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(cos phi1)
(+
(* (sin lambda1) (sin lambda2))
(* (cos lambda1) (cos lambda2)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -0.000155) || !(phi2 <= 5.1e-8)) {
tmp = R * log(exp(acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))))));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -0.000155) || !(phi2 <= 5.1e-8)) tmp = Float64(R * log(exp(acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -0.000155], N[Not[LessEqual[phi2, 5.1e-8]], $MachinePrecision]], N[(R * N[Log[N[Exp[N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -0.000155 \lor \neg \left(\phi_2 \leq 5.1 \cdot 10^{-8}\right):\\
\;\;\;\;R \cdot \log \left(e^{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.55e-4 or 5.10000000000000001e-8 < phi2 Initial program 80.7%
fma-def80.7%
associate-*l*80.7%
Simplified80.7%
cos-diff99.3%
+-commutative99.3%
Applied egg-rr99.3%
fma-udef99.2%
associate-*r*99.2%
+-commutative99.2%
cos-diff80.7%
*-commutative80.7%
log1p-expm1-u80.6%
log1p-def80.6%
+-commutative80.6%
log1p-def80.6%
log1p-expm1-u80.7%
fma-udef80.7%
Applied egg-rr80.7%
if -1.55e-4 < phi2 < 5.10000000000000001e-8Initial program 70.9%
Taylor expanded in phi2 around 0 70.6%
sub-neg70.6%
+-commutative70.6%
neg-mul-170.6%
neg-mul-170.6%
remove-double-neg70.6%
mul-1-neg70.6%
distribute-neg-in70.6%
+-commutative70.6%
cos-neg70.6%
+-commutative70.6%
mul-1-neg70.6%
unsub-neg70.6%
Simplified70.6%
cos-diff66.0%
*-commutative66.0%
*-commutative66.0%
+-commutative66.0%
Applied egg-rr89.5%
Final simplification85.0%
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 -0.000155) (not (<= phi2 5.1e-8)))
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(cos phi1)
(+
(* (sin lambda1) (sin lambda2))
(* (cos lambda1) (cos lambda2)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -0.000155) || !(phi2 <= 5.1e-8)) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -0.000155) || !(phi2 <= 5.1e-8)) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -0.000155], N[Not[LessEqual[phi2, 5.1e-8]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -0.000155 \lor \neg \left(\phi_2 \leq 5.1 \cdot 10^{-8}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.55e-4 or 5.10000000000000001e-8 < phi2 Initial program 80.7%
fma-def80.7%
associate-*l*80.7%
Simplified80.7%
if -1.55e-4 < phi2 < 5.10000000000000001e-8Initial program 70.9%
Taylor expanded in phi2 around 0 70.6%
sub-neg70.6%
+-commutative70.6%
neg-mul-170.6%
neg-mul-170.6%
remove-double-neg70.6%
mul-1-neg70.6%
distribute-neg-in70.6%
+-commutative70.6%
cos-neg70.6%
+-commutative70.6%
mul-1-neg70.6%
unsub-neg70.6%
Simplified70.6%
cos-diff66.0%
*-commutative66.0%
*-commutative66.0%
+-commutative66.0%
Applied egg-rr89.5%
Final simplification85.0%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -2.95e+14)
(*
R
(acos
(+
(*
(cos phi1)
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2))))
(* phi1 (sin phi2)))))
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.95e+14) {
tmp = R * acos(((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))) + (phi1 * sin(phi2))));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -2.95e+14) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2)))) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -2.95e+14], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -2.95 \cdot 10^{+14}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\
\end{array}
\end{array}
if lambda2 < -2.95e14Initial program 60.2%
Taylor expanded in phi2 around 0 40.4%
sub-neg40.4%
+-commutative40.4%
neg-mul-140.4%
neg-mul-140.4%
remove-double-neg40.4%
mul-1-neg40.4%
distribute-neg-in40.4%
+-commutative40.4%
cos-neg40.4%
+-commutative40.4%
mul-1-neg40.4%
unsub-neg40.4%
Simplified40.4%
Taylor expanded in phi1 around 0 26.9%
cos-diff42.1%
*-commutative42.1%
*-commutative42.1%
+-commutative42.1%
Applied egg-rr45.2%
if -2.95e14 < lambda2 Initial program 80.6%
fma-def80.6%
associate-*l*80.6%
Simplified80.6%
Final simplification72.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -3.7e+14)
(*
R
(acos
(+
(*
(cos phi1)
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2))))
(* phi1 phi2))))
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -3.7e+14) {
tmp = R * acos(((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))) + (phi1 * phi2)));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -3.7e+14) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2)))) + Float64(phi1 * phi2)))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -3.7e+14], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -3.7 \cdot 10^{+14}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right) + \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\
\end{array}
\end{array}
if lambda2 < -3.7e14Initial program 60.2%
Taylor expanded in phi2 around 0 40.4%
sub-neg40.4%
+-commutative40.4%
neg-mul-140.4%
neg-mul-140.4%
remove-double-neg40.4%
mul-1-neg40.4%
distribute-neg-in40.4%
+-commutative40.4%
cos-neg40.4%
+-commutative40.4%
mul-1-neg40.4%
unsub-neg40.4%
Simplified40.4%
Taylor expanded in phi1 around 0 26.9%
Taylor expanded in phi2 around 0 23.8%
cos-diff42.1%
*-commutative42.1%
*-commutative42.1%
+-commutative42.1%
Applied egg-rr42.1%
if -3.7e14 < lambda2 Initial program 80.6%
fma-def80.6%
associate-*l*80.6%
Simplified80.6%
Final simplification71.7%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -3950.0)
(*
R
(acos
(+
(*
(cos phi1)
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2))))
(* phi1 phi2))))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (cos (- lambda1 lambda2)) (* (cos phi1) (cos phi2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -3950.0) {
tmp = R * acos(((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))) + (phi1 * phi2)));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos((lambda1 - lambda2)) * (cos(phi1) * cos(phi2)))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= (-3950.0d0)) then
tmp = r * acos(((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))) + (phi1 * phi2)))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos((lambda1 - lambda2)) * (cos(phi1) * cos(phi2)))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -3950.0) {
tmp = R * Math.acos(((Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda1) * Math.cos(lambda2)))) + (phi1 * phi2)));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos((lambda1 - lambda2)) * (Math.cos(phi1) * Math.cos(phi2)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -3950.0: tmp = R * math.acos(((math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda1) * math.cos(lambda2)))) + (phi1 * phi2))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos((lambda1 - lambda2)) * (math.cos(phi1) * math.cos(phi2))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -3950.0) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2)))) + Float64(phi1 * phi2)))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(Float64(lambda1 - lambda2)) * Float64(cos(phi1) * cos(phi2)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= -3950.0)
tmp = R * acos(((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))) + (phi1 * phi2)));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos((lambda1 - lambda2)) * (cos(phi1) * cos(phi2)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -3950.0], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -3950:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right) + \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right)\right)\\
\end{array}
\end{array}
if lambda2 < -3950Initial program 59.6%
Taylor expanded in phi2 around 0 40.1%
sub-neg40.1%
+-commutative40.1%
neg-mul-140.1%
neg-mul-140.1%
remove-double-neg40.1%
mul-1-neg40.1%
distribute-neg-in40.1%
+-commutative40.1%
cos-neg40.1%
+-commutative40.1%
mul-1-neg40.1%
unsub-neg40.1%
Simplified40.1%
Taylor expanded in phi1 around 0 26.8%
Taylor expanded in phi2 around 0 23.7%
cos-diff43.1%
*-commutative43.1%
*-commutative43.1%
+-commutative43.1%
Applied egg-rr43.1%
if -3950 < lambda2 Initial program 80.9%
Final simplification72.0%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 1.2e-8)
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (cos phi2) (* (cos phi1) (cos lambda1))))))
(*
R
(acos
(+
(/ (- (cos (- phi1 phi2)) (cos (+ phi1 phi2))) 2.0)
(* (cos phi1) (cos (- lambda2 lambda1))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.2e-8) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
} else {
tmp = R * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0) + (cos(phi1) * cos((lambda2 - lambda1)))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 1.2d-8) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * (cos(phi1) * cos(lambda1)))))
else
tmp = r * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0d0) + (cos(phi1) * cos((lambda2 - lambda1)))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.2e-8) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda1)))));
} else {
tmp = R * Math.acos((((Math.cos((phi1 - phi2)) - Math.cos((phi1 + phi2))) / 2.0) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 1.2e-8: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi2) * (math.cos(phi1) * math.cos(lambda1))))) else: tmp = R * math.acos((((math.cos((phi1 - phi2)) - math.cos((phi1 + phi2))) / 2.0) + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1.2e-8) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * Float64(cos(phi1) * cos(lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(Float64(cos(Float64(phi1 - phi2)) - cos(Float64(phi1 + phi2))) / 2.0) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 1.2e-8)
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
else
tmp = R * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0) + (cos(phi1) * cos((lambda2 - lambda1)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1.2e-8], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[(N[Cos[N[(phi1 - phi2), $MachinePrecision]], $MachinePrecision] - N[Cos[N[(phi1 + phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.2 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\frac{\cos \left(\phi_1 - \phi_2\right) - \cos \left(\phi_1 + \phi_2\right)}{2} + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if lambda2 < 1.19999999999999999e-8Initial program 79.8%
Taylor expanded in lambda2 around 0 65.7%
if 1.19999999999999999e-8 < lambda2 Initial program 66.0%
Taylor expanded in phi2 around 0 46.0%
sub-neg46.0%
+-commutative46.0%
neg-mul-146.0%
neg-mul-146.0%
remove-double-neg46.0%
mul-1-neg46.0%
distribute-neg-in46.0%
+-commutative46.0%
cos-neg46.0%
+-commutative46.0%
mul-1-neg46.0%
unsub-neg46.0%
Simplified46.0%
sin-mult45.7%
Applied egg-rr45.7%
Final simplification60.0%
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 -2.1e-6)
(* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda1))))))
(* R (acos (+ t_0 (* (cos lambda2) (* (cos phi1) (cos phi2)))))))))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 <= -2.1e-6) {
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
} else {
tmp = R * acos((t_0 + (cos(lambda2) * (cos(phi1) * cos(phi2)))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (lambda1 <= (-2.1d-6)) then
tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))))
else
tmp = r * acos((t_0 + (cos(lambda2) * (cos(phi1) * cos(phi2)))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda1 <= -2.1e-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(lambda2) * (Math.cos(phi1) * Math.cos(phi2)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda1 <= -2.1e-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(lambda2) * (math.cos(phi1) * math.cos(phi2))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda1 <= -2.1e-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(lambda2) * Float64(cos(phi1) * cos(phi2)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda1 <= -2.1e-6)
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
else
tmp = R * acos((t_0 + (cos(lambda2) * (cos(phi1) * cos(phi2)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -2.1e-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[lambda2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -2.1 \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 \lambda_2 \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right)\right)\\
\end{array}
\end{array}
if lambda1 < -2.0999999999999998e-6Initial program 64.3%
Taylor expanded in lambda2 around 0 63.8%
if -2.0999999999999998e-6 < lambda1 Initial program 79.8%
Taylor expanded in lambda1 around 0 68.6%
cos-neg68.6%
Simplified68.6%
Final simplification67.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (cos (- lambda1 lambda2)) (* (cos phi1) (cos phi2)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + (cos((lambda1 - lambda2)) * (cos(phi1) * cos(phi2)))));
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((sin(phi1) * sin(phi2)) + (cos((lambda1 - lambda2)) * (cos(phi1) * cos(phi2)))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos((lambda1 - lambda2)) * (Math.cos(phi1) * Math.cos(phi2)))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos((lambda1 - lambda2)) * (math.cos(phi1) * math.cos(phi2)))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(Float64(lambda1 - lambda2)) * Float64(cos(phi1) * cos(phi2)))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos((lambda1 - lambda2)) * (cos(phi1) * cos(phi2)))));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right)\right)
\end{array}
Initial program 75.9%
Final simplification75.9%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi2 3.5e-28)
(*
R
(acos
(+
(/ (- (cos (- phi1 phi2)) (cos (+ phi1 phi2))) 2.0)
(* (cos phi1) t_0))))
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 3.5e-28) {
tmp = R * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0) + (cos(phi1) * t_0)));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
if (phi2 <= 3.5d-28) then
tmp = r * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0d0) + (cos(phi1) * t_0)))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * t_0)))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 3.5e-28) {
tmp = R * Math.acos((((Math.cos((phi1 - phi2)) - Math.cos((phi1 + phi2))) / 2.0) + (Math.cos(phi1) * t_0)));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi2) * t_0)));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi2 <= 3.5e-28: tmp = R * math.acos((((math.cos((phi1 - phi2)) - math.cos((phi1 + phi2))) / 2.0) + (math.cos(phi1) * t_0))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi2) * t_0))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 3.5e-28) tmp = Float64(R * acos(Float64(Float64(Float64(cos(Float64(phi1 - phi2)) - cos(Float64(phi1 + phi2))) / 2.0) + Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * t_0)))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi2 <= 3.5e-28)
tmp = R * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0) + (cos(phi1) * t_0)));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 3.5e-28], N[(R * N[ArcCos[N[(N[(N[(N[Cos[N[(phi1 - phi2), $MachinePrecision]], $MachinePrecision] - N[Cos[N[(phi1 + phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 3.5 \cdot 10^{-28}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\frac{\cos \left(\phi_1 - \phi_2\right) - \cos \left(\phi_1 + \phi_2\right)}{2} + \cos \phi_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
if phi2 < 3.5e-28Initial program 73.3%
Taylor expanded in phi2 around 0 53.2%
sub-neg53.2%
+-commutative53.2%
neg-mul-153.2%
neg-mul-153.2%
remove-double-neg53.2%
mul-1-neg53.2%
distribute-neg-in53.2%
+-commutative53.2%
cos-neg53.2%
+-commutative53.2%
mul-1-neg53.2%
unsub-neg53.2%
Simplified53.2%
sin-mult53.2%
Applied egg-rr53.2%
if 3.5e-28 < phi2 Initial program 82.3%
Taylor expanded in phi1 around 0 54.1%
sub-neg54.1%
+-commutative54.1%
neg-mul-154.1%
neg-mul-154.1%
remove-double-neg54.1%
mul-1-neg54.1%
distribute-neg-in54.1%
+-commutative54.1%
cos-neg54.1%
+-commutative54.1%
mul-1-neg54.1%
unsub-neg54.1%
Simplified54.1%
Final simplification53.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi1) (cos phi2)))))))
(if (<= phi2 -9.6e-5)
t_0
(if (<= phi2 3.6e-14)
(*
R
(acos
(+ (* (sin phi1) phi2) (* (cos phi1) (cos (- lambda2 lambda1))))))
(if (<= phi2 1.75e+164)
(*
R
(acos
(+
(* phi1 (sin phi2))
(* (+ (* -0.5 (* phi1 phi1)) 1.0) (* (cos phi2) (cos lambda2))))))
t_0)))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))));
double tmp;
if (phi2 <= -9.6e-5) {
tmp = t_0;
} else if (phi2 <= 3.6e-14) {
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
} else if (phi2 <= 1.75e+164) {
tmp = R * acos(((phi1 * sin(phi2)) + (((-0.5 * (phi1 * phi1)) + 1.0) * (cos(phi2) * cos(lambda2)))));
} else {
tmp = t_0;
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))))
if (phi2 <= (-9.6d-5)) then
tmp = t_0
else if (phi2 <= 3.6d-14) then
tmp = r * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))))
else if (phi2 <= 1.75d+164) then
tmp = r * acos(((phi1 * sin(phi2)) + ((((-0.5d0) * (phi1 * phi1)) + 1.0d0) * (cos(phi2) * cos(lambda2)))))
else
tmp = t_0
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos(phi2))));
double tmp;
if (phi2 <= -9.6e-5) {
tmp = t_0;
} else if (phi2 <= 3.6e-14) {
tmp = R * Math.acos(((Math.sin(phi1) * phi2) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
} else if (phi2 <= 1.75e+164) {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (((-0.5 * (phi1 * phi1)) + 1.0) * (Math.cos(phi2) * Math.cos(lambda2)))));
} else {
tmp = t_0;
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * math.cos(phi2)))) tmp = 0 if phi2 <= -9.6e-5: tmp = t_0 elif phi2 <= 3.6e-14: tmp = R * math.acos(((math.sin(phi1) * phi2) + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) elif phi2 <= 1.75e+164: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (((-0.5 * (phi1 * phi1)) + 1.0) * (math.cos(phi2) * math.cos(lambda2))))) else: tmp = t_0 return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * cos(phi2))))) tmp = 0.0 if (phi2 <= -9.6e-5) tmp = t_0; elseif (phi2 <= 3.6e-14) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * phi2) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); elseif (phi2 <= 1.75e+164) tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(Float64(Float64(-0.5 * Float64(phi1 * phi1)) + 1.0) * Float64(cos(phi2) * cos(lambda2)))))); else tmp = t_0; end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))));
tmp = 0.0;
if (phi2 <= -9.6e-5)
tmp = t_0;
elseif (phi2 <= 3.6e-14)
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
elseif (phi2 <= 1.75e+164)
tmp = R * acos(((phi1 * sin(phi2)) + (((-0.5 * (phi1 * phi1)) + 1.0) * (cos(phi2) * cos(lambda2)))));
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -9.6e-5], t$95$0, If[LessEqual[phi2, 3.6e-14], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.75e+164], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \phi_2\right)\\
\mathbf{if}\;\phi_2 \leq -9.6 \cdot 10^{-5}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\phi_2 \leq 3.6 \cdot 10^{-14}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.75 \cdot 10^{+164}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \left(-0.5 \cdot \left(\phi_1 \cdot \phi_1\right) + 1\right) \cdot \left(\cos \phi_2 \cdot \cos \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t_0\\
\end{array}
\end{array}
if phi2 < -9.6000000000000002e-5 or 1.7499999999999999e164 < phi2 Initial program 79.3%
fma-def79.4%
associate-*l*79.4%
Simplified79.4%
cos-diff99.4%
+-commutative99.4%
Applied egg-rr99.4%
Taylor expanded in lambda1 around 0 57.9%
associate-*r*57.9%
Simplified57.9%
Taylor expanded in lambda2 around 0 37.7%
if -9.6000000000000002e-5 < phi2 < 3.5999999999999998e-14Initial program 70.9%
Taylor expanded in phi2 around 0 70.6%
sub-neg70.6%
+-commutative70.6%
neg-mul-170.6%
neg-mul-170.6%
remove-double-neg70.6%
mul-1-neg70.6%
distribute-neg-in70.6%
+-commutative70.6%
cos-neg70.6%
+-commutative70.6%
mul-1-neg70.6%
unsub-neg70.6%
Simplified70.6%
Taylor expanded in phi2 around 0 70.6%
if 3.5999999999999998e-14 < phi2 < 1.7499999999999999e164Initial program 83.4%
fma-def83.4%
associate-*l*83.4%
Simplified83.4%
cos-diff99.1%
+-commutative99.1%
Applied egg-rr99.1%
Taylor expanded in lambda1 around 0 59.3%
associate-*r*59.3%
Simplified59.3%
Taylor expanded in phi1 around 0 31.9%
associate-+r+31.9%
+-commutative31.9%
associate-*r*31.9%
distribute-lft1-in31.9%
unpow231.9%
Simplified31.9%
Final simplification52.6%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= phi2 -0.00015)
(* R (acos (+ t_0 (* (cos phi1) (cos phi2)))))
(if (<= phi2 0.006)
(*
R
(acos
(+ (* (sin phi1) phi2) (* (cos phi1) (cos (- lambda2 lambda1))))))
(* R (acos (+ t_0 (* (cos phi2) (cos lambda1)))))))))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 (phi2 <= -0.00015) {
tmp = R * acos((t_0 + (cos(phi1) * cos(phi2))));
} else if (phi2 <= 0.006) {
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (phi2 <= (-0.00015d0)) then
tmp = r * acos((t_0 + (cos(phi1) * cos(phi2))))
else if (phi2 <= 0.006d0) then
tmp = r * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))))
else
tmp = r * acos((t_0 + (cos(phi2) * cos(lambda1))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (phi2 <= -0.00015) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(phi2))));
} else if (phi2 <= 0.006) {
tmp = R * Math.acos(((Math.sin(phi1) * phi2) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda1))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if phi2 <= -0.00015: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(phi2)))) elif phi2 <= 0.006: tmp = R * math.acos(((math.sin(phi1) * phi2) + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda1)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -0.00015) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(phi2))))); elseif (phi2 <= 0.006) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * phi2) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda1))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (phi2 <= -0.00015)
tmp = R * acos((t_0 + (cos(phi1) * cos(phi2))));
elseif (phi2 <= 0.006)
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
else
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.00015], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 0.006], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision] + 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}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -0.00015:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \phi_2\right)\\
\mathbf{elif}\;\phi_2 \leq 0.006:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \phi_2 + \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 < -1.49999999999999987e-4Initial program 75.7%
fma-def75.7%
associate-*l*75.7%
Simplified75.7%
cos-diff99.3%
+-commutative99.3%
Applied egg-rr99.3%
Taylor expanded in lambda1 around 0 53.5%
associate-*r*53.5%
Simplified53.5%
Taylor expanded in lambda2 around 0 37.1%
if -1.49999999999999987e-4 < phi2 < 0.0060000000000000001Initial program 71.1%
Taylor expanded in phi2 around 0 70.6%
sub-neg70.6%
+-commutative70.6%
neg-mul-170.6%
neg-mul-170.6%
remove-double-neg70.6%
mul-1-neg70.6%
distribute-neg-in70.6%
+-commutative70.6%
cos-neg70.6%
+-commutative70.6%
mul-1-neg70.6%
unsub-neg70.6%
Simplified70.6%
Taylor expanded in phi2 around 0 70.6%
if 0.0060000000000000001 < phi2 Initial program 85.3%
Taylor expanded in lambda2 around 0 59.6%
Taylor expanded in phi1 around 0 42.3%
Final simplification55.0%
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 (<= phi2 0.044)
(* R (acos (+ t_0 (* (cos phi1) (cos (- lambda2 lambda1))))))
(* R (acos (+ t_0 (* (cos phi2) (cos lambda1))))))))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 (phi2 <= 0.044) {
tmp = R * acos((t_0 + (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (phi2 <= 0.044d0) 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 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 (phi2 <= 0.044) {
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;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if phi2 <= 0.044: 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
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= 0.044) 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
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 (phi2 <= 0.044)
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: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 0.044], 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}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq 0.044:\\
\;\;\;\;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 < 0.043999999999999997Initial program 72.7%
Taylor expanded in phi2 around 0 53.2%
sub-neg53.2%
+-commutative53.2%
neg-mul-153.2%
neg-mul-153.2%
remove-double-neg53.2%
mul-1-neg53.2%
distribute-neg-in53.2%
+-commutative53.2%
cos-neg53.2%
+-commutative53.2%
mul-1-neg53.2%
unsub-neg53.2%
Simplified53.2%
if 0.043999999999999997 < phi2 Initial program 85.3%
Taylor expanded in lambda2 around 0 59.6%
Taylor expanded in phi1 around 0 42.3%
Final simplification50.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi2 3.5e-28)
(* R (acos (+ t_1 (* (cos phi1) t_0))))
(* R (acos (+ t_1 (* (cos phi2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= 3.5e-28) {
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
} else {
tmp = R * acos((t_1 + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
t_1 = sin(phi1) * sin(phi2)
if (phi2 <= 3.5d-28) then
tmp = r * acos((t_1 + (cos(phi1) * t_0)))
else
tmp = r * acos((t_1 + (cos(phi2) * t_0)))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (phi2 <= 3.5e-28) {
tmp = R * Math.acos((t_1 + (Math.cos(phi1) * t_0)));
} else {
tmp = R * Math.acos((t_1 + (Math.cos(phi2) * t_0)));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if phi2 <= 3.5e-28: tmp = R * math.acos((t_1 + (math.cos(phi1) * t_0))) else: tmp = R * math.acos((t_1 + (math.cos(phi2) * t_0))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= 3.5e-28) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi2) * t_0)))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (phi2 <= 3.5e-28)
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
else
tmp = R * acos((t_1 + (cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 3.5e-28], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq 3.5 \cdot 10^{-28}:\\
\;\;\;\;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 < 3.5e-28Initial program 73.3%
Taylor expanded in phi2 around 0 53.2%
sub-neg53.2%
+-commutative53.2%
neg-mul-153.2%
neg-mul-153.2%
remove-double-neg53.2%
mul-1-neg53.2%
distribute-neg-in53.2%
+-commutative53.2%
cos-neg53.2%
+-commutative53.2%
mul-1-neg53.2%
unsub-neg53.2%
Simplified53.2%
if 3.5e-28 < phi2 Initial program 82.3%
Taylor expanded in phi1 around 0 54.1%
sub-neg54.1%
+-commutative54.1%
neg-mul-154.1%
neg-mul-154.1%
remove-double-neg54.1%
mul-1-neg54.1%
distribute-neg-in54.1%
+-commutative54.1%
cos-neg54.1%
+-commutative54.1%
mul-1-neg54.1%
unsub-neg54.1%
Simplified54.1%
Final simplification53.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 3.6e-14)
(*
R
(acos (+ (* (sin phi1) phi2) (* (cos phi1) (cos (- lambda2 lambda1))))))
(*
R
(acos
(+
(* phi1 (sin phi2))
(* (+ (* -0.5 (* phi1 phi1)) 1.0) (* (cos phi2) (cos lambda2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.6e-14) {
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (((-0.5 * (phi1 * phi1)) + 1.0) * (cos(phi2) * cos(lambda2)))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 3.6d-14) then
tmp = r * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))))
else
tmp = r * acos(((phi1 * sin(phi2)) + ((((-0.5d0) * (phi1 * phi1)) + 1.0d0) * (cos(phi2) * cos(lambda2)))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.6e-14) {
tmp = R * Math.acos(((Math.sin(phi1) * phi2) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (((-0.5 * (phi1 * phi1)) + 1.0) * (Math.cos(phi2) * Math.cos(lambda2)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 3.6e-14: tmp = R * math.acos(((math.sin(phi1) * phi2) + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (((-0.5 * (phi1 * phi1)) + 1.0) * (math.cos(phi2) * math.cos(lambda2))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 3.6e-14) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * phi2) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(Float64(Float64(-0.5 * Float64(phi1 * phi1)) + 1.0) * Float64(cos(phi2) * cos(lambda2)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 3.6e-14)
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
else
tmp = R * acos(((phi1 * sin(phi2)) + (((-0.5 * (phi1 * phi1)) + 1.0) * (cos(phi2) * cos(lambda2)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 3.6e-14], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * phi2), $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[(N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.6 \cdot 10^{-14}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \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 + \left(-0.5 \cdot \left(\phi_1 \cdot \phi_1\right) + 1\right) \cdot \left(\cos \phi_2 \cdot \cos \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < 3.5999999999999998e-14Initial program 72.5%
Taylor expanded in phi2 around 0 52.8%
sub-neg52.8%
+-commutative52.8%
neg-mul-152.8%
neg-mul-152.8%
remove-double-neg52.8%
mul-1-neg52.8%
distribute-neg-in52.8%
+-commutative52.8%
cos-neg52.8%
+-commutative52.8%
mul-1-neg52.8%
unsub-neg52.8%
Simplified52.8%
Taylor expanded in phi2 around 0 48.3%
if 3.5999999999999998e-14 < phi2 Initial program 85.0%
fma-def85.0%
associate-*l*85.0%
Simplified85.0%
cos-diff99.2%
+-commutative99.2%
Applied egg-rr99.2%
Taylor expanded in lambda1 around 0 62.7%
associate-*r*62.7%
Simplified62.7%
Taylor expanded in phi1 around 0 32.2%
associate-+r+32.2%
+-commutative32.2%
associate-*r*32.2%
distribute-lft1-in32.2%
unpow232.2%
Simplified32.2%
Final simplification43.9%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(*
R
(acos (+ (* phi1 phi2) (* (cos phi1) (cos (- lambda2 lambda1)))))))
(t_1
(* R (acos (+ (* (sin phi1) phi2) (* (cos phi1) (cos lambda2)))))))
(if (<= phi2 -7.8e-222)
t_1
(if (<= phi2 2.95e-198)
t_0
(if (<= phi2 1.22e-67)
t_1
(if (<= phi2 3e-14)
t_0
(*
R
(acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos lambda2)))))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
double t_1 = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos(lambda2))));
double tmp;
if (phi2 <= -7.8e-222) {
tmp = t_1;
} else if (phi2 <= 2.95e-198) {
tmp = t_0;
} else if (phi2 <= 1.22e-67) {
tmp = t_1;
} else if (phi2 <= 3e-14) {
tmp = t_0;
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda2))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = r * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))))
t_1 = r * acos(((sin(phi1) * phi2) + (cos(phi1) * cos(lambda2))))
if (phi2 <= (-7.8d-222)) then
tmp = t_1
else if (phi2 <= 2.95d-198) then
tmp = t_0
else if (phi2 <= 1.22d-67) then
tmp = t_1
else if (phi2 <= 3d-14) then
tmp = t_0
else
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
double t_1 = R * Math.acos(((Math.sin(phi1) * phi2) + (Math.cos(phi1) * Math.cos(lambda2))));
double tmp;
if (phi2 <= -7.8e-222) {
tmp = t_1;
} else if (phi2 <= 2.95e-198) {
tmp = t_0;
} else if (phi2 <= 1.22e-67) {
tmp = t_1;
} else if (phi2 <= 3e-14) {
tmp = t_0;
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos(lambda2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) t_1 = R * math.acos(((math.sin(phi1) * phi2) + (math.cos(phi1) * math.cos(lambda2)))) tmp = 0 if phi2 <= -7.8e-222: tmp = t_1 elif phi2 <= 2.95e-198: tmp = t_0 elif phi2 <= 1.22e-67: tmp = t_1 elif phi2 <= 3e-14: tmp = t_0 else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos(lambda2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))) t_1 = Float64(R * acos(Float64(Float64(sin(phi1) * phi2) + Float64(cos(phi1) * cos(lambda2))))) tmp = 0.0 if (phi2 <= -7.8e-222) tmp = t_1; elseif (phi2 <= 2.95e-198) tmp = t_0; elseif (phi2 <= 1.22e-67) tmp = t_1; elseif (phi2 <= 3e-14) tmp = t_0; else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(lambda2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
t_1 = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos(lambda2))));
tmp = 0.0;
if (phi2 <= -7.8e-222)
tmp = t_1;
elseif (phi2 <= 2.95e-198)
tmp = t_0;
elseif (phi2 <= 1.22e-67)
tmp = t_1;
elseif (phi2 <= 3e-14)
tmp = t_0;
else
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -7.8e-222], t$95$1, If[LessEqual[phi2, 2.95e-198], t$95$0, If[LessEqual[phi2, 1.22e-67], t$95$1, If[LessEqual[phi2, 3e-14], t$95$0, N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
t_1 := R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -7.8 \cdot 10^{-222}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;\phi_2 \leq 2.95 \cdot 10^{-198}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\phi_2 \leq 1.22 \cdot 10^{-67}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;\phi_2 \leq 3 \cdot 10^{-14}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if phi2 < -7.8000000000000002e-222 or 2.94999999999999987e-198 < phi2 < 1.22e-67Initial program 73.3%
fma-def73.3%
associate-*l*73.3%
Simplified73.3%
cos-diff94.1%
+-commutative94.1%
Applied egg-rr94.1%
Taylor expanded in lambda1 around 0 55.4%
associate-*r*55.4%
Simplified55.4%
Taylor expanded in phi2 around 0 32.0%
if -7.8000000000000002e-222 < phi2 < 2.94999999999999987e-198 or 1.22e-67 < phi2 < 2.9999999999999998e-14Initial program 70.3%
Taylor expanded in phi2 around 0 70.3%
sub-neg70.3%
+-commutative70.3%
neg-mul-170.3%
neg-mul-170.3%
remove-double-neg70.3%
mul-1-neg70.3%
distribute-neg-in70.3%
+-commutative70.3%
cos-neg70.3%
+-commutative70.3%
mul-1-neg70.3%
unsub-neg70.3%
Simplified70.3%
Taylor expanded in phi1 around 0 65.3%
Taylor expanded in phi2 around 0 65.3%
if 2.9999999999999998e-14 < phi2 Initial program 85.0%
fma-def85.0%
associate-*l*85.0%
Simplified85.0%
cos-diff99.2%
+-commutative99.2%
Applied egg-rr99.2%
Taylor expanded in lambda1 around 0 62.7%
associate-*r*62.7%
Simplified62.7%
Taylor expanded in phi1 around 0 31.7%
Final simplification38.3%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 3.6e-14)
(*
R
(acos (+ (* (sin phi1) phi2) (* (cos phi1) (cos (- lambda2 lambda1))))))
(* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos lambda2)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.6e-14) {
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda2))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 3.6d-14) then
tmp = r * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))))
else
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.6e-14) {
tmp = R * Math.acos(((Math.sin(phi1) * phi2) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos(lambda2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 3.6e-14: tmp = R * math.acos(((math.sin(phi1) * phi2) + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos(lambda2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 3.6e-14) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * phi2) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(lambda2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 3.6e-14)
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
else
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 3.6e-14], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * phi2), $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[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.6 \cdot 10^{-14}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \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_2\right)\\
\end{array}
\end{array}
if phi2 < 3.5999999999999998e-14Initial program 72.5%
Taylor expanded in phi2 around 0 52.8%
sub-neg52.8%
+-commutative52.8%
neg-mul-152.8%
neg-mul-152.8%
remove-double-neg52.8%
mul-1-neg52.8%
distribute-neg-in52.8%
+-commutative52.8%
cos-neg52.8%
+-commutative52.8%
mul-1-neg52.8%
unsub-neg52.8%
Simplified52.8%
Taylor expanded in phi2 around 0 48.3%
if 3.5999999999999998e-14 < phi2 Initial program 85.0%
fma-def85.0%
associate-*l*85.0%
Simplified85.0%
cos-diff99.2%
+-commutative99.2%
Applied egg-rr99.2%
Taylor expanded in lambda1 around 0 62.7%
associate-*r*62.7%
Simplified62.7%
Taylor expanded in phi1 around 0 31.7%
Final simplification43.8%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1e+113) (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos (- lambda2 lambda1)))))) (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi1) (cos lambda1)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1e+113) {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos(lambda1))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 1d+113) then
tmp = r * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))))
else
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos(lambda1))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1e+113) {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos(lambda1))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1e+113: tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi1) * math.cos(lambda1)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1e+113) tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * cos(lambda1))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 1e+113)
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
else
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1e+113], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $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[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 10^{+113}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \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_1 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi2 < 1e113Initial program 73.8%
Taylor expanded in phi2 around 0 49.9%
sub-neg49.9%
+-commutative49.9%
neg-mul-149.9%
neg-mul-149.9%
remove-double-neg49.9%
mul-1-neg49.9%
distribute-neg-in49.9%
+-commutative49.9%
cos-neg49.9%
+-commutative49.9%
mul-1-neg49.9%
unsub-neg49.9%
Simplified49.9%
Taylor expanded in phi1 around 0 33.6%
Taylor expanded in phi2 around 0 31.8%
if 1e113 < phi2 Initial program 85.8%
Taylor expanded in phi2 around 0 18.5%
sub-neg18.5%
+-commutative18.5%
neg-mul-118.5%
neg-mul-118.5%
remove-double-neg18.5%
mul-1-neg18.5%
distribute-neg-in18.5%
+-commutative18.5%
cos-neg18.5%
+-commutative18.5%
mul-1-neg18.5%
unsub-neg18.5%
Simplified18.5%
Taylor expanded in phi1 around 0 8.7%
Taylor expanded in lambda2 around 0 6.5%
cos-neg6.5%
Simplified6.5%
Final simplification27.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= lambda1 -9.5e-7)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi1) (cos lambda2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (lambda1 <= -9.5e-7) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (lambda1 <= (-9.5d-7)) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (lambda1 <= -9.5e-7) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda1 <= -9.5e-7: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda1 <= -9.5e-7) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda1 <= -9.5e-7)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -9.5e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -9.5 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda1 < -9.5000000000000001e-7Initial program 64.3%
Taylor expanded in phi2 around 0 42.9%
sub-neg42.9%
+-commutative42.9%
neg-mul-142.9%
neg-mul-142.9%
remove-double-neg42.9%
mul-1-neg42.9%
distribute-neg-in42.9%
+-commutative42.9%
cos-neg42.9%
+-commutative42.9%
mul-1-neg42.9%
unsub-neg42.9%
Simplified42.9%
Taylor expanded in phi1 around 0 32.0%
Taylor expanded in lambda2 around 0 31.6%
cos-neg31.6%
Simplified31.6%
if -9.5000000000000001e-7 < lambda1 Initial program 79.8%
Taylor expanded in phi2 around 0 45.0%
sub-neg45.0%
+-commutative45.0%
neg-mul-145.0%
neg-mul-145.0%
remove-double-neg45.0%
mul-1-neg45.0%
distribute-neg-in45.0%
+-commutative45.0%
cos-neg45.0%
+-commutative45.0%
mul-1-neg45.0%
unsub-neg45.0%
Simplified45.0%
Taylor expanded in phi1 around 0 28.4%
Taylor expanded in lambda1 around 0 24.7%
Final simplification26.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 3.6e-14) (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos (- lambda2 lambda1)))))) (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos lambda2)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.6e-14) {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda2))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 3.6d-14) then
tmp = r * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))))
else
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.6e-14) {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos(lambda2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 3.6e-14: tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos(lambda2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 3.6e-14) tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(lambda2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 3.6e-14)
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
else
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 3.6e-14], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $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[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.6 \cdot 10^{-14}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \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_2\right)\\
\end{array}
\end{array}
if phi2 < 3.5999999999999998e-14Initial program 72.5%
Taylor expanded in phi2 around 0 52.8%
sub-neg52.8%
+-commutative52.8%
neg-mul-152.8%
neg-mul-152.8%
remove-double-neg52.8%
mul-1-neg52.8%
distribute-neg-in52.8%
+-commutative52.8%
cos-neg52.8%
+-commutative52.8%
mul-1-neg52.8%
unsub-neg52.8%
Simplified52.8%
Taylor expanded in phi1 around 0 36.0%
Taylor expanded in phi2 around 0 34.1%
if 3.5999999999999998e-14 < phi2 Initial program 85.0%
fma-def85.0%
associate-*l*85.0%
Simplified85.0%
cos-diff99.2%
+-commutative99.2%
Applied egg-rr99.2%
Taylor expanded in lambda1 around 0 62.7%
associate-*r*62.7%
Simplified62.7%
Taylor expanded in phi1 around 0 31.7%
Final simplification33.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -1.45e-66)
(* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos lambda1)))))
(*
R
(acos
(+
(* phi1 phi2)
(* (cos (- lambda2 lambda1)) (+ (* -0.5 (* phi1 phi1)) 1.0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.45e-66) {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos(((phi1 * phi2) + (cos((lambda2 - lambda1)) * ((-0.5 * (phi1 * phi1)) + 1.0))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-1.45d-66)) then
tmp = r * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos(((phi1 * phi2) + (cos((lambda2 - lambda1)) * (((-0.5d0) * (phi1 * phi1)) + 1.0d0))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.45e-66) {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos((lambda2 - lambda1)) * ((-0.5 * (phi1 * phi1)) + 1.0))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.45e-66: tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos(((phi1 * phi2) + (math.cos((lambda2 - lambda1)) * ((-0.5 * (phi1 * phi1)) + 1.0)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.45e-66) tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(Float64(lambda2 - lambda1)) * Float64(Float64(-0.5 * Float64(phi1 * phi1)) + 1.0))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -1.45e-66)
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos(((phi1 * phi2) + (cos((lambda2 - lambda1)) * ((-0.5 * (phi1 * phi1)) + 1.0))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.45e-66], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * N[(N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.45 \cdot 10^{-66}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\lambda_2 - \lambda_1\right) \cdot \left(-0.5 \cdot \left(\phi_1 \cdot \phi_1\right) + 1\right)\right)\\
\end{array}
\end{array}
if phi1 < -1.45000000000000006e-66Initial program 82.9%
Taylor expanded in phi2 around 0 49.1%
sub-neg49.1%
+-commutative49.1%
neg-mul-149.1%
neg-mul-149.1%
remove-double-neg49.1%
mul-1-neg49.1%
distribute-neg-in49.1%
+-commutative49.1%
cos-neg49.1%
+-commutative49.1%
mul-1-neg49.1%
unsub-neg49.1%
Simplified49.1%
Taylor expanded in phi1 around 0 24.3%
Taylor expanded in phi2 around 0 22.6%
Taylor expanded in lambda2 around 0 15.4%
cos-neg15.4%
Simplified15.4%
if -1.45000000000000006e-66 < phi1 Initial program 72.6%
Taylor expanded in phi2 around 0 42.3%
sub-neg42.3%
+-commutative42.3%
neg-mul-142.3%
neg-mul-142.3%
remove-double-neg42.3%
mul-1-neg42.3%
distribute-neg-in42.3%
+-commutative42.3%
cos-neg42.3%
+-commutative42.3%
mul-1-neg42.3%
unsub-neg42.3%
Simplified42.3%
Taylor expanded in phi1 around 0 31.7%
Taylor expanded in phi2 around 0 28.7%
Taylor expanded in phi1 around 0 23.2%
associate-*r*23.2%
distribute-lft1-in23.2%
unpow223.2%
Simplified23.2%
Final simplification20.7%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -9.6e-6) (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos lambda1))))) (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos lambda2)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -9.6e-6) {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-9.6d-6)) then
tmp = r * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -9.6e-6) {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos(lambda2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -9.6e-6: tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos(lambda2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -9.6e-6) tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(lambda2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -9.6e-6)
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -9.6e-6], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -9.6 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda1 < -9.5999999999999996e-6Initial program 64.3%
Taylor expanded in phi2 around 0 42.9%
sub-neg42.9%
+-commutative42.9%
neg-mul-142.9%
neg-mul-142.9%
remove-double-neg42.9%
mul-1-neg42.9%
distribute-neg-in42.9%
+-commutative42.9%
cos-neg42.9%
+-commutative42.9%
mul-1-neg42.9%
unsub-neg42.9%
Simplified42.9%
Taylor expanded in phi1 around 0 32.0%
Taylor expanded in phi2 around 0 27.8%
Taylor expanded in lambda2 around 0 27.3%
cos-neg27.3%
Simplified27.3%
if -9.5999999999999996e-6 < lambda1 Initial program 79.8%
Taylor expanded in phi2 around 0 45.0%
sub-neg45.0%
+-commutative45.0%
neg-mul-145.0%
neg-mul-145.0%
remove-double-neg45.0%
mul-1-neg45.0%
distribute-neg-in45.0%
+-commutative45.0%
cos-neg45.0%
+-commutative45.0%
mul-1-neg45.0%
unsub-neg45.0%
Simplified45.0%
Taylor expanded in phi1 around 0 28.4%
Taylor expanded in phi2 around 0 26.4%
Taylor expanded in lambda1 around 0 23.0%
Final simplification24.1%
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 phi2) (* (cos phi1) (cos (- lambda2 lambda1)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos((lambda2 - lambda1)))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda2 - lambda1)))));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)
\end{array}
Initial program 75.9%
Taylor expanded in phi2 around 0 44.5%
sub-neg44.5%
+-commutative44.5%
neg-mul-144.5%
neg-mul-144.5%
remove-double-neg44.5%
mul-1-neg44.5%
distribute-neg-in44.5%
+-commutative44.5%
cos-neg44.5%
+-commutative44.5%
mul-1-neg44.5%
unsub-neg44.5%
Simplified44.5%
Taylor expanded in phi1 around 0 29.3%
Taylor expanded in phi2 around 0 26.7%
Final simplification26.7%
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 phi2)
(* (cos (- lambda2 lambda1)) (+ (* -0.5 (* phi1 phi1)) 1.0))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi1 * phi2) + (cos((lambda2 - lambda1)) * ((-0.5 * (phi1 * phi1)) + 1.0))));
}
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 * phi2) + (cos((lambda2 - lambda1)) * (((-0.5d0) * (phi1 * phi1)) + 1.0d0))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi1 * phi2) + (Math.cos((lambda2 - lambda1)) * ((-0.5 * (phi1 * phi1)) + 1.0))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * phi2) + (math.cos((lambda2 - lambda1)) * ((-0.5 * (phi1 * phi1)) + 1.0))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(Float64(lambda2 - lambda1)) * Float64(Float64(-0.5 * Float64(phi1 * phi1)) + 1.0))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi1 * phi2) + (cos((lambda2 - lambda1)) * ((-0.5 * (phi1 * phi1)) + 1.0))));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * N[(N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \left(\lambda_2 - \lambda_1\right) \cdot \left(-0.5 \cdot \left(\phi_1 \cdot \phi_1\right) + 1\right)\right)
\end{array}
Initial program 75.9%
Taylor expanded in phi2 around 0 44.5%
sub-neg44.5%
+-commutative44.5%
neg-mul-144.5%
neg-mul-144.5%
remove-double-neg44.5%
mul-1-neg44.5%
distribute-neg-in44.5%
+-commutative44.5%
cos-neg44.5%
+-commutative44.5%
mul-1-neg44.5%
unsub-neg44.5%
Simplified44.5%
Taylor expanded in phi1 around 0 29.3%
Taylor expanded in phi2 around 0 26.7%
Taylor expanded in phi1 around 0 15.9%
associate-*r*15.9%
distribute-lft1-in15.9%
unpow215.9%
Simplified15.9%
Final simplification15.9%
herbie shell --seed 2023175
(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))