Skip to main content

The Numerical Determination of Projection Constants

  • Chapter
Numerische Methoden der Approximationstheorie

Abstract

In approximation theory and applied mathematics the following problem arises frequently: one is presented with a pair of normed linear spaces, Y ⊂ X, and it is required to invent a bounded linear map P: X → Y which will produce “good approximations”. Thus the elements of X are interpreted as entities to be approximated, and the elements of Y are the approximating objects. For a given x ∈ X, Px will be used as an approximation to the element x.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartels, R. H. and G. H. Golub: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of linear equations. Comm. Assoc. Comput. Mach. 11 (1968), 401–406.

    Google Scholar 

  2. Bartels, R. H. and G. H. Golub: Algorithm, Comm. Assoc. Comput. Mach. 11 (1968), 428–430.

    Google Scholar 

  3. Bartels, R. H. and G. H. Golub: Certification, Comm. Assoc. Comput. Mach. 12 (1969), 326.

    Google Scholar 

  4. Braess, D.: Eine Lösungsmethode für die lineare Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung. Comp. 6 (1970), 289–294.

    Article  Google Scholar 

  5. Carasso, C.: Convergence de l’algorithme de Remez. To appear, J. of Approximation Theory.

    Google Scholar 

  6. Cheney, E. W.: Introduction to Approximation Theory. McGraw-Hill, New York, 1966.

    Google Scholar 

  7. Dunham, C.: Convergence of exchange methods on an infinite set. To appear, SIAM J. of Numerical Analysis.

    Google Scholar 

  8. Kadec, M. I. and M. G. Snobar: Certain functionals on the Minkowski Compactum. Mat. Zametki 10 (1971), 453–457. (Russian) MR 45(math) 861. = Math. Notes 10 (1971), 694–696.

    Google Scholar 

  9. Laurent, P. -J.: Approximation et Optimisation. Hermann, Paris 1972.

    Google Scholar 

  10. Morris, P. D. and E. W. Cheney: On the existence and characterization of minimal projections. To appear in J. f. d. Reine u. Angew. Math. Also Report CNA-37, Center for Numerical Analysis, University of Texas, May 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer Basel AG

About this chapter

Cite this chapter

Cheney, E.W., Morris, P.D. (1975). The Numerical Determination of Projection Constants. In: Collatz, L., Meinardu, G. (eds) Numerische Methoden der Approximationstheorie. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série Internationale D’analyse Numérique, vol 26. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-5961-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-5961-5_2

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-5962-2

  • Online ISBN: 978-3-0348-5961-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics