Recently MeroSpark is lunched with more features and services, now you can ask your question, sell your books, share your notes and many more. Visit now and create your account to take full advantage of MeroSpark.

Numerical Method – Syllabus | Third Semester | BSc.CSIT (TU)

Download our Android App from Google Play Store and start reading Reference Notes Offline.

NM syllabusCourse Syllabus | BSc.CSIT
Subject: Numerical Method
Third Semester | Second Year
Tribhuvan University (TU)

Course Title: Numerical Method
Course no: CSC-204
Credit hours: 3
Full Marks: 70+10+20 | Pass Marks: 28+4+8
Natureof course: Theory (3 Hrs.) + Lab (3 Hrs.)
Course Synopsis: This course contains the concept of numerical techniques of solving the differential equations and algebraic equations.
Goal: To be familiar with the theory of numerical analysis for solving algebraic equations, solution of ordinary and partial differential equations related to engineering problems

Course Contents:

Unit 1.Solution of Nonlinear Equations: [10 Hrs.]
Review of calculus and Taylor’s theorem, Errors in numerical calculations, Trial and error method, Half- interval method, and convergence, Newton’s method, secant method and their convergence, Fixed point iteration and its convergence, Newton’s method for polynomials and Horner’s method

Unit 2.Interpolation and Approximation: [8 Hrs.]
Lagrang’s polynomials, Newton’s interpolation using difference and divided differences, Cubic spline interpolation, Least squares method for linear and nonlinear data

Unit 3.Numerical Differentiation and Integration: [5 Hrs.]
Newton’s differentiation formulas, Maxima and minima of tabulated function, Newton-Cote’s quadrature formulas, Trapeziodal rule, Simpson’s rule, 2D algorithm, Gaussian integration algorithm, Romberg integration formulas

Unit 4.Solution of Linear Algebraic Equations: [10 Hrs.]
Review of the existence of solutions and properties of matrices, Gaussian elimination method , pivoting, ill-conditioning, Gauss-Jordan method, Inverse of matrix using Gauss elimination method, Method of factorization, Dolittle algorithm, Cholesky’s factorization, Iterative solutions, Eigen values and eigen vectors problems, Solving eigen value problems using power method.

Unit 5.Solution of Ordinary Differential Equations: [7 Hrs.]
Review of differential equations, Initial value problem, Taylor series method, Picard’s method, Euler’s method and its accuracy, Heun’s method, Runge-Kutta methods, Solution of the higher order equations, Boundary value problems: Shooting method and its algorithm

Unit 6.Solution of Partial Differential Equations: [5 Hrs.]
Review of partial differential equations, Deriving difference equations, Laplacian equation and Poisson’s equation, engineering examples Laboratory works: The laboratory experiments will consist of program development and testing of non-linear equations, interpolation, numerical integration and differentation, linear algebraic equations, ordinary and partial differential equations.

Text / Reference books:

  • W. Chency and D. Kincaid, “Numerical Mathematics and Computing“, 2nd Edition, Brooks/Cole Publishing Co., 1985
  • C.F. Gerald and P.O. Wheatley, “Applied Numerical Analysis”, 4th Edition, Addison Wesley Publishing Company, New York.
  • W.H. Press, B.P. Flannery, “Numerical Recipes in C”, 1st Edition, Cambridge Press, 1988.
  • S. Yakwitz and F. Szidarovszky, “An Introduction to Numerical Computations”, 2nd Edition, Macmillan Publishing Co., New York.
(Visited 815 times, 1 visits today)

Posted By : Digvijay | Comment RSS | Category : Syllabus, Third Semester
Tag :

Post a Comment

Your email is never published nor shared. Required fields are marked *


Wordpress DMCA
Community | Toolbar | Android App | Founder/Developer : Hari Prasad Chaudhary | CSIT Portal Manager : Digvijay Chaudhary