A de Casteljau Algorithm for q‐Bernstein‐Stancu Polynomials

Grzegorz Nowak

Abstract and Applied Analysis, 2011, vol. 2011, issue 1

Abstract: This paper is concerned with a generalization of the q‐Bernstein polynomials and Stancu operators, where the function is evaluated at intervals which are in geometric progression. It is shown that these polynomials can be generated by a de Casteljau algorithm, which is a generalization of that relating to the classical case and q‐Bernstein case.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2011/609431

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2011:y:2011:i:1:n:609431

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().