Czech

Not applicable.

Students completing this course should be able to:
In the field of probability and statistics:
- compute the basic characteristics of statistical data (mean, median, modus, variance, standard deviation)
- choose the correct probability model (classical, discrete, geometrical probability) for a given problem and compute the probability of a given event
- compute the conditional probability of a random event A given an event B
- recognize and use the independence of random events when computing probabilities
- apply the total probability rule and the Bayes' theorem
- work with the cumulative distribution function, the probability mass function of a discrete random variable and the probability density function of a continuous random variable
- construct the probability mass functions (in simple cases)
- choose the appropriate type of probability distribution in model cases (binomial, hypergeometric, exponential, etc.) and work with this distribution
- compute mean, variance and standard deviation of a random variable and explain the meaning of these characteristics
- perform computations with a normally distributed random variable X: find probability that X is in a given range or find the quantile/s for a given probability
- approximate the binomial distribution with help of the normal distribution
- perform simple hypothesis testing: Z-test, test on the mean of normal distribution variance known, test on the parameter p of the binomial distribution

In the field of numerical methods, the student should be able to:
- find the root of a given equation f(x)=0 using the bisection method, Newton method or the iterative method, describe these methods including the convergence conditions
- find the root of a system of two equations using Newton or iterative method
- solve a system of linear equations using Gaussian elimination with pivoting, Jacobi and Gauss-Seidel iteration methods, discuss the advantages and disadvantages of these methods
- find Lagrange or Newton interpolation polynomial for given points and use it for approximating the given function
- find the approximation of a function by spline functions
- find the approximation of a function given by table of points by the least squares method (linear, quadratic or exponential approximation)
- choose the most convenient type of approximation (interpolation polynomial, spline, least squares)
- estimate the derivative of a given function using numerical differentiation
- compute the numerical approximation of a definite integral using trapezoidal and Simpson method, describe the principal of these methods, compare them according to their accuracy
- find the approximate solution of a differential equation using Euler method, modified Euler methods and Runge-Kutta methods

The student should be able to apply the basic knowledge of combinatorics on the secondary school level: to explain the notions of variations, permutations and combinations, to determine their counts, to perform computations with factorials and binomial coefficients.
From the AMA1 and AMA2 courses, the basic knowledge of differential and integral calculus is demanded. Especially, the student should be able to sketch the graphs of elementary functions, to substitute into functions, to compute derivatives (including partial derivatives) and integrals.

Not applicable.

Teaching methods include lectures, computer exercise and other activities.

Students' work during the semestr is awarded by maximum 30 points (20 points for 1 test and 10 points for 1 project). The exam can be taken only if the score is 10 or better. Written exam is awarded by maximum 70 points. In case of coronavirus restrictions resulting in the impossibility to write the test in person at faculty premises, work during the semester will be awarded by maximum 10 points (1 project) and the exam will be awarded by maximum 90 points.

1. Introduction to numerical methods. Numerical methods for root finding (bisection method, Newton method, iterative method)
2. Numerical solution of systems of nonlinear equations. Systems of linear equations (Gaussian elimination with pivoting, Jacobi and Gauss-Seidel iterative methods).
3. Interpolation: interpolation polynomial (Lagrange and Newton), splines (linear and cubic)
4. Least squares approximation. Numerical differentiation.
5. Numerical integration (trapezoidal and Simpson method).
6. Numerical solution of differential equations: initial problems (Euler method and its modifications, Runge-Kutta methods), boundary value problems (very briefly).

7. Introduction to descriptive statistics
8. Introduction to probability. Some probability models (classical, discrete, geometrical), conditional probability, dependence and independence of random events. Total probability rule and Bayes theorem.
9. Discrete random variables (probability mass function, cumulative distribution function, mean and variance).
10. Discrete probability distributions (binomial, geometric, hypergeometric, Poisson).
11. Continuous random variables (probability density function, distrubution function, mean, variance, quantiles). Exponencial distribution.
12. Normal distribution. Central limit theorem. Normal approximation to the binomial distribution.
13. Introduction to statistics. Z-test. Test of the mean of a normal distrinution, variance known.

Not applicable.

The aim of this course is to introduce the basics of two mathematical disciplines: numerical methods, and probability and statistics.

The content and forms of instruction in the evaluated course are specified by a regulation issued by the lecturer responsible for the course and updated for every academic year.

Not applicable.

Not applicable.

Fajmon, B., Hlavičková, I., Novák, M. Matematika 3. Elektronický text FEKT VUT, Brno, 2013 (CS)

Hlavičková, I., Hliněná, D. Matematika 3 - Sbírka úloh z pravděpodobnosti. Elektronický text FEKT VUT, Brno, 2015 (CS)
Novák, M., Matematika 3 - Sbírka příkladů z numerických metod. Elektronický text FEKT VUT, Brno, 2015 (CS)