SF1514 Numerical Methods, Basic Course 6.0 credits

Numeriska metoder, grundkurs

Show course information based on the chosen semester and course offering:

Offering and execution

No offering selected

Select the semester and course offering above to get information from the correct course syllabus and course offering.

Course information

Content and learning outcomes

Course contents *

Basic ideas and concepts: algorithm, computational cost, local linearisation, iteration, recursion, interpolation, extrapolation, discretisation, convergence, stability, condition.

Estimation of reliability: parameter sensitivity, perturbation calculation.

Numerical methods: linear and non-linear systems of equations, differential equations: initial-value problems and boundary value problems, curve fitting: interpolation and the least squares method.

Intended learning outcomes *

A general aim with the course is to give the student the understanding that numerical methods and programming techniques are needed to make reliable and efficient simulations of technical and scientific processes based on mathematical models.

  • For a general formulation of a technical or scientific problem: be able to identify and classify the mathematical subproblems that need to be solved, and reformulate them to be suitable for numerical treatment.

  • Be able to choose, apply and implement numerical methods to produce a solution to a given problem.

  • Be able to use concepts in numerical analysis to describe, characterize and analyze numerical methods and estimate the reliability of numerical results.

  • Be able to clearly present problem statements, solution approaches and results.

Course Disposition

No information inserted

Literature and preparations

Specific prerequisites *

Completed course SF1625 Calculus in one variable or SF1673 Analysis in one variable.

Completed course DD1312 Programming Techniques and Matlab or similar.

Recommended prerequisites

SF1624 Algebra and Geometry, SF1626 Calculus in Several Variable


No information inserted


Announced no later than 4 weeks before the start of the course on the course web page.

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale *

A, B, C, D, E, FX, F

Examination *

  • LABA - Laboratory Work, 1.5 credits, Grading scale: P, F
  • LABB - Laboratory Work, 1.5 credits, Grading scale: P, F
  • TEN1 - Examination, 3.0 credits, Grading scale: A, B, C, D, E, FX, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

In this course, the code of honour of the school is applied, see: http://www.sci.kth.se/institutioner/math/avd/na/utbildning/hederskodex-for-studenter-och-larare-vid-kurser-pa-avdelningen-for-numerisk-analys-1.357185

The examiner decides, in consultation with KTHs Coordinator of students with disabilities (Funka), about any customized examination for students with documented, lasting disability. 

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted


Christina Marianne Carlsund Levin

Ethical approach *

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course web

Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

Course web SF1514

Offered by


Main field of study *


Education cycle *

First cycle

Add-on studies

DD1321 Applied Programming and Computer Science, SF2520 Applied Numerical Methods. 


Erik Dalsryd (ed@kth.se); Mattias Sandberg (msandb@kth.se)