On the Müntz rational approximation rate
HTML articles powered by AMS MathViewer
- by S. P. Zhou PDF
- Proc. Amer. Math. Soc. 121 (1994), 179-183 Request permission
Abstract:
The present paper constructs a counterexample to show that a conjecture of Newman concerning rational approximation rate of arbitrary Markov system is generally not true.References
- Joseph Bak, On the efficiency of general rational approximation, J. Approximation Theory 20 (1977), no. 1, 46–50. MR 447896, DOI 10.1016/0021-9045(77)90017-x
- Joseph Bak and Donald J. Newman, Rational combinations of $x^{\lambda k}$, $\lambda _{k}\geq 0$ are always dense in $C[0, 1]$, J. Approximation Theory 23 (1978), no. 2, 155–157. MR 487180, DOI 10.1016/0021-9045(78)90101-6
- D. J. Newman, Derivative bounds for Müntz polynomials, J. Approximation Theory 18 (1976), no. 4, 360–362. MR 430604, DOI 10.1016/0021-9045(76)90007-1 —, Approximation with rational functions, Amer. Math. Soc., Providence, RI, 1978.
- G. Somorjai, A Müntz-type problem for rational approximation, Acta Math. Acad. Sci. Hungar. 27 (1976), no. 1-2, 197–199. MR 430617, DOI 10.1007/BF01896775
- S. P. Zhou, On Müntz rational approximation, Constr. Approx. 9 (1993), no. 4, 435–444. MR 1237927, DOI 10.1007/BF01204650
Additional Information
- © Copyright 1994 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 121 (1994), 179-183
- MSC: Primary 41A20; Secondary 41A25
- DOI: https://doi.org/10.1090/S0002-9939-1994-1204388-0
- MathSciNet review: 1204388