Skip to main content

Best approximation of complex-valued data

Part of the Lecture Notes in Mathematics book series (LNM,volume 630)

Abstract

We consider problems arising in the determination of best approximations to complex-valued data. The emphasis is on linear approximation in the ℓ1 and ℓ norms, but some remarks on ℓ rational approximation are also included.

Keywords

  • Rational Approximation
  • Overdetermined System
  • Chebyshev Approximation
  • Haar Condition
  • Good Approximation Problem

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, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • I. Barrodale, L.M. Delves and J.C. Mason (1977), Linear Chebyshev Approximation of Complex-Valued Functions, Math. Dept. Report No. 89, Univ. of Victoria, Victoria, B.C., Canada.

    MATH  Google Scholar 

  • I. Barrodale and C. Phillips (1975), Algorithm 495 — Solution of an Overdetermined System of Linear Equations in the Chebyshev Norm, TOMS, v. 1, pp. 264–270.

    CrossRef  MATH  Google Scholar 

  • I. Barrodale and F.D.K. Roberts (1970), Applications of Mathematical Programming to l p Approximation, from "Nonlinear Programming", edited by J.B. Rosen, O.L. Mangasarian, and K. Ritter. Academic Press, pp. 447–464.

    Google Scholar 

  • I. Barrodale and F.D.K. Roberts (1973), Best Approximation by Rational Functions, from "Proceedings of the 3rd Manitoba Conference on Numerical Mathematics", Univ. of Manitoba, Winnipeg, Manitoba, Canada. pp. 3–29.

    MATH  Google Scholar 

  • I. Barrodale and F.D.K. Roberts (1974), Algorithm 478 — Solution of an Overdetermined System of Equations in the l 1 Norm, Comm. ACM, v. 17, pp. 319–320.

    CrossRef  Google Scholar 

  • S. Ellacott and J. Williams (1976a), Linear Chebyshev Approximation in the Complex Plane Using Lawson’s Algorithm, Math. Comp., v. 30, pp. 35–44.

    MathSciNet  MATH  Google Scholar 

  • S. Ellacott and J. Williams (1976b), Rational Chebyshev Approximation in the Complex Plane, SIAM J. Numer. Anal., v. 13, pp. 310–323.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • G. Meinardus (1967), "Approximation of Functions: Theory and Numerical Methods", Springer-Verlag, New York.

    CrossRef  MATH  Google Scholar 

  • M.J.D. Powell (1977) Private communication.

    Google Scholar 

  • F.D.K. Roberts (1977), Minimal Degree Rational Approximation, Rocky Mountain J. of Math., to appear.

    Google Scholar 

  • G.F. Stuart "Numerical l1 and l Approximation", M.Sc. thesis, Univ. of Western Ontario, London, Ontario, Canada.

    Google Scholar 

  • J. Williams (1972), Numerical Chebyshev Approximation in the Complex Plane, SIAM J. Numer. Anal., v. 9, pp. 638–649.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Barrodale, I. (1978). Best approximation of complex-valued data. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067692

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08538-6

  • Online ISBN: 978-3-540-35972-2

  • eBook Packages: Springer Book Archive