Scribd
Upload
131 views

Assignment 4

The document contains 12 problems involving iterative methods for solving equations and systems of equations, including: 1) Using the bisection method and Newton-Raphson method to find roots of equations. 2) Solving systems of equations using Gauss-Jacobi and Gauss-Seidel methods. 3) Examining convergence and divergence for different systems using Gauss-Jacobi and Gauss-Seidel. 4) Performing iterations with specified initial approximations and matrix forms to solve linear systems.

Uploaded by

Akshat Gupta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
131 views

Assignment 4

The document contains 12 problems involving iterative methods for solving equations and systems of equations, including: 1) Using the bisection method and Newton-Raphson method to find roots of equations. 2) Solving systems of equations using Gauss-Jacobi and Gauss-Seidel methods. 3) Examining convergence and divergence for different systems using Gauss-Jacobi and Gauss-Seidel. 4) Performing iterations with specified initial approximations and matrix forms to solve linear systems.

Uploaded by

Akshat Gupta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment-4

1. Perform five iterations of the bisection method to obtain the smallest positive root of the equation
f (x) = x3 5x + 1 = 0.
2. Using Newton-Raphson Method find an iterative scheme to compute the cube root of a positive number.
1

Hence find (48) 3 taking initial approximation as 3.5.


3. Using Newton-Raphson Method solve the following equation correct up to 4-decimal places
ex = 5x.
4. First positive roots of f (x) = x3 5x2 + 7x 3 is of multiplicity 2. Find this root using
n)
(a) xn+1 = xn m ff0(x
(xn ) . and also

(b) the Newton-Raphson method


with an initial guess of x0 = 0. Compare the number of iterations. Find third root also using Newton
Raphson method by taking x0 = 4 as initial guess.
5. Apply the iteration method to find out the real roots of x3 +x2 1 = 0, assuming the initial approximation
as x0 = 0.8.
6. Find the roots of x2 + ln x 2 = 0 between 1 and 2, correct to four decimal places.
7. Starting from (0, 0, 0) solve the following system of equations by Gauss-Jacobi method correct up to
2-decimal places
x1 + x2 + 4x3 = 9
8x1 3x2 + 2x3 = 20
4x1 + 11x2 x3 = 33
8. Starting from (0, 0, 0) solve the following system of equations by Gauss-Seidel method correct up to 3significant digits
3x1 + 9x2 2x3 = 11
4x1 + 2x2 + 13x3 = 24
4x1 2x2 + x3 = 8
9. Starting from (0, 0, 0) show that the following system of equations converges for Gauss-Seidel method and
diverges for Gauss-Jacobi method
2x1 + x2 + x3 = 4
x1 + 2x2 + x3 = 4
x1 + x2 + 2x3 = 4

10. Without changing the order solve the following system of linear equations
2x1 + x2 + 6x3 = 9
8x1 + 3x2 + 2x3 = 13
x1 + 5x2 + x3 = 7
using initial approximation (x1 , x2 , x3 ) = (0, 0, 0) and show that both Gauss-Jacobi and Gauss-Seidel
methods diverges.
11. Solve the system of linear equations
4x1 + x2 + x3 = 2
x1 + 5x2 + 2x3 = 6
x1 + 2x2 + 3x3 = 4
using Gauss-Jacobi method with the initial approximation as x(0) = [0.5, 0.5, 0.5]T and perform three
iterations (using matrix form).
12. Solve the following system of linear equations
2x1 x2 = 7
x1 + 2x2 x3 = 1
x2 + 2x3 = 1
using Gauss-Seidel method with the initial approximation as x(0) = [0, 0, 0]T and perform three iterations
(using matrix form).

You might also like