Research Article | Open Access

# Hermite Interpolation on the Unit Circle Considering up to the Second Derivative

**Academic Editor:**G. Ólafsson

#### Abstract

The paper is devoted to study the Hermite interpolation problem on the unit circle. The interpolation conditions prefix the values of the polynomial and its first two derivatives at the nodal points and the nodal system is constituted by complex numbers equally spaced on the unit circle. We solve the problem in the space of Laurent polynomials by giving two different expressions for the interpolation polynomial. The first one is given in terms of the natural basis of Laurent polynomials and the remarkable fact is that the coefficients can be computed in an easy and efficient way by means of the Fast Fourier Transform (FFT). The second expression is a barycentric formula, which is very suitable for computational purposes.

#### 1. Introduction

One of the pioneering papers concerning Hermite interpolation on the unit circle is [1]. There a Fejér’s type theorem is proved (see [2, 3]), for nodal systems constituted by the roots of a complex number with modulus one. The main result asserts that the Hermite-Fejér interpolants uniformly converge for continuous functions on the unit circle. Some improvements to this result, considering nonvanishing derivatives and more smooth functions, were given in [4]. More recently, in [5], the order of convergence of Hermite-Fejér interpolants for analytic functions on a disk and on an annulus containing the unit circle was obtained.

The classical Hermite interpolation on the circle with nodal points equally spaced was studied in [6]. There it was constructed an orthogonal basis for the space of polynomials in order to obtain the expression of the interpolation polynomials. The coefficients of the interpolation polynomials in this basis can be computed by using the FFT. In [7], the same problem was studied and the corresponding expressions for the Laurent polynomials of interpolation were obtained in a more simple way. Another basis was constructed and again the coefficients can be computed by using the FFT. From these formulas, suitable expressions for the fundamental polynomials were obtained and the barycentric formulas for Hermite interpolation on the unit circle were deduced for the first time. The barycentric formulas were known for Hermite interpolation on the bounded interval (see [8]), but [7] was a new contribution on the circle.

A study about Hermite interpolation on two disjoint sets of nodes on the unit circle has been developed in [9] and problems considering more than one derivative were also considered. Indeed, lacunary Hermite interpolation problems have been also studied on some nonuniformly distributed nodes on the unit circle (see [10]).

In the present paper we study generalized Hermite interpolation problems on the unit circle considering nodal points equally spaced and using the values for the first two derivatives. First we obtain suitable basis for subspaces of the space of Laurent polynomials by considering appropriate interpolation conditions. This enables us to express the interpolation polynomials in such a way that the coefficients can be computed by using the FFT.

In the second part of the paper we deduce the barycentric formulas which constitute a new contribution of the paper. Like in the Lagrange interpolation (see [11]), the barycentric expressions are very useful for doing evaluations and calculus due to their stability (see [12]).

#### 2. Laurent Hermite Interpolation Polynomials

We study the generalized Hermite interpolation problem on the unit circle considering the first two derivatives. The nodal system is constituted by the -roots of a complex number , with ; that is, it consists of complex numbers equally spaced on the unit circle. The problem to solve can be posed as follows.

If and are two nondecreasing sequences of nonnegative integers such that , find the unique Laurent polynomial satisfying the interpolation conditions where and are prefixed complex numbers.

For simplicity and without loss of generality we consider the case when and and we denote the polynomial by .

To obtain an expression of the interpolation polynomial, first we introduce some auxiliary polynomials belonging to the Laurent space that we denote by , , and , with , and which are characterized by the following interpolation conditions: for .

Proposition 1. *For , the polynomials , , and satisfying (2), (3), and (4), respectively, have the following expressions:
*

*Proof. *The polynomial that interpolates satisfying (2) has the following form:
By applying the first interpolation condition we get that and by using the second interpolation condition we have . Taking again derivatives and applying the third interpolation condition we obtain . Thus we have a linear system in the unknowns , and , which has the following solutions , , and , from which we obtain the expression of .

The polynomial satisfying (3) has the form
By imposing the first interpolation condition we get .

If we assume that , we take derivatives and use the second interpolation condition then we obtain . By taking again derivatives and using the third interpolation condition we have . Hence we have a system with unknowns , , and , which has the following solutions: , and .

If then . Thus if we evaluate at and apply the second interpolation condition we get . By taking again derivatives and using the third interpolation condition we have . Then, if we solve the corresponding system we have that and . Hence we obtain the expression for given in our statement.

Finally, the polynomial satisfying (4) can be written as By applying the first interpolation condition we obtain and if we use the second interpolation condition we get .

Now if we assume that and use the third interpolation condition we obtain . Then, if we solve the corresponding system we have , , and .

If and we use the third interpolation condition we obtain . By solving the system we have the following solution: , and .

Finally, if then . By solving the corresponding system in the unknowns , and we obtain that , and .

Next we prove that these auxiliary polynomials constitute a suitable basis of the space .

Proposition 2. *The system
**
is an orthogonal basis of the Laurent space with respect to the inner product defined by
**
for .**Moreover, it holds
*

*Proof. *It is easy to check that

Now we are in conditions to obtain the expression of the polynomial satisfying (1) that we denote for simplicity . It is clear that it can be written as where , and are the solutions of the following problems: and it satisfies , , and for . and it satisfies , , and . and it satisfies , , and .

Proposition 3. *The polynomials , , , and defined before have the following expressions: *(i)(ii)(iii)(iv)

*Proof. *(i) It is clear that can be written as
For computing the coefficients we take into account that . On the other hand, it holds that and therefore . Hence, using the expression of , we have (i).

(ii) Proceeding in the same way, can be written as
On one hand, if we calculate the inner product we have
On the other hand, it holds that
and therefore
Hence, taking into account the expression of , we obtain (ii).

(iii) We write as follows
By computing the inner product, we obtain
Therefore
and we obtain the expression of given in (iii).

(iv) It is straightforward from

Next we consider the particular cases in which the nodes are roots of and , obtaining the following results.

Corollary 4. *(i) If are the roots of , then the Hermite interpolation polynomial satisfying (1) is
**(ii) If are the roots of , then the Hermite interpolation polynomial satisfying (1) is
*

Corollary 5. *(i) If are the roots of , then the Hermite interpolation polynomial satisfying (1) is
**(ii) If are the roots of , then the Hermite interpolation polynomial satisfying (1) is
*

*Remark 6. *(a) From , and in Proposition 3 it is immediate to obtain an expression for the fundamental polynomials of Hermite interpolation.

(b) Notice that the coefficients of the expressions given before can be computed in an easy and efficient way by using the FFT.

#### 3. Barycentric Expression

In this section, our aim is to obtain a barycentric expression for the interpolation polynomial . We distinguish two cases according to the nodal system having an even or odd number of points.

##### 3.1. Nodal System with an Even Number of Points

First we assume that the nodal system has an even number of points that we denote by and we try to obtain the expression of that we denote for simplicity, . Since can be written in terms of the fundamental polynomials of Hermite interpolation first we obtain suitable expressions for these polynomials.

Lemma 7. *The polynomials , , and for satisfy *(i)

*,*(ii)

*and*.*, ,*(iii)

*and*,*, , , ,*

*and*.*Proof. *Taking into account that , then it is clear that , for all , , for all . In the same way, it is immediate to see that for all for , , for , and . Furthermore, for , and for and for and .

For obtaining the exact nonvanishing values we proceed as follows.(i)If we define , we obtain . By taking derivatives and evaluating at we get , from which we deduce .(ii)In the same way, if we define we get that . By taking derivatives and evaluating at we obtain and , from which we deduce the values of and .(iii)Finally, if we define we get . By evaluating and its derivatives at we have that , and , from which we obtain the values of , , and .

Proposition 8. *The fundamental polynomials of the Hermite interpolation in the Laurent space , , , and , for , characterized by
**
have the following expressions
*

*Proof. *It is clear that , , and can be written in the following form:
with , , and given in Lemma 7.

To compute take into account that it must be . Then applying the preceding lemma we get that , from which it follows that .

For computing and we use that and and we obtain the following system:
By applying Lemma 7 and solving the system we get the result.

Finally, to obtain the coefficients , and in the expression of , we proceed in the same way. By applying the interpolation conditions we have the system
Then, by using Lemma 7 and solving the system we conclude our result.

It is straightforward to deduce, from the preceding Proposition 8, the so-called barycentric expression for .

Proposition 9. *(i) The polynomial satisfying the conditions , , and , has the following barycentric expression:
**(ii) The polynomial satisfying the conditions , , and , , has the following barycentric expression:
**(iii) The polynomial satisfying the conditions , , and , , has the following barycentric expression:
**(iv) The polynomial satisfying (1) has the following barycentric expression:
*

*Proof. *(i) It is immediate if we take into account that , with given in Proposition 8. Thus, if we divide the polynomial by , that is,
and we use the expressions of , after doing some simplifications, we obtain the result.

(ii) Take into account that , with given in Proposition 8 and proceed in the same way as in (i).

(iii) Take into account that , with given in Proposition 8 and proceed in the same way as in (i).

(iv) Take into account that
with , and given in Proposition 8 and proceed in the same way as in (i).

##### 3.2. Nodal System with an Odd Number of Points

Now we assume that the nodal system is constituted by the roots of , with . In this case we obtain the barycentric expression for the Laurent polynomial of Hermite interpolation that we denote by , characterized by where and are fixed complex numbers.

Proceeding like in the previous case, first we obtain the following auxiliary results.

Lemma 10. *The Laurent polynomials, and for , satisfy*(i)*, for all , for all , and ,*(ii)*, for all , for all ,*(iii)

*,*

*for all*,*for all*