Recurrence Relations for Orthogonal Polynomials on Triangular Domains
Department of Mathematics, Jordan University of Science and Technology, Irbid 22110, Jordan
Academic Editors: Zhongqiang Zhang and Mohsen Zayernouri
Received: 26 December 2015 / Revised: 15 March 2016 / Accepted: 7 April 2016 / Published: 12 April 2016
In Farouki et al
, 2003, Legendre-weighted orthogonal polynomials
on the triangular domain
are constructed, where
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.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Rababah, A. Recurrence Relations for Orthogonal Polynomials on Triangular Domains. Mathematics 2016, 4, 25.
Rababah A. Recurrence Relations for Orthogonal Polynomials on Triangular Domains. Mathematics. 2016; 4(2):25.
Rababah, Abedallah. 2016. "Recurrence Relations for Orthogonal Polynomials on Triangular Domains." Mathematics 4, no. 2: 25.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.