A dual method for discrete Chebychev curve fitting
暂无分享,去创建一个
[1] A. Charnes. Optimality and Degeneracy in Linear Programming , 1952 .
[2] E. Stiefel. Note on Jordan elimination, linear programming and Tchebycheff approximation , 1960 .
[3] E. Stiefel,et al. Über diskrete und lineare Tschebyscheff-Approximationen , 1959, Numerische Mathematik.
[4] Gene H. Golub,et al. The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.
[5] Abraham Charnes,et al. An Explicit Solution of a Special Class of Linear Programming Problems , 1968, Oper. Res..
[6] Paul T. Boggs,et al. A new algorithm for the Chebyshev solution of overdetermined linear systems , 1974 .
[7] G. Forsythe,et al. Computer solution of linear algebraic systems , 1969 .
[8] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .
[9] J. Uhlig. C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice-Hall, Inc. Preis geb. 54 s. net , 1972 .
[10] David G. Moursund. Chebyshev Solution of n+1 Linear Equations in n + 1nUnknowns , 1965, JACM.
[11] Ian Barrodale,et al. Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4] , 1975, TOMS.
[12] P. Rabinowitz. Applications of Linear Programming to Numerical Analysis , 1968 .
[13] E. Stiefel. Methods—Old and New—for Solving the Tchebycheff Approximation Problem , 1964 .
[14] A Descent Method for the Uniform Solution to Over-Determined Systems of Linear Equations , 1976 .