Algorithm 616: fast computation of the Hodges-Lehmann location estimator
HLQEST is a FORTRAN function subprogram for computing the estimator of \textit{J. L. Hodges} and \textit{E. L. Lehmann} [Ann. Math. Stat. 34, 598-611 (1963; Zbl 0203.211)] \[ {\hat \mu}\equiv median\{(X_ i+X_ j)/2,\quad 1\leq i\leq j\leq n\}. \] This robust and highly efficient estimator has not been widely used by statisticians because its apparent time computational complexity is \(O(n^ 2 \log n)\). Improvements in computing \({\hat \mu}\) have previously been made with an iterative algorithm and with some fast theoretical techniques. HLQEST is exact and fast, with expected time complexity of O(n log n).
- Efficient calculation of hodges-lehmann estimators of location
- A Note on the Hodges–Lehmann Estimator and the Logistic Distribution
- scientific article; zbMATH DE number 4131434
- A new Method of Estimating the Asymptotic Standard Error of the Hodges-Lehmann Estimator Based on Generalized Least Squares
- scientific article; zbMATH DE number 4151602
- Weighted selectin for the multiset x∓xwith application to r–estimates and associated confidence limits
- R-Estimator of Location of the Generalized Secant Hyperbolic Distribution
- Efficient calculation of hodges-lehmann estimators of location
- A new Method of Estimating the Asymptotic Standard Error of the Hodges-Lehmann Estimator Based on Generalized Least Squares
- Algorithm 1034: an accelerated algorithm to compute the \(Q_n\) robust statistic, with corrections to constants
This page was built for publication: Algorithm 616: fast computation of the Hodges-Lehmann location estimator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343393)