Skip to main content

Abstract

In [10] , Töpfer proposed an algorithm for linear Chebyshev approximation without Haar condition, which has been thoroughly investigated in two recent contributions of Carasso and Laurent [2] , [3] .

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. M. Brannigan, H-Sets in Linear Approximation. J. Approx. Th. 20 (1977), 153–161.

    Google Scholar 

  2. C. Carasso and P.J. Laurent, Un Algorithme de Minimisa tion en Chaîne en Optimisation Convexe. SIAM J. Control Optimization 16 (1978), 209–235-

    Google Scholar 

  3. C. Carasso and P.J. Laurent, Un Algorithme Général pour l’Approximation au Sens de Tchebycheff de Fonctions Bornées sur un Ensemble Quelconque. Lecture Notes in Mathematics 556 (1976), Springer Verlag, Berlin.

    Google Scholar 

  4. L. Collatz, Inclusion Theorems for the Minimal Distance in Rational Tschebysche Approximation with Several Variables. Approximation of Functions, Garabedian, ed., Elsevier, Amsterdam, 1965, 43–56.

    Google Scholar 

  5. J.L. Coolidge, A Treatise on Algebraic Plane Curves. Dover, New York, 1959.

    MATH  Google Scholar 

  6. C. Dierieck, Some Remarks on H-Sets in Linear Approximation Theory. J. Approx. Th. 21 (1977), 188–204.

    Google Scholar 

  7. B. Gambier, Système Linéaire de Courbes Algébriques de Degré Donné. Annales Ecole Normale, Série 3, T. 41 (1924), 147–264.

    Google Scholar 

  8. S.Y.Ku, R.J. Adler,Computing Polynomials Resultants : Bezout’s Determinant vs.Collins’ Reduced Algorithm. Comm.ACM 12 (1969), 23–30.

    Google Scholar 

  9. J.R. Rice, The Approximation of Functions, Vol. 2 : Nonlinear and Multivariate Theory. Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  10. G.A. Watson, A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation. SIAM J. Numer. Anal. 12 (1975), U6–52.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Birkhäuser Verlag Basel

About this chapter

Cite this chapter

Defert, P., Thiran, JP. (1982). Exchange Algorithm for Multivariate Polynomials. In: Collatz, L., Meinardus, G., Werner, H. (eds) Numerical Methods of Approximation Theory, Vol.6 / Numerische Methoden der Approximationstheorie, Band 6. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série internationale d’Analyse numérique, vol 59. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-7186-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-7186-0_8

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-0348-7188-4

  • Online ISBN: 978-3-0348-7186-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics