FEKT-KMA3Acad. year: 2015/2016
The aim of this course is to introduce the basics of two mathematical disciplines: numerical methods, and probability and statistics.
In the field of probability, main attention is paid to random variables, both discrete and continuous. The end of the course of probability is devoted to hypothesis testing.
In the field of numerical mathematics, the following topics are covered: root finding, systems of linear equations, curve fitting (interpolation and splines, least squares method), numerical differentiation and integration, numerical solving of differential equations.
Learning outcomes of the course unit
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
From the BMA1 and BMA2 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.
Recommended optional programme components
Haluzíková, A.: Numerické metody. Skriptum FEI VUT Brno, 1989. (CS)
Zapletal, J.: Základy počtu pravděpodobnosti a matematické statistiky. Skriptum FEI VUT Brno, PC-DIR 1995. (CS)
Ralston, A.: Základy numerické matematiky. Praha, Academia 1978. (CS)
Vitásek, E.: Numerické metody. Praha, SNTL 1987. (CS)
Loftus, J., Loftus, E.: Essence of Statistics. Second Edition, Alfred A. Knopf, New York 1988. (EN)
Taha, H.A.: Operations Research. An Introduction. Fourth Edition, Macmillan Publishing Company, New York 1989. (EN)
HLAVIČKOVÁ, I.; HLINĚNÁ, D. Matematika 3 - Sbírka úloh z pravděpodobnosti. Matematika 3 - Sbírka úloh z pravděpodobnosti. Brno: UMAT FEKT VUT, 2007. s. 1-77. (CS)
NOVÁK, M. Matematika 3: Sbírka úloh z numerických metod. Brno: FEKT VUT, 2010. (CS)
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
During the semester, students have to hand in 5 homeworks (maximum 4 points per homework) and 2 computer laboratory tasks (maximum 5 points per task).
The final test consists of 7 tasks of equal point value (maximum 10 points each task). At least 3 tasks test knowledge of numerical methods and at least 3 tasks test knowledge of probability and statistics.
Language of instruction
Tutorial 1: Introduction, Numerical methods I
Tutorial 2: Numerical methods II
Computer class 1: Introduction to Matlab, examples from numerical methods
Tutorial 3: Numerical methods completed, Probability and statistics I
Tutorial 4: Probability and statistics II
Computer class 2: Examples from probability and statistics
Tutorial 5: Repetition, seminar, information about the exam.
For detailed content of tutorials 1-4 cf. the topics of BMA3:
1. Introduction to descriptive statistics
2. Introduction to probability. Some probability models (classical, discrete, geometrical), conditional probability, dependence and independence of random events. Total probability rule and Bayes theorem.
3. Discrete random variables (probability mass function, cumulative distribution function, mean and variance).
4. Discrete probability distributions (binomial, geometric, hypergeometric, Poisson).
5. Continuous random variables (probability density function, distrubution function, mean, variance, quantiles). Exponencial distribution.
6. Normal distribution. Central limit theorem. Normal approximation to the binomial distribution.
7. Introduction to statistics. Z-test. Test of the mean of a normal distrinution, variance known.
8. Introduction to numerical methods. Numerical methods for root finding (bisection method, Newton method, iterative method)
9. Numerical solution of systems of nonlinear equations. Systems of linear equations (Gaussian elimination with pivoting, Jacobi and Gauss-Seidel iterative methods).
10. Interpolation: interpolation polynomial (Lagrange and Newton), splines (linear and cubic)
11. Least squares approximation. Numerical differentiation.
12. Numerical integration (trapezoidal and Simpson method).
13. Numerical solution of differential equations: initial problems (Euler method and its modifications, Runge-Kutta methods), boundary value problems (very briefly).
Specification of controlled education, way of implementation and compensation for absences
Classification of course in study plans
- Programme EEKR-BK Bachelor's
branch BK-AMT , 2. year of study, winter semester, 5 credits, compulsory
branch BK-EST , 2. year of study, winter semester, 5 credits, compulsory
branch BK-MET , 2. year of study, winter semester, 5 credits, compulsory
branch BK-SEE , 2. year of study, winter semester, 5 credits, compulsory
branch BK-TLI , 2. year of study, winter semester, 5 credits, compulsory
- Programme EEKR-CZV lifelong learning
branch ET-CZV , 1. year of study, winter semester, 5 credits, compulsory