Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Numerical Methods-FINALS

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 4

From the two data points(2,5) and (6, 11), using Lagrange polynomial

method, the polynomial is Li(x) = 1.5x +2.


= True
Reducing the equidistant points improves the approximation of the function,
f(x) by the polynomial, P.
= False
Simpson’s 1/3 rule is an example of an open type numerical integration
method
= False
In differentiation using numerical methods, one of the steps is interpolating
the function by a polynomial p at suitable points.
= True
The degree of the polynomial for the 10 sample values or data points is
equal to 10.
= False
The coefficients of the Newton's interpolating polynomial can also be
expressed in terms of divided difference.
= True
Using Lagrange interpolation, with data given below compute for f(1.5)
x0 = 0                          f(x0) = 2
x1 = 3                          f(x1) = 7
the solution is f(1.5) = 4.5
= True
In numerical integration, when both the end points of the interval of
integration are used as nodes in the methods, the methods are called
closed type methods
= True
Using Lagrange interpolation, with data given below compute for f(1.5)
x0 = 0                          f(x0) = 2
x1 = 3                          f(x1) = 7
x2 = 5                          f(x2) = 9
the solution is f(1.5) = 4.8
= True
For a two segment trapezoidal rule, it will use the points similar to the ones
used by Simpson’s 1/3 rule.
= True
For an interval of 0 to 1, a subinterval with a size of 0.2 will give n = 5
described as  5 segment Trapezoidal rule.
= True
A cubic polynomial can interpolate three points.
= False
While using two sets of points (x0,y0) and (x1,y1) a straight line is formed and
could use the slope equation which follows that the first derivative can be
approximated using the given values.
= True
Simpson’s 1/3 rule uses a second degree polynomial formed by the two
points of the original function.
= False
First order differences is equivalent f[x0,x1] when i = 0.
= True
In Newton-Cotes integration methods, the nodes   are uniformly
distributed in [a, b] with x0 = a, xn = band the spacing h = (b – a) / n.
= True
In using smaller integration interval for multiple segments, Trapezoidal
method can reduce the approximation error better than Simpson’s 1/3 rule
= False
Simpson's rule is a numerical method that approximates the value of a
definite integral by using third degree polynomials
= False
Another method called midpoint rule is an open type method numerical
integration.
= True
In numerical differentiation, using a very small step size may increase the
approximation error.
= True
It is possible to approximate a function by using values outside the data
points which is known as the linear interpolation.
= False
The coefficient a0 is also equal to f(x0) in the Newton’s interpolating
polynomial.
= True
Given the function f(x) = 0.75 + 1.1x, an exact value can be given instantly
by Trapezoidal rule
= True
Trapezoidal rule is a numerical method that approximates the value of a
definite integral by using first degree polynomial
= True
The approximate integral of 
= False
Numerical integrations such as Trapezoidal and Simpson’s 1/3 rule should
have intervals that are uniform.
= True
Using Newton’s interpolation, with data given below to compute for f(1.5)
x0 = 0                          f(x0) = 2
x1 = 3                          f(x1) = 7
x2 = 5                          f(x2) = 9
The first order from x0 = 0 to x1 = 3 has a value of 4.8 which is similar to
Lagrange.
= False
Using Newton’s interpolation, with data given below to compute for f(1.5)
x0 = 0                          f(x0) = 2
x1 = 3                          f(x1) = 7
x2 = 5                          f(x2) = 9
The second ordervalue is 1/3.
= False
For both the Trapezoidal and Simpson’s 1/3 rule , using more strips will
give better approximation of the curve.
= True
The approximate integral of 
= True
Using Newton’s interpolation, with data given below to compute for f(1.5)
x0 = 0                          f(x0) = 2
x1 = 3                          f(x1) = 7
x2 = 5                          f(x2) = 9
The first order from x0 = 3 to x1 = 5 has a value of 1
= True
Only four points are needed in constructing a fourth order Newton Divided
Difference polynomial,
= False
Using Newton’s interpolation, with data given below compute for f(1.5)
x0 = 0                          f(x0) = 2
x1 = 3                          f(x1) = 7
x2 = 5                          f(x2) = 9
The solution of Y(1.5)=4.8
= True
Thealgorithm of the Trapezoidalrule is described by
>>h=(b-a)/n
>>x=a sum=f(x)
>>for i=1:n-1
>>x=x+h
>>sum=sum+2*f(x)
>> end
>>sum=sum+f(b)
>>(b-a)*sum/(2*n)
= True
If the interval of the function is given as 0 to pi, for n = 6 segments, each
node or segments will be 
= True
A continuous function’s integral is approximated using either the
trapezoidal or Simpson’s rule by translating the function into discrete form.
= True
The point was added to the Simpson’s 1/3 Rule which gives a
better approximation to the integral of the function.
= False
From the two data points (1,4) and (3, 7), and (4,10) using Lagrange
polynomial method, the polynomial is Li(x) =  0.5x2 -0.5x +2.
= False
If the function, f(x) = cos3x was approximated by the polynomial, P(1.5) = -
0.2, the amount of error approximately 0.05
= True

You might also like