Course details

# Numerical Methods and Probability

INM Acad. year 2010/2011 Winter semester 5 credits

Numerical mathematics: Metric spaces, Banach theorem. Solution of nonlinear equations. Approximations of functions, interpolation, least squares method, splines. Numerical derivative and integral. Solution of ordinary differential equations, one-step and multi-step methods. Probability: Random event and operations with events, definition of probability, independent events, total probability. Random variable, characteristics of a random variable. Probability distributions used, law of large numbers, limit theorems. Rudiments of statistical thinking.

Guarantor

Language of instruction

Czech

Completion

Credit+Examination (written)

Time span

26 hrs lectures, 13 hrs exercises, 13 hrs pc labs

Assessment points

70 exam, 30 half-term test

Department

Department of Mathematics (DMAT FEEC BUT)

Subject specific learning outcomes and competences

Students apply the gained knowledge in technical subjects when solving projects and writing the Bc. thesis. Numerical methods represent the fundamental element of investigation and practice in the present state of research.

Learning objectives

In the first part the student will be acquainted with some numerical methods (approximation of functions, solution of nonlinear equations, approximate determination of a derivative and an integral, solution of differential equations) which are suitable for modelling various problems of practice. The other part of the subject yields fundamental knowledge from the probability theory (random event, probability, characteristics of random variables, probability distributions) which is necessary for simulation of random processes.

Prerequisites

Prerequisite kwnowledge and skills

Secondary school mathematics and some topics from Discrete Mathematics and Mathematical Analysis courses.

Study literature

• Chapra, S.C., Canale, R.P.: Numerical Methods for Engineers. Fourth Edition. McGraw-Hill 2002, New York (the sample book can be borrowed from the teacher).
• Loftus, J., Loftus, E.: Essence of Statistics. Second Edition, Alfred A. Knopf, New York 1988 (the book can be borrowed from the technical library Brno, Kounicova Street).

Fundamental literature

• Horová, I.: Numerické metody. Skriptum PřF MU Brno, 1999 (in Czech).
• Maroš, B., Marošová, M.: Základy numerické matematiky. Skriptum FSI VUT Brno, 1997 (in Czech).
• Loftus, J., Loftus, E.: Essence of Statistics. Second Edition, Alfred A. Knopf, New York 1988.
• Taha, H.A.: Operations Research. An Introduction. Fourth Edition, Macmillan Publishing Company, New York 1989.
• Montgomery, D.C., Runger, G.C.: Applied Statistics and Probability for Engineers. Third Edition. John Wiley & Sons, Inc., New York 2003

Syllabus of lectures

1. Banach theorem. Iterative methods for linear systems of equations.
2. Interpolation, splines.
3. Least squares method, numerical differentiation.
4. Numerical integration: trapezoid and Simpson rules.
5. Ordinary differential equations, analytical solution.
6. Ordinary differential equations, numerical solution.
7. Test 1 (15 points).
8. Probability models: classical and geometric probabilities, discrere and continuous random variables.
9. Expected value and dispersion.
10. Poisson and exponential distributions.
11. Uniform and normal distributions. Central limit theorem, z-test, power.
12. Mean value test.
13. Test 2 (15), review.

Syllabus of numerical exercises

1. Classical and geometric probabilities.
2. Discrete and continuous random variables.
3. Expected value and dispersion.
4. Binomial distribution.
5. Poisson and exponential distributions.
6. Uniform and normal distributions, z-test.
7. Mean value test, power.

Syllabus of computer exercises

1. Nonlinear equation: bisection method, regula falsi, iteration, Newton method.
2. System of nonlinear equtations, interpolation.
3. Splines, least squares method.
4. Numerical differentiation and integration.
5. Ordinary differential equations, analytical solution.
6. Ordinary differential equations, analytical solution.

Progress assessment

• Three 5-point homeworks: 15 points,
• five 3-point written tests: 15 points,
• final exam: 70 points.
Passing bounary for ECTS assessment: 50 points.

Controlled instruction

Three homeworks and five written tests.

Exam prerequisites

To pass homeworks and written tests with 5-point minimum.

Course inclusion in study plans

• Programme IT-BC-3, field BIT, 2nd year of study, Compulsory