A General Formula of Polynomial Interpolation

نویسندگان

چکیده

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

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

منابع مشابه

General Interpolation by Polynomial Functions of Distributive Lattices

For a distributive lattice L, we consider the problem of interpolating functions f : D → L defined on a finite set D ⊆ L, by means of lattice polynomial functions of L. Two instances of this problem have already been solved. In the case when L is a distributive lattice with least and greatest elements 0 and 1, Goodstein proved that a function f : {0, 1} → L can be interpolated by a lattice poly...

متن کامل

Polynomial Interpolation

Consider a family of functions of a single variable x: Φ(x; a0, a1, . . . , an), where a0, . . . , an are the parameters. The problem of interpolation for Φ can be stated as follows: Given n + 1 real or complex pairs of numbers (xi, fi), i = 0, . . . , n, with xi 6= xk for i 6= k, determine a0, . . . , an such that Φ(xi; a0, . . . , an) = fi, i = 0, . . . , n. The above is a linear interpolatio...

متن کامل

A numerical study of the Xu polynomial 2 interpolation formula in two variables 3

8 In his paper " Lagrange interpolation on Chebyshev points of two variables " (J. 9 220–238), Y. Xu proposed a set of Chebyshev like points for polynomial interpolation in the square 10 [−1, 1] 2 , and derived a compact form of the corresponding Lagrange interpolation formula. We inves-11 tigate computational aspects of the Xu polynomial interpolation formula like numerical stability and 12 ef...

متن کامل

Subdivision Invariant Polynomial Interpolation

In previous works a polynomial interpolation method for triangular meshes has been introduced. This interpolant can be used to design smooth surfaces of arbitrary topological type. In a design process, it is very useful to be able to locate the deformation made on a geometric model. The previously introduced interpolant has the so-called strict locality property: when a mesh vertex is changed, ...

متن کامل

On partial polynomial interpolation

The Alexander-Hirschowitz theorem says that a general collection of k double points in P imposes independent conditions on homogeneous polynomials of degree d with a well known list of exceptions. We generalize this theorem to arbitrary zero-dimensional schemes contained in a general union of double points. We work in the polynomial interpolation setting. In this framework our main result says ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1929

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500013596