Recurrence relations for orthogonal polynomials on triangular domains (Q515427)

From MaRDI portal





scientific article; zbMATH DE number 6695451
Language Label Description Also known as
English
Recurrence relations for orthogonal polynomials on triangular domains
scientific article; zbMATH DE number 6695451

    Statements

    Recurrence relations for orthogonal polynomials on triangular domains (English)
    0 references
    0 references
    0 references
    16 March 2017
    0 references
    Summary: In Farouki et al. (2003), Legendre-weighted orthogonal polynomials \(\mathcal P_{n,r}(u,v,w)\), \(r=0,1,\dots,n\), \(n\geq 0\) on the triangular domain \(T=\{(u,v,w):u,v,w\geq 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.
    0 references
    recurrence relation
    0 references
    bivariate orthogonal polynomials
    0 references
    Bernstein polynomials
    0 references
    Legendre polynomials
    0 references
    triangular domains
    0 references
    algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references