Abstract 

The design of iterative schemes for sparse matrix computations 

often leads to constrained polynor_dal approximation problems on 

sets in the complex plane. For the case of ellipses, we introduce a 

new class of complex polynomials wlfich are in general very good 

approximations to the best polynomials and even optimal in most 

cases.