Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
MAT 230NUMERICAL ANALYSIS3 + 06th Semester5

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Elective
Course Objective Learning basic methods of numerical analysis in detail, grasping the algorithms needed for implementation of numerical methods on a computer, making contribution to algebraic and analytical methods.
Course Content Mathematical preliminaries: Taylor’s theorem, order of convergence, difference equations / Computer arithmetic: representations of numbers, absolute and relative error, errors and their sources, significant digits / Solutions of nonlinear equations: Bisection method, Newton’s method, Secant method, Fixed point iteration, Zeros of polynomials / Interpolation: Polinomial interpolation, Divided differences, Equispaced interpolation, Inverse interpolation, Extrapolation, Curve fitting / Solutions of linear systems of equations, Matrix algebra, direct methods, iterative techniques, Numerical integration.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Who has knowledge about general concepts of numerical analysis.
2Who has knowledge about computer arithmetic and numerical errors.
3Who learns various methods for the solutions of linear and nonlinear equations.
4Who learns various iteration methods.
5Who has knowledges about curve fitting.
6Who learns numerical integral.
7Who learns how to use numerical analysis in computer programs.

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 001 3          
LO 002 24         
LO 003 555        
LO 004  55        
LO 005 55         
LO 006 545        
LO 007 555        
Sub Total 252820        
Contribution044300000000

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14456
Mid-terms11212
Final examination12020
Total Work Load

ECTS Credit of the Course






130

5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2021-2022 Summer1ALİ FİLİZ
Details 2021-2022 Fall1ALİ FİLİZ
Details 2020-2021 Summer1ALİ KURT
Details 2020-2021 Fall1ALİ KURT
Details 2019-2020 Summer1ALİ KURT
Details 2019-2020 Fall1ALİ KURT
Details 2018-2019 Fall1KENAN KARAGÜL
Details 2017-2018 Fall1VEYSEL ALKAN
Details 2016-2017 Fall1KENAN KARAGÜL
Details 2015-2016 Fall1ZEKİ KASAP


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
MAT 230 NUMERICAL ANALYSIS 3 + 0 1 Turkish 2021-2022 Summer
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Prof. Dr. ALİ FİLİZ alifiliz@pau.edu.tr MUH A0012 MUH B0130 %
Goals Learning basic methods of numerical analysis in detail, grasping the algorithms needed for implementation of numerical methods on a computer, making contribution to algebraic and analytical methods.
Content Mathematical preliminaries: Taylor’s theorem, order of convergence, difference equations / Computer arithmetic: representations of numbers, absolute and relative error, errors and their sources, significant digits / Solutions of nonlinear equations: Bisection method, Newton’s method, Secant method, Fixed point iteration, Zeros of polynomials / Interpolation: Polinomial interpolation, Divided differences, Equispaced interpolation, Inverse interpolation, Extrapolation, Curve fitting / Solutions of linear systems of equations, Matrix algebra, direct methods, iterative techniques, Numerical integration.
Topics
WeeksTopics
1 Fundamental Definitions and Theorems Machine Numbers Errors Arithmetical Process and Error Accumulation
2 Approximate Calculation of Equations with one Variable Bisection Method Regula Falsi Method
3 Changed Regula Falsi Method Newton-Raphson Method Secant Method
4 Fixed Point Iteration Convergence Rate of Fixed Point Zeros of Polynomial and Muller Method
5 Interpolation Theory Taylor Polynomial Interpolation and Lagrange Polynomial
6 Iterative Interpolation Divided Differences Numerical Derivative
7 Midterm Exam
8 Numerical Integral Matrices and Other Process related to Matrices Linear Equation Systems
9 Gauss’s Elimination Method Gauss-Jordan Method Pivot Application
10 L.U. Decomposition Method Cholesky Method Jacobi Iteration Method
11 Gauss-Seidel Iteration Method Eigenvalue and Eigenvector Force and Iteration Method
12 QR Factorization Method Curve Fitting
13 The Least Squares Method Multivariate Regression
14 Orthogonal Polynomial and The Least Squares Method Curve Fitting by Trigonometrically Functions
Materials
Materials are not specified.
Resources
ResourcesResources Language
1- Numerical Methods for Mathematics, Science, and Engineering, 2nd Edition, John H. Mathews, Prentice Hall International Edition, 1992.English
2- Numerical Analysis, Brooks/Cole, 7th Edition, Richard L. Burden, J. Douglas Faires, 2001English
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam60Final Exam
Midterm Exam40Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes