Skip to main content
SpringerLink
Log in

Ein Abstiegsverfahren für Approximationsaufgaben in normierten Räumen

A descent method for approximation problems in normed spaces

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

A numerical method for constrained approximation problems in normed linear spaces is presented. The method uses extremal subgradients of the norms or sublinear functionals involved in the approximation problem considered. Under certain weak assumptions the convergence of the method is proved. For various normed spaces hints for practical realization are given and several numerical examples are described.

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

Literatur

  1. Bredendiek, E., Collatz, L.: Simultanapproximation bei Randwertaufgaben. Numerische Methoden der Approximationstheorie, Bd. 3, ISNM 30, S. 147–174. Basel-Stuttgart: Birkhäuser 1976

    Google Scholar 

  2. Brosowski, B.: Nichtlineare Approximation in normierten Vektorräumen. Abstract spaces and approximation, ISNM 10, S. 140–159. Basel-Stuttgart: Birkhäuser 1969

    Google Scholar 

  3. Brosowski, B., Deutsch, F.: On some geometric properties of suns. J. Approximation Theory10, 245–267 (1974)

    Google Scholar 

  4. Collatz, L., Krabs, W.: Approximationstheorie. Stuttgart: Teubner 1973

    Google Scholar 

  5. Dunford, N., Schwartz, J.T.: Linear operators, Part I. New York: Interscience 1964

    Google Scholar 

  6. Ellacott, S., Williams, J.: Rational Chebychev approximation in the complex plane. SIAM J. Numer. Anal.13, 310–323 (1976)

    Google Scholar 

  7. Köthe, G.: Topologische Lineare Räume, Bd. I, Berlin-Göttingen-Heidelberg: Springer 1960

    Google Scholar 

  8. Krabs, W.: Ein Verfahren zur Lösung gewisser nichtlinearer diskreter Approximationsprobleme. Z. Angew. Math. Mech.50, 359–368 (1970)

    Google Scholar 

  9. Levitin, E.S.: A general minimization method for unsmooth extremal problems. USSR Comput. Math. Phys.9, 783–806 (1969)

    Google Scholar 

  10. Moreau, J.J.: Fonctionnelles convexes. Séminaire sur les équations aux dérivées partielles, Vol. II. Collège de France, 1966–1967

  11. Opfer, G.: An algorithm for the construction of best approximations based on Kolmogorov's criterion. Approximation Theory23 (1978)

  12. Schultz, R.: Ein Abstiegsverfahren für Approximationsaufgaben in normierten Räumen. Dissertation, Hamburg, 1977

  13. Singer, I.: Best approximation in normed linear spaces by elements of linear subspaces. Berlin-Heidelberg-New York: Springer 1970

    Google Scholar 

  14. Zuhovickij, S.I., Poljak, R.A., Primak, M.E.: An algorithm for the solution of the problem of convex Cebysev approximation. Soviet Math. Dokl.4, 901–904 (1963)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Seminar für Industriebetriebslehre und Organisation der Universität Hamburg, Von-Melle-Park 5, D-2000, Hamburg 13, Germany (Fed. Rep.)

    Reinhart Schultz

Authors
  1. Reinhart Schultz
    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

Schultz, R. Ein Abstiegsverfahren für Approximationsaufgaben in normierten Räumen. Numer. Math. 31, 77–95 (1978). https://doi.org/10.1007/BF01396016

Download citation

  • Received:

  • Issue Date:

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

Subject Classifications

Search

Navigation