0% found this document useful (0 votes)
54 views9 pages

Mid Term (Nov 2009)

The document is a 9-page exam paper for a numerical methods course containing 4 questions. It provides instructions, problems, and formulas relevant to the exam topics of numerical interpolation and approximation, matrix operations in Maple, finding lines of best fit, and using Newton's divided difference interpolation formula.

Uploaded by

Astiger Ishak
Copyright
© Attribution Non-Commercial (BY-NC)
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
0% found this document useful (0 votes)
54 views9 pages

Mid Term (Nov 2009)

The document is a 9-page exam paper for a numerical methods course containing 4 questions. It provides instructions, problems, and formulas relevant to the exam topics of numerical interpolation and approximation, matrix operations in Maple, finding lines of best fit, and using Newton's divided difference interpolation formula.

Uploaded by

Astiger Ishak
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 9

Page 1 of 9

CONFIDENTIAL



MID TERM EXAMINATION
NOVEMBER SEMESTER 2009

BACHELOR OF CIVIL ENGINEERING (HONS)
BACHELOR OF ELECTRONICS ENGINEERING (HONS)

NUMERICAL METHODS
BMM 301

(TIME: 1 HOUR)


______________________________

______________________________________


LECTURER: SHEILA ILANGOVAN




GENERAL INSTRUCTIONS


1. This question booklet consists of 7 printed pages including this page.
2. Answer the questions in the Question Booklet.




NAME :
CONFIDENTIAL

NAME :

Page 2 of 9
INSTRUCTIONS: TIME : 1 HOUR
Answer ALL Questions in the Question Booklet.

1. For question 1 (a) to (c), write the command in Maple statements.
a) To fix into 4 decimal places
______________________________________ (2 marks)

b) To print the elements in the diagonal as
2 1
, d d and
3
d from the given
matrix
|
|
|
.
|

\
|

=
1 3 1
2 5 4
0 2 1
A . (3 marks)




c) To plot a graph of = ) (x f x e
x
cos

.
____________________________________________ (2 marks)

d) In general terms, briefly explain the difference between interpolation
polynomial of degree 2 and least square parabola. (3 marks)





Page 3 of 9
2.
















According to the Maple coding given above, you are required to sketch a graph
for the function given in order to estimate the location of the root. Hence, find an
approximation for the root. (10 marks)
















Page 4 of 9
































Page 5 of 9
3. a) The following linear equations were given in class to find the coefficients
a and b for the line of best fit b ax y + = for a set of N data points.



= +
= +
i i
i i i i
y bN x a
y x x b x a
2


Without using Maple (but you may use calculator) write out the linear system
which would have to be solved to find the line of best fit for the following
data set: (8 marks)
x
y
-1.5 3.0
0 4.2
4.8 6.1
6.7 8.5



















Page 6 of 9
b) Solve the above linear system to find the line of best fit for the data. (4 marks)











The line of best fit is ) (x f = _________________ (2 marks)


c) Evaluate the function for the value
) 0 . 2 ( f = _________________ (1 mark)















Page 7 of 9
4. From the following table of
x
e :
x 1.0 1.2 1.4 1.6
x
e
2.7183 3.3201 4.0552 4.9530

is known that 5 . 4 =
c
e . Use the table above to estimate the more accurate value of
c by using the Newton divided differential interpolation polynomial. Perform all
the calculations in four decimal places. (10 marks)

























Page 8 of 9
FORMULA SHEET


Thomas Algorithm
|
|
|
|
|
|
.
|

\
|

n n
n n n
d c
e d c
e d c
e d
0 0
0 0
0 0
1 1 1
2 2 2
1 1


=
|
|
|
|
|
|
.
|

\
|

n n
n n
c
c
c

0 0
0
0
0 0
0 0 0
1 1
2 2
1


|
|
|
|
|
|
.
|

\
|

1 0 0 0
1 0 0
0
1 0
0 0 1
1
2
1



where
1 1
d =
1
=
i i i i
c d , n i ,...., 3 , 2 =
i
i
i
e

= , 1 ,...., 3 , 2 , 1 = n i
solve Lw = b by using algorithm (forward substitution)

1 1 1
/ b w = ,
( )
i i i i i
w c b w /
1
= , n i , , 3 , 2 =
solve Ux = w by using algorithm (backward substitution)
,
n n
w x =
,
1 +
=
i i i i
x w x 1 , , 2 , 1 = n n i


Lagrange Formula
( ) ( )
i
n
i
i
f x L x P

=
=
0
, ( )
( )
( )
[
=
=

=
n
i j
o j j i
j
i
x x
x x
x L

Page 9 of 9

Newtons Divided Differential Formula
( ) | | | |( ) | |( )( ) + + + + =
1 0 2 1 0 0 1 0 0
, , , x x x x x x x f x x x x f x f x P
| |( )( ) ( )
1 1 0 1 1 0
, ,..., ,


n n n
x x x x x x x x x x f

You might also like