Scribd
Upload
49 views4 pages

Course Assessment Strategy Reference Practice Booklist

This document provides an outline for a course on Numerical Methods. The course is for 3 credits and is a core engineering course. It will be taught in the summer semester of 2020. The course will introduce students to numerical techniques for solving problems involving continuous variables, including computing integrals and derivatives, solving differential equations, interpolation, root finding, and solving systems of linear and nonlinear equations. Students will learn to code algorithms and analyze their efficiency. The course aims to develop students' programming and mathematical analysis abilities.

Uploaded by

Abdul Hamid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
49 views4 pages

Course Assessment Strategy Reference Practice Booklist

This document provides an outline for a course on Numerical Methods. The course is for 3 credits and is a core engineering course. It will be taught in the summer semester of 2020. The course will introduce students to numerical techniques for solving problems involving continuous variables, including computing integrals and derivatives, solving differential equations, interpolation, root finding, and solving systems of linear and nonlinear equations. Students will learn to code algorithms and analyze their efficiency. The course aims to develop students' programming and mathematical analysis abilities.

Uploaded by

Abdul Hamid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Daffodil International University

Department of Computer Science and Engineering


(CSE)
Course Outline
Course Code: CSE 234
Course Title: Numerical Methods
Program: B.Sc. in CSE
Faculty: Faculty of Science and Information Technology (FSIT)
Semester: Summer Year: 2020
Credit: 3.00 Contact Hour: 03
Course Level: L2T3 Prerequisite: MAT 121,
MAT 211
Course Category: Core Engineering
Instructor Ohidujjaman
Name(Initial):
Designation: Sr. Lecturer
Email: [email protected]
Office Address: Exam Building, AB04 509.
Class Hours: Sections Day Time Room
PC-A

PC-B

Google Classroom th9w8f


Code:

1.1 Course Rationale

Numerical analysis, area of mathematics and computer science that creates, analyzes, and implements
algorithms for obtaining numerical solutions to problems involving continuous variables. Such problems
arise throughout the natural sciences, social sciences, engineering, medicine, and business. Since the
mid 20th century, the growth in power and availability of digital computers has led to an increasing use
of realistic mathematical models in science and engineering, and numerical analysis of increasing
sophistication is needed to solve these more detailed models of the world. The formal academic area of
numerical analysis ranges from quite theoretical mathematical studies to computer science issues. With
the increasing availability of computers, the new discipline of scientific computing, or computational
science, emerged during the 1980s and 1990s. The discipline combines numerical analysis, symbolic
mathematical computations, computer graphics, and other areas of computer science to make it easier
to set up, solve, and interpret complicated mathematical models of the real world.

1.2. Course Objective

The aim of this course is to teach the students’ different numerical methods which are essential in many
areas of modern life. This course will develop their programming knowledge and analysis ability of the
underlying mathematics in popular software packages. From this course, students’ will learn:

 Computing integrals and derivatives


 Solving differential equations
 Building models based on data, be it through interpolation, Least Square, or other methods
 Root finding and numerical optimization
 Estimating the solution to a set of linear and nonlinear equations
 Computational geometry

1.3. Course Outcomes (CO’s)

CO1 Solve differential equations that arises in the field of engineering and
interpret the result.
CO2 Estimate errors in calculation of various methods
CO3 Develop codes and analyze its efficiency level
CO4 Explain numerical procedures that are used in developing different software
packages
CO5 Apply knowledge and skills to optimize a problem

1.4. Program Outcomes (PO’s)

1.5. CO-PO Mapping

PO’s PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO’s
CO1 √ √

CO2 √ √

CO3 √ √

CO4 √ √

CO5 √ √

2.1. Syllabus:

Solution to simultaneous linear equations: tri-diagonal systems and Thomas’ method, Iteration method
of Jacob and Gauss-Seidel;—Non-linear equations: Bisection method, Newton–Raphson method.
Matrices: Norm, condition number with interpretation, LU decomposition, QR decomposition, SVD.
Interpolation: Newton’s forward, backward and divided difference. Cubic spline method, Curve fitting:
Least square method for linear and non-linear case, Bezier curves and B-spline curves, Function-
approximation by Chebyshev polynomial. IVP: Range-Kutta method, Milne’s method; BVP: Finite
difference method; CVP: Power method, QR method. Numerical Integration: Trapezoidal rule,
Simpson’s 1/3 rule, Weddle rule, use of cubic spline.

2.2. Course Delivery Plane


Class Topics Expected Learning Outcome Assessments
No (ASSN/
CT/Mid/Final)

01 Introductory Class  Overview of whole course

 Importance of this course

 Overview of lecture delivery plane

02 Error Analysis  Perform an error analysis for a given


numerical method

03 to a. Bisection, Iteration and  Prove results for various numerical 2/3 problems
05 Newton Raphson method root finding methods related
to solve algebraic and
 Perform an error analysis for a given to discussion in the
transcendental equations
numerical method
with algorithm class
 Code a numerical method in a
modern computer language
** CLASS TEST 01
**

06 to a. Background of matrix  Solve a linear system of equations 2/3 problems


08 and solving systems of using an appropriate numerical related to
Linear Equations method
discussion in the
b. Iterative methods (Jacobi  Able to find solution of linear system class
& Gauss Seidel)
 Find the dominant Eigen -values

** ASSIGNMENT
**

09 to  Approximate a function using an


11 appropriate numerical method
a. Interpolation: Newton’s 2/3 problems
Backward Difference  Code a numerical method in a related to
Method modern computer language
discussion in the
b .Interpolation: Newton’s  Approximate a function using an class
Forward difference appropriate numerical method
Method.
 Able to use in cryptography
** CLASS TEST 02
c. Lagrange Interpolation
 Approximate a function using an **
Formula

********** MID TERM EXAM ***************

12 to a. Curve fitting: Least  Construct a curve or mathematical


13 square method function that has the best fit to a
b. Applications of the series of data points.
methods for linear and
non-linear case

14 ********* PRESENTATION *********

15 to a. Numerical  Able to forecast missing data ** CLASS TEST 03


19 Differentiation. **
 Able to find maximum and minimum
b. Maximum and minimum value of a tabulated functions.
value of a tabulated
 Solve a differential equation using an
functions
appropriate numerical method
c. Numerical solution of
ordinary differential
equations: Runge-kutta
method of 2nd, 4thorder

20 to a. Derivation of General  Calculate a definite integral using an


22 Formula Numerical appropriate numerical method
Integration for Trapezoidal
rule, Simpson’s 1/3 rule,
Simpson’s 3/8 rule and
Weddle’s rule

********** FINAL EXAM ***************

Text Book(s):

(1) Numerical Analysis by Burden & Faires

(2) Introductory Methods of Numerical Analysis, S.S Sastry

You might also like