A System of Subroutines for Iteratively Reweighted Least Squares Computations

79Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

A decription of a system of subroutines to compute solutions to the iteratively reweighted least squares problem is presented. The weights are determined from the data and linear fit and are computed as functions of the scaled residuals. Iteratively reweighted least squares is a part of robust statlstms where “robustness” means relative insensltlwty to moderate departures from assumptions. The software for iteratively rewelghted least squares is cast as semiportable Fortran code whose performance is unaffected (m the sense that performance will not be degraded) by the computer or operating-system environment in which it is used. An start and an t2 start are provided. Eight weight functions, a numerical rank determination, a convergence criterion, and a stem-and-leaf display are included. © 1980, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Coleman, D., Holland, P., Kaden, N., Klema, V., & Peters, S. C. (1980). A System of Subroutines for Iteratively Reweighted Least Squares Computations. ACM Transactions on Mathematical Software (TOMS), 6(3), 327–336. https://doi.org/10.1145/355900.355905

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free