Scribd
Upload
79 views7 pages

ASSIGNMENT: Numerical Analysis Submitted To: Miss Sidra Ayub Submitted by

The document discusses various types of interpolation and extrapolation techniques: 1. Interpolation estimates values within a known discrete data set. Extrapolation estimates values beyond the original data range and is more uncertain. 2. Inverse interpolation finds the x-value corresponding to a given y-value between two data points. 3. Lagrange interpolation uses polynomials of lowest degree that pass through given data points. 4. Spline interpolation uses piecewise polynomials called splines for interpolation, avoiding issues like oscillation seen in high degree polynomial interpolation.

Uploaded by

Saad khan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
79 views7 pages

ASSIGNMENT: Numerical Analysis Submitted To: Miss Sidra Ayub Submitted by

The document discusses various types of interpolation and extrapolation techniques: 1. Interpolation estimates values within a known discrete data set. Extrapolation estimates values beyond the original data range and is more uncertain. 2. Inverse interpolation finds the x-value corresponding to a given y-value between two data points. 3. Lagrange interpolation uses polynomials of lowest degree that pass through given data points. 4. Spline interpolation uses piecewise polynomials called splines for interpolation, avoiding issues like oscillation seen in high degree polynomial interpolation.

Uploaded by

Saad khan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 7

ASSIGNMENT: Numerical Analysis

Submitted to: Miss Sidra Ayub

Submitted by:
QUESTION:

Explain the following with counter example?

ANSWER:

1- Interpolation:

 Interpolation is a type of estimation, a method of constructing new data

points within the range of a discrete set of known data points.

Interpolation is the determination or estimation of the value of f(x), or

a function of x, from certain known values of the function. If x0 < … < xn and y0 = f(x0),

…, yn = f(xn) are known, and if x0 < x < xn, then the estimated value of f(x) is said to be

an interpolation.

1
An interpolation of a finite set of points on an epitrochoid. The points in red are

connected by blue interpolated spline curves deduced only from the red points.

The interpolated curves have polynomial formulas much simpler than that of the

original epitrochoid curve.

2- Extrapolation:

In mathematics, extrapolation is a type of estimation, beyond the original

observation range, the value of a variable on the basis of its relationship with

another variable. It is similar to interpolation, which produces estimates between

known observations, but extrapolation is subject to greater uncertainty and a

higher risk of producing meaningless results. Extrapolation may also mean

extension of a method, assuming similar methods will be applicable. Extrapolation

may also apply to human experience to project, extend, or expand known

experience into an area not known or previously experienced so as to arrive at a

(usually conjectural) knowledge of the unknown.

2
Example illustration of the extrapolation problem, consisting of assigning a

meaningful value at the blue box, at x=7, given the red data points.

3- Inverse Interpolation:

Sometimes we have to find the value of  x for a given values of y not in the table.

This reverse process is known as inverse interpolation.

Thus inverse interpolation is defined as the process of finding the value of the

argument corresponding to a given value of the function lying between two

tabulated functional values.

In numerical analysis, inverse quadratic interpolation is a root-finding algorithm,

meaning that it is an algorithm for solving equations of the form f(x) = 0. The idea is

to use quadratic interpolation to approximate the inverse of f. This algorithm is

rarely used on its own, but it is important because it forms part of the

popular Brent's method.

3
4- Lagrange Interpolation:

In numerical analysis, Lagrange polynomials are used for polynomial

interpolation. For a given set of points (xj and yj) with no two xj values equal, the

Lagrange polynomial is the polynomial of lowest degree that assumes at each

value xj the corresponding value yj, so that the functions coincide at each point.

This image shows, for four points ((−9, 5), (−4, 2), (−1, −2), (7, 9)), the (cubic)

interpolation polynomial L(x) (dashed, black), which is the sum of the scaled basis

polynomials y0ℓ0(x), y1ℓ1(x), y2ℓ2(x) and y3ℓ3(x). The interpolation polynomial passes

through all four control points, and each scaled basis polynomial passes through its

4
respective control point and is 0 where x corresponds to the other three control

points

5- Spline interpolation:

In the mathematical field of numerical analysis, spline interpolation is a form

of interpolation where the interplant is a special type of piecewise polynomial called

a spline. Spline interpolation is often preferred over polynomial

interpolation because the interpolation error can be made small even when using

low degree polynomials for the spline. Spline interpolation avoids the problem

of Runge's phenomenon, in which oscillation can occur between points when

interpolating using high degree polynomials.

5
Interpolation with cubic splines between eight points. Hand-drawn technical

drawings were made for shipbuilding etc. using flexible rulers that were bent to

follow pre-defined points

You might also like