Numerische Mathematik

, Volume 26, Issue 2, pp 179–189 | Cite as

Discrete, linear approximation problems in polyhedral norms

  • D. H. Anderson
  • M. R. Osborne
Article
Received:

Summary

We introduce a class of polyhedral norms and study discrete linear approximation problems under these norms. It is possible to give a uniform treatment, in particular, ofL1 and maximum norm problems, at least as regards notation; and we develop a general exchange algorithm in which we permit also linear inequality constraints.

Keywords

Mathematical Method Linear Approximation Approximation Problem Inequality Constraint Maximum Norm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anderson, D. H.: Linear Programming and the Calculation of Maximum Norm Approximations. Ph. D. Thesis, Australian National University, 1975Google Scholar
  2. 2.
    Cheney, E. W.: Introduction to Approximation Theory. New York: McGraw-Hill 1966Google Scholar
  3. 3.
    Gill, P. E., Golub, G. H., Murray, W., Saunders, M. A.: Methods for modifying matrix factorizations. Stanford University Computer Science Department Report STAN-CS-72-322, (1972)Google Scholar
  4. 4.
    Householder, A. S.: The Theory of Matrices in Numerical Analysis. Massachusetts: Blaisdell 1964Google Scholar
  5. 5.
    Madsen, K.: An algorithm for minimax solution of overdetermined systems of nonlinear equations. U. K. AEA Research Report, TP559 (1973)Google Scholar
  6. 6.
    Osborne, M. R., Watson, G. A.: On an algorithm for nonlinearL 1 approximation. Computer J.14, 184–188 (1971)Google Scholar
  7. 7.
    Osborne, M. R., Watson, G. A.: On the best linear Chebyshev approximation. Computer J.10, 172–177 (1967)Google Scholar
  8. 8.
    Stiefel, E. L.: Über diskrete und lineare Tschebyscheff-Approximationen. Numer. Math.1, 1–28 (1959)Google Scholar
  9. 9.
    Stiefel, E. L.: Note on Jordan elimination, linear programming, and Tschebyscheff approximation. Numer. Math.2, 1–17 (1960)Google Scholar
  10. 10.
    Watson, G. A.: The calculation of best restricted approximations. SIAM J. Numer. Anal.11, 693–699 (1974)Google Scholar

Copyright information

© Springer-Verlag 1976

Authors and Affiliations

  • D. H. Anderson
    • 1
  • M. R. Osborne
    • 2
  1. 1.Mathematics DepartmentMelbourne UniversityMelbourneAustralia
  2. 2.Computer CentreAustralian National UniversityCanberraAustralia

Personalised recommendations