A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Computation of Baarda’s lower bound of the non-centrality parameter
Abstract. Baarda’s reliability measures for outliers, as well as sensitivity and separability measures for deformations, are functions of the lower bound of the non-centrality parameter (LBNP). This parameter, which is taken from Baarda’s well-known nomograms, is actually a non-centrality parameter of the cumulative distribution function (CDF) of the non-central $ χ^{2} $-distribution yielding a complementary probability of the desired power of the test, i.e. probability of Type II error. It is investigated how the LBNP can be computed for desired probabilities (power of the test and significance level) and known degrees of freedom. Two recursive algorithms, namely bisection and the Newton algorithm, were applied to compute the LBNP after the definition of a stable and accurate algorithm for the computation of the corresponding CDF. Despite the fact that the recursive algorithms ensure some desired accuracy, it is presented numerically that the Newton algorithm has a faster convergence to the solution than the bisection algorithm.
Computation of Baarda’s lower bound of the non-centrality parameter
Abstract. Baarda’s reliability measures for outliers, as well as sensitivity and separability measures for deformations, are functions of the lower bound of the non-centrality parameter (LBNP). This parameter, which is taken from Baarda’s well-known nomograms, is actually a non-centrality parameter of the cumulative distribution function (CDF) of the non-central $ χ^{2} $-distribution yielding a complementary probability of the desired power of the test, i.e. probability of Type II error. It is investigated how the LBNP can be computed for desired probabilities (power of the test and significance level) and known degrees of freedom. Two recursive algorithms, namely bisection and the Newton algorithm, were applied to compute the LBNP after the definition of a stable and accurate algorithm for the computation of the corresponding CDF. Despite the fact that the recursive algorithms ensure some desired accuracy, it is presented numerically that the Newton algorithm has a faster convergence to the solution than the bisection algorithm.
Computation of Baarda’s lower bound of the non-centrality parameter
Aydin, C. (author) / Demirel, H. (author)
Journal of Geodesy ; 78
2004
Article (Journal)
English
BKL:
38.73
Geodäsie
Computation of Baarda’s lower bound of the non-centrality parameter
| Online Contents | 2004
Revisiting Baarda’s concept of minimal detectable bias with regard to outlier identifiability
| Online Contents | 2015
| Taylor & Francis Verlag | 2021
| DataCite | 2012
Challenges in the computation of lower-bound buckling loads for tanks under wind pressures
| Online Contents | 2010