best polynomial approximation with linear constraints.pdfVIP

Canad.J. Math.Vol. 44 (6) 1992.pp. 1289-1302. BESTPOLYNOMIAL APPROXIMATION WITH LINEAR CONSTRAINTS K. PANAND E.B. SAFF ABSTRACT. Let A bea (k + I) x (k + I) nonzeromatrix. For polynomialsp E .IP. setE:= (P(O),P(O) ,p(k)(O»)Tand B.(A) := {p E P : AE = Q}. Let E C C bea compactsetthat doesnot separatethe planeand f bea function continuouson E and analytic in the interior of E. Set E.(A,f) := inf{IV -pilE: p E B.(A)} and E.if) := inf{IV -pilE: pEP.}. Our goal is to study approximationto f on E by polynomialsfrom B.(A). Weobtain necessaryandsufficientconditionson the matrix A for the convergenceE.(A,f) --+ 0 to takeplace.Theseresultsdependon whether zero lies inside. on the boundaryor outsideE andyield genernlizationsof theorems of Clunie. HassonandSafffor approximationby polynomialsthatomit a powerof z. LetP:.A E B.(A) besuch that E.(A.f) = IV-p:.AIIE. We also studythe asymptotic behaviorof the zerosof P~.AandtheasymptoticrelationbetWeenE.f) andE.(A,f). 1. Introduction and notation. Let E be a compact set in the complex plane C containing infinitely many points and let II .II denote the unifonn nonn on E. For a function!. if the derivativesF)(O), j = Q. ..., k, exist, define: ( J .,o(k) )T l := V(O),! (0), ...,J (0) . Let A := (aiJ)fJ=Or! 0 be a given (k + 1) x (k + 1) matrix with complex constant entries. With Pndenoting the collection of all algebraic polynomials of degree at most n, we set anAif):= inf{llpll : p E Pnand Ae = Ai}, n ~k. Wealsodefine