Hostname: page-component-7b7567c8c-9cwtv Total loading time: 0 Render date: 2026-11-19T15:26:31.372Z Has data issue: false hasContentIssue false

Shape-preserving polynomial approximation in C[– 1, 1]

Published online by Cambridge University Press:  24 October 2008

Z. Ditzian
Affiliation:
Department of Mathematics, University of Alberta, Edmonton, Alberta, CanadaT6G 2G1
D. Jiang
Affiliation:
Department of Mathematics, University of Alberta, Edmonton, Alberta, CanadaT6G 2G1
D. Leviatan
Affiliation:
Department of Mathematics, Raymond and Beverly Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A recent result of the first two authors has bridged the gap between the Timantype pointwise estimate and the norm estimate for polynomial approximation in C[– 1, 1]. Here we show that, when considering the second order modulus of smoothness, the aforementioned result holds with polynomials that preserve monotonicity, convexity and the values of the function at the end points of the interval [–1, 1]. This yields a generalization of results by Telyakovskii, Gopengauz, DeVore, Yu and the third author. Moreover, the construction here does not depend on the construction for the non-constrained approximation by polynomials.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1992