On real and complex-valued bivariate Chebyshev polynomials (Q1262485)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On real and complex-valued bivariate Chebyshev polynomials |
scientific article; zbMATH DE number 4124306
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On real and complex-valued bivariate Chebyshev polynomials |
scientific article; zbMATH DE number 4124306 |
Statements
On real and complex-valued bivariate Chebyshev polynomials (English)
0 references
1989
0 references
The authors consider the following two problems: Problem A(B). Given arbitrary integers m,n with \(m+n\geq 1\), find all elements \(p^*\) of the space \(P_{m+n-1}\) of real (complex) bivariate polynomials of total degree \(m+n-1\) which best approximate the function \(f(x,y)=x^ ny^ m(f(w,z)=w^ nz^ m)\) on the unit square \(U=[-1,1]^ 2\) (on the biellipse \(B_{\phi}=E^ 2_{\phi}\), \(E_{\phi}=\{z\in {\mathbb{C}}| z=1/2(t+t^{-1})\), \(| t| =\phi \}\), \(1<\phi <\infty)\) in the uniform norm. The first contribution of this paper is to provide uniqueness conditions for Problem A, by exploiting the well-known Noether's theorem of algebraic plane curves theory and to discribe the set of best approximations in case of nonuniqueness. It is also proved in a simple manner that the product of monic Chebyshev polynomials of the first kind also yields an optimal error for Problem B and that the same uniqueness conditions prevail in the complex case.
0 references
set of best approximations
0 references
monic Chebyshev polynomials
0 references
optimal error
0 references