Scientific Computing KF

5 credits

Syllabus, Bachelor's level, 1TD399

A revised version of the syllabus is available.
Education cycle
First cycle
Main field(s) of study and in-depth level
Computer Science G1N, Mathematics G1N, Technology G1N
Grading system
Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
Finalised by
The Faculty Board of Science and Technology, 27 May 2015
Responsible department
Department of Information Technology

Learning outcomes

To pass, the student should be able to

  • describe and perform tasks in connection to the key concepts covered in the course;
  • explain the idea behind and apply the algorithms covered in the course;
  • explore properties for numerical methods and mathematical models by using the analysis methods covered in the course;
  • explain the results when running a MATLAB program, and describe a problem with an algorithm or a programming code in MATLAB (which might include self-written MATLAB functions);
  • structure and divide a computational problem into sub-problems, formulate an algorithm and implement the algorithm in MATLAB;
  • in a short report, in Swedish and English, explain and summarise solution methods and results in a lucid way.


MATLAB and programming in MATLAB: fundamental programming structures (if statements, for, while), functions, parameter passing. Programming structure. Problem solving methodology. Given a problem, divide it into sub-problems, write an algorithm and transform the algorithm to a MATLAB program.

Basic matrix and vector operations. Expressing linear systems of equations in matrix vector form. Matrices and vectors as mathematical objects and data structures. Solution to linear equation systems using LU-factorisation with pivoting. Norms for matrices and vectors. Sensitivity and condition number, stable/unstable algorithm. Numerical solution to integrals. Simpsons metod and Trapezoid rule. Solution to non-linear equations and iterative methods. Bisection, Newton-Raphon method and hybrid algorithms. Floating point representation and the IEEE-standard for floating point arithmetic, machine epsilon and round-off error.

Important key concepts covered in the course e.g. algorithm, numerical method, complexity, discretisation och discretisation error, machine epsilon, floating point numbers, round off error, accuracy and order of accuracy, stable and unstable algorithm, iteration and iterative method, condition and condition number, efficiency, adaptivity and adaptive methods, convergence, convergence rate, fix point iteration.


Lectures, workouts (problem solving classes), laboratory work, mini projects.


Written examination (3 credits) and mini projects presented in writing (2 credits).