Skip to main content
Log in

On the density principle for rational functions

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

Let E be a subspace of C(X) and define R(E):={g/h: g,hεE;h>0}. We prove that R(E) is dense in C(X) if for every X 0X there exists xεX 0 such that E contains an approximation to a δ-function at the point x on the set X 0. We use this principle to study the density of Müntz rationals in two variables.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Bak and D.J. Newman, Rational combinations of x λk , λ k ⩾ 0, are always dense in C ([0, 1]), J. Approx. Theory 32 (1978) 155–157.

    Google Scholar 

  2. G. Gierz and B. Shekhtman, Duality principle for rational approximation, Pacific J. Math. 125 (1986) 79–90.

    Google Scholar 

  3. G. Gierz and B. Shekhtman, On duality in rational approximation, Rocky Mountain J. Math. 19 (1988) 137–143.

    Google Scholar 

  4. D.J. Newman, Approximation with rational functions, in: CBMS Regional Conference Series, Vol. 41 (SIAM, Providence, RI, 1979).

    Google Scholar 

  5. G. Somorjai, A Müntz-type problem for rational approximation, Acta Math. Acad. Hungar. 27 (1976) 197–199.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shekhtman, B. On the density principle for rational functions. Numerical Algorithms 25, 341–346 (2000). https://doi.org/10.1023/A:1016669325910

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016669325910

Keywords

Navigation