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 some aspects of multivariate polynomial interpolation

The purpose of this paper is to present some aspects of multivariate Hermite polynomial interpolation. We do not focus on algebraic considerations, combinatoric and geometric aspects, but on explicitation of formulas for uniform and non-uniform bivariate interpolation and some higher dimensional problems. The concepts of similar and equivalent interpolation schemes are introduced and some differential aspects related to them are also investigated. This revised version was published online in June 2006 with corrections to the Cover Date.     

On a Hermite interpolation on the sphere

The purpose of this paper is to put forward a kind of Hermite interpolation scheme on the unit sphere. We prove the superposition interpolation process for Hermite interpolation on the sphere and give some examples of interpolation schemes. The numerical examples shows that this method for Hermite interpolation on the sphere is feasible. And this paper can be regarded as an extension and a development of Lagrange interpolation on the sphere since it includes Lagrange interpolation as a particular case.     

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 the Hermite interpolation

Explicit representations for the Hermite interpolation and their derivatives of any order are provided.Furthermore,suppose that the interpolated function f has continuous derivatives of sufficiently high order on some sufficiently small neighborhood of a given point x and any group of nodes are also given on the neighborhood.If the derivatives of any order of the Hermite interpolation polynomial of f at the point x are applied to approximating the corresponding derivatives of the function f(x),the asymptotic representations for the remainder are presented.     

Discrete Sturm–Liouville problems, Jacobi matrices and Lagrange interpolation series

The close relationship between discrete Sturm–Liouville problems belonging to the so-called limit-circle case, the indeterminate Hamburger moment problem and the search of self-adjoint extensions of the associated semi-infinite Jacobi matrix is well known. In this paper, all these important topics are also related with associated sampling expansions involving analytic Lagrange-type interpolation series.     

Geometry of interpolation sets in derivative free optimization

We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be directly approximated. We show how the bounds on the error between an interpolating polynomial and the true function can be used in the convergence theory of derivative free sampling methods. These bounds involve a constant that reflects the quality of the interpolation set. The main task of such a derivative free algorithm is to maintain an interpolation sampling set so that this constant remains small, and at least uniformly bounded. This constant is often described through the basis of Lagrange polynomials associated with the interpolation set. We provide an alternative, more intuitive, definition for this concept and show how this constant is related to the condition number of a certain matrix. This relation enables us to provide a range of algorithms whilst maintaining the interpolation set so that this condition number or the geometry constant remain uniformly bounded. We also derive bounds on the error between the model and the function and between their derivatives, directly in terms of this condition number and of this geometry constant.     

Two-level Galerkin–Lagrange multipliers method for the stationary Navier–Stokes equations

In this paper, we combine the Galerkin–Lagrange multiplier (GLM) method with the two-level method to solve the stationary Navier–Stokes equations in order to avoid the time-consuming process and the construction of zero-divergence elements. Different quadrilateral partitions are used for approximating the velocity and the pressure. Then some error estimates are obtained and some numerical results of the GLM method and the two-level GLM method are given. The results show that the two-level method based on the GLM method is more efficient than the GLM method under the convergence rate of same order.     

On a quadratic functional occurring in a bivariate scattered data interpolation problem

Sunto L’applicazione di noti metodi che utilizzano funzioni di tipo blending per la costruzione di funzioni bivariate C¹ per l’interpolazione di dati, richiede la conoscenza delle derivate parziali del primo ordine ai vertici di una triangolazione sottostante. In questo lavoro consideriamo il metodo proposto da Nielson, che consiste nel calcolare stime delle derivate parziali del primo ordine minimizzando un opportuno funzionale quadratico, caratterizzato da parametri di tensione non negativi. Scopo del lavoro è l’analisi di alcune proprietà particolari di questo funzionale per la costruzione di algoritmi efficienti e robusti per la determinazione delle stime suddette delle derivate quando si ha a che fare con insiemi di dati di grandi dimensioni. Abstract The application of widely known blending methods for constructingC ¹ bivariate functions interpolating scattered data requires the knowledge of the partial derivatives of first order at the vertices of an underlying triangulation. In this paper we consider the method proposed by Nielson that consists in computing estimates of the first order partial derivatives by minimizing an appropriate quadratic functional, characterized by nonnegative tension parameters. The aim of the paper is to analyse some peculiar properties of this functional in order to construct robust and efficient algorithms for determining the above estimates of the derivatives when we are concerned with extremely large data sets.      

On the Domain of Divergence of Hermite–Fejér Interpolating Polynomials

Recently, the study of the behavior of the Hermite–Fejér interpolants in the complex plane was initiated by L. Brutman and I. Gopengauz (1999, Constr. Approx.15, 611–617). It was shown that, for a broad class of interpolatory matrices on [−1, 1], the sequence of polynomials induced by Hermite–Fejér interpolation to f(z)≡z diverges everywhere in the complex plane outside the interval of interpolation [−1, 1]. In this note we amplify this result and prove that the divergence phenomenon takes place without any restriction on the interpolatory matrices.     

Solution of the Ulam stability problem for Euler–Lagrange–Jensen k‐quintic mappings

In this paper, we are introducing pertinent Euler–Lagrange–Jensen type k‐quintic functional equations and investigate the ‘Ulam stability’ of these new k‐quintic functional mappings f:X→Y, where X is a real normed linear space and Y a real complete normed linear space. We also solve the Ulam stability problem for Euler–Lagrange–Jensen alternative k‐quintic mappings. Copyright © 2016 John Wiley & Sons, Ltd.     

Optimal interpolation of convergent algebraic series

Let , –1<x ₁<...<x _n <1. Denote , t∈(–1,1). Given a function f∈W we try to recover f(ζ) at fixed point ζ∈(–1,1) by an algorithm A on the basis of the information f(x ₁),...,f(x _n ). We find the intrinsic error of recovery . This work is supported by RFBR (grant 07-01-00167-a and grant 06-01-00003).     

Error estimates of Hermite interpolation

This paper presents a procedure for obtaining error estimates for Hermite interpolation at the Chebyshev nodes {cos ((2j+1)/2n)} _j ^=0n–1 –1x1, for functionsf(x) of various orders of continuity. The procedure is applicable in many cases when the usual Lagrangian error bound is not, and is a better bound, in general, when both are applicable.     

ON LAGRANGE INTERPOLATION TO ｜x｜^α（1 〈α 〈 2） WITH EQUALLY SPACED NODES

S.M. Lozinskii proved the exact convergence rate at the zero of Lagrange interpolation polynomials to |x| based on equidistant nodes in [−1,1], In 2000, M. Rever generalized S.M. Lozinskii’s result to |x|^α(0≤α≤1). In this paper we will present the exact rate of convergence at the point zero for the interpolants of |x|^α(1<α<2).     

Bernstein–Nikolskii inequalities and Riesz interpolation formula on compact homogeneous manifolds

Bernstein–Nikolskii inequalities and Riesz interpolation formula are established for eigenfunctions of Laplace operators and polynomials on compact homogeneous manifolds.     

Complex interpolation of Herz‐type Triebel–Lizorkin spaces

We study complex interpolation of Herz‐type Triebel–Lizorkin spaces by using the Calderón product method. Additionally we present complex interpolation between Herz‐type Triebel–Lizorkin spaces and Triebel–Lizorkin spaces . Moreover, we apply these results to obtain the complex interpolation of Triebel–Lizorkin spaces equipped with power weights and between (or ) spaces and Herz spaces.     

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.     

Marcinkiewicz–Zygmund inequalities and interpolation by spherical harmonics

We find necessary density conditions for Marcinkiewicz–Zygmund inequalities and interpolation for spaces of spherical harmonics in with respect to the L^p norm. Moreover, we prove that there are no complete interpolation families for p≠2.