0% found this document useful (0 votes)
262 views3 pages

B.SC (Prog) Computer Science VI Sem - Assignment

The document contains 18 numerical methods questions related to topics like root finding methods (bisection, secant, Newton's, regula falsi), matrix operations (Gauss-Jordan elimination, Gauss-Thomas algorithm), systems of equations (Jacobi iteration, Gauss elimination), interpolation (Newton backward, Gregory-Newton, quadratic), numerical integration (trapezoidal, Simpson's, composite trapezoidal, Romberg). Students are asked to perform iterations of methods, find inverse/solutions of matrices, estimate derivatives/function values, and integrate functions numerically.

Uploaded by

Rahul Kumar
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
0% found this document useful (0 votes)
262 views3 pages

B.SC (Prog) Computer Science VI Sem - Assignment

The document contains 18 numerical methods questions related to topics like root finding methods (bisection, secant, Newton's, regula falsi), matrix operations (Gauss-Jordan elimination, Gauss-Thomas algorithm), systems of equations (Jacobi iteration, Gauss elimination), interpolation (Newton backward, Gregory-Newton, quadratic), numerical integration (trapezoidal, Simpson's, composite trapezoidal, Romberg). Students are asked to perform iterations of methods, find inverse/solutions of matrices, estimate derivatives/function values, and integrate functions numerically.

Uploaded by

Rahul Kumar
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/ 3

-

Assignment- 2020

B.Sc.(Prog) Computer Science Mathematics Semester VI

DSE-2 Numerical Methods

Maximum Marks – 10

Do any fifteen questions. Each question carry equal marks.

Q1. Perform three iterations of Secant method to obtain a root of the equation

𝑥 2 − 7 = 0. With initial approximation [ 𝑥0 , 𝑦0 ] = [2,3].

Q2. Perform three iterations of bisection method to obtain a root of the equation

𝑥 3 − 3𝑥 2 − 0.09𝑥 + 0.27 = 0 in the interval [0,1].

Q3. If true value is 0.000310698 and approximated value is 0.0049065, then find the absolute and

and the relative error.Differentiate round-off error and trunctation error.

Q4. Perform two iterations of Newton’s method to solve the non-linear system of the

Equations 𝑥 2 𝑦 − 𝑦 3 = 0 , 𝑥𝑦 2 − 𝑥 2 = 3 With initial approximation [ 𝑥0 , 𝑦0 ] = [0.8,2.2].

Q5. Perform three iterations of Regula-Falsi method to find the root of the equation

𝑓(𝑥) = 𝑥 3 − 2 = 0 in the interval [1,2].

Q6. Perform three iterations of Newton-Rapson method to obtain the cube root of 17

With initial approximation 𝑥0 = 2.

Q7. Find the inverse of the following matrix using the Gauss-Jorden method.

1 2 1
𝐴=[2 3 −1 ]
2 −1 3
Q8. Solve the tridiagonal system 𝐴𝑋 = 𝑏 by using Gauss-Thomas algorithim
1 2 0 𝑥 10
[1 3 3 ] [ 𝑦] = [ 17]
0 3 10 𝑧 22
Q9. For the following. System of equations
10 40 −2 𝑥 12
[ 1 𝑦
−10 −1 ] [ ] = [ −10 ]
5 2 −10 𝑧 −3
(i) Show that Jacobi iteration scheme converges.

(ii) Starting with 𝑿(𝟎) = 𝟎. Iterate three times.

Q10. For the following data obtain the Gregory-Newton back word differences polynomial

𝑥 0.1 0.2 0.3 0.4 0.5


𝑓(𝑥) 1.40 1.56 1.76 2.00 2.28

also find the approximate value of f(0.25)

1 1
Q11. Prove that 1 + ∆ = 1 + 2 𝛿 2 + 𝛿√1 + 4 𝛿 2 .

Q12. The function 𝑓(𝑥) = 𝑆𝑖𝑛(𝑥) is defined on [1,2] and [2,3]. Hence find tha approximate value of

𝑓(1.5) 𝑎𝑛𝑑 𝑓(2.5) .

Q13. The following data for the function 𝑓(𝑥) = 𝑥 4 is given.

𝑥 0.4 0.6 0.8


𝑓(𝑥) 0.0256 0.1296 -0.4096

Find 𝑓′(0.8) and 𝑓′′(0.8) using quadratic interpolation.


2 2
Q14. Find the approximate value of 𝐼 = ∫0 𝑒 −𝑥 𝑑𝑥. using (i) trapezoidal rule,and (ii) Simpson’s rule.
1 1
Q15. Evaluate ∫0 1+𝑥
𝑑𝑥 using composite Trapezoidal rule and Romberg integration with

1
ℎ = 1 𝑎𝑛𝑑 ℎ = only.
2

Q16. Define the order of convergence of an iterative method.Derive the order of convergence of the
.

Q17. Solve the System of equations.

2𝑥 − 2𝑦 + 𝑧 = 1

4𝑥 + 2𝑦 + 3𝑧 = 2

𝑥+𝑦+𝑧 = 3

Using the Gauss elimination method with partial pivoting.


Q18. Using the Newton’s backward difference interpolation,construct the interpolating polynomial

That fits the data .

𝑥 0.1 0.3 0.5 0.7 0.9 1.1


𝑓(𝑥) -1.699 -1.073 -0.375 0.443 1.429 2.631

Estimate the value of 𝑓(𝑥) at 𝑥 = 0.6 and 𝑥 = 1.0.

You might also like