Skip to main content
SpringerLink
Log in

Chebyshev solution of overdetermined systems of linear equations

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A simplex algorithm for the Chebyshev solution of overdetermined systems of linear equations is described. In this algorithm, an initial basic feasible solution is available with no artificial variables needed. Also minimum storage is required and no conditions are imposed on the coefficient matrix. The algorithm is a simple and fast one. Numerical results are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. N. Abdelmalek,A computer program for the Chebyshev solution of overdetermined systems of linear equations, International J. for Numerical methods in engineering, submitted for publication.

  2. I. Barrodale and A. Young,Algorithms for best L 1 and L ∞ linear approximations on a discrete set, Numer. Math. 8 (1966), 295–306.

    Google Scholar 

  3. R. H. Bartels and G. H. Golub,The simplex method of linear programming using LU decomposition, ACM Comm. 12 (1969), 266–268.

    Google Scholar 

  4. P. T. Boggs,A new algorithm for the Chebyshev solution of overdetermined linear systems, Math. Comp. 28 (1974), 203–217.

    Google Scholar 

  5. E. W. Cheney,Introduction to approximation theory, McGraw-Hill, New York, 1966.

    Google Scholar 

  6. C. Duris,An exchange method for solving Haar and non-Haar overdetermined linear equations in the sense of Chebyshev, in ACM national conference proceedings, (1968), 61–66.

  7. C. S. Duris and V. P. Sreedharan,Chebyshev and l 1-solutions of linear equations using least squares solutions, SIAM J. Numer. Anal. 5 (1968), 491–505.

    Google Scholar 

  8. M. C. Easton,A fixed point method for Tchebycheff solution of inconsistent linear equations, J. Inst. Maths. Applics. 12 (1973), 137–159.

    Google Scholar 

  9. P. E. Gill, G. H. Golub, W. Murray and M. A. Saunders,Methods for modifying matrix factorizations, Computer Science Dept. Report no. CS-72-322 (1972), Stanford University, Stanford, Calif.

    Google Scholar 

  10. A. A. Goldstein, N. Levine and J. B. Hereshoff,On the best and least qth approximation of an overdetermined system of linear equations, ACM J. 4 (1957), 341–347.

    Google Scholar 

  11. G. Hadley,Linear programming, Addison-Wesley Publishing Co. 1962.

  12. M. Meicler,A steepest ascent method for the Chebyshev problem, Math. Comp. 23 (1969), 813–817.

    Google Scholar 

  13. M. R. Osborne and G. A. Watson,On the best linear Chebyshev approximation, Computer J. 10 (1967), 172–177.

    Google Scholar 

  14. E. Stiefel, Über diskrete und lineare Tschebyscheff-Approximationen, Numer. Math. 1 (1959), 1–28.

    Google Scholar 

  15. E. Stiefel,Note on Jordan elimination, linear programming and Tchebycheff approximation, Numer. Math. 2 (1960), 1–17.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computation Centre, National Research Council, Ottawa, Canada

    Nabih N. Abdelmalek

Authors
  1. Nabih N. Abdelmalek
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abdelmalek, N.N. Chebyshev solution of overdetermined systems of linear equations. BIT 15, 117–129 (1975). https://doi.org/10.1007/BF01932684

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01932684

Keywords

Search

Navigation