Computational Methods 420-IS1-2MOB
Course profile: general
Form of study: full-time
Course type: obligatory
Field and discipline of science: natural sciences, computer science
Year/semester of study: 2 / 4
Prerequisites (sequential system of courses and exams): none
Lecture: 30 Laboratory classes: 30
Teaching methods: lectures, discussion, computer programs, individual consultations
ECTS credits: 4
Balance of student workload:
Class attendance:
- lecture 30h
- laboratory classes 30h
Course preparation:
- laboratory classes 15h
Literature study: 10h
Reports, homeworks: 10h
Preparation for the test: 7h
Preparation for the exam: 8h
Exam duration: 2h
Individual consultation with the teacher: 2h
Student workload:
With direct interaction with the teacher: 64h, 2 ECTS
Without direct interaction with the teacher: 50h, 2 ECTS
Type of course
Mode
(in Polish) zdalnie
(in Polish) w sali
Prerequisites (description)
Course coordinators
Learning outcomes
Knowledge:
1. The student knows the objectives and principles of estimating the uncertainty of calculations. KA6_WG6
2. The student knows and understands interpolation and approximation algorithms. KA6_WG3, KA6_WG6, KA6_WG7
3. The student knows and understands selected algorithms of integration computational methods KA6_WG3, KA6_WG6, KA6_WG7
4. The student knows and understands selected algorithms of computational methods of iterative solving of algebraic equations systems, and nonlinear equations. KA6_WG3, KA6_WG6, KA6_WG7
Skills:
5. The student can solve problems using selected algorithms of the calculation methods. KA6_UW9, KA6_UW10
6. The student is able to implement the learned algorithms of computational methods. KA6_UW9, KA6_UW10, KA6_KO1, KA6_UU1
Assessment criteria
General form of assessment: exam
Bibliography
Obligatory literature:
S. Rosloniec, Fundamental Numerical Methods for Electrical Engineering, Springer, Berlin 2008, (https://link.springer.com/book/10.1007%2F978-3-540-79519-3)
S. Pal, Numerical methods : principles, analyses, and algorithms, New Delhi, New York, Oxford University Press, 2009
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: