COURSE UNIT TITLE

: NUMERICAL ANALYSIS II

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
MAT 3008 NUMERICAL ANALYSIS II ELECTIVE 4 0 0 7

Offered By

Mathematics

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR ÇETIN DIŞIBÜYÜK

Offered to

Mathematics (Evening)
Mathematics

Course Objective

This course aims to introduce students to the theory underlying numerical methods for approximation of functions and numerical differentiation and integration.

Learning Outcomes of the Course Unit

1   will be able write a polynomial for a function given with some of its data.
2   will be able to find a nearest curve to a function that lies on a different space.
3   will be able to choose points that minimize error of interpolation problem.
4   will be able to solve Numerical Differentiation.
5   will be able to solve Numerical Integration.
6   will be able to identify sources and magnitude of error of approximation.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Polynomial Interpolation, Vandermonde Matrix, Lagrange Interpolation, Divided Difference Sec. 6.1, 6.2 Numerical Analysis, D. Kincaid, W Cheney
2 Equally spaced points, Forward difference, Backward difference, Central difference, Accuracy of interpolation Sec. 6.1 Numerical Analysis, D. Kincaid, W Cheney
3 Hermite interpolation, Divided difference method, Lagrange form of the Hermite interpolation Sec. 6.2, 6.3 Numerical Analysis, D. Kincaid, W Cheney
4 The choice of interpolating points (Optimal interpolation). Chebyshev polynomials, Weierstrass Approximation Theorem, Bohman-Korovkin Theorem, Bernstein Polynomials Sec. 6.1 Numerical Analysis, D. Kincaid, W Cheney
5 Spline functions and interpolation, Cubic spline function, B-spline, Marsden s Identity Sec. 6.4 Numerical Analysis, D. Kincaid, W Cheney
6 Least Squares Approximation, Best Approximation-Least Square Theory, Sec. 6.8 Numerical Analysis, D. Kincaid, W Cheney
7 Solving problems
8 Mid-term exam
9 Inner product spaces, Orthonormal systems Sec. 6.8, 6.9 Numerical Analysis, D. Kincaid, W Cheney
10 Legendre polynomials, Chebyshev polynomials, Gram Matrix Sec. 6.8, 6.9 Numerical Analysis, D. Kincaid, W Cheney
11 Numerical Differentiation and Integration, Differentiation via polynomial interpolation, Richardson Extrapolation Sec. 7.1 Numerical Analysis, D. Kincaid, W Cheney
12 Numerical integration, Trapezoid rule, Simpson s rule, Error analysis of Trapezoid and Simpson rules Sec. 7.2 Numerical Analysis, D. Kincaid, W Cheney
13 The method of undetermined coefficients, Change of intervals Sec. 7.3 Numerical Analysis, D. Kincaid, W Cheney
14 Gauss Quadrature, Error Formula Sec. 7.3 Numerical Analysis, D. Kincaid, W Cheney

Recomended or Required Reading

Textbook(s): : Numerical Analysis, D. Kincaid, W Cheney 2nd ed. ISBN 0534338925
Supplementary Book(s): Theory and Applications of Numerical Analysis, G. M. Phillips, P. J. Taylor 2nd ed. ISBN 9780125535601
References:
Materials: Presentations

Planned Learning Activities and Teaching Methods

Presentation
Question-Answer
Solving Problems

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 FIN FINAL EXAM
3 FCG FINAL COURSE GRADE MTE * 0.40 + FIN * 0.60
4 RST RESIT
5 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.40 + FIN * 0.60


*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

e-mail: cetin.disibuyuk@deu.edu.tr
Office: (232) 301 85 87

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 13 4 52
Preparations before/after weekly lectures 12 2,5 30
Preparation for midterm exam 1 20 20
Preparation for final exam 1 30 30
Preparation for quiz etc. 4 3 12
Preparing assignments 1 15 15
Final 1 2 2
Midterm 1 2 2
Quiz etc. 4 1 4
TOTAL WORKLOAD (hours) 167

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.15555222
LO.25555223
LO.35524
LO.45522
LO.55522
LO.6555524