Clusterwise linear regression. (English) Zbl 0387.65028


65F20 Numerical solutions to overdetermined systems, pseudoinverses
65K05 Numerical mathematical programming methods
Full Text: DOI


[1] Barrodale, I., Young, A.: Algorithms for bestL 1 andL linear approximation on a discrete set. Numer. Math.8, 295–306 (1966). · Zbl 0173.18801
[2] Barrodale, I., Young, A.: An improved algorithm for discreteL 1 linear approximation. SIAM J. Numer. An.10, 839–848 (1973). · Zbl 0266.65016
[3] Businger, P. A.: Updating a singular value decomposition. BIT10, 376–397 (1970).
[4] Cromme, L.: Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm. Computing21, 37–52 (1978). · Zbl 0435.65010
[5] Dinkelbach, W.: Sensitivitätsanalysen und parametrische Programmierung. Berlin-Heidelberg-New York: Springer 1969. · Zbl 0174.51404
[6] Fakiner, H., Krieger, E., Rohmeier, H.: Regional differenzierte Analyse und Prognose des Wasserbedafs der privaten Haushalte in der Bundesrepublik Deutschland. In: Fallstudien Cluster-Analyse (Späth, H., Hrsg.). München: R. Oldenbourg 1977.
[7] Daniel, J. W., Gragg, W. B., Kaufman, L., Stewart, G. W.: Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. of Comput.30, 772–795 (1976). · Zbl 0345.65021
[8] Lawson, C. L., Hanson, R. J.: Solving least squares problems. Englewood Cliffs: Prentice-Hall 1974. · Zbl 0860.65028
[9] Merle, G., Späth, H.: Computational experiences with discreteL p-approximation. Computing12, 315–321 (1974). · Zbl 0282.65014
[10] Rey, W.: On leastp-th power methods in multiple regressions and location estimations. BIT15, 174–185 (1975). · Zbl 0303.65010
[11] Schittkowski, K., Stoer, J.: A factorization method for constrained least squares prolems with data changes, part 1: theory. Preprint No. 20, Institut für Angewandte Mathematik und Statistik, Universität Würzburg, 1976. [See also: Numer. math.31, 431–463 (1979).] · Zbl 0378.65026
[12] Schittkowski, K., Zimmermann, P.: A factorization method for constrained least squares problems with data changes, part 2: numerical tests, comparisons and ALGOL-codes. Preprint No. 30, Institut für Angewandte Mathematik und Statistik, Universität Würzburg, 1977.
[13] Späth, H.: Algorithmen für multivariable Ausgleichmsodelle. München: R. Oldenbourg 1974. · Zbl 0327.65016
[14] Späth, H.: Cluster-Analyse-Algorithmen, 2. Aufl. München: R. Oldenburg 1977. (English traslation: Cluster analysis algorithms. Chichester: Horwood 1979.)
[15] Späth, H.: Computational experiences with the exchange method apllied to four commonly used partitioning cluster analysis criteria. Europ. J. Op. Res.1, 23–31 (1977). · Zbl 0353.65004
[16] Späth, H.: Klassenweise diskrete Approximation. In: Numerische Methoden bei graphentheoretischen und kombinatorischen problemen, Band 2, ISNM Vol. 46. (Collatz, L., Meinardus, G., Wetterling, W., Hrsg.). Basel-Stuttgart: Birkhäuser 1979.
[17] Stoer, J.: Einführung in die Numerische Mathematik I, 2. Aufl. Berlin-Heidelberg-New York: Springer 1976. · Zbl 0329.65001
[18] Watson, G. A.: On two methods for discreteL p approximation. Computing18, 263–266 (1977). · Zbl 0365.65008
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.