On the generalized Ball bases (Q2491236)

The Said-Ball and the Wang-Ball bases generalize to arbitrary degree the three term Ball basis for cubic polynomial evaluation on \([0,1]\). These bases lead to the less computational cost than the cost of the de Casteljau algorithm of evaluation of polynomials. The authors complete the analysis of shape preserving properties (monotonicity, convexity, endpoint interpolation property and boundary tangent property) and evaluate the stability and the condition numbers for problems of polynomial and root evaluations performed with these bases. The famous Wilkinson polynomial \(\prod_{k=1}^{20}(x-\frac{k}{20})\) is choosen as an example to test the error analysis, stability and conditioning of evaluation using the bases in question with respect to the similar evaluation with the Bernstein basis.