
(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: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(fma
(sin phi1)
(sin phi2)
(fma
(cos lambda1)
(* (* (cos phi1) (cos phi2)) (cos lambda2))
(* (cos phi1) (* (* (cos phi2) (sin lambda1)) (sin lambda2))))))
R))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(fma(sin(phi1), sin(phi2), fma(cos(lambda1), ((cos(phi1) * cos(phi2)) * cos(lambda2)), (cos(phi1) * ((cos(phi2) * sin(lambda1)) * sin(lambda2)))))) * R;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(fma(sin(phi1), sin(phi2), fma(cos(lambda1), Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda2)), Float64(cos(phi1) * Float64(Float64(cos(phi2) * sin(lambda1)) * sin(lambda2)))))) * R) end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[phi2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \mathsf{fma}\left(\cos \lambda_1, \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_2, \cos \phi_1 \cdot \left(\left(\cos \phi_2 \cdot \sin \lambda_1\right) \cdot \sin \lambda_2\right)\right)\right)\right) \cdot R
\end{array}
Initial program 70.7%
Simplified70.7%
associate-*r*70.7%
cos-diff91.9%
distribute-lft-in91.9%
Applied egg-rr91.9%
Taylor expanded in phi1 around 0 91.9%
fma-def91.9%
associate-*r*91.9%
*-commutative91.9%
associate-*l*91.9%
*-commutative91.9%
associate-*r*91.9%
Simplified91.9%
Taylor expanded in phi1 around 0 91.9%
cos-neg91.9%
*-commutative91.9%
cos-neg91.9%
associate-*r*91.9%
Simplified91.9%
Final simplification91.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(fma
(cos lambda1)
(* (* (cos phi1) (cos phi2)) (cos lambda2))
(* (cos phi2) (* (sin lambda1) (* (cos phi1) (sin lambda2)))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(fma(sin(phi1), sin(phi2), fma(cos(lambda1), ((cos(phi1) * cos(phi2)) * cos(lambda2)), (cos(phi2) * (sin(lambda1) * (cos(phi1) * sin(lambda2)))))));
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(fma(sin(phi1), sin(phi2), fma(cos(lambda1), Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda2)), Float64(cos(phi2) * Float64(sin(lambda1) * Float64(cos(phi1) * sin(lambda2)))))))) end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \mathsf{fma}\left(\cos \lambda_1, \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_2, \cos \phi_2 \cdot \left(\sin \lambda_1 \cdot \left(\cos \phi_1 \cdot \sin \lambda_2\right)\right)\right)\right)\right)
\end{array}
Initial program 70.7%
Simplified70.7%
associate-*r*70.7%
cos-diff91.9%
distribute-lft-in91.9%
Applied egg-rr91.9%
Taylor expanded in phi1 around 0 91.9%
fma-def91.9%
associate-*r*91.9%
*-commutative91.9%
associate-*l*91.9%
*-commutative91.9%
associate-*r*91.9%
Simplified91.9%
Final simplification91.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(+
(* (cos phi1) (* (* (cos phi2) (sin lambda1)) (sin lambda2)))
(* (cos lambda1) (* (* (cos phi1) (cos phi2)) (cos lambda2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(fma(sin(phi1), sin(phi2), ((cos(phi1) * ((cos(phi2) * sin(lambda1)) * sin(lambda2))) + (cos(lambda1) * ((cos(phi1) * cos(phi2)) * cos(lambda2))))));
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(Float64(cos(phi1) * Float64(Float64(cos(phi2) * sin(lambda1)) * sin(lambda2))) + Float64(cos(lambda1) * Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda2))))))) end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[phi2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\left(\cos \phi_2 \cdot \sin \lambda_1\right) \cdot \sin \lambda_2\right) + \cos \lambda_1 \cdot \left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_2\right)\right)\right)
\end{array}
Initial program 70.7%
Simplified70.7%
associate-*r*70.7%
cos-diff91.9%
distribute-lft-in91.9%
Applied egg-rr91.9%
Taylor expanded in phi1 around 0 91.9%
fma-def91.9%
associate-*r*91.9%
*-commutative91.9%
associate-*l*91.9%
*-commutative91.9%
associate-*r*91.9%
Simplified91.9%
Taylor expanded in phi1 around 0 91.9%
cos-neg91.9%
*-commutative91.9%
cos-neg91.9%
associate-*r*91.9%
Simplified91.9%
fma-udef91.9%
Applied egg-rr91.9%
Final simplification91.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(* (cos phi1) (cos phi2))
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))))));
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))))))) end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $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]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)
\end{array}
Initial program 70.7%
cos-diff47.6%
Applied egg-rr91.9%
cos-neg47.6%
*-commutative47.6%
fma-def47.6%
cos-neg47.6%
Simplified91.9%
Final simplification91.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= phi1 -0.0115)
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi2) (* (cos phi1) t_0)))))
(if (<= phi1 5.9e-9)
(*
R
(acos
(+
(*
t_1
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2))))
(* phi1 (sin phi2)))))
(* R (- (* PI 0.5) (asin (fma t_0 t_1 (* (sin phi1) (sin phi2))))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (phi1 <= -0.0115) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * (cos(phi1) * t_0))));
} else if (phi1 <= 5.9e-9) {
tmp = R * acos(((t_1 * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2)))) + (phi1 * sin(phi2))));
} else {
tmp = R * ((((double) M_PI) * 0.5) - asin(fma(t_0, t_1, (sin(phi1) * sin(phi2)))));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi1 <= -0.0115) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * Float64(cos(phi1) * t_0))))); elseif (phi1 <= 5.9e-9) tmp = Float64(R * acos(Float64(Float64(t_1 * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(fma(t_0, t_1, Float64(sin(phi1) * sin(phi2)))))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.0115], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 5.9e-9], N[(R * N[ArcCos[N[(N[(t$95$1 * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 * t$95$1 + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.0115:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \left(\cos \phi_1 \cdot t_0\right)\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 5.9 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(\mathsf{fma}\left(t_0, t_1, \sin \phi_1 \cdot \sin \phi_2\right)\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.0115Initial program 84.1%
log1p-expm1-u84.0%
log1p-udef84.0%
Applied egg-rr84.0%
Taylor expanded in phi1 around 0 84.0%
Simplified84.1%
if -0.0115 < phi1 < 5.8999999999999999e-9Initial program 63.9%
Taylor expanded in phi1 around 0 63.9%
cos-diff67.1%
Applied egg-rr85.4%
cos-neg67.1%
*-commutative67.1%
fma-def67.1%
cos-neg67.1%
Simplified85.4%
if 5.8999999999999999e-9 < phi1 Initial program 74.0%
acos-asin74.1%
sub-neg74.1%
div-inv74.1%
metadata-eval74.1%
+-commutative74.1%
*-commutative74.1%
fma-def74.1%
Applied egg-rr74.1%
sub-neg74.1%
sub-neg74.1%
remove-double-neg74.1%
mul-1-neg74.1%
distribute-neg-in74.1%
+-commutative74.1%
cos-neg74.1%
mul-1-neg74.1%
unsub-neg74.1%
Simplified74.1%
Final simplification82.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(* (cos phi1) (cos phi2))
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))))
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda1) * Math.cos(lambda2))))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda1) * math.cos(lambda2))))))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)
\end{array}
Initial program 70.7%
cos-diff35.5%
+-commutative35.5%
Applied egg-rr91.9%
Final simplification91.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= phi1 -0.011)
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi2) (* (cos phi1) t_0)))))
(if (<= phi1 5.9e-9)
(*
R
(acos
(+
(*
t_1
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2))))
(* phi1 (sin phi2)))))
(* R (- (* PI 0.5) (asin (fma t_0 t_1 (* (sin phi1) (sin phi2))))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (phi1 <= -0.011) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * (cos(phi1) * t_0))));
} else if (phi1 <= 5.9e-9) {
tmp = R * acos(((t_1 * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))) + (phi1 * sin(phi2))));
} else {
tmp = R * ((((double) M_PI) * 0.5) - asin(fma(t_0, t_1, (sin(phi1) * sin(phi2)))));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi1 <= -0.011) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * Float64(cos(phi1) * t_0))))); elseif (phi1 <= 5.9e-9) tmp = Float64(R * acos(Float64(Float64(t_1 * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2)))) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(fma(t_0, t_1, Float64(sin(phi1) * sin(phi2)))))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.011], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 5.9e-9], N[(R * N[ArcCos[N[(N[(t$95$1 * 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[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 * t$95$1 + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.011:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \left(\cos \phi_1 \cdot t_0\right)\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 5.9 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_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 \left(\pi \cdot 0.5 - \sin^{-1} \left(\mathsf{fma}\left(t_0, t_1, \sin \phi_1 \cdot \sin \phi_2\right)\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.010999999999999999Initial program 84.1%
log1p-expm1-u84.0%
log1p-udef84.0%
Applied egg-rr84.0%
Taylor expanded in phi1 around 0 84.0%
Simplified84.1%
if -0.010999999999999999 < phi1 < 5.8999999999999999e-9Initial program 63.9%
Taylor expanded in phi1 around 0 63.9%
cos-diff44.1%
+-commutative44.1%
Applied egg-rr85.4%
if 5.8999999999999999e-9 < phi1 Initial program 74.0%
acos-asin74.1%
sub-neg74.1%
div-inv74.1%
metadata-eval74.1%
+-commutative74.1%
*-commutative74.1%
fma-def74.1%
Applied egg-rr74.1%
sub-neg74.1%
sub-neg74.1%
remove-double-neg74.1%
mul-1-neg74.1%
distribute-neg-in74.1%
+-commutative74.1%
cos-neg74.1%
mul-1-neg74.1%
unsub-neg74.1%
Simplified74.1%
Final simplification82.0%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi1 -2.1e-15) (not (<= phi1 1.22e-157)))
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi2) (* (cos phi1) (cos (- lambda2 lambda1)))))))
(*
R
(acos
(+
(*
(* (cos phi1) (cos phi2))
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2))))
(* phi1 phi2))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi1 <= -2.1e-15) || !(phi1 <= 1.22e-157)) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * (cos(phi1) * cos((lambda2 - lambda1))))));
} else {
tmp = R * acos((((cos(phi1) * cos(phi2)) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2)))) + (phi1 * phi2)));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi1 <= -2.1e-15) || !(phi1 <= 1.22e-157)) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))))); else tmp = Float64(R * acos(Float64(Float64(Float64(cos(phi1) * cos(phi2)) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))) + Float64(phi1 * phi2)))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi1, -2.1e-15], N[Not[LessEqual[phi1, 1.22e-157]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -2.1 \cdot 10^{-15} \lor \neg \left(\phi_1 \leq 1.22 \cdot 10^{-157}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right) + \phi_1 \cdot \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -2.09999999999999981e-15 or 1.22e-157 < phi1 Initial program 75.8%
log1p-expm1-u75.8%
log1p-udef75.8%
Applied egg-rr75.8%
Taylor expanded in phi1 around 0 75.7%
Simplified75.8%
if -2.09999999999999981e-15 < phi1 < 1.22e-157Initial program 62.6%
Taylor expanded in phi1 around 0 62.6%
Taylor expanded in phi2 around 0 50.5%
cos-diff69.3%
Applied egg-rr69.3%
cos-neg69.3%
*-commutative69.3%
fma-def69.3%
cos-neg69.3%
Simplified69.3%
Final simplification73.3%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi1 -3.5e-14) (not (<= phi1 9.6e-163)))
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi2) (* (cos phi1) (cos (- lambda2 lambda1)))))))
(*
R
(acos
(+
(*
(* (cos phi1) (cos phi2))
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda1) (cos lambda2))))
(* phi1 phi2))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi1 <= -3.5e-14) || !(phi1 <= 9.6e-163)) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * (cos(phi1) * cos((lambda2 - lambda1))))));
} else {
tmp = R * acos((((cos(phi1) * cos(phi2)) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2)))) + (phi1 * phi2)));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi1 <= -3.5e-14) || !(phi1 <= 9.6e-163)) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))))); else tmp = Float64(R * acos(Float64(Float64(Float64(cos(phi1) * cos(phi2)) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2)))) + Float64(phi1 * phi2)))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi1, -3.5e-14], N[Not[LessEqual[phi1, 9.6e-163]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $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]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -3.5 \cdot 10^{-14} \lor \neg \left(\phi_1 \leq 9.6 \cdot 10^{-163}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right) + \phi_1 \cdot \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -3.5000000000000002e-14 or 9.6000000000000003e-163 < phi1 Initial program 75.0%
log1p-expm1-u75.0%
log1p-udef74.9%
Applied egg-rr74.9%
Taylor expanded in phi1 around 0 74.9%
Simplified75.0%
if -3.5000000000000002e-14 < phi1 < 9.6000000000000003e-163Initial program 63.7%
Taylor expanded in phi1 around 0 63.7%
Taylor expanded in phi2 around 0 51.3%
cos-diff42.5%
+-commutative42.5%
Applied egg-rr69.7%
Final simplification73.0%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -1.05e-228) (not (<= phi2 6.6e-64)))
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi2) (* (cos phi1) (cos (- lambda2 lambda1)))))))
(*
R
(acos
(+
(* phi1 phi2)
(*
(cos phi1)
(+
(* (sin lambda1) (sin lambda2))
(* (cos lambda1) (cos lambda2)))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.05e-228) || !(phi2 <= 6.6e-64)) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * (cos(phi1) * cos((lambda2 - lambda1))))));
} else {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -1.05e-228) || !(phi2 <= 6.6e-64)) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))))))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -1.05e-228], N[Not[LessEqual[phi2, 6.6e-64]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * 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]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.05 \cdot 10^{-228} \lor \neg \left(\phi_2 \leq 6.6 \cdot 10^{-64}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \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.04999999999999995e-228 or 6.5999999999999999e-64 < phi2 Initial program 71.8%
log1p-expm1-u71.8%
log1p-udef71.8%
Applied egg-rr71.8%
Taylor expanded in phi1 around 0 71.8%
Simplified71.8%
if -1.04999999999999995e-228 < phi2 < 6.5999999999999999e-64Initial program 67.9%
Taylor expanded in phi1 around 0 51.0%
Taylor expanded in phi2 around 0 51.0%
Taylor expanded in phi2 around 0 51.0%
cos-diff72.1%
+-commutative72.1%
Applied egg-rr72.1%
Final simplification71.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= phi2 -2.35e-228)
(*
R
(acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))
(if (<= phi2 1.4e-63)
(*
R
(acos
(+
(* phi1 phi2)
(*
(cos phi1)
(+
(* (sin lambda1) (sin lambda2))
(* (cos lambda1) (cos lambda2)))))))
(*
R
(acos
(fma (cos phi1) (* (cos phi2) (cos (- lambda2 lambda1))) t_0)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -2.35e-228) {
tmp = R * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
} else if (phi2 <= 1.4e-63) {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
} else {
tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda2 - lambda1))), t_0));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -2.35e-228) tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))))); elseif (phi2 <= 1.4e-63) tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))))))); else tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))), t_0))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -2.35e-228], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.4e-63], N[(R * N[ArcCos[N[(N[(phi1 * 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], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -2.35 \cdot 10^{-228}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.4 \cdot 10^{-63}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right), t_0\right)\right)\\
\end{array}
\end{array}
if phi2 < -2.3500000000000001e-228Initial program 70.2%
if -2.3500000000000001e-228 < phi2 < 1.4000000000000001e-63Initial program 67.9%
Taylor expanded in phi1 around 0 51.0%
Taylor expanded in phi2 around 0 51.0%
Taylor expanded in phi2 around 0 51.0%
cos-diff72.1%
+-commutative72.1%
Applied egg-rr72.1%
if 1.4000000000000001e-63 < phi2 Initial program 73.6%
Taylor expanded in phi1 around 0 73.6%
associate-*r*73.6%
fma-udef73.6%
sub-neg73.6%
neg-mul-173.6%
fma-udef73.6%
associate-*r*73.6%
fma-def73.7%
Simplified73.7%
Final simplification71.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -1.65e-228) (not (<= phi2 4.5e-63)))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))
(*
R
(acos
(+
(* phi1 phi2)
(*
(cos phi1)
(+
(* (sin lambda1) (sin lambda2))
(* (cos lambda1) (cos lambda2)))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.65e-228) || !(phi2 <= 4.5e-63)) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
} else {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if ((phi2 <= (-1.65d-228)) .or. (.not. (phi2 <= 4.5d-63))) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
else
tmp = r * acos(((phi1 * phi2) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.65e-228) || !(phi2 <= 4.5e-63)) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))));
} else {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda1) * Math.cos(lambda2))))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if (phi2 <= -1.65e-228) or not (phi2 <= 4.5e-63): tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) else: tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda1) * math.cos(lambda2)))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -1.65e-228) || !(phi2 <= 4.5e-63)) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda1) * cos(lambda2))))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if ((phi2 <= -1.65e-228) || ~((phi2 <= 4.5e-63)))
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
else
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda1) * cos(lambda2))))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -1.65e-228], N[Not[LessEqual[phi2, 4.5e-63]], $MachinePrecision]], N[(R * 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]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * 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]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.65 \cdot 10^{-228} \lor \neg \left(\phi_2 \leq 4.5 \cdot 10^{-63}\right):\\
\;\;\;\;R \cdot \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)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \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.65000000000000003e-228 or 4.5e-63 < phi2 Initial program 71.8%
if -1.65000000000000003e-228 < phi2 < 4.5e-63Initial program 67.9%
Taylor expanded in phi1 around 0 51.0%
Taylor expanded in phi2 around 0 51.0%
Taylor expanded in phi2 around 0 51.0%
cos-diff72.1%
+-commutative72.1%
Applied egg-rr72.1%
Final simplification71.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= lambda2 1.4e-14)
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (cos lambda1) (* (cos phi1) (cos phi2))))))
(if (<= lambda2 1.06e+137)
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi2) t_0))))
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi1) t_0))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (lambda2 <= 1.4e-14) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(lambda1) * (cos(phi1) * cos(phi2)))));
} else if (lambda2 <= 1.06e+137) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * t_0)));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * t_0)));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (lambda2 <= 1.4e-14) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(lambda1) * Float64(cos(phi1) * cos(phi2)))))); elseif (lambda2 <= 1.06e+137) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * t_0)))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * t_0)))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda2, 1.4e-14], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 1.06e+137], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\lambda_2 \leq 1.4 \cdot 10^{-14}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \lambda_1 \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right)\right)\\
\mathbf{elif}\;\lambda_2 \leq 1.06 \cdot 10^{+137}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot t_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot t_0\right)\right)\\
\end{array}
\end{array}
if lambda2 < 1.4e-14Initial program 73.5%
Taylor expanded in lambda2 around 0 64.7%
if 1.4e-14 < lambda2 < 1.06000000000000006e137Initial program 56.6%
Simplified56.6%
Taylor expanded in phi1 around 0 35.2%
sub-neg35.2%
neg-mul-135.2%
neg-mul-135.2%
remove-double-neg35.2%
mul-1-neg35.2%
distribute-neg-in35.2%
+-commutative35.2%
cos-neg35.2%
mul-1-neg35.2%
unsub-neg35.2%
Simplified35.2%
if 1.06000000000000006e137 < lambda2 Initial program 67.2%
Simplified67.1%
Taylor expanded in phi2 around 0 46.7%
sub-neg46.7%
remove-double-neg46.7%
mul-1-neg46.7%
distribute-neg-in46.7%
+-commutative46.7%
cos-neg46.7%
mul-1-neg46.7%
unsub-neg46.7%
Simplified46.7%
Final simplification58.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= lambda1 -3e-5)
(* R (acos (+ t_1 (* (cos lambda1) t_0))))
(* R (acos (+ (* t_0 (cos lambda2)) t_1))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (lambda1 <= -3e-5) {
tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
} else {
tmp = R * acos(((t_0 * cos(lambda2)) + t_1));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos(phi1) * cos(phi2)
t_1 = sin(phi1) * sin(phi2)
if (lambda1 <= (-3d-5)) then
tmp = r * acos((t_1 + (cos(lambda1) * t_0)))
else
tmp = r * acos(((t_0 * cos(lambda2)) + t_1))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi1) * Math.cos(phi2);
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda1 <= -3e-5) {
tmp = R * Math.acos((t_1 + (Math.cos(lambda1) * t_0)));
} else {
tmp = R * Math.acos(((t_0 * Math.cos(lambda2)) + t_1));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi1) * math.cos(phi2) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda1 <= -3e-5: tmp = R * math.acos((t_1 + (math.cos(lambda1) * t_0))) else: tmp = R * math.acos(((t_0 * math.cos(lambda2)) + t_1)) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda1 <= -3e-5) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(lambda1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(t_0 * cos(lambda2)) + t_1))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi1) * cos(phi2);
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda1 <= -3e-5)
tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
else
tmp = R * acos(((t_0 * cos(lambda2)) + t_1));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -3e-5], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[lambda1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(t$95$0 * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -3 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \lambda_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 \cdot \cos \lambda_2 + t_1\right)\\
\end{array}
\end{array}
if lambda1 < -3.00000000000000008e-5Initial program 60.1%
Taylor expanded in lambda2 around 0 60.5%
if -3.00000000000000008e-5 < lambda1 Initial program 74.7%
Taylor expanded in lambda1 around 0 59.9%
cos-neg20.6%
Simplified59.9%
Final simplification60.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2)))))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)
\end{array}
Initial program 70.7%
Final simplification70.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -0.96)
(*
R
(acos
(fma (sin phi1) (sin phi2) (* (cos phi1) (cos (- lambda2 lambda1))))))
(*
R
(acos
(+
(* phi1 (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.96) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.96) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.96], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[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[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.96:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.95999999999999996Initial program 83.7%
Simplified83.8%
Taylor expanded in phi2 around 0 48.6%
sub-neg48.6%
remove-double-neg48.6%
mul-1-neg48.6%
distribute-neg-in48.6%
+-commutative48.6%
cos-neg48.6%
mul-1-neg48.6%
unsub-neg48.6%
Simplified48.6%
if -0.95999999999999996 < phi1 Initial program 67.5%
Taylor expanded in phi1 around 0 50.0%
Final simplification49.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi2 6.2e-10)
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi1) t_0))))
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi2) t_0)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 6.2e-10) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * t_0)));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * t_0)));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 6.2e-10) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * t_0)))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 6.2e-10], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 6.2 \cdot 10^{-10}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot t_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot t_0\right)\right)\\
\end{array}
\end{array}
if phi2 < 6.2000000000000003e-10Initial program 69.2%
Simplified69.1%
Taylor expanded in phi2 around 0 51.3%
sub-neg51.3%
remove-double-neg51.3%
mul-1-neg51.3%
distribute-neg-in51.3%
+-commutative51.3%
cos-neg51.3%
mul-1-neg51.3%
unsub-neg51.3%
Simplified51.3%
if 6.2000000000000003e-10 < phi2 Initial program 74.7%
Simplified74.8%
Taylor expanded in phi1 around 0 47.9%
sub-neg47.9%
neg-mul-147.9%
neg-mul-147.9%
remove-double-neg47.9%
mul-1-neg47.9%
distribute-neg-in47.9%
+-commutative47.9%
cos-neg47.9%
mul-1-neg47.9%
unsub-neg47.9%
Simplified47.9%
Final simplification50.4%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
(if (<= phi1 -5000.0)
(* R (acos (+ t_0 (* (sin phi1) phi2))))
(* R (acos (+ (* phi1 (sin phi2)) t_0))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -5000.0) {
tmp = R * acos((t_0 + (sin(phi1) * phi2)));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + t_0));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = (cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))
if (phi1 <= (-5000.0d0)) then
tmp = r * acos((t_0 + (sin(phi1) * phi2)))
else
tmp = r * acos(((phi1 * sin(phi2)) + t_0))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -5000.0) {
tmp = R * Math.acos((t_0 + (Math.sin(phi1) * phi2)));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + t_0));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = (math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2)) tmp = 0 if phi1 <= -5000.0: tmp = R * math.acos((t_0 + (math.sin(phi1) * phi2))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + t_0)) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi1 <= -5000.0) tmp = Float64(R * acos(Float64(t_0 + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + t_0))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = (cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2));
tmp = 0.0;
if (phi1 <= -5000.0)
tmp = R * acos((t_0 + (sin(phi1) * phi2)));
else
tmp = R * acos(((phi1 * sin(phi2)) + t_0));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -5000.0], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -5000:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + t_0\right)\\
\end{array}
\end{array}
if phi1 < -5e3Initial program 83.4%
Taylor expanded in phi2 around 0 41.4%
if -5e3 < phi1 Initial program 67.7%
Taylor expanded in phi1 around 0 49.7%
Final simplification48.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))))
(if (<= lambda2 3.25e-12)
(* R (acos (+ (* phi1 (sin phi2)) (* (cos lambda1) t_0))))
(* R (acos (+ (* phi1 phi2) (* t_0 (cos (- lambda1 lambda2)))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double tmp;
if (lambda2 <= 3.25e-12) {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(lambda1) * t_0)));
} else {
tmp = R * acos(((phi1 * phi2) + (t_0 * cos((lambda1 - lambda2)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos(phi1) * cos(phi2)
if (lambda2 <= 3.25d-12) then
tmp = r * acos(((phi1 * sin(phi2)) + (cos(lambda1) * t_0)))
else
tmp = r * acos(((phi1 * phi2) + (t_0 * cos((lambda1 - lambda2)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi1) * Math.cos(phi2);
double tmp;
if (lambda2 <= 3.25e-12) {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(lambda1) * t_0)));
} else {
tmp = R * Math.acos(((phi1 * phi2) + (t_0 * Math.cos((lambda1 - lambda2)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi1) * math.cos(phi2) tmp = 0 if lambda2 <= 3.25e-12: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(lambda1) * t_0))) else: tmp = R * math.acos(((phi1 * phi2) + (t_0 * math.cos((lambda1 - lambda2))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (lambda2 <= 3.25e-12) tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(lambda1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(t_0 * cos(Float64(lambda1 - lambda2)))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi1) * cos(phi2);
tmp = 0.0;
if (lambda2 <= 3.25e-12)
tmp = R * acos(((phi1 * sin(phi2)) + (cos(lambda1) * t_0)));
else
tmp = R * acos(((phi1 * phi2) + (t_0 * cos((lambda1 - lambda2)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 3.25e-12], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\lambda_2 \leq 3.25 \cdot 10^{-12}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \lambda_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if lambda2 < 3.2500000000000001e-12Initial program 73.7%
Taylor expanded in phi1 around 0 45.2%
Taylor expanded in lambda2 around 0 38.2%
if 3.2500000000000001e-12 < lambda2 Initial program 61.9%
Taylor expanded in phi1 around 0 38.5%
Taylor expanded in phi2 around 0 36.0%
Final simplification37.6%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* phi1 (sin phi2))))
(if (<= lambda1 -0.00031)
(* R (acos (+ t_1 (* (cos lambda1) t_0))))
(* R (acos (+ (* t_0 (cos lambda2)) t_1))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double t_1 = phi1 * sin(phi2);
double tmp;
if (lambda1 <= -0.00031) {
tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
} else {
tmp = R * acos(((t_0 * cos(lambda2)) + t_1));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos(phi1) * cos(phi2)
t_1 = phi1 * sin(phi2)
if (lambda1 <= (-0.00031d0)) then
tmp = r * acos((t_1 + (cos(lambda1) * t_0)))
else
tmp = r * acos(((t_0 * cos(lambda2)) + t_1))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi1) * Math.cos(phi2);
double t_1 = phi1 * Math.sin(phi2);
double tmp;
if (lambda1 <= -0.00031) {
tmp = R * Math.acos((t_1 + (Math.cos(lambda1) * t_0)));
} else {
tmp = R * Math.acos(((t_0 * Math.cos(lambda2)) + t_1));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi1) * math.cos(phi2) t_1 = phi1 * math.sin(phi2) tmp = 0 if lambda1 <= -0.00031: tmp = R * math.acos((t_1 + (math.cos(lambda1) * t_0))) else: tmp = R * math.acos(((t_0 * math.cos(lambda2)) + t_1)) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) t_1 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda1 <= -0.00031) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(lambda1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(t_0 * cos(lambda2)) + t_1))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi1) * cos(phi2);
t_1 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda1 <= -0.00031)
tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
else
tmp = R * acos(((t_0 * cos(lambda2)) + t_1));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -0.00031], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[lambda1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(t$95$0 * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
t_1 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -0.00031:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \lambda_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 \cdot \cos \lambda_2 + t_1\right)\\
\end{array}
\end{array}
if lambda1 < -3.1e-4Initial program 60.1%
Taylor expanded in phi1 around 0 36.2%
Taylor expanded in lambda2 around 0 36.5%
if -3.1e-4 < lambda1 Initial program 74.7%
Taylor expanded in phi1 around 0 46.2%
Taylor expanded in lambda1 around 0 38.2%
cos-neg20.6%
Simplified38.2%
Final simplification37.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* phi1 (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi1 * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((phi1 * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi1 * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2)))))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi1 * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * 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]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)
\end{array}
Initial program 70.7%
Taylor expanded in phi1 around 0 43.5%
Final simplification43.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))))
(if (<= lambda1 -0.00043)
(* R (acos (+ (* phi1 phi2) (* (cos lambda1) t_0))))
(* R (acos (+ (* t_0 (cos lambda2)) (* phi1 phi2)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double tmp;
if (lambda1 <= -0.00043) {
tmp = R * acos(((phi1 * phi2) + (cos(lambda1) * t_0)));
} else {
tmp = R * acos(((t_0 * cos(lambda2)) + (phi1 * phi2)));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos(phi1) * cos(phi2)
if (lambda1 <= (-0.00043d0)) then
tmp = r * acos(((phi1 * phi2) + (cos(lambda1) * t_0)))
else
tmp = r * acos(((t_0 * cos(lambda2)) + (phi1 * phi2)))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi1) * Math.cos(phi2);
double tmp;
if (lambda1 <= -0.00043) {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(lambda1) * t_0)));
} else {
tmp = R * Math.acos(((t_0 * Math.cos(lambda2)) + (phi1 * phi2)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi1) * math.cos(phi2) tmp = 0 if lambda1 <= -0.00043: tmp = R * math.acos(((phi1 * phi2) + (math.cos(lambda1) * t_0))) else: tmp = R * math.acos(((t_0 * math.cos(lambda2)) + (phi1 * phi2))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (lambda1 <= -0.00043) tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(lambda1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(t_0 * cos(lambda2)) + Float64(phi1 * phi2)))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi1) * cos(phi2);
tmp = 0.0;
if (lambda1 <= -0.00043)
tmp = R * acos(((phi1 * phi2) + (cos(lambda1) * t_0)));
else
tmp = R * acos(((t_0 * cos(lambda2)) + (phi1 * phi2)));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -0.00043], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(t$95$0 * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\lambda_1 \leq -0.00043:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \lambda_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 \cdot \cos \lambda_2 + \phi_1 \cdot \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -4.29999999999999989e-4Initial program 60.1%
Taylor expanded in phi1 around 0 36.2%
Taylor expanded in phi2 around 0 29.0%
Taylor expanded in lambda2 around 0 29.3%
if -4.29999999999999989e-4 < lambda1 Initial program 74.7%
Taylor expanded in phi1 around 0 46.2%
Taylor expanded in phi2 around 0 36.9%
Taylor expanded in lambda1 around 0 30.2%
cos-neg20.6%
Simplified30.2%
Final simplification29.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* phi1 phi2) (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi1 * phi2) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((phi1 * phi2) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi1 * phi2) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * phi2) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2)))))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi1 * phi2) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)
\end{array}
Initial program 70.7%
Taylor expanded in phi1 around 0 43.5%
Taylor expanded in phi2 around 0 34.7%
Final simplification34.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi1 -2e-8)
(* R (acos (+ (* phi1 phi2) (* (cos phi1) t_0))))
(* R (acos (+ (* phi1 phi2) (* (cos phi2) t_0)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -2e-8) {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * t_0)));
} else {
tmp = R * acos(((phi1 * phi2) + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda1 - lambda2))
if (phi1 <= (-2d-8)) then
tmp = r * acos(((phi1 * phi2) + (cos(phi1) * t_0)))
else
tmp = r * acos(((phi1 * phi2) + (cos(phi2) * t_0)))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -2e-8) {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * t_0)));
} else {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi2) * t_0)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) tmp = 0 if phi1 <= -2e-8: tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * t_0))) else: tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi2) * t_0))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi1 <= -2e-8) tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi2) * t_0)))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda1 - lambda2));
tmp = 0.0;
if (phi1 <= -2e-8)
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * t_0)));
else
tmp = R * acos(((phi1 * phi2) + (cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -2e-8], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -2 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
if phi1 < -2e-8Initial program 84.1%
Taylor expanded in phi1 around 0 17.1%
Taylor expanded in phi2 around 0 16.5%
Taylor expanded in phi2 around 0 16.5%
if -2e-8 < phi1 Initial program 67.4%
Taylor expanded in phi1 around 0 50.1%
Taylor expanded in phi2 around 0 39.3%
Taylor expanded in phi1 around 0 34.1%
Final simplification30.6%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -105.0) (* R (acos (+ (* phi1 phi2) (* (cos lambda1) (cos phi1))))) (* R (acos (+ (cos (- lambda2 lambda1)) (* phi1 phi2))))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -105.0) {
tmp = R * acos(((phi1 * phi2) + (cos(lambda1) * cos(phi1))));
} else {
tmp = R * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-105.0d0)) then
tmp = r * acos(((phi1 * phi2) + (cos(lambda1) * cos(phi1))))
else
tmp = r * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -105.0) {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(lambda1) * Math.cos(phi1))));
} else {
tmp = R * Math.acos((Math.cos((lambda2 - lambda1)) + (phi1 * phi2)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -105.0: tmp = R * math.acos(((phi1 * phi2) + (math.cos(lambda1) * math.cos(phi1)))) else: tmp = R * math.acos((math.cos((lambda2 - lambda1)) + (phi1 * phi2))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -105.0) tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(lambda1) * cos(phi1))))); else tmp = Float64(R * acos(Float64(cos(Float64(lambda2 - lambda1)) + Float64(phi1 * phi2)))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -105.0)
tmp = R * acos(((phi1 * phi2) + (cos(lambda1) * cos(phi1))));
else
tmp = R * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -105.0], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -105:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \lambda_1 \cdot \cos \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \left(\lambda_2 - \lambda_1\right) + \phi_1 \cdot \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -105Initial program 83.4%
Taylor expanded in phi1 around 0 17.2%
Taylor expanded in phi2 around 0 17.2%
Taylor expanded in phi2 around 0 17.2%
Taylor expanded in lambda2 around 0 13.5%
if -105 < phi1 Initial program 67.7%
Taylor expanded in phi1 around 0 49.7%
Taylor expanded in phi2 around 0 38.9%
Taylor expanded in phi2 around 0 28.6%
Taylor expanded in phi1 around 0 23.5%
cos-neg23.5%
sub-neg23.5%
+-commutative23.5%
distribute-neg-in23.5%
remove-double-neg23.5%
sub-neg23.5%
Simplified23.5%
Final simplification21.6%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 5.5e-36) (* R (acos (+ (* phi1 phi2) (* (cos lambda1) (cos phi1))))) (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos lambda2)))))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 5.5e-36) {
tmp = R * acos(((phi1 * phi2) + (cos(lambda1) * cos(phi1))));
} else {
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 5.5d-36) then
tmp = r * acos(((phi1 * phi2) + (cos(lambda1) * cos(phi1))))
else
tmp = r * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 5.5e-36) {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(lambda1) * Math.cos(phi1))));
} else {
tmp = R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos(lambda2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 5.5e-36: tmp = R * math.acos(((phi1 * phi2) + (math.cos(lambda1) * math.cos(phi1)))) else: tmp = R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos(lambda2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 5.5e-36) tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(lambda1) * cos(phi1))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(lambda2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 5.5e-36)
tmp = R * acos(((phi1 * phi2) + (cos(lambda1) * cos(phi1))));
else
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 5.5e-36], N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 5.5 \cdot 10^{-36}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \lambda_1 \cdot \cos \phi_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 lambda2 < 5.49999999999999984e-36Initial program 73.7%
Taylor expanded in phi1 around 0 45.1%
Taylor expanded in phi2 around 0 34.5%
Taylor expanded in phi2 around 0 26.9%
Taylor expanded in lambda2 around 0 22.4%
if 5.49999999999999984e-36 < lambda2 Initial program 62.9%
Taylor expanded in phi1 around 0 39.4%
Taylor expanded in phi2 around 0 35.4%
Taylor expanded in phi2 around 0 25.2%
Taylor expanded in lambda1 around 0 25.1%
cos-neg25.1%
Simplified25.1%
Final simplification23.2%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* phi1 phi2) (* (cos phi1) (cos (- lambda1 lambda2)))))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda1 - lambda2)))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda1 - lambda2)))))
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi1 * phi2) + (Math.cos(phi1) * Math.cos((lambda1 - lambda2)))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * phi2) + (math.cos(phi1) * math.cos((lambda1 - lambda2)))))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi1 * phi2) + Float64(cos(phi1) * cos(Float64(lambda1 - lambda2)))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi1 * phi2) + (cos(phi1) * cos((lambda1 - lambda2)))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)
\end{array}
Initial program 70.7%
Taylor expanded in phi1 around 0 43.5%
Taylor expanded in phi2 around 0 34.7%
Taylor expanded in phi2 around 0 26.4%
Final simplification26.4%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (cos (- lambda2 lambda1)) (* phi1 phi2)))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)))
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos((Math.cos((lambda2 - lambda1)) + (phi1 * phi2)));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos((math.cos((lambda2 - lambda1)) + (phi1 * phi2)))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(cos(Float64(lambda2 - lambda1)) + Float64(phi1 * phi2)))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \left(\lambda_2 - \lambda_1\right) + \phi_1 \cdot \phi_2\right)
\end{array}
Initial program 70.7%
Taylor expanded in phi1 around 0 43.5%
Taylor expanded in phi2 around 0 34.7%
Taylor expanded in phi2 around 0 26.4%
Taylor expanded in phi1 around 0 19.9%
cos-neg19.9%
sub-neg19.9%
+-commutative19.9%
distribute-neg-in19.9%
remove-double-neg19.9%
sub-neg19.9%
Simplified19.9%
Final simplification19.9%
herbie shell --seed 2023299
(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))