On multivariate Hermite interpolation

We study the problem of Hermite interpolation by polynomials in several variables. A very general definition of Hermite interpolation is adopted which consists of interpolation of consecutive chains of directional derivatives. We discuss the structure and some aspects of poisedness of the Hermite interpolation problem; using the notion of blockwise structure which we introduced in [10], we establish an interpolation formula analogous to that of Newton in one variable and use it to derive an integral remainder formula for a regular Hermite interpolation problem. For Hermite interpolation of degreen of a functionf, the remainder formula is a sum of integrals of certain (n + 1)st directional derivatives off multiplied by simplex spline functions.     

About measures and nodal systems for which the Hermite interpolants uniformly converge to continuous functions on the circle and interval

We obtain the Laurent polynomial of Hermite interpolation on the unit circle for nodal systems more general than those formed by the n-roots of complex numbers with modulus one. Under suitable assumptions for the nodal system, that is, when it is constituted by the zeros of para-orthogonal polynomials with respect to appropriate measures or when it satisfies certain properties, we prove the convergence of the polynomial of Hermite-Fejér interpolation for continuous functions. Moreover, we also study the general Hermite interpolation problem on the unit circle and we obtain a sufficient condition on the interpolation conditions for the derivatives, in order to have uniform convergence for continuous functions.Finally, we obtain some improvements on the Hermite interpolation problems on the interval and for the Hermite trigonometric interpolation.     

Error estimates for Hermite interpolation on spheres

In this paper, we prove convergence rates for spherical spline Hermite interpolation on the sphere S^d−1 via an error estimate given in a technical report by Luo and Levesley. The functionals in the Hermite interpolation are either point evaluations of pseudodifferential operators or rotational differential operators, the desirable feature of these operators being that they map polynomials to polynomials. Convergence rates for certain derivatives are given in terms of maximum point separation.     

New algorithm for computing the Hermite interpolation polynomial

Let x ₀, x ₁,? , x _n , be a set of n + 1 distinct real numbers (i.e., x _i ≠ x _j , for i ≠ j) and y _{i, k} , for i = 0,1,? , n, and k = 0 ,1 ,? , n _i , with n _i ≥ 1, be given of real numbers, we know that there exists a unique polynomial p _{N ? 1}(x) of degree N ? 1 where \(N={\sum }_{i=0}^{n}(n_{i}+1)\), such that \(p_{N-1}^{(k)}(x_{i})=y_{i,k}\), for i = 0,1,? , n and k = 0,1,? , n _i . P _N?1(x) is the Hermite interpolation polynomial for the set {(x _i , y _{i, k} ), i = 0,1,? , n, k = 0,1,? , n _i }. The polynomial p _N?1(x) can be computed by using the Lagrange polynomials. This paper presents a new method for computing Hermite interpolation polynomials, for a particular case n _i = 1. We will reformulate the Hermite interpolation polynomial problem and give a new algorithm for giving the solution of this problem, the Matrix Recursive Polynomial Interpolation Algorithm (MRPIA). Some properties of this algorithm will be studied and some examples will also be given.     

C 1 Quadratic and C 2 Quartic Macro-Elements on a Modified Morgan-Scott Triangulation

In this paper, we construct a quadratic composite finite element of class C ¹ and quartic composite finite element of class C ² on a new triangulation τ ₁₀ which is obtained by splitting each triangle of a given triangulation τ into ten smaller subtriangles. These new elements can be used for constructing spline spaces with local basis that can be applied for solving some Hermite interpolation problems with optimal approximation order.     

A composition formula for squares of Hermite polynomials and its generalizations

We prove a general formula which, with appropriately chosen parameters, gives a composition formula for squares of Gould–Hopper polynomials g²_n(x,h), and hence also for Hermite polynomials. Our main tool is the classical Mehler formula, but with imaginary arguments. To cite this article: P. Graczyk, A. Nowak, C. R. Acad. Sci. Paris, Ser. I 338 (2004).     

A constructive approach to cubic Hermite Fractal Interpolation Function and its constrained aspects

The theory of splines is a well studied topic, but the kinship of splines with fractals is novel. We introduce a simple explicit construction for a -cubic Hermite Fractal Interpolation Function (FIF). Under some suitable hypotheses on the original function, we establish a priori estimates (with respect to the L _p -norm, 1≤p≤∞) for the interpolation error of the -cubic Hermite FIF and its first derivative. Treating the first derivatives at the knots as free parameters, we derive suitable values for these parameters so that the resulting cubic FIF enjoys global smoothness. Consequently, our method offers an alternative to the standard moment construction of -cubic spline FIFs. Furthermore, we identify appropriate values for the scaling factors in each subinterval and the derivatives at the knots so that the graph of the resulting -cubic FIF lies within a prescribed rectangle. These parameters include, in particular, conditions for the positivity of the cubic FIF. Thus, in the current article, we initiate the study of the shape preserving aspects of fractal interpolation polynomials. We also provide numerical examples to corroborate our results.     

Clusters of point matrices

Along with classical orthogonal polynomials, we consider orthogonal polynomials of degree n ? 1 at n points. These arise naturally from interpolation polynomials. The name “point matrices” is justified by the fact that we deal, not with a class of similar or congruent matrices that play a key role in a linear space and are related to its bases, but with matrices with a fixed set of nodes (or points) x ₁, …, x _n . A certain matrix cluster corresponds to each set of nodes. It is stated that there exists a simple connection between eigenproblems of a Hankel matrix H and a symmetric Jacobi matrix T.     

A New Class of Generalized Polynomials Associated with Hermite and Euler Polynomials

In this paper, we introduce a new class of generalized polynomials associated with the modified Milne-Thomson’s polynomials \({\Phi_{n}^{(\alpha)}(x,\nu)}\) of degree n and order α introduced by Dere and Simsek. The concepts of Euler numbers E _n , Euler polynomials E _n (x), generalized Euler numbers E _n (a, b), generalized Euler polynomials E _n (x; a, b, c) of Luo et al., Hermite–Bernoulli polynomials \({{_HE}_n(x,y)}\) of Dattoli et al. and \({{_HE}_n^{(\alpha)} (x,y)}\) of Pathan are generalized to the one \({ {_HE}_n^{(\alpha)}(x,y,a,b,c)}\) which is called the generalized polynomials depending on three positive real parameters. Numerous properties of these polynomials and some relationships between E _n , E _n (x), E _n (a, b), E _n (x; a, b, c) and \({{}_HE_n^{(\alpha)}(x,y;a,b,c)}\) are established. Some implicit summation formulae and general symmetry identities are derived using different analytical means and applying generating functions.     

Expansions for the Fundamental Hermite Interpolation Polynomials in Terms of Chebyshev Polynomials

We obtain explicit expansions of the fundamental Hermite interpolation polynomials in terms of Chebyshev polynomials in the case where the nodes considered are either zeros of the (n + 1)th-degree Chebyshev polynomial or extremum points of the nth-degree Chebyshev polynomial.     

Zur Bestimmung vonE n [x n+2m ]

Remark on the estimation ofE _n [x ^n+2m ]. Let be $$E_n [f]: = \mathop {\inf }\limits_{p \in P_n } \mathop {\sup }\limits_{x \in [ - 1, 1]} |f(x) - p(x)|$$ (P _n : set of all polynomials of degreen). Riess-Johnson [4] proved (3) $$E_n [x^{n + 2m} ] = \frac{{n^{m - 1} }}{{2^{n + 2m - 1} (m - 1)!}}[1 + O(n^{ - 1} )],n even.$$ This degree of approximation is realized by expansion in Chebyshev polynomials and by interpolation at Chebyshev nodes. The purpose of this paper is to give a more precise estimation by constructing the polynomial of best approximation on a finite set. This construction is easily done and one obtains the result, that the termO(n ^?1) in (3) may be replaced by 1/2(m ? 1) (3m + 2)n ^?1 + O(n ^?2).     

Bivariate Hermite Interpolation and Numerical Curves

In this paper, Hermite interpolation by bivariate algebraic polynomials of total degree ?nis considered. The interpolation parameters are the values of a function and its partial derivatives up to some ordern_ν−1 at the nodesz_ν=(x_ν, y_ν),ν=1, …, s, wheren_νis the multiplicity ofz_ν. The sequence ={n₁, …, n_s; n} of multiplicities associated with the degree of interpolating polynomials is investigated. Some results of the paper were announced in [GHS93].     

Generic hypersurface singularities

The problem considered here can be viewed as the analogue in higher dimensions of the one variable polynomial interpolation of Lagrange and Newton. Let x₁,...,x_r be closed points in general position in projective spacePn, then the linear subspaceV ofH⁰ (?ⁿ,O(d)) (the space of homogeneous polynomials of degreed on ?ⁿ) formed by those polynomials which are singular at eachx_i, is given by r(n + 1) linear equations in the coefficients, expressing the fact that the polynomial vanishes with its first derivatives at x₁,...,x_r. As such, the “expected” value for the dimension ofV is max(0,h⁰(O(d))?r(n+1)). We prove thatV has the “expected” dimension for d≥5 (theorem A). This theorem was first proven in [A] using a very complicated induction with many initial cases. Here we give a greatly simplified proof using techniques developed by the authors while treating the corresponding problem in lower degrees.     

The role of the endpoint in weighted polynomial approximation with varying weights

For a weight functionw: [a, b]→(0, ∞), we consider weighted polynomials of the formw ⁿ P_n where the degree ofP _n is at mostn. The class of functions that can be approximated with such polynomials depends on the behavior of the densityv(t) of the extremal measure associated withw. We show that every approximable function must vanish at the endpointa ifv(t) behaves like (t?a) ^β ast→a with β>?1/2. We also present an analogous result for internal points. Our results solve some open problems posed by V. Totik and disprove a conjecture of G.G. Lorentz on incomplete polynomials.     

Hermite pseudospectral approximations. An error estimate

We find an error bound for the pseudospectral approximation of a function in terms of Hermite functions, hn(x)=e−x²Hn(x), in certain weighted Sobolev spaces. We use properties of Hermite polynomials, as well as an asymptotic expression for their largest zeroes to achieve the mentioned estimate.     

Interpolation of operators of weak type (ϕ, ϕ)

Considering the measurable and nonnegative functions ? on the half-axis [0, ∞) such that ?(0) = 0 and ?(t) → ∞ as t → ∞, we study the operators of weak type (?, ?) that map the classes of ?-Lebesgue integrable functions to the space of Lebesgue measurable real functions on ?ⁿ. We prove interpolation theorems for the subadditive operators of weak type (?₀, ?₀) bounded in L _∞(?ⁿ) and subadditive operators of weak types (?₀, ?₀) and (?₁, ?₁) in L _?(? ⁿ ) under some assumptions on the nonnegative and increasing functions ?(x) on [0, ∞). We also obtain some interpolation theorems for the linear operators of weak type (?₀, ?₀) bounded from L _∞(?ⁿ) to BMO(? ⁿ). For the restrictions of these operators to the set of characteristic functions of Lebesgue measurable sets, we establish some estimates for rearrangements of moduli of their values; deriving a consequence, we obtain a theorem on the boundedness of operators in rearrangement-invariant spaces.     

Representation and approximation for generalized inverseA T,S (2) : Revisited

In this paper an alternative representation of the generalized inverseA _T,S ⁽²⁾ of a matrixA is given out, which drops the restriction on the nonnegativity of the spectrum ofGA for parameter matrixG satisfyingR(G) =T andN(G) =S. Based on this new representation and two special Hermitian interpolation polynomials we present two iterative schemes for computing the generalized inverseA _T,S ⁽²⁾ . The corresponding error bounds are also estimated. Finally, an example is shown to illustrate our theory.     

Gabor (super)frames with Hermite functions

We investigate vector-valued Gabor frames (sometimes called Gabor superframes) based on Hermite functions H _n . Let h = (H ₀, H ₁, . . . , H _n ) be the vector of the first n + 1 Hermite functions. We give a complete characterization of all lattices \({\Lambda \subseteq \mathbb{R} ^2}\) such that the Gabor system \({\{ {\rm e}^{2\pi i \lambda _{2} t}{\bf h} (t-\lambda _1): \lambda = (\lambda _1, \lambda _2) \in \Lambda \}}\) is a frame for \({L^2 (\mathbb{R} , \mathbb{C} ^{n+1})}\). As a corollary we obtain sufficient conditions for a single Hermite function to generate a Gabor frame and a new estimate for the lower frame bound. The main tools are growth estimates for the Weierstrass σ-function, a new type of interpolation problem for entire functions on the Bargmann–Fock space, and structural results about vector-valued Gabor frames.     

Cubic Splines with Minimal Norm

Natural cubic interpolatory splines are known to have a minimal L ₂-norm of its second derivative on the C ² (or W ₂ ² ) class of interpolants. We consider cubic splines which minimize some other norms (or functionals) on the class of interpolatory cubic splines only. The cases of classical cubic splines with defect one (interpolation of function values) and of Hermite C ¹ splines (interpolation of function values and first derivatives) with spline knots different from the points of interpolation are discussed.     

A markov type inequality for higher derivatives of polynomials

Let ‖·‖ be the weightedL ²-norm with weightw(t). LetP _n be the set of all complex polynomials whose degree does not exceedn and let \(\gamma _n^{(r)} : = \sup _{f \in P_n } \) (‖f ^(r)‖/‖f‖). In this paper we given upper and lower bound for γ _n ^(r) in the case of the Laguerre weight functionw(t)=exp (?t) and investigate its behaviour asn→∞. Moreover, we derive some identities concerningorthogonal polynomials.