Scribd
Upload
48 views3 pages

Numerical Methiods Unit I: Solution of Equations and Eigen Value Problems Part A

1. This document discusses numerical methods for solving equations and eigenvalue problems. 2. It includes iterative methods like Newton's method, fixed point iteration, and matrix methods like Gauss-Jordan, Gauss-Seidel, Jacobi, and power for solving systems of equations and finding eigenvalues and eigenvectors. 3. Examples are provided for applying these numerical methods to solve equations and eigenvalue problems.

Uploaded by

pearls_elite2281
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 DOC, PDF, TXT or read online on Scribd
48 views3 pages

Numerical Methiods Unit I: Solution of Equations and Eigen Value Problems Part A

1. This document discusses numerical methods for solving equations and eigenvalue problems. 2. It includes iterative methods like Newton's method, fixed point iteration, and matrix methods like Gauss-Jordan, Gauss-Seidel, Jacobi, and power for solving systems of equations and finding eigenvalues and eigenvectors. 3. Examples are provided for applying these numerical methods to solve equations and eigenvalue problems.

Uploaded by

pearls_elite2281
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 DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

NUMERICAL METHIODS

Unit I : Solution of equations and eigen value problems


Part A
1. If g(x) is continuous in [a,b] then under what condition the iterative method x =
g(x) has unique solution in [a,b].
2. By Newtons method find an iterative formula to find 1/N.
3. Find the positive root of x3 + 5x 3 = o usind fixed point iteration method with
0.6 as first approximation.
4. Find inverse of A =

,
_

7 2
3 1
by Gauss Jordan method.
5. State the convergence and order of convergence for method of false position.
6. Why Gauss Seidel iteration is a method of successive corrections.
7. Compare Gauss Jacobi and Gauss Siedel methods for solving linear system of
the form AX = B.
8. State the conditions for convergence of Gauss Siedel method for solving a
system of equations.
9. Find an iterative formula to find N where N is a positive number.
10. Compare Gaussian elimination method and Gauss-Jordan method.
11. What type of eigen value can be obtained using power method.
12. State the order of convergence and convergence condition for Newton
Raphson,s method.
13. Find the dominant eigen value of A =
1
]
1

4 3
2 1
by power method.
14. How is the numerically smallest eigen value of A obtained.
15. State two difference between direct and iterative methods for solving system of
equations.
Part B
1. Consider the non linear system x
2
2x y +0.5 =0 and x
2
+4y
2
4 = 0. Use
Newton Raphson method with the starting value (x
0
, y
0
) = (2.00, 0.25) and
compute (x
1
, y
1
), (x
2
, y
2
) and (x
3
, y
3
) .
2. Fins the real root of xe
x
3 = 0 by fixed point method.
3. Find the real root using method of newton raphson for x
3
2x 5 = 0 coreect to
three decimal places.
4. Find all the eigen values of the matrix
1
1
1
]
1

2 1 0
1 2 1
0 1 2
by power method (Apply
only 3 iterations).
5. Solve the system of equations using Gauss Seidel iterative methods.
20x y 2z = 17, 3x + 20y z = -18, 2x 3y +20z = 25.
6.Find the largest eigen values and its corresponding vector of the matrix

1
1
1
]
1

10 4 1
4 2 3
1 3 1
by power method.
7. Using Gauss- Jordan obtain the inverse of the matrix
1
1
1
]
1

5 3 1
1 1 2
3 2 2
8.Using Gauss Seidel method solve the system of equations starting with the values
x = 1 , y = -2 and z = 3,
x + 3y + 5z = 173.61, x 27y + 2z = 71.31, 41x 2y + 3z = 65.46
9. Solve the following equations by Jacobis iteration method
x + y + z = 9, 2x 3y + 4z = 13, 3x + 4y + 5z = 40.

You might also like