R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)double f(double R, double lambda1, double lambda2, double phi1, double phi2) {
double r86253 = R;
double r86254 = lambda1;
double r86255 = lambda2;
double r86256 = r86254 - r86255;
double r86257 = phi1;
double r86258 = phi2;
double r86259 = r86257 + r86258;
double r86260 = 2.0;
double r86261 = r86259 / r86260;
double r86262 = cos(r86261);
double r86263 = r86256 * r86262;
double r86264 = r86263 * r86263;
double r86265 = r86257 - r86258;
double r86266 = r86265 * r86265;
double r86267 = r86264 + r86266;
double r86268 = sqrt(r86267);
double r86269 = r86253 * r86268;
return r86269;
}
double f(double R, double lambda1, double lambda2, double phi1, double phi2) {
double r86270 = R;
double r86271 = lambda1;
double r86272 = lambda2;
double r86273 = r86271 - r86272;
double r86274 = phi1;
double r86275 = phi2;
double r86276 = r86274 + r86275;
double r86277 = 2.0;
double r86278 = r86276 / r86277;
double r86279 = cos(r86278);
double r86280 = r86273 * r86279;
double r86281 = r86274 - r86275;
double r86282 = hypot(r86280, r86281);
double r86283 = r86270 * r86282;
return r86283;
}



Bits error versus R



Bits error versus lambda1



Bits error versus lambda2



Bits error versus phi1



Bits error versus phi2
Results
Initial program 39.4
Simplified3.7
rmApplied *-commutative3.7
Final simplification3.7
herbie shell --seed 2019195 +o rules:numerics
(FPCore (R lambda1 lambda2 phi1 phi2)
:name "Equirectangular approximation to distance on a great circle"
(* R (sqrt (+ (* (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))) (* (- phi1 phi2) (- phi1 phi2))))))