科研之友
微信
新浪微博
Facebook
分享链接
摘要
Given m + 1 strictly decreasing numbers h(0), h(1), . . . h(m), we give an algorithm to construct a corresponding finite sequence of orthogonal polynomials p(0), p(1), . . . ,p(m), such that p(0) = 1, p(j) has degree j and p(m-j)(h(n)) = (-1)(n)p(j)(h(n)) for all j, n = 0, 1 m. Using these polynomials, we construct bivariate Lagrange polynomials and cubature formulas for nodes that are points in R-2 where the coordinates are taken from given finite decreasing sequences of the same length and where the indices have the same (or opposite) parity.
- 出版日期2018-10-1
