Scribd
Upload
1K views

Computer Oriented Numerical Methods

This document outlines the teaching scheme, objectives, and units covered in the course "Computer Oriented Numerical Methods". The course aims to give students an intuitive understanding of numerical methods and experience implementing them using a computer. It also seeks to demonstrate the concept of error in these methods. The course covers topics like solving algebraic equations, linear systems, differential equations, interpolation, differentiation, integration, and numerical solutions to ODEs and PDEs. Students will be evaluated through mid-semester and end-semester exams, assignments, and quizzes.

Uploaded by

mahesh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1K views

Computer Oriented Numerical Methods

This document outlines the teaching scheme, objectives, and units covered in the course "Computer Oriented Numerical Methods". The course aims to give students an intuitive understanding of numerical methods and experience implementing them using a computer. It also seeks to demonstrate the concept of error in these methods. The course covers topics like solving algebraic equations, linear systems, differential equations, interpolation, differentiation, integration, and numerical solutions to ODEs and PDEs. Students will be evaluated through mid-semester and end-semester exams, assignments, and quizzes.

Uploaded by

mahesh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

COMPUTER ORIENTED NUMERICAL METHODS

Teaching Scheme Examination Scheme


Lectures : 3 Hrs/week Mid Sem. Exam - 30 marks
Assignment/Quizzes - 20 marks
End Sem. Exam - 50 marks
Objectives :
To enable students to obtain an intuitive and working understanding of numerical methods
for the basic problems of numerical analysis and gain experience in the implementation of
numerical methods using a computer
They would also gain an appreciation of the concept of error in these methods and the
need to analyze and predict it.
Demonstrate understanding and ability to write codes for various numerical methods using
high level language

Unit 1 (6 Hrs)
Solution of Algebraic and transcendental equation: Bisection methods of false position,
Newtons methods and Newton-Raphson method. Approximate solution of equation Horners
methods.

Unit 2 (8 Hrs)
Solution of simultaneous linear equations and ordinary differential equations: Gauss-
Elimination methods, pivoting, Ill-conditioned equations, refinement of solution. Gauss-Seidal
iterative method, Euler method, Euler modified method, Taylor-series method, Runge-Kutta
methods, Predictor-Corrector methods.

Unit 3 (8 Hrs)
Finite Differences: Forward difference operator, Backward Difference operator, Central
difference operator, Newtons Interpolation Formulae, Newtons Forward backward-Central
Interpolation Formulae, Sterling Formula, Bessels Formula Interpolation with unequal intervals

Unit 4 (6 Hrs)
Differentiation and Integration: Newton-Cortes Formula. Trapezoidal Rule. Simpson One
Third Rule, Simpson Three- Eight Rule. Weddles rule

Unit 5 (6 Hrs)
Numerical Solution of ODE: Picards methods, Taylor series method, Eulers method,
modified Eulers method. Runge- Kutta method. Predictor Corrector methods-Milnes method

Unit 6 (6 Hrs)
Adams-Bash forth method, second order Differential equation. Numerical Solution For
Elliptical Partial differential Equation.

Text Books:
Rajaraman V., Computer Oriented Numerical Methods, Prentice Hall, India, 3 rd Edition,
2006, ISBN: 978-81-203-0786-5
S.S. Sastry, Introductory Methods of Numerical Analysis, Prentice Hall, India, 4th Edition,
2005, ISBN :978-81-203-2761-0

Reference Books:
M.K. Jain, S.R.K. Iyengar, R.K. Jain, Numerical methods for Scientific and Engineering
Computation, 4th Edition, New Age International Publishers, 2003.
Samuel D.Conte and Carl de Boor, Elementary Numerical Analysis: An Algorithmic
Approach, 3rd Edition, McGraw Hill, 1980.

You might also like