CBCS-2020 SEM – III, NUMERICAL ANALYSIS
ST. FRANCIS COLLEGE FOR WOMEN,BEGUMPET,HYDERABAD-16
(AUTONOMOUS & AFFILIATED COLLEGE OF OSMANIA UNIVERSITY)
DEPARTMENT OF MATHEMATICS
M.SC. MATHEMATICS-II
SEMESTER-III
NUMERICAL ANALYSIS
DISCIPLINE SPECIFIC CORE
P20/MAT/DSC/303
Course objectives:
This Course introduces the basic concepts solutions of systems of linear algebraic equations by
Direct methods: Gauss Elimination method- Gauss Jordan Elimination method-
Triangularization method , Gauss Seidel Iteration method. Finding polynomials by
interpolation,finding derivatives and integral values using Numerical Differentiation&
Integration, Singlestep Methods- Multistep Methods
Course outcomes:
On Completion of the course students will be able to:
CO1:Understand the concepts ofSystems of linear algebraic equations
CO2: EvaluateSystems of linear algebraic equations usingDirect methods and Iteration
methods
CO3: DiscussInterpolation techniques
CO4:Apply Interpolation techniques to find the polynomials
CO5:Analyzethe derivatives of the data provided using Numerical Differentiation
CO6:Intrepretintegral values of a function usingNumerical Integration
CO7:Apply single step and multistep numerical methods
CO8:Evaluate problems using numerical methods
Syllabus: Credits:5
No. of hours:6
Total No. of Hrs/Semester:90/L
MODULE-I 22 Hrs
Systems of linear algebraic equations: Introduction-Direct methods: Gauss Elimination method-
Gauss Jordan Elimination method-Triangularization method- Cholesky method- Partition
Method- Iteration methods: Jordan Iteration method - Gauss Seidel Iteration
method,SORmethod.
DEPARTMENT OF MATHEMATICS, ST.FRANCIS COLLEGE FOR WOMEN, HYDERABAD-16 Page 1
CBCS-2020 SEM – III, NUMERICAL ANALYSIS
(Sections: 3.1, 3.2, 3.4 of Ch 3,Pg:109 – 140, 153-175(Iterative method to determine 𝐴−1 is not
included)).
MODULE-II 23 Hrs
Interpolation: Introduction- Lagrange and Newton’s interpolation- Finite Difference Operators-
Interpolating polynomials using finite differences - Hermite interpolation(Algorithms on
Lagrange and Newton divided difference Interpolation).
(Sections: 4.1, 4.2, 4.3, 4.4, 4.5 of Ch 4,Pg :217-257 , Problems on Hermite Interpolation in
Exercise 4.2 in pages 284, 285).
MODULE-III 23 Hrs
Numerical Differentiation: Introduction-Methods based on interpolation- Methods based on
finite difference operators.
Numerical Integration: Methods based on Interpolation- Methods based on undetermined
coefficients, Romberg Integration, Double Integration.(Algorithms on Trapezoidal, Simpson
only)
(Sections: 5.1,5.2, 5.6, 5.7, 5.8 , 5.10, 5.11of Ch5, Pg: 328 – 339, 356-368,400-405, Problems on
Trapezoidal, Simpson’s rule, Romberg Integration in Exercise 5.2 in pages 406 – 412)
MODULE-IV 22 Hrs
Numerical methods - Singlestep Methods- Multistep Methods(Algorithms on Eulers &Runge
Kutta methods only) (Sections: 6.3,6.4 of Ch 6,Pg: 432-460 , 498- 511, Problems on above
methods in Exercise 6.2 in pages:489-498,Exercise 6.3 in pages 555- 564)
Text Books:
[1] M.K.Kain, S.R.K.Iyengar, R.K.Jain, “Numerical Methods for scientific and Engineering
computation”, Fourth Edition, New Age Int.Publishers, New Delhi
[2] V.Rajaraman,”Computer oriented Numerical methods”,Prentice-Hall of India Pvt. Ltd. , New
Delhi
References:
[1] S.S.Sastry ,”Introduction to Numerical Analysis” Eastern Economy Edition.
[2] Bhupendra Singh,” Numerical Analysis”, PragathiPrakashan.
DEPARTMENT OF MATHEMATICS, ST.FRANCIS COLLEGE FOR WOMEN, HYDERABAD-16 Page 2
CBCS-2020 SEM – III, NUMERICAL ANALYSIS
ST. FRANCIS COLLEGE FOR WOMEN ,BEGUMPET,HYDERABAD-16
(AUTONOMOUS & AFFILIATED COLLEGE OF OSMANIA UNIVERSITY)
SEMESTER –III EXAMINATION
FACULTY OF SCIENCE& DEPARTMENT OF MATHEMATICS
M.Sc (MATHEMATICS)-II
NUMERICAL ANALYSIS
(MODEL PAPER)
DISCIPLINE SPECIFIC CORE
TIME: 2 ½ HRS MAX MARKS:60
P20/MAT/DSC/303
SECTION –A
I. Answer the following Questions: (Marks:4x10=40)
1. (a)Solve the system of equations
2 1 −4 1 x1 4
−4 3 5 −2 x2 −10
1 −1 1 −1 x3 = 2
by L U decomposition method
1 3 −3 2 x4 −1
OR
2. Solve the system of equations 2x1-x2+0x3=7,- x1+2x2-x3=1,& x1-x2+2x3=1 using Gauss Seidel
method where initial approximation is X(0)=0
3. Construct the interpolating polynomial that fits the data
X 0 0.1 0.2 0.3 0.4 0.5
f(x) -1.5 -1.27 -0.98 -0.63 -0.22 0.25
using Gregory – Newton forward and backward difference interpolation also estimate the values
of f(x) at x=0.25, 0.25 and 0.45
OR
4.Find the Hermite interpolating polynomial for the data
X 1 2
f(x) 7.389 54.598
f’(x) 14.778 109.196
Estimate the values of f(1.5)
DEPARTMENT OF MATHEMATICS, ST.FRANCIS COLLEGE FOR WOMEN, HYDERABAD-16 Page 3
CBCS-2020 SEM – III, NUMERICAL ANALYSIS
5.Given the following values of f(x)=lnx, find the approximate value of f’(2.0) using linear and
quadratic interpolation and f’’(2.0) using quadratic interpolation. Obtain an upper bound on the
error
X 2.0 2.2 2.6
f(x) 0.69315 0.78846 0.95551
OR
2 2 𝑑𝑥𝑑𝑦
6.Evaluate the integral 1 1 𝑥+𝑦
using trapezoidal rule with=k=0.5 and h=k=0.25. Improve the
estimate using Romberg Integration.
7. Using the Adams – Bashforth method to solve the initial value problem u’= -2tu2
u(0)=1 on [0,1] with h=0.5
OR
8. Use Runge – Kutta fourth order method to find the value of y when x=1 given that y=1 when
dy y−x
x=0 and that dx = y+x
SECTION –B
II. Answer any five Questions: (Marks:5x4=20)
B C
1. Find the inverse of the matrix A= using partition method
E D
2. Explain Gauss – Jacobi iteration method
3. Find the unique polynomial of degree 2 or less such that f(0)=1, f(1)=3, f(3)=55 using Newton
divided difference
4. If f(x)=eax then show that ∆n f(x)=(eah-1)neax
2 𝑥
5. Evaluate 0
𝑒 𝑑𝑥 using simpson’s rule with h=0.5
6. Derive Trapezoidal rule using Newton – Cotes method
7.Write the algorithm of Euler’s method
8. Explain Milne – Simpson method
DEPARTMENT OF MATHEMATICS, ST.FRANCIS COLLEGE FOR WOMEN, HYDERABAD-16 Page 4
