Course: Applied Mathematics II

» List of faculties » FPE » KMA
Course title Applied Mathematics II
Course code KMA/7AM2
Organizational form of instruction Lecture + Seminar
Level of course Bachelor
Year of study not specified
Semester Summer
Number of ECTS credits 3
Language of instruction Czech
Status of course Compulsory
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)
  • Tlustý Pavel, prof. RNDr. CSc.
  • Roskovec Tomáš, RNDr. Ph.D.
Course content
Introduction to numerical mathematics; computational errors. Iterative methods; the bisection method. The method of simple iteration. Newton's method (method of tangents). The secant method and the regula falsi method. Interpolation polynomials (Lagrange and Newton interpolation polynomials). Numerical differentiation and numerical integration. Introduction to graph theory with an emphasis on practical applications. Basic theorems of graph theory; formulation of simple graph problems and algorithms for their solution. Basic concepts of game theory and decision-making. References: Horová, I. and J. Zelinka (2004). Numerical Methods. Masaryk University, Brno. ISBN 80-210-3317-7. Available at: https://www.math.muni.cz/~zelinka/dokumenty/numerika.pdf Kučera, R. (2006). Numerical Methods. Ostrava: VŠB - Technical University. ISBN 80-248-1198-7. Available at: http://physics.ujep.cz/~jskvor/NME/DalsiSkripta/FINALNI_VERZE_CD.pdf Růžičková, I. and R. Hlavička. Numerical Methods. VUT - FSI. Available at: http://physics.ujep.cz/~jskvor/NME/DalsiSkripta/Numerika.pdf

Learning activities and teaching methods
Monologic (reading, lecture, briefing), Work with text (with textbook, with book), Individual tutoring
  • Class attendance - 28 hours per semester
Learning outcomes
The student acquires fundamental knowledge of numerical mathematics and graph theory.
The student will be able to solve basic problems in numerical mathematics and graph theory and apply the acquired knowledge in practical real-life situations.
Prerequisites
No specific prior knowledge is required.

Assessment methods and criteria
Combined exam

Active participation in lectures and tutorials (minimum attendance of 90%). Regular independent preparation and completion of assigned tasks.
Recommended literature
  • Aumann, R. J., ed. Handbook of Game Theory with Economic Applications. Amsterdam, 2002.
  • Maňas, M. Teorie her a její aplikace. Praha, 1991.
  • Matoušek, J., Nešetřil, J. Kapitoly z diskrétní matematiky. Praha, 2000.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester