Course detail

Modern Numerical Methods

FEKT-MMNMAcad. year: 2017/2018

The course deals with some numerical methods that are used to find the numerical solution of the problem that we can not or are not able to solve analytically. All methods are correctly implemented and in most cases proved. Therefore, the first we focus on the theory of errors introduced in terms of metrics and standards and their relationships. Furthermore, we discuss proceeds with Banach fixed point theorem, which is the basis of a number of numerical methods. Explanation of its action is carried out on systems of linear algebraic equations. The interpretation starts from the finite methods and iterative solution methods. Similarly, we discuss the solution of nonlinear equations, algebraic equations and their systems. We also deal with eigenvalues of the matrix and with the search for solutions to the initial and boundary value problems for ordinary differential equations and their systems and also for partial differential equations. For each numerical methods are included that guarantee convergence of the method.

Language of instruction

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Learning outcomes of the course unit

After completing the course the student will be able to:
• Work with various matrix and vector norms and make their estimates.
• Solve systems of linear algebraic equations. Decide whether it is possible to solve the system using a given method.
• Find roots of nonlinear and algebraic equations with required accuracy.
• Solve systems of equations.
• Determine the dominant eigenvalue of a matrix.
• Find all eigenvalues. To the suitability of the specified procedure for finding eigenvalues.
• Find the numerical solution of initial value problems for ordinary differential equations and their systems with required accuracy.
• Find the numerical solution of partial differential equations. Work with boundary and internal points system.
• Explain the nature of the finite element method and know how to use it to solve problems on a computer.
• Select the appropriate method for a given type of task and estimate the rate of convergence of certain methods.
• Determine accuracy estimates for certain methods.

Prerequisites

We require knowledge at the level of bachelor's degree, i.e. that students must be able to work with matrices and vectors, handle the calculation of determinants, calculate the product of a matrix and inverse matrix, know the graphs of elementary functions and methods of construction, differentiate and integrate of basic functions, solve basic types of ordinary differential equations of the first order.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Techning methods include lectures and computer laboratories. Students have to write a single project during the course.

Assesment methods and criteria linked to learning outcomes

Students may be awarded
Up to 40 points for computer exercises for a written test (10 points) and 30 points for individual homework (max. 15 points for the program and the maximum 15 points for presentation and protocol).
Up to 60 points for the written final exam. The test contains both theoretical and numerical tasks that are used to verify the orientation in the problems of numerical methods and their application. This includes tasks such as "adjust to the shape of convergence", without interpolating the end.

Course curriculum

1. The principle of numerical methods, classification and propagation of errors in the numerical process, increasing the accuracy of the calculation, Banach fixed point theorem.
2. Solving systems of linear equations: an overview of finite and iterative solution methods.
3. Review of methods for solving nonlinear equations.
4. Algebraic equations and their properties, estimates of the root position, the method of determining roots of algebraic equations.
5. Solving systems of nonlinear equations. Newton and iterative methods for systems of equations.
6. Eigenvalues. Identification of the dominant eigenvalue.
7. The solution of ordinary differential equations of the first order. Basic concepts, the initial problem, one-step and multi-step methods of solution, Taylor series method.
8. Ordinary differential equations of higher order. Systems of ordinary differential equations of first order and their solutions.
9. Boundary value problems for ordinary differential equation and its solution by finite differences and finite volumes.
10. Finite element methods for ordinary differential equations.
11. Partial Differential Equations. Basic concepts, solutions of partial differential equations of the first order.
12. Classification of partial differential equations of second order. The solution of partial differential equations of second order using method of finite differences.
13. The solution of partial differential equations of second order using the finite elements method.

Work placements

Not applicable.

Aims

The aim of the course is to extend and intesify students' basic knowledge of numerical methods and their applications to solve concrete problems. Therefore, much attention is paid to the derivation of certain procedures and methods, and examples using both numerical methods and also clarify the limitations and circumscribed use of the methods.

Specification of controlled education, way of implementation and compensation for absences

Computer exercises are compulsory. Properly excused absence can be replaced by individual homework, which focuses on the issues discussed during the missed exercise.
Specifications of the controlled activities and ways of implementation are provided in annual public notice.
Date of the written test is announced in agreement with the students at least one week in advance. The new term for properly excused students is usually during the credit week.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

BAŠTINEC, J.; NOVÁK, M. Moderní numerické metody: sbírka příkladů. Brno: FEKT, VUT v Brně, 2011.

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme EEKR-M Master's

    branch M-MEL , 1 year of study, summer semester, theoretical subject
    branch M-KAM , 1 year of study, summer semester, theoretical subject
    branch M-EEN , 1 year of study, summer semester, theoretical subject
    branch M-EST , 1 year of study, summer semester, theoretical subject
    branch M-SVE , 1 year of study, summer semester, theoretical subject
    branch M-TIT , 1 year of study, summer semester, theoretical subject
    branch M-BEI , 1 year of study, summer semester, theoretical subject

  • Programme AUDIO-P Master's

    branch P-AUD , 1 year of study, summer semester, elective interdisciplinary
    branch P-AUD , 2 year of study, summer semester, elective interdisciplinary

  • Programme EEKR-CZV lifelong learning

    branch EE-FLE , 1 year of study, summer semester, theoretical subject

Type of course unit

 

Lecture

39 hod., optionally

Teacher / Lecturer

Syllabus

Examples of practical problems, principle of numeric methods, classification and propagation of errors.
Encreasing of result accuracy, Richardson extrapolation.
Complete metric space, contraction mapping, Banach fixed-point theorem and its use.
Finite, matrix-iterative and gradient-iterative methods for solution of linear equations.
Review of nethods for one nonlinear equation solution, Newton and iterative method for systems.
Ordinary differential equations, basic considerations and concepts.
Initial value problems, one-step methods, Runge-Kutta methods.
Taylor series method, principle of its algorithm, possibilities of its application.
Multi-step methods, methods based on numeric derivation and integration, predictor-corrector methods.
Boundary value problems, the finite difference, finite element and finite volume methods.
Partial differential equations, basic concepts, the second-order equation classification.
Finite difference method, finite element method.
Finite volume method, examples of numerical field computations.

Exercise in computer lab

13 hod., compulsory

Teacher / Lecturer

Syllabus

Computer laboratory fulfilling the lectures.