Skip to main content
SpringerLink
Log in

Computational experiences with discrete Lp-Approximation

Numerische Erfahrungen mit diskreter L p -Approximation

  • Published:
Computing Aims and scope Submit manuscript

Zusammenfassung

Die diskreteL p -Approximation ist insbesondere für 1≤p≤2 von praktischer Bedeutung. Wir schildern die Erfahrungen mit einem Algorithmus zu ihrer numerischen Berechnung.

Abstract

DiscreteL p -approximation, especially for 1≤p≤2 is useful for practical purposes. We describe the experience with an algorithm for its numerical computation.

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

References

  1. Barrodale, I., and A. Young: Algorithms for BestL 1 andL ∞ Linear Approximations on a Discrete Set. Num. Math.8, 295–306 (1966).

    Google Scholar 

  2. Barrodale, I.:L 1-Approximation and the Analysis of Data. Appl. Stat.17, 51–57 (1968).

    Google Scholar 

  3. Bartels, R. H., and G. H. Golub: Chebyshev Solution to an overdetermined linear System. Comm. ACM11, 428–430 (1968).

    Google Scholar 

  4. Bauer, F. L.: Elimination with Weighted Row Combinations for Solving Linear Equations and Least Squares Problems. Num. Math.7, 338–352 (1965).

    Google Scholar 

  5. Björck, A., and G. H. Golub: Iterative Refinement of Linear Least Squares Solutions by Householder Transformations. BIT7, 322–337 (1967).

    Google Scholar 

  6. Businger, P., and G. H. Golub: Linear Least Squares Solutions by Householder Transformations. Num. Math.7, 269–276 (1965).

    Google Scholar 

  7. Collatz, L.: Funktionalanalysis und Numerische Mathematik. Berlin-Göttingen-Heidelberg-New York: Springer. 1964.

    Google Scholar 

  8. Fletcher, R., J. A. Grant, and M. D. Hebden: The calculation of linear bestL p approximations. Computer J.14, 226–279 (1971).

    Google Scholar 

  9. Kahng, S. W.: BestL p Approximation. Math. of Computation26, 505–508 (1972).

    Google Scholar 

  10. SSP-Scientific Subroutine Package. IBM-FORM H 20-0205-3.

  11. Späth, H.: Algorithmen für multivariable Ausgleichsmodelle. München: R. Oldenbourg-Verlag (erscheint 1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ORG+DV Operations Research Großversandhaus Quelle, Wandererstraße 159, D-8500, Nürnberg, Bundesrepublik Deutschland

    G. Merle &  H. Späth

Authors
  1. G. Merle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Späth
    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

Merle, G., Späth, H. Computational experiences with discrete Lp-Approximation. Computing 12, 315–321 (1974). https://doi.org/10.1007/BF02253335

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation