Methods of Computing PK for the Offset Circle Problem
Abstract
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1971
- Accession Number
- AD0729886
Entities
People
- Jason Williams
Organizations
- Air Force Research Laboratory