Professional Documents
Culture Documents
Na Notes
Na Notes
2) Open Methods: These methods can involve one or more initial guesses, but there
is no need for them to bracket the root.
i) Secant Method
ii) Newton-Raphson Method
iii) Interpolation Methods
ADVANTAGES:
1. Bisection can be shown to be an "optimal" algorithm for functions that change
sigh in [a,b] in that it produces the smallest interval of uncertainty in a given # of
iterations
2. f(x) need not be continuous on [a,b]
DISADVANTAGES/DRAWBACKS:
4. Two initial guesses are required,with f(a) f(b) <0. This may prove difficult
5. If there are multiple zeros in the interval there is no guidance as to which will be
chosen
6. Linear convergence may be slow compared to other methods
Q) Explain Interpolation.
A) Interpolation is a method of constructing new data points within the range of a
discrete set of known data points.
INTERPOLANTS: An interpolant is a function L=L(x) which agrees with a particular
function f at a set of known points and which is used to compute values for f(x) at
those points.
METHODS OF INTERPOLATION:
1. Direct Method
2. Newton Dividend Difference
3. Lagrange Interpolation
TYPES OF INTERPOLATION:
1. Linear Interpolation
2. Quadratic Interpolation
3. Cubic Interpolation
TYPES OF DIFFERENCES:
1. Dividend Differences: Divided differences is a recursive division process. The
method can be used to calculate the coefficients in the interpolation polynomial in
the Newton form.This difference is useful when the function is tabulated at unequal
intervals.
2. Forward Difference: When the data points are equidistantly distributed we get the
special case called forward differences. They are easier to calculate than the more
general divided differences.
3. Backward Difference: It is same as forward difference
4. Central Difference: (Not in the Course)
COMPARISONS/DIFFERENCES
* Bracketing Method vs Open Method