1. Sparse matrices arise in computing the numerical solution of …………….

2. The Jacobi’s method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal

3. Power method is applicable if the eigen values are ______________.

4. While solving a system of linear equations by Gauss Jordon Method, after all the elementary row operations if there lefts also zeros on the main diagonal then which of the is true about the system?

5. Relaxation Method is a/an ……….

6. Sparse matrix is a matrix with ……….

7. Central difference method seems to be giving a better approximation, however it requires more computations.

8. An eigenvector V is said to be normalized if the coordinate of largest magnitude is equal to zero

9. If x is an eigen value corresponding to eigen value of V of a matrix A. If a is any constant, then x – a is an eigen value corresponding to eigen vector V is an of the matrix A - a I.

10. Let A be an n ×n matrix. The number x is an eigenvalue of A if there exists a non-zero vector v such that _______.

11. Below are all the finite difference methods EXCEPT _________.

12. An indefinite integral may _________ in the sense that the limit defining it may not exist

13. In interpolation is used to represent the δ

14. While solving a system of linear equations, which of the following approach is economical for the computer memory?

15. Symbol used for forward differences is

16. The eigenvectors of a square matrix are the non-zero vectors that, after being multiplied by the matrix, remain …………… to the original vector.

17. The linear equation: 2x+0y-2=0 has -------- solution/solutions

18. While using Relaxation method, which of the following is the Residuals for 1st iteration on the system; 2x+3y = 1, 3x +2y =4 ?

19. Gauss - Jordan Method is similar to ……….

20. The determinant of a diagonal matrix is the product of the diagonal elements

21. While using Relaxation method, which of the following is the largest Residual for 1st iteration on the system; 2x+3y = 1, 3x +2y = - 4 ?

22. Gauss–Seidel method is also known as method of …………….

23. .In Simpson’s Rule, we use parabolas to approximating each part of the curve. This proves to be very efficient as compared to Trapezoidal rule

24. Differences methods find the ________ solution of the system.

25. Euler's Method numerically computes the approximate derivative of a function

26. In Jacobi’s Method, the rate of convergence is quite ______ compared with other methods

27. In …………… method, a system is reduced to an equivalent diagonal form using elementary transformations.

28. Euler's Method numerically computes the approximate ________ of a function

29. The Jacobi iteration converges, if A is strictly diagonally dominant.

30. Numerical methods for finding the solution of the system of equations are classified as direct and ………… methods