Gurantor department | Department of Applied Mathematics | Credits | 6 |

Subject guarantor | prof. RNDr. Jiří Bouchala, Ph.D. | Subject version guarantor | prof. RNDr. Jiří Bouchala, Ph.D. |

Study level | undergraduate or graduate | Requirement | Compulsory |

Year | 1 | Semester | summer |

Study language | Czech | ||

Year of introduction | 2010/2011 | Year of cancellation | |

Intended for the faculties | FEI | Intended for study types | Follow-up Master |

Instruction secured by | |||
---|---|---|---|

Login | Name | Tuitor | Teacher giving lectures |

BOU10 | prof. RNDr. Jiří Bouchala, Ph.D. | ||

VOD03 | doc. Mgr. Petr Vodstrčil, Ph.D. |

Extent of instruction for forms of study | ||
---|---|---|

Form of study | Way of compl. | Extent |

Full-time | Credit and Examination | 2+2 |

Part-time | Credit and Examination | 10+10 |

Students, who pases the course, will be able to define a weak solution for various kinds of elliptic boundary value problems, to prove the existence of a unique solution and master a couple of approaches to solve it numerically.

Lectures

Tutorials

The course is offered throughout the university. Within the course the students are introduced into weak formulations of various kinds of elliptic boundary value problems, solvability conditions as well as fundamental properties of the weak solutions. The correct understanding of these notions is necessary to succeed with solution of various engineering problems.

M. Renardy, R. C. Rogers: An introduction to partial differential equations, Springer-Verlag, New York, 1993.
E. Zeidler: Applied Functional Analysis, Springer-Verlag, New York, 1995.

E. Zeidler: Applied Functional Analysis, Springer-Verlag, New York, 1995.

Podmínky udělení zápočtu:
Aktivní účast na cvičeních. Vyřešení zadaných problémů.

There are not defined other requirements for student.

Subject has no prerequisities.

Subject has no co-requisities.

Lebesgue Integral.
Lebesgue Spaces.
Distributions.
Sobolev Spaces.
Trace Theorem.
Weak Solutions of Boundary Value Problems.
Lax Milgram Theorem.
Existence and Uniqueness of Weak Solutions.
Regularity of Weak Solution.
Energy Functional.
Ritz and Galerkin Methods.

Task name | Type of task | Max. number of points
(act. for subtasks) | Min. number of points |
---|---|---|---|

Exercises evaluation and Examination | Credit and Examination | 100 (100) | 51 |

Exercises evaluation | Credit | 30 | 10 |

Examination | Examination | 70 | 21 |

Show history

Academic year | Programme | Field of study | Spec. | Zaměření | Form | Study language | Tut. centre | Year | W | S | Type of duty | |
---|---|---|---|---|---|---|---|---|---|---|---|---|

2021/2022 | (N0541A170007) Computational and Applied Mathematics | (S01) Applied Mathematics | MFA | P | Czech | Ostrava | 1 | Compulsory | study plan | |||

2021/2022 | (N0541A170007) Computational and Applied Mathematics | (S02) Computational Methods and HPC | AMv | K | Czech | Ostrava | 1 | Compulsory | study plan | |||

2021/2022 | (N0541A170007) Computational and Applied Mathematics | (S02) Computational Methods and HPC | AMv | P | Czech | Ostrava | 1 | Compulsory | study plan | |||

2021/2022 | (N0541A170007) Computational and Applied Mathematics | (S01) Applied Mathematics | MFA | K | Czech | Ostrava | 1 | Compulsory | study plan | |||

2020/2021 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2020/2021 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2020/2021 | (N0541A170007) Computational and Applied Mathematics | (S01) Applied Mathematics | MFA | K | Czech | Ostrava | 1 | Compulsory | study plan | |||

2020/2021 | (N0541A170007) Computational and Applied Mathematics | (S02) Computational Methods and HPC | AMv | P | Czech | Ostrava | 1 | Compulsory | study plan | |||

2020/2021 | (N0541A170007) Computational and Applied Mathematics | (S01) Applied Mathematics | MFA | P | Czech | Ostrava | 1 | Compulsory | study plan | |||

2020/2021 | (N0541A170007) Computational and Applied Mathematics | (S02) Computational Methods and HPC | AMv | K | Czech | Ostrava | 1 | Compulsory | study plan | |||

2019/2020 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2019/2020 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2019/2020 | (N0541A170007) Computational and Applied Mathematics | (S01) Applied Mathematics | MFA | P | Czech | Ostrava | 1 | Compulsory | study plan | |||

2019/2020 | (N0541A170007) Computational and Applied Mathematics | (S02) Computational Methods and HPC | AMv | P | Czech | Ostrava | 1 | Compulsory | study plan | |||

2019/2020 | (N0541A170007) Computational and Applied Mathematics | (S01) Applied Mathematics | MFA | K | Czech | Ostrava | 1 | Compulsory | study plan | |||

2019/2020 | (N0541A170007) Computational and Applied Mathematics | (S02) Computational Methods and HPC | AMv | K | Czech | Ostrava | 1 | Compulsory | study plan | |||

2018/2019 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2018/2019 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2017/2018 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2017/2018 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2016/2017 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2016/2017 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2015/2016 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2015/2016 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2014/2015 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Choice-compulsory | study plan | ||||

2014/2015 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Choice-compulsory | study plan | ||||

2013/2014 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Choice-compulsory | study plan | ||||

2013/2014 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Choice-compulsory | study plan | ||||

2012/2013 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Choice-compulsory | study plan | ||||

2012/2013 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Choice-compulsory | study plan | ||||

2011/2012 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Choice-compulsory | study plan | ||||

2011/2012 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Choice-compulsory | study plan | ||||

2010/2011 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | Czech | Ostrava | 1 | Choice-compulsory | study plan | ||||

2010/2011 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | Czech | Ostrava | 1 | Choice-compulsory | study plan |

Block name | Academic year | Form of study | Study language | Year | W | S | Type of block | Block owner |
---|