## Efficient Recursions for Truncation of the SPRT |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

accept HQ accumulate actual error probabilities Ann Arbor approximate Aroian and Robison choose close computing conservative constant curve density function Department desired error probabilities different values distributed EFFICIENT RECURSIONS equal equation example expected number Figure find the smallest given gives Golhar and Pollock guarantee Hence holds IID Normal random increases independent integer truncation point Johnson Kalamazoo less linear relationship maximum number memory nature needed normal random variables Note number of observations obtained by rounding operating characteristic function order of km parameters plot present log-likelihood ratio procedure produce proposed random variable Zn recursive method reject HQ relation represent respect resulting round-off errors rule samples sequential sets shown by Golhar shows simple relationship Slope smaller SPRT standard error stopping bounds suggests Table taken term true type I error University of Michigan values shown Wald Wald's bounds Western Michigan University