M4180 Numerical Methods I

Faculty of Science
Spring 2011
Extent and Intensity
2/2/0. 4 credit(s) (příf plus uk k 1 zk 2 plus 1 > 4). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Ivanka Horová, CSc. (lecturer)
Mgr. Michaela Benešová (seminar tutor)
Mgr. Jan Orava (seminar tutor)
Mgr. Vlastimil Severa (seminar tutor)
Mgr. Martin Tláskal (seminar tutor)
Mgr. Jiří Zelinka, Dr. (seminar tutor)
Guaranteed by
prof. RNDr. Ivanka Horová, CSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Timetable
Thu 8:00–9:50 D2
  • Timetable of Seminar Groups:
M4180/01: Wed 13:00–13:50 M6,01011, Wed 14:00–14:50 MP1,01014, J. Zelinka
M4180/02: Tue 10:00–10:50 M4,01024, Tue 11:00–11:50 MP1,01014, J. Zelinka
M4180/03: Wed 14:00–14:50 M4,01024, Wed 15:00–15:50 MP1,01014, V. Severa
M4180/04: Wed 8:00–8:50 M2,01021, Wed 9:00–9:50 MP1,01014, J. Orava
M4180/05: Wed 10:00–10:50 M5,01013, Wed 11:00–11:50 MP1,01014, J. Orava
M4180/06: Mon 12:00–12:50 M4,01024, Mon 13:00–13:50 MP1,01014, M. Benešová
M4180/07: Mon 14:00–14:50 M6,01011, Mon 15:00–15:50 MP1,01014, M. Benešová
M4180/08: Mon 11:00–11:50 M6,01011, Mon 12:00–12:50 MP1,01014, J. Zelinka
M4180/09: Thu 17:00–17:50 M3,01023, Thu 18:00–18:50 MP1,01014, M. Tláskal
M4180/10: Thu 15:00–15:50 M6,01011, Thu 16:00–16:50 MP1,01014, M. Tláskal
M4180/11: Mon 9:00–9:50 M6,01011, Mon 10:00–10:50 MP1,01014, J. Zelinka
Prerequisites
KREDITY_MIN(30)
Differential calculus of functions of one and more variables.Basic knoledge of linear algebra-theory of matrices and solving systems of linear equations.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 6 fields of study the course is directly associated with, display
Course objectives
This course together with the course Numerical Methods II provides complete explanation of numerical mathematics as the separate scientific discipline. The emphasis is given to the algorithmization and computer implementation. Some examples with graphical outputs help to explain even some difficult parts. At the end of course students should be able to apply numerical methods for solving practical problems and use these methods in other disciplines e.g. in statistical methods.
Syllabus
  • Error analysis
  • Solving of nonlinear equations-iterative methods,their order and convergence,Newton method,secant method,regula falsi method, Steffensen method,Müller method
  • Solving of systems of nonlinear equations-Newton method,Seidel method
  • Roots of polynomials-Sturm theorem,application of Newton method, finding all roots of polynomials,Bairstow method
  • Direct methods for solving systems of linear equations-Gaussian elimination,LU decomposition,Cholesky method,Crout method,backward error analysis,stability of algorithms and conditioning of problems
  • Iterative methods for solving of systems of linear equations- principle of a construction of iterative methods,convergence theorems, Jacobi method,Gauss-Seidel method,relaxation methods
Literature
  • HOROVA, Ivana and Jiří ZELINKA. Numerické metody (Numerical Methods). 2nd ed. Brno: Masarykova univerzita v Brně, 2004, 294 pp. 3871/Př-2/04-17/31. ISBN 80-210-3317-7. info
  • MATHEWS, John H. and Kurtis D. FINK. Numerical methods using MATLAB. 4th ed. Upper Saddle River, N.J.: Pearson, 2004, ix, 680. ISBN 0130652482. info
  • DATTA, Biswa Nath. Numerical linear algebra and applications. Pacific Grove: Brooks/Cole publishing company, 1994, xxii, 680. ISBN 0-534-17466-3. info
  • STOER, J. and R. BULIRSCH. Introduction to numerical analysis. 1st ed. New York - Heidelberg - Berlin: Springer-Verlag, 1980, 609 pp. IX. ISBN 0-387-90420-4. info
  • RALSTON, Anthony. Základy numerické matematiky. Translated by Milan Práger - Emil Vitásek. České vyd. 2. Praha: Academia, 1978, 635 s. info
Teaching methods
Lecture: 2 hours weeky, theoretical preparation. Class excercise: 2 hours weekly, Theoretical exercise (1 hour)is focused on solving of problems by methods presented in the lecture, practical exercise (1 hour) in a computer room is aimed at algoritmization and programming of presented numerical methods.
Assessment methods
Attendance of class excercises is compulsory, successful tests results are required for a credit. Exam is written.
Language of instruction
Czech
Follow-Up Courses
Further Comments
Study Materials
The course can also be completed outside the examination period.
The course is taught annually.
Listed among pre-requisites of other courses
The course is also listed under the following terms Spring 2008 - for the purpose of the accreditation, Spring 2011 - only for the accreditation, Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2012, spring 2012 - acreditation, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2017, spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024, Spring 2025.
  • Enrolment Statistics (Spring 2011, recent)
  • Permalink: https://is.muni.cz/course/sci/spring2011/M4180