Course: Computer programming and numerical methods

« Back
Course title Computer programming and numerical methods
Course code SLO/PROG1
Organizational form of instruction Lecture + Exercise
Level of course Bachelor
Year of study not specified
Semester Winter
Number of ECTS credits 5
Language of instruction Czech, English
Status of course Compulsory-optional
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Course availability The course is available to visiting students
Lecturer(s)
  • Křepelka Jaromír, Ing. CSc.
Course content
- Computation errors - influence of finite number of digits on the accuracy of the computation - Algebraic methods - systems of linear algebraic equations (systems with non-empty null-space, predetermined systems), three-diagonal scheme, Gauss and Gauss-Jordan method, LU decomposition, inversion of matrices, zero points of the polynomial expressions (Lin- Bairstow method, method of Siljakov coefficients, Laguerre method), eigenvalues and eigenvectors of the matrices (general problem, symmetric matrices, LU and QR algorithms) - Solving of systems of nonlinear equations - bisection of the interval, Newton method of the tangents, Richmond method of tangential hyperboles, their generalization for the systems of equations, Čebyšev iteration methods, Warner scheme (generalized method of tangents), gradient methods - Interpolation, numerical differentiation and integration - Laguerre polynomials, the best trigonometric polynomials, Fourier series, discrete and fast Fourier transform, cubic splines, Čebyšev approximation (Remez algorithm), numerical differentiation and integration (trapezoidal formula, Newton-Cotes quadrature formula, Simpson formula, Gauss methods, special formula) - Numerical solutions of ordinary differential equations - problem with initial condition (Euler method, Runge-Kutta methods, Merson method, automatic choice of integration step, implicit integration methods, stability convergence, correctness), boundary problem (method of shooting, linear systems of differential equations, analytical solutions, problems of existence of numerical solutions, construction of difference schemes, Marcuk identity) - Minimization of functions and optimization - minimization of functions of one variable (golden section, differential methods), simplex method of minimization of functions of more variables, gradient methods (method of conjugated vectors, Powell quadratic convergent method), linear programming, combinatory problems (permutation problems - lexicographical selection, problem of traveling salesman, method of simulative annealing, evolution algorithms - self-organized migration algorithms) - Basics of numerical solving of partial differential equations - difference scheme, fully conservative difference scheme

Learning activities and teaching methods
Lecture, Demonstration
  • Attendace - 39 hours per semester
  • Homework for Teaching - 31 hours per semester
  • Preparation for the Course Credit - 35 hours per semester
  • Preparation for the Exam - 45 hours per semester
Learning outcomes
The aim consists in application of mathematical analysis and algebra knowledge for understanding the basic numerical methods usable in scientific calculations and practically demonstrate how these algorithms work when implemented in the computer environment.
Application Apply knowledge of mathematical analysis and algebra and understand the basic numerical methods usable in scientific calculations, show how these algorithms work implemented in the computer.
Prerequisites
basics of mathematical analysis and algebra, programming language ? basic, fortran, C, Matlab etc.

Assessment methods and criteria
Oral exam, Student performance

Passing the oral examination Practical application of a given numerical method in the form of the software programme compiled in one of the following programming environment: C, FORTRAN, PASCAL, BASIC, MATLAB etc.
Recommended literature
  • Flannery, B. P., Teukolsky S. A., Vetterling W. T. (1986). Numerical Recipes - The Art of Scientific Computing. Cambridge University Press.
  • Kubíček M. (1983). Numerické algoritmy řešení chemicko-inženýrských úloh. SNTL Praha.
  • Vitásek E. (1982). Numerické metody. SNTL Praha.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester
Faculty: Faculty of Science Study plan (Version): Applied Physics (2019) Category: Physics courses - Recommended year of study:-, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Instrument and Computer Physics (2019) Category: Physics courses 2 Recommended year of study:2, Recommended semester: Winter