Computing orthogonal polynomials on a triangle by degree raising
We give an algorithm for computing orthogonal polynomials over triangular domains in Bernstein–Bézier form which uses only the operator of degree raising and its adjoint. This completely avoids the need to choose an orthogonal basis (or tight frame) for the orthogonal polynomials of a given degree, and hence the difficulties inherent in that approach. The results are valid for Jacobi polynomials on a simplex, and show the close relationship between the Bernstein form of Jacobi polynomials, Hahn polynomials and degree raising.
KeywordsBernstein–Bézier form Hahn polynomials Jacobi polynomials surface smoothing
AMS (MOS) Subject Classificationsprimary 33C45 65D17 secondary 41A10
Unable to display preview. Download preview PDF.
- de Boor, C.: \(B\)-form basics. In: Farin, G.E. (ed.) Geometric Modeling: Algorithms and New Trends, pp. 131–148. SIAM, Philadelphia, Pennsylvania (1987)Google Scholar
- Waldron, S.: On the Bernstein–Bézier form of Jacobi polynomials on a simplex. J. Approx. Theory 140(1), 86–99 (2006)Google Scholar