Lagrange polynomials, reproducing kernels and cubature in two dimensions

نویسنده

  • Lawrence A. Harris
چکیده

We obtain by elementary methods necessary and sufficient conditions for a k-dimensional cubature formula to hold for all polynomials of degree up to 2m− 1 when the nodes of the formula have Lagrange polynomials of degree at most m. The main condition is that the Lagrange polynomial at each node is a scalar multiple of the reproducing kernel of degree m− 1 evaluated at the node plus an orthogonal polynomial of degree m. Stronger conditions are given for the case where the cubature formula holds for all polynomials of degree up to 2m. This result is applied in one dimension to obtain a quadrature formula where the nodes are the roots of a quasi-orthogonal polynomial of order 2. In two dimensions the result is applied to obtain constructive proofs of cubature formulas of degree 2m − 1 for the Geronimus and the MorrowPatterson classes of nodes. A cubature formula of degree 2m is obtained for a subclass of Morrow-Patterson nodes. Our discussion gives new proofs of previous theorems for the Chebyshev points and the Padua points, which are special cases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal cubature formulae of trigonometric degree

In this paper we construct minimal cubature formulae of trigonometric degree: we obtain explicit formulae for low dimensions of arbitrary degree and for low degrees in all dimensions. A useful tool is a closed form expression for the reproducing kernels in two dimensions.

متن کامل

Lagrange Interpolation on Chebyshev Points of Two Variables

We study interpolation polynomials based on the points in [−1, 1]× [−1, 1] that are common zeros of quasi-orthogonal Chebyshev polynomials and nodes of near minimal degree cubature formula. With the help of the cubature formula we establish the mean convergence of the interpolation polynomials. 1991 Mathematics Subject Classification: Primary 41A05, 33C50.

متن کامل

An ‎E‎ffective Numerical Technique for Solving Second Order Linear Two-Point Boundary Value Problems with Deviating Argument

Based on reproducing kernel theory, an effective numerical technique is proposed for solving second order linear two-point boundary value problems with deviating argument. In this method, reproducing kernels with Chebyshev polynomial form are used (C-RKM). The convergence and an error estimation of the method are discussed. The efficiency and the accuracy of the method is demonstrated on some n...

متن کامل

Bivariate Lagrange Interpolation at the Chebyshev Nodes

We discuss Lagrange interpolation on two sets of nodes in two dimensions where the coordinates of the nodes are Chebyshev points having either the same or opposite parity. We use a formula of Xu for Lagrange polynomials to obtain a general interpolation theorem for bivariate polynomials at either set of Chebyshev nodes. An extra term must be added to the interpolation formula to handle all poly...

متن کامل

On minimal cubature formulae for product weight functions 1

We derive in a simple way certain minimal cubature formulae, obtained by Morrow and Patterson [2], and Xu [4], using a different technique. We also obtain in explicit form new near minimal cubature formulae. Then, as a corollary, we get a compact expression for the bivariate Lagrange interpolation polynomials, based on the nodes of the cubature.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Approximation Theory

دوره 195  شماره 

صفحات  -

تاریخ انتشار 2015