Mathematical Algorithms
Code  Completion  Credits  Range  Language 

11MALG  Z,ZK  5  2+2  Czech 
 Lecturer:
 Tutor:
 Supervisor:
 Department of Applied Mathematics
 Synopsis:

Fundamentals of discrete and numerical algorithms and numerical methods. Practical excersises on selected algorithms, error analysis of numerical algorithms, comparison of possible variants of a numerical algorithm.
 Requirements:

Knowledge of MATLAB and its programming or ability to write programs in highlevel languages such as C++ or Python. Understanding the basic programming techniques and algorithms. Knowledge of algebra and calculus in the extent of standard courses.
 Syllabus of lectures:
 Syllabus of tutorials:
 Study Objective:

Students know the basic set of algorithms that are used in discrete and numerical mathematics and they are able to implement these algorithms in MATLAB or another highlevel programming language.
 Study materials:

Graham, R. L.  Knuth, D. E. Patashnik, O.: Concrete Mathematics, Addison ? Wesley Publishing Company, Inc., 2004
Heath, M. T.: Scientific Computing: An Introductory Survey. 2nd edition. McGrawHill, 2002
Cormen, T. H. Leiserson, C. E.  Rivest, R. L.  Stein, C.: Introduction to Algorithms. 2nd edition. The MIT Press / McGrawHill, 2002
 Note:
 Further information:
 No timetable has been prepared for this course
 The course is a part of the following study plans: