NMAC15	Numerical linear algebra and optimization, ECTS-points /Numerisk lineär algebra och optimering/ Advancement level: C
	Aim: To give an overview of numerical methods for the solution of problems in numerical linear algebra and unconstrained optimization and to prevent the theory needed to analyze the methods. To give practical experience of the methods through computer experiments. Prerequisites: Knowledge of mathematics and numerical analysis as taught in the first two years of the mathematics program. Course organization: The course consists of lectures, lessons and computer exercises. Course content: Linear algebra: Norms. Partitioning and block matrices. Givens transformation. Householder transformation. QR-factorization. The singular value decomposition. Symmetric, positive definite matrices. Iterative methods for the solution of systems of linear equations. Linear least squares problems. The matrix eigenvalue problem. Nonlinear unconstrained optimization: Newton-like methods. Conjugate gradient methods. Trustregion methods. Non-linear least squares problems. Course literature: Dahlquist-Björck: Numerical methods, manuscript. Ch. 6, 7, 10-12. R. Fletcher: Practical methods of optimization. Chichester Wiley, 1987 (complementary). Exercises and examples of earlier written examinations.
TEN1
LAB1

Course language is swedish.