| studiehandbok@lith | |
|
|
|
|
|
| TANA25 | Numerical Methods II, 3 p (sw) /NUMERISKA METODER II/ Advancement level: C | |
| Aim: The student should be able to understand and apply modern techniques for solving important computational problems in Science and Technology. Another purpose is to give knowledge about the use of commercial software for scientific computations. Prerequisites: Numerical Methods I / Numerical Algorithms. A Basic Programming course.Course organization: The course consists of lectures, lessons and computer exercises. Course content: Linear Algebra: LU-factorization. Perturbation Theory. The Singular Value Decomposition and the Pseudoinverse. Orthogonal transformations using the Householder and the Givenīs methods. The QR decomposition and the Least Squares Problem. The Eigenvalue Problem: Normal forms. Perturbation Theory and error estimates. The Rayleigh quotient. The Power method and Inverse Iteration. Transformation to Hessenberg and tridiagonal form. The QR-algorithm. Systems of nonlinear equations and nonlinear least squares problems. The Newton and Gauss-Newton methods. Ordinary Differential Equations: Runge-Kutta methods. Multistep methods. Errror estimates and step lenght control. Difference equations. Stability and Convergence. Methods for stiff systems.Course literature: G. Dahlquist and Åke Björck: Numerical Methods, 2nd ed. (manuscript from the Department of Mathematics) | ||
| |
|
|
 |
|||||
|
|
||||||
