Efficient sorting during repetitive statistical computations: Algorithms and an application

DOI10.1016/0167-9473(89)90045-5zbMath0726.62001OpenAlexW2075314970MaRDI QIDQ804105

John R. Gleason

Publication date: 1989

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9473(89)90045-5

zbMATH Keywords

order statisticsranksQuicksortJaeckel's robust estimatorquantile findersrank methodsShellsort

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistics (62-04) Order statistics; empirical distribution functions (62G30) Probabilistic methods, stochastic differential equations (65C99)

Uses Software

• BRENT
• Quicksort
• Algorithm 489
• Algorithm 347

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms and complexity for least median of squares regression
• Rank based robust analysis of linear models. I: Exposition and review. With comments and a rejoinder by the author
• The Resistant Line and Related Regression Methods
• A new upper bound for Shellsort
• A Robust Alternative Based on Ranks to Least Squares in Analyzing Linear Models
• Implementing Quicksort programs
• Estimating Regression Coefficients by Minimizing the Dispersion of the Residuals
• Numerical Methods for Robust Regression: Linear Models
• Estimates of the Regression Coefficient Based on Kendall's Tau

This page was built for publication: Efficient sorting during repetitive statistical computations: Algorithms and an application