Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2018/2019

Nonlinear Continuous Optimization and Numerical Methods

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
MI-NON.16 Z,ZK 5 2+1 Czech
Lecturer:
Jaroslav Kruis (guarantor)
Tutor:
Jaroslav Kruis (guarantor)
Supervisor:
Department of Theoretical Computer Science
Synopsis:

Students will be introduced to nonlinear continuous optimization, principles of the most popular methods of optimization and applications of such methods to real-world problems. They will also learn the finite element method and the finite difference method used for solving ordinary and partial differential equations in engineering. They will learn to solve systems of linear algebraic equations that arise from discretization of the continuous problems by direct and iterative algorithms. They will also learn to implement these algorithms sequentially as well as in parallel.

Requirements:

Basic knowledge of linear algebra (vectors, matrices, systems of linear algebraic equations, Gaussian elimination method), polynoms, differential calculus (derivative, integral).

Syllabus of lectures:

1. Partial derivative, gradient, hessian.

2. Continuous optimization of the 1st and 2nd order.

3. Quasi-Newton method, conjugate gradient method.

4. Application of methods of nonlinear continuous optimization.

5. Introduction to ordinary and partial differential equations (taxonomy, the notion of the solution, physical interpretation).

6. Ordinary differential equations - boundary value problem (exact solution, finite difference method, finite differences).

7. Ordinary differential equations - boundary value problem (finite element method).

8. Partial differential equations - stationary cases (finite difference method).

9. Partial differential equations - stationary cases (finite element method).

10. Ordinary differential equations - initial value problem.

11. Partial differential equations - nonstationary problems.

12. Iterative methods (Gauss-Seidel method, conjugate gradient method).

13. Introduction to domain decomposition methods. Parallel solvers of sets of linear equations.

Syllabus of tutorials:
Study Objective:

The module gives an introduction to continuous optimization with respect to the solution of complicated problems, e.g., data approximation or identification of model parameters. The second part deals with several parts of computational sciences, with the emphasis on the finite element method and the finite difference method which are massively used in all engineering branches, not only in academic community but also in industry.

Study materials:

1. Kruis, J. ''Domain Decomposition Methods for Distributed Computing''. Saxe-Coburg Publications, 2007. ISBN 1874672237.

2. Petzold, L. R. ''Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations''. Society for Industrial and Applied Mathematics, 1998. ISBN 0898714125.

Note:
Further information:
https://moodle.fit.cvut.cz/courses/MI-NON.16/
Time-table for winter semester 2018/2019:
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue
Fri
roomT9:347
Kruis J.
11:00–12:30
(lecture parallel1)
Dejvice
NBFIT učebna
roomT9:347
Kruis J.
12:45–14:15
ODD WEEK

(lecture parallel1
parallel nr.101)

Dejvice
NBFIT učebna
Thu
Fri
Time-table for summer semester 2018/2019:
Time-table is not available yet
The course is a part of the following study plans:
Data valid to 2019-03-20
For updated information see http://bilakniha.cvut.cz/en/predmet4656106.html