Selected Mathematical Methods

Enrollement in the course requires an successful completion of the following courses:

Linear Algebra (BI-LIN)
Elements of Calculus (BI-ZMA)

Lecturer:

Tutor:

Supervisor:

Department of Applied Mathematics

Synopsis:

We start reviewing geometric properties of linear spaces with inner product. Next, we introduce and analyze the discrete Fourier transform (DFT) and its fast implementation (FFT).

Further we deal with differential calculus of functions involving multiple variables. We present methods for the localization of extreme values of functions. For this purposes, we study normed linear spaces and quadratic forms. In addition, we introduce the least square method.

The last part of the course is devoted to optimization and duality. The linear programming and the Simplex method is analyzed in more detail.

Requirements:

The fundamental knowledge of mathematical analysis and linear algerbra is required as they are given in BI-ZMA and BI-LIN.

Syllabus of lectures:

1. Complex numbers, complex function of complex variable, exponential function.

2. Fourier series.

3. Hilbert spaces of finite dimension, unitary matrices.

4. Discrete Fourier transformation (DFT) and Fast Fourier transform (FFT).

5. Basic objects from theory of multivariate functions.

6. (Constrained) extrema of multivariate functions.

7. General optimization problem.

8. Weak and strong duality.

9. Linear programming (introduction, formulation).

10. Linear programming (problem in standard form).

11. SIMPLEX algorithm.

12. Examples and applications of Linear programming.

Syllabus of tutorials:

1. Complex numbers, complex function of complex variable, exponential function.

2. Fourier series.

3. Hilbert spaces of finite dimension, unitary matrices.

4. Discrete Fourier transformation (DFT) and Fast Fourier transform (FFT).

5. Basic objects from theory of multivariate functions.

6. (Constrained) extrema of multivariate functions.

7. General optimization problem.

8. Weak and strong duality.

9. Linear programming (introduction, formulation).

10. Linear programming (problem in standard form).

11. SIMPLEX algorithm.

12. Examples and applications of Linear programming.

Study Objective:

The goal of the course is to improve student's mathematical skills and to present classical mathematical methods with applications in IT.

Study materials:

Howard Karloff: Linear Programming.

O. Julius Smith: Mathematics of the Discrete Fourier Transform with Audio Applications.

J.Kopáček: Matematika nejen pro fyziky II (lecture notes in czech).

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans:

• Information Technology - Version for those who Enrolled in 2014 (in Czech) (elective course)
• Information Systems and Management - Version for those who Enrolled in 2014 (in Czech) (elective course)
• Bc. Programme Informatics, in Czech, Version 2015 to 2019 (elective course)
• Bc. Branch Security and Information Technology, in Czech, Version 2015 to 2019 (elective course)
• Bc. Branch Computer Science, in Czech, Version 2015 to 2019 (elective course)
• Bc. Branch Computer Engineering, in Czech, Version 2015 to 2019 (elective course)
• Bachelor Branch Information Systems and Management, in Czech, Version 2015 to 2019 (elective course)
• Bachelor Branch Knowledge Engineering, in Czech, Version 2015, 2016 and 2017 (elective course)
• Bachelor Branch WSI, Specialization Software Engineering, in Czech, Version 2015 to 2019 (elective course)
• Bachelor Branch, Specialization Web Engineering, in Czech, Version 2015 to 2019 (elective course)
• Bachelor Branch WSI, Specialization Computer Grafics, in Czech, Version 2015 to 2019 (elective course)
• Bachelor Branch Knowledge Engineering, in Czech, Version 2018 to 2019 (elective course)