Methods of Computing PK for the Offset Circle Problem
Technical rept. Apr 1969-Apr 1971
AIR FORCE WEAPONS LAB KIRTLAND AFB NM
Pagination or Media Count:
Four methods are surveyed briefly for computing the probability of kill PK for the offset circle problem which cannot be solved in closed form. ASA FORTRAN routines for these methods are presented. When ranked according to increasing accuracy, the order is the Wilson-Hilferty W-H approximation, the Pearson-Wilson-Hilferty P-W-H approximation, the Germond-Wegner GW approximation, and the series expansion SE approximation. When ranked according to increasing machine time requirements, the order is G-W, W-H, P-W-H, SE with the G-W approximation requiring 30 percent as much time as the SE.
- Fire Control and Bombing Systems