
| Course Code | : MCS536 |
| Course Type | : Area Elective |
| Couse Group | : Second Cycle (Master's Degree) |
| Education Language | : English |
| Work Placement | : N/A |
| Theory | : 3 |
| Prt. | : 0 |
| Credit | : 3 |
| Lab | : 0 |
| ECTS | : 6 |
This course is designed to give engineering students in graduate level the expertise necessary to understand and use computational methods for the approximate/numerical solution of linear algebra problems that arise in many different fields of science like electrical networks, solid mechanics, signal analysis and optimisation. The emphasis is on methods for linear algebra problems such as solutions of linear systems, least squares problems and eigenvalue-eigenvector problems, the effect of roundoff on algorithms and the citeria for choosing the best algorithm for the mathematical structure of the problem under consideration.
Floating Point Computations. Vector and Matrix Norms. Direct Methods for The Solution of Linear Systems. Least Squares Problems. Eigenvalue Problems. Singular Value Decomposition. Iterative Methods for Linear Systems.
| 1. | At the end of the course the students are expected to: Choose an efficient method to solve (large) linear systems, eigenvalue problems and least squares problems coming from a certain application field, |
| 2. | Discuss the numerical methods and/or algorithms with respect to stability, applicability, reliability, conditioning, accuracy, computational complexity and efficiency. |
| 3. | Implement the methods and/or algorithms as computer code and use them to solve applied problems. |
| 4. | Establish the advantages, disadvantages and limitations of the numerical methods and select the algorithms that converge to solutions in the most effective way. |
| 5. | Analyze the error and establish the conditions for convergence related to these methods. |
| 1. | L.N. Trefethen and D. Bau, III, Numerical Linear Algebra, SIAM, 1997. |
| 2. | A. Greenbaum, Iterative Methods for Solving Linear Systems, SIAM, 1997. |
| 3. | C.D. Meyer, Matrix Analysis and Applied Linear Algebra, SIAM, 2000 |
| 4. | O. Axelsson, Iterative Solution Methods, Cambridge University Press, 1996. |
| 5. | J.W.Demmel, Applied Numerical Linear Algebra, SIAM, 1997 |
| Type of Assessment | Count | Percent |
|---|---|---|
| Attending Lectures | 1 | %5 |
| Project | 1 | %10 |
| Midterm Examination | 1 | %15 |
| Final Examination | 1 | %70 |
| Activities | Count | Preparation | Time | Total Work Load (hours) |
|---|---|---|---|---|
| Lecture - Theory | 14 | 3 | 3 | 84 |
| Project | 1 | 20 | 3 | 23 |
| Individual Work | 14 | 0 | 1 | 14 |
| Midterm Examination | 1 | 10 | 3 | 13 |
| Final Examination | 1 | 15 | 3 | 18 |
| TOTAL WORKLOAD (hours) | 152 | |||
PÇ-1 | PÇ-2 | PÇ-3 | PÇ-4 | PÇ-5 | PÇ-6 | PÇ-7 | PÇ-8 | PÇ-9 | |
OÇ-1 | 4 | 5 | 3 | 2 | 2 | 3 | 3 | 2 | 4 |
OÇ-2 | 2 | 3 | 2 | 2 | 2 | 2 | 2 | 2 | 5 |
OÇ-3 | 5 | 3 | 4 | 4 | 3 | 4 | 3 | 2 | 4 |
OÇ-4 | 3 | 3 | 3 | 4 | 2 | 3 | 3 | 3 | 4 |
OÇ-5 | 2 | 4 | 2 | 2 | 1 | 2 | 2 | 2 | 3 |