A Lobatto interpolation grid over the triangle

A sequence of increasingly refined interpolation grids over the triangle is proposed, with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The number of interpolation nodes, N , corresponds to a complete mth-order polynomial expansion with respect to the triangle barycentric coordinates, which arises by the horizontal truncation of the Pascal triangle. The proposed grid is generated by deploying Lobatto interpolation nodes along the three edges of the triangle, and then computing interior nodes by averaged intersections to achieve three-fold rotational symmetry. Numerical computations show that the Lebesgue constant and interpolation accuracy of the proposed grid compares favorably with those of the best-known grids consisting of the Fekete points. Integration weights corresponding to the set of Lobatto triangle base points are tabulated.