Practice Problems
Practice Problems
Practice Problems
Vector spaces
2x1 + 2x2 − x3 + x5 = 0
x1 + x2 − 2x3 − x5 = 0
x3 + x4 + x5 = 0.
(14) Find a basis and the dimension of the solution space of the homogeneous system
(1) Solve the system of equations 4x1 + x2 + x3 = 2, x1 + 5x2 + 2x3 = −6, x1 + 2x2 + 3x3 = −4
using the Jacobi iteration method. Use the initial approximations as (i) xi = 0, i = 1, 2, 3, (ii)
x1 = 0.5, x2 = −0.5, x3 = −0.5. Perform five iterations in each case.
(2) State the sufficient conditions for the existence of solution for system of linear equations using
Gauss-Jacobi method.
(3) Solve the system of equations 26x1 +2x2 +2x3 = 12.6, 3x1 +27x2 +x3 = −14.3, 2x1 +3x2 +17x3 =
6.0 using the Jacobi iteration method. Obtain the result correct to three decimal places.
(4) What is the disadvantage of the Gauss-Jacobi method?
(5) Distinguish between Gauss-Jacobi and Gauss-Seidel method.
(6) Find the solution of the system of equations 45x1 + 2x2 + 3x3 = 58, −3x1 + 22x2 + 2x3 = 47,
5x1 + x2 + 20x3 = 67 correct to three decimal places, using the Gauss-Seidel iteration method.
(7) Computationally show that Gauss-Seidel method applied to the system of equations 3x1 − 6x2 +
2x3 = 23, −4x1 + x2 − x3 = −8, x1 − 3x2 + 7x3 = 17 diverges. Take the initial approximations
as x1 = 0.9, x2 = −3.1, x3 = 0.9. Interchange the first and second equations and solve the
resulting system by the Gauss-Seidel method. Again take the initial approximations as x1 = 0.9,
x2 = −3.1, x3 = 0.9, and obtain the result correct
totwo decimal places.
1 2
(8) Determine the dominant eigen value of A = by power method.
3 4
(9) Determine the numerically largest eigen value and the corresponding eigen vector of the following
25 1 2
matrix, using the power method. 1 3 0 .
2 0 4
Nonlinear equations
(1) Locate the intervals which contain the positive real roots of the equation x3 −3x+1 = 0. Obtain
these roots correct to three decimal places, using the method of false position.
(2) Find the root correct to two decimal places of the equation xex = cos x, using the method of
false position.
(3) Perform four iterations of the Newton’s method to find the smallest positive root of the equation
f (x) = x3 − 5x + 1 = 0.
(4) Derive the Newton’s method for finding 1/N , where N > 0. Hence, find 1/17, using the initial
approximation as (i) 0.05, (ii) 0.15. Do the iterations converge?
(5) State the advantages of Newton’s method over method of false position.
4
(1) Using the data sin(0.1) = 0.09983 and sin (0.2) = 0.19867, find an approximate value of sin
(0.15) by Lagrange interpolation.
(2) Use Lagrange’s formula, to find the quadratic polynomial that takes the values
x 0 1 3
y 0 1 0
(3) Given that f(0) = 1, f(1) = 3, f(3) = 55, find the unique polynomial of degree 2 or less, which
fits the given data
x -1 1 4 7
(4) Construct the Lagrange interpolation polynomial for the data
y -2 0 63 342
x -1 0 2 3
(5) Obtain the divided difference table for the data
f(x) -8 3 1 12
(6) Find f(x) as a polynomial in x for the following data by Newton’s divided difference formula
x -4 1 0 2 5
f(x) 1245 33 5 9 1335
(7) Find f(x) as a polynomial in x for the following data by Newton’s divided difference formula
x -2 -1 0 1 3 4
Hence, interpolate at x = 0.5 and x = 3.1.
f(x) 9 16 17 18 44 81
x -1 0 1 2
(8) Construct the forward and backward difference table for the data
f(x) -8 3 1 12
(9) For the following data, calculate the differences and obtain the Newton’s forward and backward
difference interpolation polynomials. Are these polynomials different? Interpolate at x = 0.25
x 0.1 0.2 0.3 0.4 0.5
and x = 0.35.
f(x) 1.40 1.56 1.76 2.0 2.28
x 1 2 3 4
(1) Find dy/dx at x = 1 from the following table of values
f(x) 1 8 27 64
⋆ ⋆ ⋆ ⋆ ⋆⋆