The Islamic University of Gaza Instructors:

Faculty of Engineering Dr. Mazen Abualtayef

Numerical Analysis ECIV 3306 Eng. Ahmed Jaber
Midterm Exam (10/4/2016) Eng. Afnan AL-Bahtiti
Allowable Time: 60 Minutes

:‫الرقم الجامعي‬ :‫ة‬/‫اسم الطالب‬

Using of Programmable Calculators is not allowed

Keep 4 significant figures in your calculations
Show all your calculation

Question (1): Choose the most appropriate answer [10 marks]

1. The secant method of finding roots of nonlinear equations falls under the
category of _________ method.
a) an open b) a bracketing c) a random d) a graphical

2. In a system of equations [A][B] = [C], if [A] is diagonally dominant, then

Gauss Siedel method _________.
a) always converge b) may or may not converge c) always diverge

3. The goal of forward elimination steps in Gauss Jordan elimination method

is to reduce the coefficient matrix to ___________ matrix.
a) an identity b) an upper triangular c) a lower triangular d) a diagonal

4. LU decomposition method is computationally more efficient than Naïve

Gauss elimination for ___________.
a) Solving less than ten simultaneous linear equations.
b) Solving multiple set of simultaneous linear equations with same
coefficient matrix but different right hand sides.
c) Solving multiple sets of simultaneous linear equations with different
coefficient matrices.
d) Solving a single set of simultaneous linear equations.

5. For finding the root of sin x = 0, using secant method the following choice
of initial guesses would not be appropriate
𝜋 𝜋 𝜋 3𝜋 𝜋 𝜋 𝜋 𝜋
a) & b) & c) - & d) &
4 2 4 4 2 2 3 2

6. If a system of equations Ax= C is ill condition, then:

a) Determinant of A equal zero b) Condition number of A equal one
c) Condition number of A is large d) ǁAǁ∞ is large

7. The set of equations 3x+y=5 and 9x+3y=8 can be described as ________

system.
a) no solution b) one solution
c) infinite number of solutions d) ill condition

8. Ill condition systems:

a) are systems where small changes in coefficients result in large change
in the solution.
b) happen when two or more equations are almost identical.

1
 c) are sensitive to round off errors.
d) All of the above.

9. Given f(3)=2, f '(3)=1, f "(3)=4; and that all other higher order derivatives
of f(x) are zero at x=3, and assuming the function and all its derivatives
exist and are continuous between x=3 and x=7, the value of f(7) is:
a) 38.000 b) 79.500 c)126.00 d) 331.50

10. The augmented matrix for a 3×3 system of linear equations [A:b] is given
2 6 1 8
by: [0 1 4 ⋮ 9].
4 2 1 4
The final solution matrix of this system using the Gauss Jordan elimination
without pivoting is given by:
1 2 5 0 1 0 0 0 1 0 0 2 1 0 0 2
a) [0 1 6 ⋮ 1] b) [0 1 0 ⋮ 1] c) [ 3 1 0 ⋮ 1] d) [0 1 0 ⋮ 1]
0 0 1 2 0 0 1 2 10 29 1 0 0 0 1 0

Question (2): [10 marks]

2
a) Given the function f(x) = x + 2x. The first iterative value of the root using
Newton Raphson method with initial guess of xo = 1 is _________.

𝟐−𝒆𝒙 +𝒙𝟐
b) The following function has a root near x = 1.5, f(x) =
𝟑
Use two iterations of the fixed-point iteration method to calculate the root
that will converge.

2
Question (3): [10 marks]
Consider the following system of equations:
15𝑥1 + 3𝑥2 + 6𝑥3 = -18
5𝑥1 + 10𝑥2 + 2𝑥3 = - 6
3𝑥1 + 𝑥2 + 8𝑥3 = 10

a) Solve the system using Gauss-Seidel method.

Employ guesses [x1 = -1.5, x2 = 0, x3 = 1.5], use two iterations
and find the approximation error.

b) Solve the system using Naïve Gauss elimination.

3
 Useful Formula
Bisection method

False position method

Newton-Raphson method

f (x i )(x i 1  x i )
Secant method x i 1  x i 
f (x i 1 )  f (x i )

f (x )  0  g (x )  x
Fixed point iteration x i 1  g (x i )