Scribd
Upload
4K views2 pages

Numerical Methods

This document provides information on the Numerical Methods course BIT280CO, including details about teaching hours, examination scheme, course objectives, course contents, and reference books. The course aims to teach students numerical methods to solve nonlinear equations, interpolation, curve fitting, linear equations, and integration and differentiation using computers. Topics covered include error analysis, solving nonlinear equations, interpolation, systems of linear equations, numerical differentiation and integration, and numerical solutions to ordinary differential equations.

Uploaded by

Bijay Mishra
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
4K views2 pages

Numerical Methods

This document provides information on the Numerical Methods course BIT280CO, including details about teaching hours, examination scheme, course objectives, course contents, and reference books. The course aims to teach students numerical methods to solve nonlinear equations, interpolation, curve fitting, linear equations, and integration and differentiation using computers. Topics covered include error analysis, solving nonlinear equations, interpolation, systems of linear equations, numerical differentiation and integration, and numerical solutions to ordinary differential equations.

Uploaded by

Bijay Mishra
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Numerical Methods BIT280CO

Year: II Teaching schedule Hours/Week Theory Tutorial Practical 3 1 2 Semester: III Examination Scheme Internal Assessment Theory 20 Practical 50 80 Final Theory Practical Total 150

Course Objective:
This subject aims that enabling 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 1.1 Introduction to numerical method 1.2 Introduction to error 1.3 Sources of error 1.4 General errors formula Solution of Nonlinear Equations 2.1 Introduction 2.2 Bisection method 2.3 Newton Raphson method 2.4 Fixed point iteration method 2.5 Secant method 2.6 Horners rule Interpolation 3.1 Introduction 3.2 Finite differences 3.2.1 Foreward differences 3.2.2 Backward differences 3.2.3 Central differences 3.2.4 Symbolic relations 3.3 Newtons Forward and Backward formulae 3.4 Central difference interpolation formula 3.4.1 Gauss Forward and backward formula 3.4.2 Stirlings, Bessels and Everetts formulae 3.5 Lagrange interpolation 3.6 Method of Least Square methods (LSM) 3.6.1 LSM for linear equation (y=a+bx) 3.6.2 LSM for quadratic equation (y=a+bx+cx2) 3.6.3 LSM for y=axb 3.6.4 LSM for y=aebx System of Linear Equations 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 (3 Hrs)

2.

(6 Hrs)

3.

(10 Hrs)

4.

(11 Hrs)

5.

Numerical Differentiation and Integration 5.1 Numerical Differentiation for 1st and 2nd order differentiation 5.1.1 Forward formula 5.1.2 Backward formula 5.1.3 Central Difference formula 5.2 Numerical Integration 5.2.1 Trapezoidal rule 5.2.2 Simpsons 1/3 rule and 3/8 rule 5.2.3 Romberg integration 5.2.4 Gaussian integration Numerical Solution of Ordinary Differential Equations 6.1 Introduction 6.2 Eulers method and Modified Eulers method 6.3 Rungekutta 2nd order and 4th order methods 6.4 Boundary value problem (Finite Difference method)

(8 Hrs)

6.

(7 Hrs)

Laboratories: There shall be following lab exercises using any high-level language.
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. Bisection method Newton Raphson method Fixed-point iteration method Secant method Horners rule Langrange interpolation Newton interpolation Least Square method for linear equations Gauss Elimination method Gauss Seidel iteration method Integration (Trapezoidal rule, Simpsons 1/3 rule and 3/8 rule) Eulers method Rungekutta 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

You might also like