Finite Elements method
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
D01MKP_EN | ZK | 2P | English |
- Course guarantor:
- Aleš Nekvinda
- Lecturer:
- Aleš Nekvinda
- Tutor:
- Supervisor:
- Department of Mathematics
- Synopsis:
-
Hilbert's spaces
Bilinear forms and functionals
Quadratic functional, symmetry, positive definitness, theorem about the minimum and relation to the equation
Riesz's theorem and Lax-Milgram's theorem
Finite element method, convergence (generally for nonsymmetric operator) - Riesz‘s and Galerkin‘s method
It can converge slowly
Better regularity converges better
The least square method
Variational crimes
Selection of base functions: h-version, p-version, hp-version, hierarchical base, cascade
Linear system preparation
Methods of solution of the resulting systems
- direct procedures
- iterative procedures
- possibilities of preconditioning
- Requirements:
- Syllabus of lectures:
- Syllabus of tutorials:
- Study Objective:
- Study materials:
- Note:
- Time-table for winter semester 2024/2025:
- Time-table is not available yet
- Time-table for summer semester 2024/2025:
- Time-table is not available yet
- The course is a part of the following study plans: