×

The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix. (English) Zbl 0519.65022


MSC:

65F20 Numerical solutions to overdetermined systems, pseudoinverses
65F25 Orthogonalization in numerical linear algebra
65F35 Numerical computation of matrix norms, conditioning, scaling

Software:

LINPACK
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Abdelmalek, N.N.: A computer program for the Chebyshev solution of overdetermined systems of linear equations. Internat J. Numer. Math. Engrg.10, 1197-1202 (1977) · Zbl 0333.65018 · doi:10.1002/nme.1620100521
[2] Abdelmalek, N.N.: Chebyshev solution of overdetermined systems of linear equations. BIT,15, 117-129 (1975) · Zbl 0303.65032 · doi:10.1007/BF01932684
[3] Barrodale, I., and Phillips, C.: Solution of an overdetermined system of linear equations in the Chebyshev norm. ACM Trans. Math. Software1, 264-270 (1975); CACM algorithm 495 · Zbl 0309.65015 · doi:10.1145/355644.355651
[4] Barrodale, I., and Young, A.: Algorithms for bestL 1 andL ? linear approximations on a discrete set. Numer. Math.8, 295-306 (1966) · Zbl 0173.18801 · doi:10.1007/BF02162565
[5] Boggs, P.T.: A new algorithm for the Chebyshev solution of overdetermined linear systems. Math. Comput.28, 203-217 (1974) · Zbl 0293.65025 · doi:10.1090/S0025-5718-1974-0334482-3
[6] Cline, A.K.: A descent method for the uniform solution of overdetermined systems of linear equations. SIAM J. Numer. Anal.13, 293-309 (1976) · Zbl 0337.65027 · doi:10.1137/0713027
[7] Collatz, L.: Approximation von Funktionen bei einer und bei mehreren unabh?ngigen Ver?nderlichen. Z. Angew. Math. Mech.36, 198-211 (1956) · Zbl 0074.04703 · doi:10.1002/zamm.19560360506
[8] Collatz, L.: Inclusion theorems for the minimal distance in rational Chebyshev approximation with several variables. In: Approximation of Functions, Symposium General Motors. H.L. Garabedian (ed.) Warren, Mishigan, Elsevier, New York 43-56, 1965
[9] Cheney, E.W.: Introduction to approximation theory. New York: McGraw-Hill, 1966 · Zbl 0161.25202
[10] Daniel, J.W., Gragg, W.B., Kaufman, L., Stewart, G.W.: Reorthogonalisation and stable algorithms for updating the Gram-Schmidt QR factorisation. Math. Comput.30, 772-795 (1976) · Zbl 0345.65021
[11] Dongarra, J.J., Moler, C.B., Bunch, J.R., Stewart, G.W.: Linpack users guide. SIAM, 1979 · Zbl 0476.68025
[12] Duris, C.: An exchange method for solving Haar and non-Haar overdetermined linear equations in the sense of Chebyshev. Proc. Nat. Conf. ACM 61-66, 1968
[13] Duris, C., Sreedharan, V.P.: Chebyshev and 1 solutions of linear equations using least squares solutions. SIAM J. Numer. Anal.5, 491-505 (1968) · Zbl 0174.46901 · doi:10.1137/0705040
[14] Duris, C., Temple, M.G.: A finite step algorithm for determining the strict Chebyshev solution toAx=b. SIAM J. Numer. Anal.10, 690-699 (1973) · Zbl 0232.65033 · doi:10.1137/0710060
[15] Easton, M.C.: A fixed point method for Chebyshev solution of inconsistent linear equations. J. Inst. Math. Appl.12, 137-159 (1973) · Zbl 0276.90035 · doi:10.1093/imamat/12.2.137
[16] Gearhart, W.B.: Some Chebyshev approximations by polynomials in two variables. J. Approximation Theory8, 195-209 (1973) · Zbl 0282.41009 · doi:10.1016/0021-9045(73)90009-9
[17] Golub, G.H., Reinsch, C.: Singular value decomposition and least squares solutions. Numer. Math.14, 403-420 (1970) · Zbl 0181.17602 · doi:10.1007/BF02163027
[18] Meicler, M.: A steepest ascent method for the Chebyshev problem. Math. Comput.23, 813-817 (1969) · Zbl 0208.40605 · doi:10.1090/S0025-5718-1969-0258251-6
[19] Osborne, M.R., Watson, G.A.: On the best linear Chebyshev approximation. Comput. J.10, 172-177 (1967) · Zbl 0155.48101
[20] Powell, J.J.D., Hopper, M.J.: A technique that gains speed and accuracy in the minimax solution of overdetermined linear equations. In: Mathematical Software III. J.R. Rice (ed.) New York: Academic Press, 1977 · Zbl 0407.68028
[21] Rice, J.R.: The approximation of functions, Vol. II. Reading, MA: Addison Wesley, 1969 · Zbl 0185.30601
[22] Stiefel, E.: ?ber diskrete und lineare Tschebyscheff Approximationen. Numer. Math.1, 1-28 (1959) · Zbl 0083.11501 · doi:10.1007/BF01386369
[23] Stiefel, E.: Note on Jordan elimination, linear programming and Chebyshev approximation. Numer. Math.2, 1-17 (1960) · Zbl 0097.32306 · doi:10.1007/BF01386203
[24] Wolfe, P.: A technique for resolving degeneracy in linear programming. SIAM J.11, 205-211 (1963) · Zbl 0127.36903
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.