DISCRETE BERNSTEIN BASES AND HAHN POLYNOMIALS

[摘要] In this paper, we study the representation and evaluation of Hahn polynomials in discrete Bernstein bases of various degrees defined on different intervals of integers. Basic tools are degree elevation and subdivision algorithms. They only involve linear convex combinations with simple rational coefficients and are numerically stable. Their computational complexity is also evaluated. Applications to the computation of discrete orthogonal projections and to a property of the max-norm of discrete Chebyshev polynomials are given.

[发布日期] 1993-12-31

[效力级别]  Proceedings Paper

[关键词] DISCRETE BERNSTEIN BASES;HAHN POLYNOMIALS;SUBDIVISION ALGORITHMS