Discrete Bernstein bases and Hahn polynomials

DOI10.1016/0377-0427(93)90155-5zbMath0794.65016OpenAlexW1991545480MaRDI QIDQ1318414

Paul Sablonniere

Publication date: 27 March 1994

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(93)90155-5

zbMATH Keywords

computational complexitydiscrete orthogonal projectionssubdivision algorithmsHahn polynomialsdiscrete Bernstein basesdiscrete Chebyshev polynomialsdiscrete scalar product

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Computation of special functions and constants, construction of tables (65D20) Approximation by polynomials (41A10)

Related Items

Dual generalized Bernstein basis ⋮ Bernstein bases and hahn—eberlein orthogonal polynomials ⋮ Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights ⋮ Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients ⋮ Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials ⋮ Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials ⋮ Multivariate generalized Bernstein polynomials: Identities for orthogonal polynomials of two variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for polynomials in Bernstein form
• Explicit Formula Relating the Jacobi, Hahn and Bernstein Polynomials