Discrete Bernstein bases and Hahn polynomials (Q1318414): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Explicit Formula Relating the Jacobi, Hahn and Bernstein Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4041056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for polynomials in Bernstein form / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5841174 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4039835 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3828480 / rank | |||
Normal rank |
Latest revision as of 14:18, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Discrete Bernstein bases and Hahn polynomials |
scientific article |
Statements
Discrete Bernstein bases and Hahn polynomials (English)
0 references
27 March 1994
0 references
Hahn polynomials are orthogonal with respect to a discrete scalar product. The paper investigates the representation of Hahn polynomials in discrete Bernstein bases of various degree defined on different intervals of integers. Basic tools are degree evaluation and subdivision algorithms. The computational complexity of the problem is also evaluated, and applications are given to the computation of discrete orthogonal projections and to a property of the max-norm of discrete Chebyshev polynomials.
0 references
Hahn polynomials
0 references
discrete scalar product
0 references
discrete Bernstein bases
0 references
subdivision algorithms
0 references
computational complexity
0 references
discrete orthogonal projections
0 references
discrete Chebyshev polynomials
0 references