Scribd
Upload
11 views4 pages

Ass 7

Uploaded by

androwbeshay14
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views4 pages

Ass 7

Uploaded by

androwbeshay14
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Hermite

Interpolation &
Extrapolation
By
Andrew Beshay Mousa
Sec: 2

Under the supervision : Dr/ khaled Abdelgab


Introduction:
Hermite interpolation is a numerical technique used to approximate a
function when both function values and derivative values are known at
specific points. Unlike Lagrange interpolation, which only considers the
values of the function, Hermite interpolation provides a more accurate
representation of functions by incorporating derivative information. This
makes it particularly useful in applications where smoothness and
precision are essential, such as computer graphics, curve fitting, and
numerical solutions to differential equations.
Extrapolation using Hermite interpolation involves extending the curve
beyond the known data range. However, as with all extrapolation
techniques, it becomes less reliable the farther one moves from the known
data points.

---------------------------------------------------------------

The Hermite Polynomial:


The Hermite interpolation polynomial H(x)H(x) is constructed as:

∑𝑛𝑖=0 [𝑓(𝑥𝑖)ℎ𝑖(𝑥) + 𝑓 ′ (𝑥𝑖)ℎ𝑖 ′ (𝑥 )]

where hi(x)hi (x) are the basis functions, and hi′(x)hi′ (x) are their
derivatives, ensuring that the function and its derivatives match the given
data at each point.

The basic functions are derived such that:

ℎ𝑖 (𝑥𝑗) = 𝛿𝑖𝑗, ℎ𝑖 ′ (𝑥𝑗) = 𝛿𝑖𝑗 ′ ℎ𝑖(𝑥𝑗) = 𝛿𝑖𝑗, ℎ𝑖 ′(𝑥𝑗) = 𝛿𝑖𝑗 ′

where 𝛿𝑖𝑗 is the Kronecker delta.


---------------------------------------------------------------

Advantages and Limitations:


Advantages:

▪ Provides higher accuracy by incorporating derivative data.


▪ Ensures smoothness in the interpolated curve.
Limitations:

▪ Computationally intensive for large datasets.


▪ Extrapolation accuracy diminishes rapidly beyond the known data
range.
----------------------------------------------------------------

Extrapolation with Hermite Polynomials:


When extrapolating, the Hermite polynomial is used to predict values
outside the given data interval. While the inclusion of derivative data can
improve initial accuracy compared to other methods, the unreliability of
extrapolation remains a significant concern. To mitigate errors, smaller
intervals or additional data points may be required.

----------------------------------------------------------------

Example:
Suppose we have points :

(𝑥0, 𝑓(𝑥0), 𝑓 ′ (𝑥0)) (𝑥0, 𝑓(𝑥0), 𝑓 ′ (𝑥0)) and (𝑥1,𝑓 (𝑥1), 𝑓 ′ (𝑥1))(𝑥1
, 𝑓(𝑥1),𝑓 ′ (𝑥1)).

The Hermite polynomial is constructed by combining the contributions of


f(x)f(x) and f′(x)f′(x) at both points.

𝑓𝑜𝑟: 𝑥0 = 0, 𝑥1 = 1, 𝑓(0) = 1, 𝑓 ′ (0) = 0, 𝑓(1) = 2, 𝑓 ′ (1) = 3𝑥0 = 0, 𝑥1


= 1, 𝑓(0) = 1
, 𝑓 ′ (0) = 0, 𝑓(1) = 2, 𝑓 ′ (1) = 3

𝐻(𝑥 ) = 1 ⋅ ℎ0(𝑥 ) + 0 ⋅ ℎ0′ (𝑥 ) + 2 ⋅ ℎ1(𝑥 ) + 3 ⋅ ℎ1′ (𝑥 ). 𝐻(𝑥 )


= 1 ⋅ ℎ0(𝑥 ) + 0 ⋅ ℎ0′ (𝑥 ) + 2 ⋅ ℎ1(𝑥) + 3 ⋅ ℎ1′ (𝑥 ).

The polynomial is then expanded and simplified for use in interpolation and
extrapolation.
---------------------------------------------------------------
Conclusion:
Hermite interpolation utilizes function values and derivatives to provide
smooth and accurate approximations, ideal for applications requiring
precision. While effective within known data ranges, extrapolation risks
significant errors and requires caution. This method supports complex
problem-solving across various fields, though its implementation demands
attention to computational cost and data reliability.

You might also like