• Pravděpodobně máte vypnutý JavaScript. Některé funkce portálu nebudou funkční.

# Course detail

## Numerical Methods

Course unit code: FSI-2NU-A
Type of course unit: compulsory
Level of course unit: Bachelor's (1st cycle)
Year of study: 1
Semester: summer
Number of ECTS credits:
 Learning outcomes of the course unit: Students will be made familiar with a basic collection of numerical methods. They will make sense of errors in mathematical modelling, learn to find zeros of nonlinear equation and to solve systems of linear equations. They will master the basics of approximation including the least squares method, manage to use quadrature formulas and obtain an initial insight into the unconstrained minimization.
 Mode of delivery: 90 % face-to-face, 10 % distance learning
 Prerequisites: Numerical linear algebra, approximation of functions, numerical differentiation and integration, differential and integral calculus, basic Matlab programming.
 Co-requisites: Not applicable.
 Recommended optional programme components: Not applicable.
 Course contents (annotation): Students will be made familiar with a basic collection of numerical methods. They will make sense of errors in mathematical modelling, learn to find zeros of nonlinear equation and to solve systems of linear equations. They will master the basics of approximation including the least squares method, manage to use quadrature formulas and obtain an initial insight into the unconstrained minimization.
 Recommended or required reading: L. Čermák, R. Hlavička: Numerické metody, CERM, 2016 (CS)M.T. Heath: Scientific Computing. An Introductory Survey. Second edition. McGraw-Hill, New York, 2002.C.B. Moler: Numerical Computing with Matlab, Siam, Philadelphia, 2004.C.B. Moler: Numerical Computing with MATLAB, SIAM, Philadelphia, 2004.J.H. Mathews, K.D. Fink: Numerical Methods Using MATLAB, Pearson Prentice Hall, New Jersey, 2004.G. Dahlquist, A. Bjork: Numerical Methods, Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1974.J.H. Mathews, K.D. Fink: Numerical Methods Using MATLAB, Pearson Prentice Hall, New Jersey, 2004.
 Planned learning activities and teaching methods: The course is taught through lectures explaining the basic principles and theory of the discipline. Exercises are focused on practical topics presented in lectures.
 Assesment methods and criteria linked to learning outcomes: COURSE-UNIT CREDIT IS AWARDED ON THE FOLLOWING CONDITIONS: Active participation in practisals. Students have to pass successfully two check tests and to work out semester assignment solved by means of MATLAB (OCTAVE). A student can receive up to 20 points for both tests and up to 10 points for a semester assignment, in total up to 30 points. A necessary condition for course credit acquirement is a gain of at leat 15 points, including at least 10 points in both check tests. Students, who reach course-unit credits, thus obtain from 15 to 30 points, which will be included in the final course classification. FORM OF THE EXAMINATIONS: The exam is written and has a practical and a theoretical part. In the practical part students solve numerical examples by hand using pocked calculator, in the theoretical part they answer several questions to basic notions in order to check up how they understand the subject. As a result of the exam students will obtain 0--70 points. FINAL ASSESSMENT: The final point course classicifation is the sum of points obtained from both the practisals (15--30) and the exam (0--70). FINAL COURSE CLASSIFICATION: A (excellent): 100--90, B (very good): 89--80, C (good): 79--70, D (satisfactory): 69--60, E (sufficient): 59--50, F (failed): 49--0.
 Language of instruction: English
 Work placements: Not applicable.
 Course curriculum: Not applicable.
 Aims: The aim of the course is to familiarize students with essential methods applied for solving numerical problems and provide them with an ability to solve such problems individually by hand and especially on computer. Students ought to realize that only the knowledge of substantial features of particular numerical methods enables them to choose a suitable method and an appropriate software product.
 Specification of controlled education, way of implementation and compensation for absences: Attendance at seminars is checked. Lessons are planned according to the week schedules. Absence may be replaced by the agreement with the teacher.

Type of course unit:

Lecture: 13 hours, optionally Mgr. Petr Vašík, Ph.D. Two-hour lessons take place every other week. Week 1-2. Introduction to computing: Error analysis. Computer arithmetic. Conditioning of problems, stability of algorithms. Solving linear systems: Gaussian elimination. LU decomposition. Pivoting. Week 3-4. Solving linear systems: Effect of roundoff errors. Conditioning. Iterative methods (Jacobi, Gauss-Seidel, SOR method). Week 5-6. Interpolation: Lagrange, Newton and Hermite interpolation polynomial. Piecewise linear and piecewise cubic Hermite interpolation. Cubic interpolating spline. Least squares method. Week 7-8. Numerical differentiation: Basic formulas. Richardson extrapolation. Numerical integration: Basic quadrature rules (midpoint, trapezoidal and Simpson's rule). Gaussian quadrature. Composite quadrature. Adaptive quadrature. Week 9-10. Solving nonlinear equations in one dimension: bisection method, Newton's method, secant method, false position method, inverse quadratic interpolation, fixed point iteration. Solving nonlinear systems: Newton's method, fixed point iteration. Week 11-12. Minimization of a function of one variable: golden ratio, quadratic interpolation. Minimization methods for multivariable functions: Nelder-Mead method, steepest descent and Newton's method. Week 13. Teacher's reserve. 26 hours, compulsory Mgr. Petr Vašík, Ph.D. Seminars are organized in biweekly cycles, alternatively in a classical classroom and in a computer lab. The seminar schedule corresponds to the subject of the corresponding lecture.

The study programmes with the given course