Scribd
Upload
15 views2 pages

Numerical Methods

The document describes a numerical methods exam containing 6 questions. Question 1 involves Newton-Raphson and bisection methods to find roots. Question 2 involves Gauss-Jordan elimination and Gauss-Seidel iteration. Question 3 uses Lagrange interpolation. Question 4 finds initial acceleration from velocity-time data. Question 5 approximates derivatives and uses Euler's method. Question 6 approximates an integral using numerical integration rules.

Uploaded by

Amish
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
15 views2 pages

Numerical Methods

The document describes a numerical methods exam containing 6 questions. Question 1 involves Newton-Raphson and bisection methods to find roots. Question 2 involves Gauss-Jordan elimination and Gauss-Seidel iteration. Question 3 uses Lagrange interpolation. Question 4 finds initial acceleration from velocity-time data. Question 5 approximates derivatives and uses Euler's method. Question 6 approximates an integral using numerical integration rules.

Uploaded by

Amish
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/ 2

Name of the Course : CBCS B.Sc. Mathematical Sciences / B.Sc. (Prog.

Unique Paper Code : 42357618

Name of the Paper : DSE- Numerical Methods

Semester : VI

Duration : 3 Hours

Maximum Marks : 75 Marks

Attempt any four questions. All questions carry equal marks. All symbols have usual meanings.

1. Let 𝑓(𝑥) = 𝑥 4 − 18𝑥 2 + 45 and 𝑔(𝑥) = 𝑥 3 + 𝑥 2 − 3𝑥 − 3.


(i) Verify that both the equations 𝑓(𝑥) = 0 and 𝑔(𝑥) = 0 have a root on the interval (1, 2).
(ii) By performing three iterations of Newton-Raphson method, with 𝑥0 = 1, find an
approximation of the root of 𝑓(𝑥) = 0 .
(iii) By performing three iterations of Bisection method, find an approximation of the root of
𝑔(𝑥) = 0.
(iv) Given that the exact value of the root in both cases is 𝑥 = √3, compute the absolute
error in the approximations obtained.

2. Find the inverse of A, using Gauss-Jordan elimination


1 3 5
𝐴 = [2 7 13].
3 11 22

Using Gauss-Seidel iteration method, solve the system of equations given by

𝑥 1.1
𝐴 [ 𝑦 ] = [1.2] .
𝑧 1.3

3. Use the Lagrange’s interpolation to find a polynomial that passes through the points (0, 2), (1, 3),
(2, 12) and (5, 147).

Using the following data


𝑥 1.0 1.5 2.0 2.5
𝑓(𝑥) 2.7183 4.4817 7.3891 12.1825
estimate the value of 𝑓(2.15) using
(i) Newton’s forward difference interpolation
(ii) Newton’s backward difference interpolation.

1
Compare the errors and find which of the methods gave a better approximation of 𝑓(2.15).

4. The following data gives the velocity of a particle for 20 seconds at an interval of 5 seconds. Find
the initial acceleration using the entire data:

Time 𝑡 (sec) 0 5 10 15 20
Velocity 𝑣(m/sec) 0 2 13 68 227

A boundary value problem is defined by


𝑑2 𝑦
+ 𝑦 + 1 = 0, 0≤𝑥≤1
𝑑𝑥 2
where 𝑦(0) = 0 and 𝑦(1) = 0 with ℎ = 0.5. Use the finite difference method to determine the
value of 𝑦(0.5). Its exact solution is
1 − cos 1
𝑦(𝑥) = cos 𝑥 + sin 𝑥 − 1.
sin 1
Calculate the error.

5. Use the formula

𝑓(𝑥0 ) − 𝑓(𝑥0 − ℎ)
𝑓′(𝑥0 ) ≈
ℎ

to approximate the derivative of f ( x)  sin x at x0   taking ℎ = 1, 0.1, 0.01.

Use Euler's method to approximate the solution of the initial value problem

𝑑𝑦 (1 + 𝑦)2
= , 𝑦(1) = 0, 1 ≤ 𝑡 ≤ 4
𝑑𝑡 𝑡

taking 5 steps.

2
6. Find approximate value of the integral 𝐼 = ∫0 𝑒 𝑥 𝑑𝑥 using
(i) Trapezoidal Rule;
(ii) Simpson’s 1/3 rule;
(iii) Simpson’s 3/8 rule.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy