Abstract
Mehta, Patel, and Gray proposed a network algorithm for the exact confidence limits of the common odds ratio in several 2x2 tables. Their algorithm was implemented in the StatXact and Egret statistical packages and further discussed by Vollset, Hirji, and Elashoff. The need to evaluate polynomials of potentially very high degrees, however, poses some numerical difficulties. This article presents a method that cuts the degree of polynomials by at least one half. Two other modifications to further stabilize and speed the computation are also proposed.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 173-179 |
| Number of pages | 7 |
| Journal | Journal of Computational and Graphical Statistics |
| Volume | 4 |
| Issue number | 3 |
| DOIs | |
| State | Published - Sep 1995 |
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Discrete Mathematics and Combinatorics
- Statistics, Probability and Uncertainty