Osculatory Interpolation

Jim Lambers
MAT 460/560
Fall Semester 2009-10
Lecture 19 Notes
These notes correspond to Section 3.3 in the text.
Osculatory Interpolation
Suppose that the interpolation points are perturbed so that two neighboring points π‘₯𝑖 and π‘₯𝑖+1 ,
0 ≀ 𝑖 < 𝑛, approach each other. What happens to the interpolating polynomial? In the limit, as
π‘₯𝑖+1 β†’ π‘₯𝑖 , the interpolating polynomial 𝑝𝑛 (π‘₯) not only satisfies 𝑝𝑛 (π‘₯𝑖 ) = 𝑦𝑖 , but also the condition
𝑝′𝑛 (π‘₯𝑖 ) =
lim
π‘₯𝑖+1 β†’π‘₯𝑖
𝑦𝑖+1 βˆ’ 𝑦𝑖
.
π‘₯𝑖+1 βˆ’ π‘₯𝑖
It follows that in order to ensure uniqueness, the data must specify the value of the derivative of
the interpolating polynomial at π‘₯𝑖 .
In general, the inclusion of an interpolation point π‘₯𝑖 π‘˜ times within the set π‘₯0 , . . . , π‘₯𝑛 must be
(𝑗)
accompanied by specification of 𝑝𝑛 (π‘₯𝑖 ), 𝑗 = 0, . . . , π‘˜ βˆ’ 1, in order to ensure a unique solution.
These values are used in place of divided differences of identical interpolation points in Newton
interpolation.
Interpolation with repeated interpolation points is called osculatory interpolation, since it can
be viewed as the limit of distinct interpolation points approaching one another, and the term
β€œosculatory” is based on the Latin word for β€œkiss”.
Hermite Interpolation
In the case where each of the interpolation points π‘₯0 , π‘₯1 , . . . , π‘₯𝑛 is repeated exactly once, the
interpolating polynomial for a differentiable function 𝑓 (π‘₯) is called the Hermite polynomial of 𝑓 (π‘₯),
and is denoted by 𝐻2𝑛+1 (π‘₯), since this polynomial must have degree 2𝑛 + 1 in order to satisfy the
2𝑛 + 2 constraints
𝐻2𝑛+1 (π‘₯𝑖 ) = 𝑓 (π‘₯𝑖 ),
β€²
𝐻2𝑛+1
(π‘₯𝑖 ) = 𝑓 β€² (π‘₯𝑖 ),
𝑖 = 0, 1, . . . , 𝑛.
The Hermite polynomial can be described using Lagrange polynomials and their derivatives,
but this representation is not practical because of the difficulty of differentiating and evaluating
these polynomials. Instead, one can construct the Hermite polynomial using a divided-difference
table, as discussed previously, in which each entry corresponding to two identical interpolation
points is filled with the value of 𝑓 β€² (π‘₯) at the common point. Then, the Hermite polynomial can be
represented using the Newton divided-difference formula.
1
Example We will use Hermite interpolation to construct the third-degree polynomial 𝑝3 (π‘₯) that
fits the data
𝑖
0,1
2,3
π‘₯𝑖
0
1
𝑓 (π‘₯𝑖 )
0
0
𝑓 β€² (π‘₯𝑖 )
1
1
In other words, we must have 𝑝3 (0) = 0, 𝑝′3 (0) = 1, 𝑝3 (1) = 0, and 𝑝′3 (1) = 1. To include the values
of 𝑓 β€² (π‘₯) at the two distinct interpolation points, we repeat each point once, so that the number of
interpolation points, including repetitions, is equal to the number of constraints described by the
data.
First, we construct the divided-difference table from this data. The divided differences in the
table are computed as follows:
𝑓 [π‘₯0 ] = 𝑓 (π‘₯0 )
= 0
𝑓 [π‘₯1 ] = 𝑓 (π‘₯1 )
= 0
𝑓 [π‘₯2 ] = 𝑓 (π‘₯2 )
= 0
𝑓 [π‘₯3 ] = 𝑓 (π‘₯3 )
= 0
𝑓 [π‘₯1 ] βˆ’ 𝑓 [π‘₯0 ]
𝑓 [π‘₯0 , π‘₯1 ] =
π‘₯1 βˆ’ π‘₯0
β€²
= 𝑓 (π‘₯0 )
= 1
𝑓 [π‘₯2 ] βˆ’ 𝑓 [π‘₯1 ]
𝑓 [π‘₯1 , π‘₯2 ] =
π‘₯2 βˆ’ π‘₯1
0βˆ’0
=
1βˆ’0
= 0
𝑓 [π‘₯3 ] βˆ’ 𝑓 [π‘₯2 ]
𝑓 [π‘₯2 , π‘₯3 ] =
π‘₯3 βˆ’ π‘₯2
β€²
= 𝑓 (π‘₯2 )
= 1
𝑓 [π‘₯1 , π‘₯2 ] βˆ’ 𝑓 [π‘₯0 , π‘₯1 ]
𝑓 [π‘₯0 , π‘₯1 , π‘₯2 ] =
π‘₯2 βˆ’ π‘₯0
0βˆ’1
=
1βˆ’0
2
= βˆ’1
𝑓 [π‘₯2 , π‘₯3 ] βˆ’ 𝑓 [π‘₯1 , π‘₯2 ]
𝑓 [π‘₯1 , π‘₯2 , π‘₯3 ] =
π‘₯3 βˆ’ π‘₯1
1βˆ’0
=
1βˆ’0
= 1
𝑓 [π‘₯1 , π‘₯2 , π‘₯3 ] βˆ’ 𝑓 [π‘₯0 , π‘₯1 , π‘₯2 ]
𝑓 [π‘₯0 , π‘₯1 , π‘₯2 , π‘₯3 ] =
π‘₯3 βˆ’ π‘₯0
1 βˆ’ (βˆ’1)
=
1βˆ’0
= 2
Note that the values of the derivative are used whenever a divided difference of the form 𝑓 [π‘₯𝑖 , π‘₯𝑖+1 ]
is to be computed, where π‘₯𝑖 = π‘₯𝑖+1 . This makes sense because
lim
𝑓 [π‘₯𝑖 , π‘₯𝑖+1 ] =
π‘₯𝑖+1 β†’π‘₯𝑖
lim
π‘₯𝑖+1 β†’π‘₯𝑖
𝑓 (π‘₯𝑖+1 ) βˆ’ 𝑓 (π‘₯𝑖 )
= 𝑓 β€² (π‘₯𝑖 ).
π‘₯𝑖+1 βˆ’ π‘₯𝑖
The resulting divided-difference table is
π‘₯0 = 0
𝑓 [π‘₯0 ] = 0
𝑓 [π‘₯0 , π‘₯1 ] = 1
π‘₯1 = 0
𝑓 [π‘₯0 , π‘₯1 , π‘₯2 ] = βˆ’1
𝑓 [π‘₯1 ] = 0
𝑓 [π‘₯1 , π‘₯2 ] = 0
π‘₯2 = 1
𝑓 [π‘₯0 , π‘₯1 , π‘₯2 , π‘₯3 ] = 2
𝑓 [π‘₯2 ] = 0
𝑓 [π‘₯1 , π‘₯2 , π‘₯3 ] = 1
𝑓 [π‘₯2 , π‘₯3 ] = 1
π‘₯3 = 1
𝑓 [π‘₯3 ] = 0
It follows that the interpolating polynomial 𝑝3 (π‘₯) can be obtained using the Newton divideddifference formula as follows:
𝑝3 (π‘₯) =
3
βˆ‘
𝑗=0
𝑓 [π‘₯0 , . . . , π‘₯𝑗 ]
π‘—βˆ’1
∏
(π‘₯ βˆ’ π‘₯𝑖 )
𝑖=0
= 𝑓 [π‘₯0 ] + 𝑓 [π‘₯0 , π‘₯1 ](π‘₯ βˆ’ π‘₯0 ) + 𝑓 [π‘₯0 , π‘₯1 , π‘₯2 ](π‘₯ βˆ’ π‘₯0 )(π‘₯ βˆ’ π‘₯1 ) +
𝑓 [π‘₯0 , π‘₯1 , π‘₯2 , π‘₯3 ](π‘₯ βˆ’ π‘₯0 )(π‘₯ βˆ’ π‘₯1 )(π‘₯ βˆ’ π‘₯2 )
= 0 + (π‘₯ βˆ’ 0) + (βˆ’1)(π‘₯ βˆ’ 0)(π‘₯ βˆ’ 0) + 2(π‘₯ βˆ’ 0)(π‘₯ βˆ’ 0)(π‘₯ βˆ’ 1)
= π‘₯ βˆ’ π‘₯2 + 2π‘₯2 (π‘₯ βˆ’ 1).
We see that Hermite interpolation, using divided differences, produces an interpolating polynomial
that is in the Newton form, with centers π‘₯0 = 0, π‘₯1 = 0, and π‘₯2 = 1. β–‘
3