Abstract
In this paper we prove that given certain convex domains Δ on the plane, ε>0, andf∈C(Δ) such thatf=0 on θ2Δ={(θ2 x,θ2 y):(x,y)∉Δ} (0<θ<1), a polynomialp(x, y) of the form
exists such that ∥f−p∥ C(Δ) ≤ε. The admissible convex domains include triangles and parallelograms with a vertex at the origin and sections of unit disk.
Similar content being viewed by others
References
M. v. Golitschek (1980):Approximation by incomplete polynomials. J. Approx. Theory,28:155–160.
M. v. Golitschek (1970):Erweiterungen der Approximationssätze von Jackson im Sinne von C. Müntz. J. Approx. Theory,3:72–86.
G. G. Lorentz (1977):Approximation by incomplete polynomials (problems and results). In: Padé and Rational Approximation (E. B. Saff, R. S. Varga, eds.). New York: Academic Press, pp. 289–302.
G. G. Lorentz (1980):Problems for incomplete polynomials. In: Approximation Theory III (E. W. Cheney, ed.). New York: Academic Press, pp. 41–73.
E. B. Saff, R. S. Varga (1978):Uniform approximation by incomplete polynomials. Internat. J. Math. Math. Sci.,1:407–420.
E. B. Saff, R. S. Varga (1979):The sharpness of Lorentz' theorem on incomplete polynomials. Trans. Amer. Math. Soc.,249:163–186.
F. Schurer, F. W. Steutel (1979):On the exact degree of approximation of Bernstein operators on C([0, 1]2). In: Multivariate Approximation Theory (W. Schempp, K. Zeller, eds.). Basel: Birkhäuser-Verlag, p. 413.
Author information
Authors and Affiliations
Additional information
Communicated by George G. Lorentz
Rights and permissions
About this article
Cite this article
Kroó, A. On approximation by bivariate incomplete polynomials. Constr. Approx 10, 197–206 (1994). https://doi.org/10.1007/BF01263064
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01263064