Syllabus academic year 2007/2008
NUMERICAL ANALYSISFMN050

Higher education credits: 6. Grading scale: TH. Level: G2 (First level). Language of instruction: The course will be given in English on demand. FMN050 overlap following cours/es: FMN011, FMN041, FMN081, FMN130, FMN011, FMN041, FMN081 och FMN130. Compulsory for: E3. Optional for: I3. Course coordinator: Gustaf Söderlind, Gustaf.Soderlind@na.lu.se, Numerisk analys. Recommended prerequisits: Linear Algebra, Calculus in One and Several Variables, experience with MATLAB. Assessment: The grade is based on homework assignments and a written exam. Home page: http://www.maths.lth.se/na/courses/FMN050.

Aim
The aim of the course is to teach basics computational methods for solving simple and common mathematical problems by computers and numerical software. This includes the construction, application and analysis of basic computational algorithms. Problemsolving by computers is a central part of the course.

Knowledge and understanding
For a passing grade the student must

Mathematical models are often written as systems of linear and nonlinear equations and differential equations. Students are expected to discretize such equations, that is to construct computable approximations. Moreover, students have to implement and to apply such algorithms independently

Skills and abilities
For a passing grade the student must

- be able to independently select and apply computational algorithms

- be able to evaluate both accuracy and relevance of numerical results

Judgement and approach
For a passing grade the student must

- report solutions to problems and numerical results in written form.

- write a logically well structured report in suitable terminology on the construction of basic mathematical models and algorithms.

- write a algorithmically well structured report in suitable terminology on the numerical solution of a mathematical problem

Contents
Software for scientific computing, error analysis, computer arithmetic, condition, systems of (non) linear equations, fixed point and Newton iteration, least squares, eigenvalues, interpolation, ordinary differential equations, FFT.

Literature
Timothy Sauer: Numerical Analysis. Pearson (2006), ISBN 0-321-26898-9