Course detail
Numerical Methods
FSI-2NU-A Acad. year: 2027/2028 Summer semester
The Numerical Methods course introduces students to a core set of problems in numerical mathematics. It highlights the pitfalls of numerical computations (errors, conditioning, algorithm stability) and covers methods for solving linear and non-linear equations, interpolation, least-squares approximation, numerical differentiation and integration, and unconstrained optimization.
Language of instruction
English
Number of ECTS credits
4
Supervisor
Department
Entry knowledge
Students are expected to possess foundational knowledge from standard university-level mathematics courses: differential and integral calculus, basic linear algebra (vector spaces, matrices, systems of linear equations), and basic skills in programming and algorithmization.
Rules for evaluation and completion of the course
COURSE-UNIT CREDIT IS AWARDED ON THE FOLLOWING CONDITIONS: Active participation in seminars. Students have to pass two check tests successfully. A student can earn up to 20 points for both tests . A necessary condition for course credit acquirement is a gain of at least 10 points.
FORM OF THE EXAMINATIONS: The exam has a practical and a theoretical part. In the practical part students solve several numerical examples by hand using a scientific calculator. In the theoretical part they answer several questions to basic notions in order to check up how they understand the subject. The classification evaluation mainly includes the result of the written exam, while the results of credit tests and any discussion that follows the exam may also be taken into account.
Students will obtain 0--100 points as a result of the exam.
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.
Attendance at seminars is checked. Lessons are planned according to the week schedules. Absence may be replaced by the agreement with the teacher.
Aims
The aim of the Numerical Methods course is to introduce students to basic techniques for solving selected numerical problems and to equip them with the ability to solve these problems independently, both manually and using computers. Students will understand the essential properties of individual numerical methods, enabling them to make an effective choice of suitable methods and corresponding software products.
Graduates will gain a comprehensive overview of fundamental numerical mathematics problems and understand the pitfalls of numerical computing (rounding errors, conditioning, numerical stability). They will be able to practically solve systems of linear and non-linear equations, perform interpolation, apply the least-squares approximation, conduct numerical differentiation and integration, and solve unconstrained optimization problems.
The study programmes with the given course
Programme B-STI-A: Fundamentals of Mechanical Engineering, Bachelor's, compulsory
Programme B-STI-Z: Fundamentals of Mechanical Engineering, Bachelor's, recommended course
Type of course unit
Lecture
13 hours, compulsory
Syllabus
Lecture Syllabus (13 hours of direct instruction in total):
Lectures are scheduled in blocks throughout the semester according to the faculty timetable (total teaching load of 13 hours).
1. Introduction to numerical methods: Error analysis. Problem conditioning, stability of algorithms. Solving linear systems: Gaussian eliminatio, LU decomposition, pivoting.
2. Solving linear systems: Effect of roundoff errors, conditioning. Iterative methods (Jacobi, Gauss-Seidel, SOR method).
Interpolation: Lagrange, Newton and Hermite interpolation polynomial.
3. Piecewise linear and piecewise cubic Hermite interpolation. Cubic interpolating spline. Least squares method.
4. Numerical differentiation: Basic formulas. Richardson extrapolation.
Numerical integration: Basic quadrature rules (midpoint, trapezoidal and Simpson's rule). Gaussian quadrature. Composite quadrature. Adaptive quadrature.
5. Solving single nonlinear equations: bisection, Newton's method, secant method, false position method, inverse quadratic interpolation, fixed point iteration.
Solving nonlinear systems: Newton's method, fixed point iteration.
6. Unconstrained optimization of single and multi-variable functions: golden section, quadratic interpolation, Nelder-Mead, steepest descent and Newton's method.
Computer-assisted exercise
26 hours, compulsory
Syllabus
The practical content directly follows the lecture topics, focusing on algorithm implementation and manual calculations.