Abstract
A fast implementation of a formerly [5] published algorithm is given.
Zusammenfassung
Für einen früher publizierten Algorithmus [5] wird eine schnelle Implementation angegeben.
Similar content being viewed by others
References
Daniel, J. W., Gragg, W. B., Kaufman, L., Stewart, G. W.: Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comp.30, 722–795 (1976).
Gentleman, M. W.: Least squares computations by Givens transformations without square roots. J. Inst. Maths Applics12, 329–336 (1973).
Gentleman, M. W.: Algorithm AS 75. Basic procedures for large, sparse or weighted least squares problems. Appl. Statist.23, 448–454 (1974).
Gragg, W. B., Leveque, R. J., Trangenstein, J. A.: Numerically stable methods for updating regressions. J. Am. Statist. Ass.74, 161–168 (1979).
Späth, H.: Algorithm 39. Clusterwise linear regression. Computing22, 367–373 (1979).
Späth, H.: Cluster analysis algorithms for data reduction and classification of objects. Chichester 1980.
Späth, H.: correction to Algorithm 39. Clusterwise linear regression. Computing26, 275 (1981).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Späth, H. A fast algorithm for clusterwise linear regression. Computing 29, 175–181 (1982). https://doi.org/10.1007/BF02249940
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02249940