Recurrence Relations for Orthogonal Polynomials on Triangular Domains

被引:0
|
作者
Rababah, Abedallah [1 ]
机构
[1] Jordan Univ Sci & Technol, Dept Math, Irbid 22110, Jordan
关键词
recurrence relation; bivariate orthogonal polynomials; Bernstein polynomials; Legendre polynomials; triangular domains; 65Dxx; 33C45; BERNSTEIN;
D O I
10.3390/math4020025
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In Farouki et al, 2003, Legendre-weighted orthogonal polynomials P-n,P-r(u, v, w), r = 0, 1,..., n, n >= 0 on the triangular domain T = {(u, v, w) : u, v, w >= 0, u + v + w = 1} are constructed, where u, v, w are the barycentric coordinates. Unfortunately, evaluating the explicit formulas requires many operations and is not very practical from an algorithmic point of view. Hence, there is a need for a more efficient alternative. A very convenient method for computing orthogonal polynomials is based on recurrence relations. Such recurrence relations are described in this paper for the triangular orthogonal polynomials, providing a simple and fast algorithm for their evaluation.
引用
收藏
页数:7
相关论文
共 50 条