Scribd
Upload
22 views

Assignment 2

Uploaded by

Kshitij Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views

Assignment 2

Uploaded by

Kshitij Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment-2

1. The equation x4 − 6x3 + 12x2 − 10x + 3 = 0 has a root at x = 1. Starting with x0 = 0.5, find the first
approximate solution by a suitable method of quadratic convergence.
 
6 7 9
0
2. Consider the matrix A =  7 8 10  , b = [0.1, 0.1, −0.2] .
 
8 9 8

ˆ Solve Ax = b by using Gauss-elimination with scaling, partial pivoting and 4 digit decimal arithmetic
with rounding.
ˆ Find the determinant of A by using Gauss-elimination
(i)without scaling and pivoting (ii) with scaling and pivoting.
Use 4 digit arithmetic in computations with rounding.
 
1 1 1
3. Consider the matrix A =  4 3 −1  , b = [1, 6, 4]T .
 
3 5 3

ˆ Find the determinant of A by using Gauss-elimination with scaling and pivoting. Use 3 digit arith-
metic in computations with rounding.
ˆ Determine the LU decomposition of A by using Gauss-elimination technique (without scaling and
pivoting) and hence solve Ax = b.

4. Consider the system of equations 28x + 4y − z = 32, x + 3y + 10z = 24 and 2x + 17y + 4z = 35. Rearrange
these equations if necessary to have convergent solution by using Jacobi and Gauss-Seidel methods. Give
errors in l∞ -norm and l1 -norm after 3 iterations in each case. Also determine, with justification, which
method converges faster.

5. Consider the following linear system of equations

−2x1 + 3x2 + 10x3 = 22; 10x1 + 2x2 + x3 = 9; x1 + 10x2 − x3 = −22

with the initial solution X (0) = [1, −1, 1]T .

ˆ Do two iterations of Jacobi’s method after rearranging the given system of equations (so that the
method converges ) to solve the linear system. Also, verify the convergence results by computing the
l∞ norm of the iteration matrix T .
ˆ Hence, determine the minimum number of iterations required to achieve an accuracy 10−4 .

6. Find a real root of the equations x − cos(y − x) = 0 and y − sin(x + y) = 0 with (x0 , y0 ) = (1, 1) by using
(a) Newton-Raphson method and (b) Fixed iteration method.
Perform two iterations in each case to obtain the root using 4 digit floating-point arithmetic with rounding.

7. Write the given system of non-linear equations for fixed point iteration scheme to converge. Check the
conditions for convergence. Do 2 iterations starting with (x0 , y0 ) = (1, 1) for
√ √
exp(x/3) + 0.5 y − x = 1.035; 0.3 x − exp(y/3) + y = −0.4692.

Compute the error in l∞ norm when the exact solution is (x = 0.5, y = 0.5).

You might also like