Hermite interpolation and its numerical differentiation formula involving symmetric functions

By utilizing symmetric functions,this paper presents explicit representations for Hermite interpolation and its numerical differentiation formula.And the corresponding error estimates are also provided.

TRUNCATED HERMITE INTERPOLATION ON AN ARBITRARY SYSTEM OF NODES

The criteria of convergence, including a theorem of Grunwald- type and the rate of convergence in terms of the modulus omega phi (f,t) of Ditzian and Totik for truncated Hermite interpolation on ail arbitrary system of nodes are given.

ON THE POINTWISE ESTIMATIONS OF APPROXIMATION OF FUNCTIONS AND THEIR DERIVATIVES BY HERMITE INTERPOLATION

The object of this paper is to establish the pointwise estimations of approximation of functions in C^1 and their derivatives by Hermite interpolation polynomials. The given orders have been proved to be exact in gen- eral.

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.

A Verifiable Multi-Secret Sharing Scheme Based on Hermite Interpolation

A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange＇s interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one key, that is, a multi-secret sharing scheme has p （〉_ 2） keys. Dealer distribute shares of keys among n participants. Gathering t （〈 n） participants, keys can be reconstructed. Yang et al. （2004） gave a scheme of a （t, n） multi-secret sharing based on Lagrange＇s interpolation. Zhao et al. （2007） gave a scheme of a （t, n） verifiable multi-secret sharing based on Lagrange＇s interpolation. Recently, Adachi and Okazaki give a scheme of a （t, n） multi-secret sharing based on Hermite interpolation, in the case ofp 〈 t. In this paper, we give a scheme ofa （t, n） verifiable multi-secret sharing based on Hermite interpolation.

The Simultaneous Approximation Order by Hermite Interpolation in a Smooth Domain

Let D be a smooth domain in the complex plane. In D consider the simultaneous ap- proximation to a function and its ith (0≤i≤q) derivatives by Hermite interpolation. The orders of uniform approximation and approximation in the mean, are obtained under some domain boundary conditions. Some known results are included as particular cases of the theorems of this paper.

The Average Errors for Hermite Interpolation on the 1-Fold Integrated Wiener Space

For the weighted approximation in Lp-norm,the authors determine the weakly asymptotic order for the p-average errors of the sequence of Hermite interpolation based on the Chebyshev nodes on the 1-fold integrated Wiener space.By this result,it is known that in the sense of information-based complexity,if permissible information functionals are Hermite data,then the p-average errors of this sequence are weakly equivalent to those of the corresponding sequence of the minimal p-average radius of nonadaptive information.

Simultaneous Approximation of Sobolev Classes by Piecewise Cubic Hermite Interpolation

For the approximation in L_(p)-norm,we determine the weakly asymptotic orders for the simultaneous approximation errors of Sobolev classes by piecewise cubic Hermite interpolation with equidistant knots.For p=1,∞,we obtain its values.By these results we know that for the Sobolev classes,the approximation errors by piecewise cubic Hermite interpolation are weakly equivalent to the corresponding infinite-dimensional Kolmogorov widths.At the same time,the approximation errors of derivatives are weakly equivalent to the corresponding infinite-dimensional Kolmogorov widths.

MEAN CONVERGENCE OF HERMITE-FEJER TYPE INTERPOLATION ON AN ARBITRARY SYSTEM OF NODES

In this paper sufficient conditions for mean convergence and rate of convergence of Hermite-Fejer type interpolation in the Lp norm on an arbitrary system of nodes are presented.

The Convergence of Hermite Interpolation Operators on the Real Line

The present paper investigates the convergence of Hermite interpolation operators on the real line. The main result is： Given 0 〈 δo 〈 1/2, 0 〈 εo 〈 1. Let f ∈ C（-∞,∞） satisfy ｜y｜= O（e^（1/2-δo）xk^2,） and ｜f（x）｜t= O（e^（1-εo ）x2^）. Then for any given point x ∈ R, we have limn→Hn,（f, x） = f（x）.

On cubic Hermite coalescence hidden variable fractal interpolation functions

Hermite interpolation is a very important tool in approximation theory and nu- merical analysis, and provides a popular method for modeling in the area of computer aided geometric design. However, the classical Hermite interpolant is unique for a prescribed data set, and hence lacks freedom for the choice of an interpolating curve, which is a crucial requirement in design environment. Even though there is a rather well developed fractal theory for Hermite interpolation that offers a large flexibility in the choice of interpolants, it also has the short- coming that the functions that can be well approximated are highly restricted to the class of self-affine functions. The primary objective of this paper is to suggest a gl-cubic Hermite in- terpolation scheme using a fractal methodology, namely, the coalescence hidden variable fractal interpolation, which works equally well for the approximation of a self-affine and non-self-affine data generating functions. The uniform error bound for the proposed fractal interpolant is established to demonstrate that the convergence properties are similar to that of the classical Hermite interpolant. For the Hermite interpolation problem, if the derivative values are not actually prescribed at the knots, then we assign these values so that the interpolant gains global G2-continuity. Consequently, the procedure culminates with the construction of cubic spline coalescence hidden variable fractal interpolants. Thus, the present article also provides an al- ternative to the construction of cubic spline coalescence hidden variable fractal interpolation functions through moments proposed by Chand and Kapoor [Fractals, 15（1） （2007）, pp. 41-53].

UNIFORM CONVERGENCE OF HERMITE INTERPOLATION OF HIGHER ORDER

In this paper the uniform convergence of Hermite-Fejer interpolation and Griinwald type theorem of higher order on an arbitrary system of nodes are presented.

ON HIGH DIMENSIONAL INTERPOLATION

This paper introduces the definition of the Orthogonal Type Node Configuration and discusses the corresponding multivariate Lagrange, Hermite and Birkhoff interpolation problems in high dimensional space R s(s>2). This node configuration can be considered to be a kind of extension of the Cross Type Node Configuration , in R 2 to high dimensional spaces. And the Mixed Type Node Configuration in R s(s>2) is also discussed in this paper in an example.

General Interpolation Formulae for Barycentric Blending Interpolation

General interpolation formulae for barycentric interpolation and barycen- tric rational Hermite interpolation are established by introducing multiple parameters, which include many kinds of barycentric interpolation and barycentric rational Her- mite interpolation. We discussed the interpolation theorem, dual interpolation and special cases. Numerical example is given to show the effectiveness of the method.

Trivariate Polynomial Natural Spline for 3D Scattered Data Hermit Interpolation

Consider a kind of Hermit interpolation for scattered data of 3D by trivariate polynomial natural spline, such that the objective energy functional （with natural boundary conditions） is minimal. By the spline function methods in Hilbert space and variational theory of splines, the characters of the interpolation solution and how to construct it are studied. One can easily find that the interpolation solution is a trivariate polynomial natural spline. Its expression is simple and the coefficients can be decided by a linear system. Some numerical examples are presented to demonstrate our methods.

SOME REMARKs ON OVERCONVERGENCE OF HERMITE INTERPOLATING POLYNOMIALS

In this paper. a quantitative estimate for Hermite interpolant to function ψ(z)=(z^m-β~m)~l on the ze- ros of (z^n-α~n)~r is obtained Using this estimate. a rather wide exiension of the theorem of Walsh is proved and five special cases of it are given.

ON QUADRATURE FORMULAE FOR SINGULAR INTEGRALS OF ARBITRARY ORDER

Some quadrature formulae for the numerical evaluation of singular integrals of arbitrary order are established and both the estimate of remainder and the convergence of each quadrature formula derived here are also given.

Revising the unified hardening model by using a smoothed Hvorslev envelope

The original unified hardening(UH) model, in which a straight Hvorslev envelope was employed to determine the potential peak stress ratio of overconsolidated soils, is revised using a smoothed Hvorslev envelope(Hermite-Hvorslev envelope). The strength at the intersection between the straight Hvorslev envelope and the critical state surface(i.e. Mohr-Coulomb envelope) can be undefined due to the discontinuous change in the slope of the two linear strength envelopes mentioned above. A smoothed Hvorslev envelope is derived through Hermite interpolation to ensure a smooth change between the proposed Hvorslev envelope and the zero-tension surface as well as a smoothed transition between the proposed Hvorslev envelope and the critical state surface. The Hermite-Hvorslev envelope is then integrated into the original UH model, and then the UH models with four different functions of the Hvorslev envelope are compared with each other. The UH model revised by the Hermite-Hvorslev envelope can well predict the mechanical behaviors of normally consolidated and overconsolidated soils in drained and undrained conditions with the same parameters in the modified Cam-Clay model.

A NEW HIGH-ORDER MULTI-JOINT FINITE ELEMENTFOR THIN-WALLED BAR

A new high-order multi-joint finite element for thin-walled bar was derived from the Hermite interpolation polynomial and minimum potential energy principle. This element's characteristics are that it is of high accuracy and can be used in finite method analysis of bridge, tall mega-structure building.

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 Pns(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.