z-logo
Premium
A least squares method for computing statistical tolerance limits
Author(s) -
Wallace J. R.,
Grant J. L.
Publication year - 1977
Publication title -
water resources research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.863
H-Index - 217
eISSN - 1944-7973
pISSN - 0043-1397
DOI - 10.1029/wr013i005p00819
Subject(s) - mathematics , statistics , population , order statistic , percentile , confidence interval , probability density function , statistic , sampling distribution , location parameter , limit (mathematics) , point estimation , probability distribution , mathematical analysis , demography , sociology
Statistical analysis often requires the fitting of a probability density function to sample data in order to estimate either the population parameters or a particular percentile point of the population. In either case the exact determination of the population values cannot be expected because a sample generally does not completely describe the population. The theories of statistical confidence regions and tolerance limits allow inferences to be drawn regarding relationships between the estimates and the corresponding unknown population values. A least squares procedure has been devised which allows the construction of confidence regions and tolerance limits for arbitrary distribution functions. The class errors, e i , are defined as the difference between the sample histogram and the expected frequency based upon the density function. The confidence region is defined by the relation R α = {θ : [ R 1 ( e )/ R 2 ( e )] < [ m /( N − m )] F (α, m, N − m )}, where θ represents the m ‐dimensional parameter vector of the distribution function, R 1 ( e ) and R 2 ( e ) represent decompositions of ∑ e i 2 of ranks m and N − m , respectively, and F is Snedecor's F statistic. The η tolerance limit of the γ percentile point is found from the relation υ γ , η   =   max θ ∈ R η{ υ : ∫ ∞ υ p ( x ,   θ )   d x   =   γ } .

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here