A Tutorial on the SWEEP Operator
- 1 August 1979
- journal article
- research article
- Published by Taylor & Francis in The American Statistician
- Vol. 33 (3) , 149-158
- https://doi.org/10.1080/00031305.1979.10482685
Abstract
The importance of the SWEEP operator in statistical computing is not so much that it is an inversion technique, but rather that it is a conceptual tool for understanding the least squares process. The SWEEP operator can be programmed to produce generalized inverses and create, as by-products, such items as the Forward Doolittle matrix, the Cholesky decomposition matrix, the Hermite canonical form matrix, the determinant of the original matrix, Type I sums of squares, the error sum of squares, a solution to the normal equations, and the general form of estimable functions. First, this tutorial describes the use of Gauss-Jordan elimination for least squares and continues with a description of a completely generalized sweep operator that computes and stores (X′X)−, (X′X)− X′X, (X′X)− X′Y, and Y′Y — Y′X(X′X)− X′Y, all in the space of a single upper triangular matrix.Keywords
This publication has 6 references indexed in Scilit:
- Tolerance and Condition in Regression ComputationsJournal of the American Statistical Association, 1977
- A Note on Checking Tolerance in Matrix Inversion and RegressionTechnometrics, 1977
- The Acceptability of Regression Solutions: Another Look at Computational AccuracyJournal of the American Statistical Association, 1976
- Efficient Calculation of All Possible RegressionsTechnometrics, 1968
- THE USE OF SPECIAL MATRIX OPERATORS IN STATISTICAL CALCULUSETS Research Bulletin Series, 1964
- Error Analysis of Direct Methods of Matrix InversionJournal of the ACM, 1961