Efficient sorting during repetitive statistical computations: Algorithms and an application
DOI10.1016/0167-9473(89)90045-5zbMATH Open0726.62001OpenAlexW2075314970MaRDI QIDQ804105FDOQ804105
Authors: 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
Recommendations
Probabilistic methods, stochastic differential equations (65C99) Software, source code, etc. for problems pertaining to statistics (62-04) Order statistics; empirical distribution functions (62G30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms and complexity for least median of squares regression
- Estimating Regression Coefficients by Minimizing the Dispersion of the Residuals
- Estimates of the Regression Coefficient Based on Kendall's Tau
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implementing Quicksort programs
- Numerical Methods for Robust Regression: Linear Models
- 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
- Title not available (Why is that?)
- A Robust Alternative Based on Ranks to Least Squares in Analyzing Linear Models
Cited In (1)
Uses Software
This page was built for publication: Efficient sorting during repetitive statistical computations: Algorithms and an application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804105)