Scribd
Upload
4 views2 pages

Numerical Methods Syllabus-2

The Numerical Methods course (BIT201HS) for Year II focuses on teaching students various techniques for solving nonlinear equations, interpolation, curve fitting, linear equations, and performing integration and differentiation using numerical methods. The course includes theoretical and practical components, with a total of 100 marks for assessment. Key topics covered include errors in computation, methods for nonlinear equations, interpolation techniques, systems of linear equations, numerical differentiation and integration, and ordinary differential equations.

Uploaded by

dorjepasang987
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
4 views2 pages

Numerical Methods Syllabus-2

The Numerical Methods course (BIT201HS) for Year II focuses on teaching students various techniques for solving nonlinear equations, interpolation, curve fitting, linear equations, and performing integration and differentiation using numerical methods. The course includes theoretical and practical components, with a total of 100 marks for assessment. Key topics covered include errors in computation, methods for nonlinear equations, interpolation techniques, systems of linear equations, numerical differentiation and integration, and ordinary differential equations.

Uploaded by

dorjepasang987
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

Numerical Methods

BIT201HS

Year: II

Teaching Schedule (Hours/Week) Examination Scheme

Internal Assessment Final


Theory Tutorial Practical Total
(Theory / Practical) (Theory)

3 1 2 20 / 20 60 100

Course Objective:
The main objective of this course is to enable students to (a) solve nonlinear equations, (b) use interpolation, (c)
fit curves, (d) solve linear equations, and (e) perform integration and differentiation using numerical methods
through computers.
Course Contents:
1. Errors in Numerical Computation [3 Hrs]
1.1 Introduction to numerical method
1.2 Introduction to error
1.3 Sources of error
1.4 General errors formula
2. Solution of Nonlinear Equations [6 Hrs]
2.1 Introduction
2.2 Bisection method
2.3 Newton-Raphson method
2.4 Secant method
2.5 Horner's rule
3. Interpolation [10 Hrs]
3.1 Introduction
3.2 Finite Differences
3.2.1 Forward differences
3.2.2 Backward differences
3.2.3 Central differences
3.2.4 Symbolic relations
3.3 Newton's Forward and Backward formulae
3.4 Lagrange interpolation
3.5 Method of Least Square (LSM)
3.5.1 LSM for linear equation (y = a + bx)
3.5.2 LSM for quadratic equation (y = a + bx + cx2)
3.5.3 LSM for y = axb
3.5.4 LSM for y = aebx
4. System of Linear Equations [11 Hrs]
4.1 Contingency of a linear system of equations
4.2 Solution of linear system – Direct method
4.2.1 Gaussian Elimination method
4.2.2 Gauss Jordan method
4.2.3 Matrix inversion
4.3 Solution of linear system – Indirect method
4.3.1 Gauss Jacobi iteration method
4.3.2 Gauss Seidel iteration method
4.4 Method of Factorization, LU Decomposition method
4.5 Eigen vectors and Eigen values, Power method
5. Numerical Differentiation and Integration [8 Hrs]
5.1 Numerical Differentiation for 1st and 2nd order differentiation
5.1.1 Forward formula
5.1.2 Backward formula
5.2 Numerical Integration
5.2.1 Trapezoidal rule
5.2.2 Simpson's 1/3 rule and 3/8 rule
5.2.3 Romberg integration
6. Numerical Solution of Ordinary Differential Equations [7 Hrs]
6.1 Introduction
6.2 Euler's method and Modified Euler's method
6.3 Runge-Kutta 2nd order and 4th order methods
6.4 Boundary value problem (Finite Difference method)

Laboratories:
There shall be following lab exercises using any high-level programming language:
1. Bisection method
2. Newton-Raphson method
3. Secant method
4. Horner's rule
5. Lagrange interpolation
6. Newton interpolation
7. Least Square method for linear equations
8. Gauss Elimination method
9. Gauss Seidel iteration method
10. Integration (Trapezoidal rule, Simpson's 1/3 rule and 3/8 rule)
11. Euler's method
12. Runge-Kutta 4th order methods

Reference Books:
1. S. S. Sastry, "Introductory Methods of Numerical Analysis", PHI
2. S. Yakowitz & F. Szidarovszky, "An Introduction to Numerical Computations"
3. Dr. V. N. Vedamurthy, Dr. N. Ch. S. N. Iyengar, "Numerical Methods"
4. S. S. Sastry, "Engineering Mathematics Volume-II", PHI
5. E. Balagurusamy, "Numerical Methods"
6. B. S. Grewal, "Numerical Methods"

You might also like