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)}\mathsf{hypot}\left(\mathsf{fma}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(0.5 \cdot \phi_2\right), \lambda_1, \sin \left(0.5 \cdot \phi_2\right) \cdot \left(\lambda_2 \cdot \sin \left(0.5 \cdot \phi_1\right)\right) - \mathsf{fma}\left(\cos \left(0.5 \cdot \phi_2\right), \cos \left(0.5 \cdot \phi_1\right) \cdot \lambda_2, \sin \left(0.5 \cdot \phi_2\right) \cdot \left(\sin \left(0.5 \cdot \phi_1\right) \cdot \lambda_1\right)\right)\right), \phi_1 - \phi_2\right) \cdot Rdouble code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return (R * sqrt(((((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))) * ((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)))) + ((phi1 - phi2) * (phi1 - phi2)))));
}
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return (hypot(fma((cos((0.5 * phi1)) * cos((0.5 * phi2))), lambda1, ((sin((0.5 * phi2)) * (lambda2 * sin((0.5 * phi1)))) - fma(cos((0.5 * phi2)), (cos((0.5 * phi1)) * lambda2), (sin((0.5 * phi2)) * (sin((0.5 * phi1)) * lambda1))))), (phi1 - phi2)) * R);
}



Bits error versus R



Bits error versus lambda1



Bits error versus lambda2



Bits error versus phi1



Bits error versus phi2
Results
Initial program 39.0
Simplified4.0
Taylor expanded around inf 4.0
Simplified4.0
rmApplied distribute-lft-in4.0
Applied cos-sum0.1
Simplified0.1
Simplified0.1
Taylor expanded around inf 0.1
Simplified0.1
Final simplification0.1
herbie shell --seed 2020053 +o rules:numerics
(FPCore (R lambda1 lambda2 phi1 phi2)
:name "Equirectangular approximation to distance on a great circle"
:precision binary64
(* R (sqrt (+ (* (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2))) (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2)))) (* (- phi1 phi2) (- phi1 phi2))))))