On the divided differences of the remainder in polynomial interpolation

We present formulas for the divided differences of the remainder of the interpolation polynomial that include some recent interesting formulas as special cases.     

On polynomial interpolation of two variables

Polynomial interpolation of two variables based on points that are located on multiple circles is studied. First, the poisedness of a Birkhoff interpolation on points that are located on several concentric circles is established. Second, using a factorization method, the poisedness of a Hermite interpolation based on points located on various circles, not necessarily concentric, is established. Even in the case of Lagrange interpolation, this gives many new sets of poised interpolation points.     

On the Sauer-Xu formula for the error in multivariate polynomial interpolation

Use of a new notion of multivariate divided difference leads to a short proof of a formula by Sauer and Xu for the error in interpolation, by polynomials of total degree in variables, at a `correct' point set.

     

On multivariate polynomial interpolation

We provide a map which associates each finite set in complexs-space with a polynomial space from which interpolation to arbitrary data given at the points in is possible and uniquely so. Among all polynomial spacesQ from which interpolation at is uniquely possible, our is of smallest degree. It is alsoD- and scale-invariant. Our map is monotone, thus providing a Newton form for the resulting interpolant. Our map is also continuous within reason, allowing us to interpret certain cases of coalescence as Hermite interpolation. In fact, our map can be extended to the case where, with eachgq, there is associated a polynomial space P, and, for given smoothf, a polynomialqQ is sought for which

A fast algorithm for multivariate Hermite interpolation

Multivariate Hermite interpolation is widely applied in many fields, such as finite element construction, inverse engineering, CAD etc.. For arbitrarily given Hermite interpolation conditions, the typical method is to compute the vanishing ideal I （the set of polynomials satisfying all the homogeneous interpolation conditions are zero） and then use a complete residue system modulo I as the interpolation basis. Thus the interpolation problem can be converted into solving a linear equation system. A generic algorithm was presented in [18], which is a generalization of BM algorithm [22] and the complexity is O（τ^3） where r represents the number of the interpolation conditions. In this paper we derive a method to obtain the residue system directly from the relative position of the points and the corresponding derivative conditions （presented by lower sets） and then use fast GEPP to solve the linear system with O（（τ ＋ 3）τ^2） operations, where τ is the displacement-rank of the coefficient matrix. In the best case τ = 1 and in the worst case τ = [τ/n], where n is the number of variables.     

Intertwining unisolvent arrays for multivariate Lagrange interpolation

Generalizing a classical idea of Biermann, we study a way of constructing a unisolvent array for Lagrange interpolation in C^n+m out of two suitably ordered unisolvent arrays respectively in Cⁿ and C^m. For this new array, important objects of Lagrange interpolation theory (fundamental Lagrange polynomials, Newton polynomials, divided difference operator, vandermondian, etc.) are computed. AMS subject classification 41A05, 41A63     

A de Montessus type convergence study of a least-squares vector-valued rational interpolation procedure

In a recent paper of the author [A. Sidi, A new approach to vector-valued rational interpolation, J. Approx. Theory 130 (2004) 177–187], three new interpolation procedures for vector-valued functions F(z), where F:C→C^N, were proposed, and some of their algebraic properties were studied. One of these procedures, denoted IMPE, was defined via the solution of a linear least-squares problem. In the present work, we concentrate on IMPE, and study its convergence properties when it is applied to meromorphic functions with simple poles and orthogonal vector residues. We prove de Montessus and Koenig type theorems when the points of interpolation are chosen appropriately.     

A new approach to vector-valued rational interpolation

In this work we propose three different procedures for vector-valued rational interpolation of a function F(z), where , and develop algorithms for constructing the resulting rational functions. We show that these procedures also cover the general case in which some or all points of interpolation coalesce. In particular, we show that, when all the points of interpolation collapse to the same point, the procedures reduce to those presented and analyzed in an earlier paper (J. Approx. Theory 77 (1994) 89) by the author, for vector-valued rational approximations from Maclaurin series of F(z). Determinant representations for the relevant interpolants are also derived.     

Lagrange插值公式与Hermite插值公式的注记

给出一种基于商的形式的Lagrange与Hermite插值公式及其证明,同时还给出了两个相关的不等式.     

On the poisedness of Bojanov–Xu interpolation

In this paper, we consider the bivariate Hermite interpolation introduced by Bojanov and Xu [SIAM J. Numer. Anal. 39(5) (2002) 1780–1793]. The nodes of the interpolation with Π_2k-δ, where δ=0 or 1, are the intersection points of 2k+1 distinct rays from the origin with a multiset of k+1-δ concentric circles. Parameters are the values and successive radial derivatives, whenever the corresponding circle is multiple. The poisedness of this interpolation was proved only for the set of equidistant rays [Bojanov and Xu, 2002] and its counterparts with other conic sections [Hakopian and Ismail, East J. Approx. 9 (2003) 251–267]. We show that the poisedness of this (k+1-δ)(2k+1) dimensional Hermite interpolation problem is equivalent to the poisedness of certain 2k+1 dimensional Lagrange interpolation problems. Then the poisedness of Bojanov–Xu interpolation for a wide family of sets of rays satisfying some simple conditions is established. Our results hold also with above circles replaced by ellipses, hyperbolas, and pairs of parallel lines.Next a conjecture [Hakopian and Ismail, J. Approx. Theory 116 (2002) 76–99] concerning a poisedness relation between the Bojanov–Xu interpolation, with set of rays symmetric about x-axis, and certain univariate lacunary interpolations is established. At the end the poisedness for a wide class of lacunary interpolations is obtained.     

On specific stability bounds for linear multiresolution schemes based on piecewise polynomial Lagrange interpolation

The Deslauriers-Dubuc symmetric interpolation process can be considered as an interpolatory prediction scheme within Harten's framework. In this paper we express the Deslauriers-Dubuc prediction operator as a combination of either second order or first order differences. Through a detailed analysis of certain contractivity properties, we arrive to specific l_∞-stability bounds for the multiresolution transform. A variety of tests indicate that these l_∞ bounds are closer to numerical estimates than those obtained with other approaches.     

A Newton type rational interpolation formula

We give a Newton type rational interpolation formula (Theorem 2.2). It contains as a special case the original Newton interpolation, as well as the interpolation formula of Liu, which allows to recover many important classical q-series identities. We show in particular that some bibasic identities are a consequence of our formula.     

Algebraic properties of some new vector-valued rational interpolants

In a recent paper of the author [A. Sidi, A new approach to vector-valued rational interpolation, J. Approx. Theory, 130 (2004) 177–187], three new interpolation procedures for vector-valued functions F(z), where , were proposed, and some of their properties were studied. In this work, after modifying their definition slightly, we continue the study of these interpolation procedures. We show that the interpolants produced via these procedures are unique in some sense and that they are symmetric functions of the points of interpolation. We also show that, under the conditions that guarantee uniqueness, they also reproduce F(z) in case F(z) is a rational function.     

A Kind of Generalization of the Curve Type Node Configuration in R^S（S 〉 2）

A kind of generalization of the Curve Type Node Configuration is given in this paper,and it is called the generalized node configuration CTNCB in RS(S＞2).The related multivariate polynomial interpolation problem is discussed.It is proved that the CTNCB is an appropriate node configuration for the polynomial space PSn (S＞2).And the expressions of the multivariate Vandermonde determinants that are related to the Odd Curve Type Node Configuration in R2 are also obtained.     

Lagrange‐type basis for multivariate uniform integrable tensor‐product Birkhoff interpolation

Birkhoff interpolation is the most general interpolation scheme. We study the Lagrange‐type basis for uniform integrable tensor‐product Birkhoff interpolation. We prove that the Lagrange‐type basis of multivariate uniform tensor‐product Birkhoff interpolation can be obtained by multiplying corresponding univariate Lagrange‐type basis when the integrable condition is satisfied. This leads to less computational complexity, which drops to from .     

A continuity property of multivariate Lagrange interpolation

Let be a sequence of interpolation schemes in of degree (i.e. for each one has unique interpolation by a polynomial of total degree and total order . Suppose that the points of tend to as and the Lagrange-Hermite interpolants, , satisfy for all monomials with . Theorem: for all functions of class in a neighborhood of . (Here denotes the Taylor series of at 0 to order .) Specific examples are given to show the optimality of this result.

     

On interpolation by radial polynomials

A lemma of Micchelli's, concerning radial polynomials and weighted sums of point evaluations, is shown to hold for arbitrary linear functionals, as is Schaback's more recent extension of this lemma and Schaback's result concerning interpolation by radial polynomials. Schaback's interpolant is explored. Happy 60th and beyond, Charlie! Mathematics subject classifications (2000) 41A05, 41A6.