Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Best polynomial approximation on the triangle (1711.04756v1)

Published 13 Nov 2017 in math.CA

Abstract: Let $E_n(f){\alpha,\beta,\gamma}$ denote the error of best approximation by polynomials of degree at most $n$ in the space $L2(\varpi{\alpha,\beta,\gamma})$ on the triangle ${(x,y): x, y \ge 0, x+y \le 1}$, where $\varpi_{\alpha,\beta,\gamma}(x,y) := x\alpha y \beta (1-x-y)\gamma$ for $\alpha,\beta,\gamma > -1$. Our main result gives a sharp estimate of $E_n(f){\alpha,\beta,\gamma}$ in terms of the error of best approximation for higher order derivatives of $f$ in appropriate Sobolev spaces. The result also leads to a characterization of $E_n(f){\alpha,\beta,\gamma}$ by a weighted $K$-functional.

Citations (3)

Summary

We haven't generated a summary for this paper yet.