PřF:M4180 Numerical methods I - Course Information
M4180 Numerical Methods I
Faculty of ScienceSpring 2011 - only for the accreditation
- 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)
doc. Mgr. Jan Koláček, Ph.D. (seminar tutor)
Mgr. Jan Orava (seminar tutor)
Mgr. Václav Pink, Ph.D. (seminar tutor)
Mgr. Jiří Zelinka, Dr. (seminar tutor) - Guaranteed by
- prof. RNDr. Ivanka Horová, CSc.
Department of Mathematics and Statistics – Departments – Faculty of Science - 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 7 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
- The course can also be completed outside the examination period.
The course is taught annually.
The course is taught: every week. - Listed among pre-requisites of other courses
- Enrolment Statistics (Spring 2011 - only for the accreditation, recent)
- Permalink: https://is.muni.cz/course/sci/spring2011-onlyfortheaccreditation/M4180